1542 search results - page 37 / 309 » The metamathematics of random graphs |
WG
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
CPC
2002
14 years 9 months ago
2002
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
RSA
2008
14 years 9 months ago
2008
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
112
click to vote
CPC
2011
14 years 4 months ago
2011
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
WAW
2004
Springer
15 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, ...