Corpus ID: 236469490

Site Percolation on Pseudo-Random Graphs

  title={Site Percolation on Pseudo-Random Graphs},
  author={Sahar Diskin and Michael Krivelevich},
We consider vertex percolation on pseudo-random d−regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in nd ) sized component, at p = 1 d . In the supercritical regime, our main result recovers the sharp asymptotic of the size of the largest component, and shows that all other components are typically much smaller. Furthermore, we consider other typical properties of the largest component such as the number of… Expand


Percolation on finite graphs and isoperimetric inequalities
Consider a uniform expanders family Gn with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of Gn obtained by retaining each edge, randomly and independently,Expand
Asymptotics in percolation on high‐girth expanders
We consider supercritical bond percolation on a family of high-girth $d$-regular expanders. Alon, Benjamini and Stacey (2004) established that its critical probability for the appearance of aExpand
The phase transition in random graphs: A simple proof
A very simple proof is provided that in the supercritical regime p = 1+ǫn , the random graph G(n,p) contains typically a path of linear length. Expand
Percolation ?
572 NOTICES OF THE AMS VOLUME 53, NUMBER 5 Percolation is a simple probabilistic model which exhibits a phase transition (as we explain below). The simplest version takes place on Z2, which we viewExpand
Site Percolation on the d-Dimensional Hamming Torus
  • David Sivakoff
  • Computer Science, Physics
  • Combinatorics, Probability and Computing
  • 2013
The value of λc that is found is distinct from the critical value for the emergence of a giant component in bond percolation on the Hamming torus, which is the positive root of a degree d polynomial whose coefficients depend on a1, . Expand
The Phase Transition in Site Percolation on Pseudo-Random Graphs
The existence of the phase transition in site percolation on pseudo-random $d$-regular graphs is established and typically $R$ contains a connected component of size at least $\frac{\epsilon n}{d}$ and a path of length proportional to the eigenvalue ratio. Expand
On the evolution of random graphs
(n) k edges have equal probabilities to be chosen as the next one . We shall 2 study the "evolution" of such a random graph if N is increased . In this investigation we endeavour to find what is theExpand
Largest random component of ak-cube
It is shown that forp=λ/k, λ>1,Gk, p almost surely contains a connected component of sizec2k,c=c(λ) and it is also true that the second largest component is of sizeo(2k). Expand
Let E,, .V denote the set of all graphs having n given labelled vertices VI, L’s;,., Vn and N edges. The graphs considered are supposed to be not oriented, without parallel edges and without slingsExpand
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,Expand