Continuity of the percolation threshold in randomly grown graphs.
Turova, Tatyana S. (2007)
Electronic Journal of Probability [electronic only]
Similarity:
Displaying similar documents to “Degree distribution nearby the origin of a preferential attachment graph.”
Continuity of the percolation threshold in randomly grown graphs.
On percolation in random graphs with given vertex degrees.
Janson, Svante (2009)
Electronic Journal of Probability [electronic only]
Similarity:
Encores on cores.
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on the component structure in random intersection graphs with tunable clustering.
Lagerås, Andreas N., Lindholm, Mathias (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The largest component in an inhomogeneous random intersection graph with clustering.
Bloznelis, Mindaugas (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Critical subgraphs of a random graph.
Molloy, Michael, Reed, Bruce (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Stationary random graphs on with prescribed iid degrees and finite mean connections.
Deijfen, Maria, Jonasson, Johan (2006)
Electronic Communications in Probability [electronic only]
Similarity:
Component evolution in random intersection graphs.
Behrisch, Michael (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Intersections of randomly embedded sparse graphs are Poisson.
Bender, Edward A., Canfield, E.Rodney (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Almost every bipartite graph has not two vertices of minimum degree
József Bukor (1993)
Mathematica Slovaca
Similarity:
Bootstrap percolation and diffusion in random graphs with given vertex degrees.
Amini, Hamed (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: