The phase transition in random graphs: A simple proof

@article{Krivelevich2013ThePT,
  title={The phase transition in random graphs: A simple proof},
  author={Michael Krivelevich and Benny Sudakov},
  journal={Random Structures \& Algorithms},
  year={2013},
  volume={43}
}
The classical result of Erdős and Rényi asserts that the random graph G(n,p) experiences sharp phase transition around \documentclass{article}\usepackage{mathrsfs}\usepackage{amsmath}\pagestyle{empty}\begin{document}\begin{align*}p=\frac{1}{n}\end{align*} \end{document} – for any ε > 0 and \documentclass{article}\usepackage{mathrsfs}\usepackage{amsmath}\pagestyle{empty}\begin{document}\begin{align*}p=\frac{1-\epsilon}{n}\end{align*} \end{document}, all connected components of G(n,p) are… 

The phase transition in the multi-type binomial random graph $G(\mathbf{n},P)$

We determine the asymptotic size of the largest component in the $2$-type binomial random graph $G(\mathbf{n},P)$ near criticality using a refined branching process approach. In $G(\mathbf{n},P)$

Short proofs for long induced paths

TLDR
A modification of the Depth first search algorithm, suited for finding long induced paths, is presented, and the induced size-Ramsey number of paths satisfies, giving an explicit constant in the linear bound.

On Coloring Random Subgraphs of a Fixed Graph

TLDR
It is shown that for any graph $G$ with chromatic number k = \chi(G) and independence number O(n/k) it holds that $\mathbb{E}[G_{1/2})] \geq \Omega \left( k/\log(k) \right)$, which gives a positive answer to the question of Bukh for a large family of graphs.

The Phase Transition in Multitype Binomial Random Graphs

We determine the asymptotic size of the largest component in the $2$-type binomial random graph $G(\mathbf{n},P)$ near criticality using a refined branching process approach. In $G(\mathbf{n},P)$

Ramsey goodness of trees in random graphs

We say that a graph $G$ is Ramsey for $H_1$ versus $H_2$, and write $G \to (H_1,H_2)$, if every red-blue colouring of the edges of $G$ contains either a red copy of $H_1$ or a blue copy of $H_2$. In

The Phase Transition in Site Percolation on Pseudo-Random Graphs

TLDR
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.

Expansion in randomly perturbed connected graphs and its consequences

We propose a unified approach, based on expansion, to analyzing combinatorial properties of random perturbations of connected graphs. Given an $n$-vertex connected graph $G$, form a random supergraph

Sandwiching random regular graphs between binomial random graphs

TLDR
This paper proves Kim-Vu's sandwich conjecture, with perfect containment on both sides, for all d/log n, and proves a weaker version of the sandwich conjecture with $p_2$ approximately equal to $(d/n)\log n) and without any defect.

Paths and Cycles in Random Subgraphs of Graphs with Large Minimum Degree

TLDR
It is shown that several results concerning the length of the longest path/cycle of a random graph naturally translate to $G_p$ if $G$ is an arbitrary graph of minimum degree at least $n-1 and asymptotically best-possible.

Largest Components in Random Hypergraphs

TLDR
It is shown that the existence of a j-tuple-connected component containing Θ(nj) j-sets undergoes a phase transition and the threshold occurs at edge probability, which controls the structure of the component grown in the search process.
...

References

SHOWING 1-10 OF 20 REFERENCES

Random graphs

  • A. Rucinski
  • Mathematics
    ZOR Methods Model. Oper. Res.
  • 1989
TLDR
I study random graphs as a probabilist dealing with some combinatorial structures, and my methods are probabilistic and based on analysis, using for example integration theory, functional analysis, martingales and stochastic integration.

The Transitive Closure of a Random Digraph

  • R. Karp
  • Mathematics
    Random Struct. Algorithms
  • 1990
TLDR
It is shown that, when n is large and np is equal to a constant c greater than 1, it is very likely that all but one of the strong components are very small, and that the unique large strong component contains about Θ2n vertices, where Θ is the unique root in [0, 1] of the equation.

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 the

Long cycles in subgraphs of (pseudo)random directed graphs

TLDR
This work studies the resilience of random and pseudorandom directed graphs with respect to the property of having long directed cycles by finding a constant c = c(γ) such that the following holds.

The emergence of a giant component in random subgraphs of pseudo‐random graphs

TLDR
It is shown that if $\alpha 1$ then G_p contains a unique giant component of size $\Omega(n)$, with all other components of size $O(\log n)$.

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,

Pseudo-Random Graphs

Biased positional games on matroids

The longest path in a random graph

A random graph with (1+ε)n/2 edges contains a path of lengthcn. A random directed graph with (1+ε)n edges contains a directed path of lengthcn. This settles a conjecture of Erdõs.

Random graphs

  • A. Frieze
  • Mathematics, Computer Science
    SODA '06
  • 2006
TLDR
Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.