Image de couverture de livre

Explosive appearance of cores and bootstrap percolation on lattices

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hartarsky, Ivailo, Lichev, Lyuben
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Probability 05C69, 05C80, 60C05, 60K35
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Sensitive bootstrap percolation second term
par: Hartarsky, Ivailo
Publié: (2023)

Diameter and mixing time of the giant component in the percolated hypercube
par: Anastos, Michael, et autres
Publié: (2025)

Sharp metastability transition for two-dimensional bootstrap percolation with symmetric isotropic threshold rules
par: Duminil-Copin, Hugo, et autres
Publié: (2023)

The maximal running time of hypergraph bootstrap percolation
par: Hartarsky, Ivailo, et autres
Publié: (2022)

Sharp Fuss-Catalan thresholds in graph bootstrap percolation
par: Bartha, Zsolt, et autres
Publié: (2025)

The acyclic directed bunkbed conjecture is false
par: Przybyłowski, Tomasz
Publié: (2025)

The sharp threshold for jigsaw percolation in random graphs
par: Cooley, Oliver, et autres
Publié: (2018)

$H$-percolation with a random $H$
par: Bartha, Zsolt, et autres
Publié: (2023)

Can the root cluster remain largest forever in random recursive tree percolation?
par: Zheng, Yushu
Publié: (2026)

Majority bootstrap percolation on the permutahedron and other high-dimensional graphs
par: Collares, Maurício, et autres
Publié: (2025)

Two-Point Concentration of the Domination Number of Random Graphs
par: Bohman, Tom, et autres
Publié: (2024)

The bunkbed conjecture remains true when gluing along a vertex
par: Meunier, Paul, et autres
Publié: (2024)

Network evolution with self-reinforcement
par: Bhamidi, Shankar, et autres
Publié: (2026)

Large Deviations for Markovian Graphon Processes and Associated Dynamical Systems on Networks
par: Bhamidi, Shankar, et autres
Publié: (2025)

Perfect Matching in Product Graphs and in their Random Subgraphs
par: Diskin, Sahar, et autres
Publié: (2024)

Minimum degree $k$ and $k$-connectedness usually arrive together
par: Diskin, Sahar, et autres
Publié: (2024)

The bunkbed conjecture is not robust to generalisation
par: Hollom, Lawrence
Publié: (2024)

Bootstrap percolation is local
par: Hartarsky, Ivailo, et autres
Publié: (2024)

Upper tails of subgraph counts in directed random graphs
par: Park, Jiyun
Publié: (2024)

$d$-connectivity of the random graph with restricted budget
par: Lichev, Lyuben
Publié: (2022)

Critical level-set percolation on finite graphs and spectral gap
par: Goswami, Subhajit, et autres
Publié: (2026)

Non-equilibrium coagulation processes and subcritical percolation on evolving networks
par: Banerjee, Sayan, et autres
Publié: (2025)

The bunkbed problem and the random cluster model
par: Ayyer, Arvind, et autres
Publié: (2025)

Refined universality for critical KCM: upper bounds
par: Hartarsky, Ivailo
Publié: (2021)

Bond percolation does not simulate site percolation
par: Gladkov, Nikita, et autres
Publié: (2024)

The largest common subtree of two random trees
par: Angel, Omer, et autres
Publié: (2025)

The bunkbed conjecture is false
par: Gladkov, Nikita, et autres
Publié: (2024)

Optimal matching under size priority
par: Enriquez, Nathanaël, et autres
Publié: (2026)

Optimal Unimodular Matching
par: Enriquez, Nathanaël, et autres
Publié: (2024)

Uniqueness and locality of the ground state of the disordered Monomer-Dimer models on independently weighted Unimodular Bienaymé-Galton-Watson trees
par: Kang, Mihyun, et autres
Publié: (2026)

Sharp thresholds, hitting times and the power of choice for random geometric graphs
par: Ignasiak, Dawid, et autres
Publié: (2025)

Random Subwords and Pipe Dreams
par: Defant, Colin
Publié: (2024)

Tripodal structure in undersaturated random graphs
par: DiCarlo, William, et autres
Publié: (2025)

Interacting Particle Systems on Random Graphs
par: Capannoli, F., et autres
Publié: (2024)

Tight universal bounds on the height times the width of random trees
par: Donderwinkel, Serte, et autres
Publié: (2024)

Critical trees are neither too short nor too fat
par: Addario-Berry, Louigi, et autres
Publié: (2023)

Note on extremal problems about connected subgraph sums
par: Cambie, Stijn, et autres
Publié: (2025)

Cluster sizes in subcritical soft Boolean models
par: Jahnel, Benedikt, et autres
Publié: (2024)

On $k$-clusters of high-intensity random geometric graphs
par: Penrose, Mathew D., et autres
Publié: (2022)

Large deviations of the giant in supercritical kernel-based spatial random graphs
par: Jorritsma, Joost, et autres
Publié: (2024)