Component evolution in random intersection graphs.
Behrisch, Michael (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A note on the component structure in random intersection graphs with tunable clustering.”
Component evolution in random intersection graphs.
The largest component in an inhomogeneous random intersection graph with clustering.
Bloznelis, Mindaugas (2010)
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:
Tight bounds for quasirandom rumor spreading.
Angelopoulos, Spyros, Doerr, Benjamin, Huber, Anna, Panagiotou, Konstantinos (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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:
Almost every bipartite graph has not two vertices of minimum degree
József Bukor (1993)
Mathematica Slovaca
Similarity:
Random matching problems on the complete graph.
Wästlund, Johan (2008)
Electronic Communications in Probability [electronic only]
Similarity:
Planarity thresholds for two types of random subgraphs of the -cube
Karin Mahrhold, Karl F. E. Weber (1989)
Commentationes Mathematicae Universitatis Carolinae
Similarity: