## Giant Components in Biased Graph Processes

*Amir, Gideon*;

*Gurel-Gurevich, Ori*;

*Lubetzky, Eyal*;

*Singer, Amit*;

- Subject: Mathematics - Combinatorics | Mathematics - Probability | 05C80,60C05 | Mathematics - Analysis of PDEs

A random graph process, $\Gorg[1](n)$, is a sequence of graphs on $n$ vertices which begins with the edgeless graph, and where at each step a single edge is added according to a uniform distribution on the missing edges. It is well known that in such a process a giant c... View more

Share - Bookmark

- Download from