Dominating sets of random 2-in 2-out directed graphs.
Howe, Stephen (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Howe, Stephen (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Amini, Hamed (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rybarczyk, Katarzyna (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...
Friedrich, Tobias, Sauerwald, Thomas (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Behrisch, Michael (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Janson, Svante (2009)
Electronic Journal of Probability [electronic only]
Similarity:
Beer, Elizabeth, Fill, James Allen, Janson, Svante, Scheinerman, Edward R. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Molloy, Michael, Reed, Bruce (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mitra, Pradipta (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: