Cover Image

Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Diskin, Sahar, Krivelevich, Michael
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Components, large and small, are as they should be II: supercritical percolation on regular graphs of constant degree
by: Diskin, Sahar, et al.
Published: (2024)

Long cycles in percolated expanders
by: Collares, Maurício, et al.
Published: (2024)

A large hole in pseudo-random graphs
by: Diskin, Sahar, et al.
Published: (2025)

Hitting time of connectedness in the random hypercube process
by: Diskin, Sahar, et al.
Published: (2024)

Universality of the matching number in percolated regular graphs
by: Diskin, Sahar, et al.
Published: (2025)

Cycle lengths in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs
by: Diskin, Sahar, et al.
Published: (2024)

Nearly spanning cycle in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

Supercritical Site Percolation on Regular Graphs
by: Diskin, Sahar, et al.
Published: (2026)

Tree tilings in random regular graphs
by: Diskin, Sahar, et al.
Published: (2024)

Spanning trees of bounded degree in random geometric graphs
by: Anastos, Michael, et al.
Published: (2025)

Minimum degree $k$ and $k$-connectedness usually arrive together
by: Diskin, Sahar, et al.
Published: (2024)

Isoperimetric Inequalities and Supercritical Percolation on High-dimensional Graphs
by: Diskin, Sahar, et al.
Published: (2023)

Percolation on High-dimensional Product Graphs
by: Diskin, Sahar, et al.
Published: (2022)

Percolation through Isoperimetry
by: Diskin, Sahar, et al.
Published: (2023)

Percolation on Irregular High-dimensional Product Graphs
by: Diskin, Sahar, et al.
Published: (2022)

A Jump of the Saturation Number in Random Graphs?
by: Diskin, Sahar, et al.
Published: (2023)

The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes
by: Christoph, Micha, et al.
Published: (2026)

Perfect Matching in Product Graphs and in their Random Subgraphs
by: Diskin, Sahar, et al.
Published: (2024)

Saturation in Random Hypergraphs
by: Diskin, Sahar, et al.
Published: (2024)

Diameter and mixing time of the giant component in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)

Expansion in supercritical random subgraphs of expanders and its consequences
by: Sahar Diskin, et al.
Published: (2024)

Large deviations for subcritical bootstrap percolation on the random graph
by: Angel, Omer, et al.
Published: (2017)

Finding long cycles in a percolated expander graphs
by: Hollom, Lawrence
Published: (2025)

Color-avoiding percolation on the Erdős-Rényi random graph
by: Lichev, Lyuben, et al.
Published: (2022)

Supercritical percolation on finite transitive graphs I: Uniqueness of the giant component
by: Easo, Philip, et al.
Published: (2021)

Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs
by: Collares, Maurício, et al.
Published: (2024)

Bootstrap percolation on the high-dimensional Hamming graph
by: Kang, Mihyun, et al.
Published: (2024)

Critical threshold for regular graphs
by: Bhadoo, Ishaan
Published: (2024)

Isoperimetry in product graphs
by: Diskin, Sahar, et al.
Published: (2024)

Scaling limits and universality: Critical percolation on weighted graphs converging to an $L^3$ graphon
by: Baslingker, Jnaneshwar, et al.
Published: (2023)

The Hamilton cycle space of random regular graphs and randomly perturbed graphs
by: Hefetz, Dan, et al.
Published: (2025)

Spread-out percolation on transitive graphs of polynomial growth
by: Spanos, Panagiotis, et al.
Published: (2024)

Existence of a percolation threshold on finite transitive graphs
by: Easo, Philip
Published: (2022)

On the number of spanning trees in random regular graphs
by: Greenhill, Catherine, et al.
Published: (2013)

Percolation on graphs of polynomial growth is local: analyticity, supercritical sharpness, isoperimetry
by: Martineau, Sébastien, et al.
Published: (2025)

Do random initial degrees suppress concentration in preferential attachment graphs?
by: Makai, T., et al.
Published: (2024)

Diameters and mixing times for giant components of random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2026)

Non-triviality of the phase transition for percolation on finite transitive graphs
by: Hutchcroft, Tom, et al.
Published: (2021)