Encores on cores.
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Entrywise bounds for eigenvectors of random graphs.”
Encores on cores.
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:
The cover time of deterministic random walks.
Friedrich, Tobias, Sauerwald, Thomas (2010)
The Electronic Journal of Combinatorics [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:
Matrix and discrepancy view of generalized random and quasirandom graphs
Marianna Bolla, Ahmed Elbanna (2016)
Special Matrices
Similarity:
We will discuss how graph based matrices are capable to find classification of the graph vertices with small within- and between-cluster discrepancies. The structural eigenvalues together with the corresponding spectral subspaces of the normalized modularity matrix are used to find a block-structure in the graph. The notions are extended to rectangular arrays of nonnegative entries and to directed graphs. We also investigate relations between spectral properties, multiway discrepancies,...
Chromatic number for a generalization of Cartesian product graphs.
Král', Daniel, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [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:
Random threshold graphs.
Reilly, Elizabeth Perez, Scheinerman, Edward R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the chromatic number of simple triangle-free triple systems.
Frieze, Alan, Mubayi, Dhruv (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the cover time of planar graphs.
Jonasson, Johan, Schramm, Oded (2000)
Electronic Communications in Probability [electronic only]
Similarity:
Critical subgraphs of a random graph.
Molloy, Michael, Reed, Bruce (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity: