Encores on cores.
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On exchangeable random variables and the statistics of large graphs and hypergraphs.”
Encores on cores.
Random even graphs.
Grimmett, Geoffrey, Janson, Svante (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sharp threshold functions for random intersection graphs via a coupling method.
Rybarczyk, Katarzyna (2011)
The Electronic Journal of Combinatorics [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:
Bootstrap percolation and diffusion in random graphs with given vertex degrees.
Amini, Hamed (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Uniqueness of the mixing measure for a random walk in a random environment on the positive integers.
Eckhoff, Maren, Rolles, Silke W.W. (2009)
Electronic Communications in Probability [electronic only]
Similarity:
Standard representation of multivariate functions on a general probability space.
Janson, Svante (2009)
Electronic Communications in Probability [electronic only]
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.
The law of the iterated logarithm for exchangeable random variables.
Zhang, Hu-Ming, Taylor, Robert L. (1995)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Planarity thresholds for two types of random subgraphs of the -cube
Karin Mahrhold, Karl F. E. Weber (1989)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
On percolation in random graphs with given vertex degrees.
Janson, Svante (2009)
Electronic Journal of Probability [electronic only]
Similarity: