8 research outputs found
Percolation on sparse random graphs with given degree sequence
We study the two most common types of percolation process on a sparse random
graph with a given degree sequence. Namely, we examine first a bond percolation
process where the edges of the graph are retained with probability p and
afterwards we focus on site percolation where the vertices are retained with
probability p. We establish critical values for p above which a giant component
emerges in both cases. Moreover, we show that in fact these coincide. As a
special case, our results apply to power law random graphs. We obtain rigorous
proofs for formulas derived by several physicists for such graphs.Comment: 20 page
Percolation on dense graph sequences
In this paper we determine the percolation threshold for an arbitrary
sequence of dense graphs . Let be the largest eigenvalue of
the adjacency matrix of , and let be the random subgraph of
obtained by keeping each edge independently with probability . We
show that the appearance of a giant component in has a sharp
threshold at . In fact, we prove much more: if
converges to an irreducible limit, then the density of the largest component of
tends to the survival probability of a multi-type branching process
defined in terms of this limit. Here the notions of convergence and limit are
those of Borgs, Chayes, Lov\'asz, S\'os and Vesztergombi. In addition to using
basic properties of convergence, we make heavy use of the methods of
Bollob\'as, Janson and Riordan, who used multi-type branching processes to
study the emergence of a giant component in a very broad family of sparse
inhomogeneous random graphs.Comment: Published in at http://dx.doi.org/10.1214/09-AOP478 the Annals of
Probability (http://www.imstat.org/aop/) by the Institute of Mathematical
Statistics (http://www.imstat.org
Pseudo-random graphs
Random graphs have proven to be one of the most important and fruitful
concepts in modern Combinatorics and Theoretical Computer Science. Besides
being a fascinating study subject for their own sake, they serve as essential
instruments in proving an enormous number of combinatorial statements, making
their role quite hard to overestimate. Their tremendous success serves as a
natural motivation for the following very general and deep informal questions:
what are the essential properties of random graphs? How can one tell when a
given graph behaves like a random graph? How to create deterministically graphs
that look random-like? This leads us to a concept of pseudo-random graphs and
the aim of this survey is to provide a systematic treatment of this concept.Comment: 50 page
Expansion in Supercritical Random Subgraphs of Expanders and its Consequences
In 2004, Frieze, Krivelevich and Martin [17] established the emergence of a
giant component in random subgraphs of pseudo-random graphs. We study several
typical properties of the giant component, most notably its expansion
characteristics. We establish an asymptotic vertex expansion of connected sets
in the giant by a factor of . From these
expansion properties, we derive that the diameter of the giant is typically
, and that the mixing time of a lazy random
walk on the giant is asymptotically . We
also show similar asymptotic expansion properties of (not necessarily
connected) linear sized subsets in the giant, and the typical existence of a
large expander as a subgraph