Results 1  10
of
7,887
NonUniform Random Variate Generation
, 1986
"... This is a survey of the main methods in nonuniform random variate generation, and highlights recent research on the subject. Classical paradigms such as inversion, rejection, guide tables, and transformations are reviewed. We provide information on the expected time complexity of various algorith ..."
Abstract

Cited by 1021 (26 self)
 Add to MetaCart
This is a survey of the main methods in nonuniform random variate generation, and highlights recent research on the subject. Classical paradigms such as inversion, rejection, guide tables, and transformations are reviewed. We provide information on the expected time complexity of various
Building Uniformly Random Subtrees
, 2004
"... We prove the existence of, and describe, a (random) process which builds subtrees of a rooted dbranching tree one node at a time, in such a way that the subtree created at stage n is precisely a uniformly random subtree of size n. The union of these subtrees is a "uniformly random &qu ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We prove the existence of, and describe, a (random) process which builds subtrees of a rooted dbranching tree one node at a time, in such a way that the subtree created at stage n is precisely a uniformly random subtree of size n. The union of these subtrees is a "uniformly random &
Uniform random sampling of traces in . . .
, 2006
"... This paper presents some first results on how to perform uniform random walks (where every trace has the same probability to occur) in very large models. The models considered here are described in a succinct way as a set of communicating reactive modules. The method relies upon techniques for count ..."
Abstract
 Add to MetaCart
This paper presents some first results on how to perform uniform random walks (where every trace has the same probability to occur) in very large models. The models considered here are described in a succinct way as a set of communicating reactive modules. The method relies upon techniques
Connectivity of the Uniform Random Intersection
, 2008
"... A uniform random intersection graph G(n, m, k) is a random graph constructed as follows. Label each of n nodes by a randomly chosen set of k distinct colours taken from some finite set of possible colours of size m. Nodes are joined by an edge if and only if some colour appears in both their labels. ..."
Abstract
 Add to MetaCart
A uniform random intersection graph G(n, m, k) is a random graph constructed as follows. Label each of n nodes by a randomly chosen set of k distinct colours taken from some finite set of possible colours of size m. Nodes are joined by an edge if and only if some colour appears in both their labels
Densities of short uniform random walks
, 2010
"... We study the densities of uniform random walks in the plane. A special focus is on the case of short walks with three or four steps and less completely those with five steps. We also present some new results concerning the moments of uniform random walks, in particular their derivatives. 1 ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
We study the densities of uniform random walks in the plane. A special focus is on the case of short walks with three or four steps and less completely those with five steps. We also present some new results concerning the moments of uniform random walks, in particular their derivatives. 1
CONTROLLED NON UNIFORM RANDOM GENERATION OF DECOMPOSABLE STRUCTURES
"... Controlled non uniform random generation of decomposable structures ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
Controlled non uniform random generation of decomposable structures
Uniform random Voronoi meshes
 In 20th International Meshing Roundtable
, 2011
"... Summary. We generate Voronoi meshes over three dimensional domains with prescribed boundaries. Voronoi cells are clipped at onesided domain boundaries. The seeds of Voronoi cells are generated by maximal Poissondisk sampling. In contrast to centroidal Voronoi tessellations, our seed locations are ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
are unbiased. The exception is some bias near concave features of the boundary to ensure wellshaped cells. The method is extensible to generating Voronoi cells that agree on both sides of twosided internal boundaries. Maximal uniform sampling leads naturally to bounds on the aspect ratio and dihedral angles
Uniform Random Generation of . . .
, 1997
"... The recursive method formalized by Nijenhuis and Wilf [15] and systematized by Flajolet, Van Cutsem and Zimmermann [8], is extended here to floatingpoint arithmetic. The resulting ADZ method enables one to generate decomposable data structures  both labelled or unlabelled  uniformly at random ..."
Abstract
 Add to MetaCart
The recursive method formalized by Nijenhuis and Wilf [15] and systematized by Flajolet, Van Cutsem and Zimmermann [8], is extended here to floatingpoint arithmetic. The resulting ADZ method enables one to generate decomposable data structures  both labelled or unlabelled  uniformly
ON UNIFORM RANDOM NUMBER GENERATORS
, 1994
"... In an earlier report [1] we described methods to obtain pseudorandom numbers from various statistical distributions as well as more general methods. The underlying generators giving uniformly distributed random number between zero and one was only briefly described. In this report we try to summariz ..."
Abstract
 Add to MetaCart
In an earlier report [1] we described methods to obtain pseudorandom numbers from various statistical distributions as well as more general methods. The underlying generators giving uniformly distributed random number between zero and one was only briefly described. In this report we try
Uniform random generation . . .
"... In this paper we study the problem of tiling a strip of dimensions rs * n by using rectangles r * s with r < s and r, s relatively prime. We use a generating tree approach to construct the tilings and prove that they are counted by the nth (r, s)Fibonacci number. This construction is done in t ..."
Abstract
 Add to MetaCart
in terms of prime components and, by studying the tilings with respect to the length of the strip and to the number of prime components, we are able to give an algorithm which uniformly generate a random tiling of length n in time O(n), where the constant multiplying n is strictly less then 1.
Results 1  10
of
7,887