The voter model with anti-voter bonds
Nina Gantert, Matthias Löwe, Jeffrey E. Steif (2005)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Random even graphs.”
The voter model with anti-voter bonds
Bootstrap percolation and diffusion in random graphs with given vertex degrees.
Amini, Hamed (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Encores on cores.
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On vertex, edge, and vertex-edge random graphs.
Beer, Elizabeth, Fill, James Allen, Janson, Svante, Scheinerman, Edward R. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sharp threshold functions for random intersection graphs via a coupling method.
Rybarczyk, Katarzyna (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On percolation in random graphs with given vertex degrees.
Janson, Svante (2009)
Electronic Journal of Probability [electronic only]
Similarity:
On exchangeable random variables and the statistics of large graphs and hypergraphs.
Austin, Tim (2008)
Probability Surveys [electronic only]
Similarity:
Uniqueness of the mixing measure for a random walk in a random environment on the positive integers.
Eckhoff, Maren, Rolles, Silke W.W. (2009)
Electronic Communications in Probability [electronic only]
Similarity:
The cover time of deterministic random walks.
Friedrich, Tobias, Sauerwald, Thomas (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Giant vacant component left by a random walk in a random d-regular graph
Jiří Černý, Augusto Teixeira, David Windisch (2011)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
We study the trajectory of a simple random walk on a -regular graph with ≥ 3 and locally tree-like structure as the number of vertices grows. Examples of such graphs include random -regular graphs and large girth expanders. For these graphs, we investigate percolative properties of the set of vertices not visited by the walk until time , where > 0 is a fixed positive parameter. We show that this so-called set exhibits a phase transition in in the following sense: there exists...
Critical subgraphs of a random graph.
Molloy, Michael, Reed, Bruce (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity: