Sciweavers

2079 search results - page 15 / 416
» Universality of random graphs
Sort
View
COMPGEOM
2009
ACM
15 years 12 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...
RSA
2010
98views more  RSA 2010»
15 years 3 months ago
Merging percolation on Zd and classical random graphs: Phase transition
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
Tatyana S. Turova, Thomas Vallier
RSA
2006
88views more  RSA 2006»
15 years 5 months ago
Randomly coloring sparse random graphs with fewer colors than the maximum degree
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze...
CPC
2007
93views more  CPC 2007»
15 years 5 months ago
On a Random Graph Related to Quantum Theory
We show that a random graph studied by Ioffe and Levit is an example of an inhomogeneous random graph of the type studied by Bollob´as, Janson and Riordan, which enables us to gi...
Svante Janson