
Summary: An algorithm for generating random points uniformly distributed in an arbitrary cone from \(\mathbb{R}^n\) is suggested. As a particular case, a recurrent algorithm to generate uniform random points inside a general \(n\)-simplex is proposed. The quality of the resulted random points is tested.
Monte Carlo method, uniform random points, Monte Carlo methods, random number generation, Random number generation in numerical analysis, cone, simplex, optimization, stochastic simulation
Monte Carlo method, uniform random points, Monte Carlo methods, random number generation, Random number generation in numerical analysis, cone, simplex, optimization, stochastic simulation
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
