2996 search results - page 46 / 600 » Numberings and Randomness |
COMBINATORICA
2008
13 years 10 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
COMPGEOM
2010
ACM
14 years 3 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Given a Poisson process on a d-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are give...
VOSS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
WAW
2004
Springer
14 years 3 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...