Degree distributions in general random intersection graphs.
Shang, Yilun (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Sharp threshold functions for random intersection graphs via a coupling method.”
Degree distributions in general random intersection graphs.
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:
Encores on cores.
Cain, Julie, Wormald, Nicholas (2006)
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:
Critical subgraphs of a random graph.
Molloy, Michael, Reed, Bruce (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The sizes of components in random circle graphs
Ramin Imany-Nabiyyi (2008)
Discussiones Mathematicae Graph Theory
Similarity:
We study random circle graphs which are generated by throwing n points (vertices) on the circle of unit circumference at random and joining them by an edge if the length of shorter arc between them is less than or equal to a given parameter d. We derive here some exact and asymptotic results on sizes (the numbers of vertices) of "typical" connected components for different ways of sampling them. By studying the joint distribution of the sizes of two components, we "go into" the structure...
Loose Hamilton cycles in random 3-uniform hypergraphs.
Frieze, Alan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Random even graphs.
Grimmett, Geoffrey, Janson, Svante (2009)
The Electronic Journal of Combinatorics [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:
The voter model with anti-voter bonds
Nina Gantert, Matthias Löwe, Jeffrey E. Steif (2005)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
Infinite paths and cliques in random graphs
Alessandro Berarducci, Pietro Majer, Matteo Novaga (2012)
Fundamenta Mathematicae
Similarity:
We study the thresholds for the emergence of various properties in random subgraphs of (ℕ, <). In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the probability is made. The main tools are a topological version of Ramsey theory, exchangeability theory and elementary ergodic theory.