Improved expansion of random Cayley graphs.
Loh, Po-Shen, Schulman, Leonard J. (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
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.
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.
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 Cayley graphs are expanders: a simple proof of the Alon-Roichman theorem.”
Improved expansion of random Cayley graphs.
Entrywise bounds for eigenvectors of random graphs.
Mitra, Pradipta (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the order and the number of cliques in a random graph
Daniel Olejár, Eduard Toman (1997)
Mathematica Slovaca
Similarity:
Random walks on finite groups with few random generators.
Pak, Igor (1999)
Electronic Journal of Probability [electronic only]
Similarity:
On the cover time of planar graphs.
Jonasson, Johan, Schramm, Oded (2000)
Electronic Communications in Probability [electronic only]
Similarity:
The diameter and Laplacian eigenvalues of directed graphs.
Chung, Fan (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Limiting behavior for the distance of a random walk.
Berestycki, Nathanael, Durrett, Rick (2008)
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:
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:
Random procedures for dominating sets in bipartite graphs
Sarah Artmann, Jochen Harant (2010)
Discussiones Mathematicae Graph Theory
Similarity:
Using multilinear functions and random procedures, new upper bounds on the domination number of a bipartite graph in terms of the cardinalities and the minimum degrees of the two colour classes are established.
Compositions of random functions on a finite set.
Dalal, Avinash, Schmutz, Eric (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity: