![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Sharp threshold for percolation on expanders
Sharp threshold for percolation on expandersAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Mustapha Amrani. Discrete Analysis In this joint work with I. Benjamini, S. Boucheron, and R. Rossignol, we study the appearance of the giant component in random subgraphs of a given finite graph G = (V,E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then for any c in (0,1), the property that the random subgraph contains a giant component of size c|V | has a sharp threshold. The main technical tools are based on variance inequalities for functions of independent random variables. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsSJC Regular Seminars Sedgwick Museum of Earth Sciences Surface, Microstructure & Fracture groupOther talksModularity, criticality and evolvability of a developmental GRN Joseph Banks: science, culture and the remaking of the Indo-Pacific world The Ethical and Legal Elements of Capacity and Consent Protean geographies: Plants, politics and postcolonialism in South Africa |