Limiting behavior for the distance of a random walk.
Berestycki, Nathanael, Durrett, Rick (2008)
Electronic Journal of Probability [electronic only]
Similarity:
Displaying similar documents to “Random graph-homomorphisms and logarithmic degree.”
Limiting behavior for the distance of a random walk.
The cover time of deterministic random walks.
Friedrich, Tobias, Sauerwald, Thomas (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Recurrent graphs where two independent random walks collide finitely often.
Krishnapur, Manjunath, Peres, Yuval (2004)
Electronic Communications in Probability [electronic only]
Similarity:
Bootstrap percolation and diffusion in random graphs with given vertex degrees.
Amini, Hamed (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Entrywise bounds for eigenvectors of random graphs.
Mitra, Pradipta (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the range of the simple random walk bridge on groups.
Benjamini, Itai, Izkovsky, Roey, Kesten, Harry (2007)
Electronic Journal of Probability [electronic only]
Similarity:
Encores on cores.
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Continuity of the percolation threshold in randomly grown graphs.
Turova, Tatyana S. (2007)
Electronic Journal of Probability [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:
First hitting times of simple random walks on graphs with congestion points.
Kang, Mihyun (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Bounding a random environment bounding a random environment for two-dimensional edge-reinforced random walk.
Merkl, Franz, Rolles, Silke W.W. (2008)
Electronic Journal of Probability [electronic only]
Similarity:
Critical subgraphs of a random graph.
Molloy, Michael, Reed, Bruce (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Coloring the edges of a random graph without a monochromatic giant component.
Spöhel, Reto, Steger, Angelika, Thomas, Henning (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: