Cover Image

The bunkbed conjecture remains true when gluing along a vertex

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Meunier, Paul, Pournajafi, Pegah
Format:	Preprint
Published:	2024
Subjects:	Probability Combinatorics 60K35 (Primary), 05C80, 60C05 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The acyclic directed bunkbed conjecture is false
by: Przybyłowski, Tomasz
Published: (2025)

The bunkbed conjecture is not robust to generalisation
by: Hollom, Lawrence
Published: (2024)

The bunkbed conjecture is false
by: Gladkov, Nikita, et al.
Published: (2024)

The bunkbed problem and the random cluster model
by: Ayyer, Arvind, et al.
Published: (2025)

Inhomogeneous long-range percolation in the strong decay regime: recurrence in one dimension
by: Mönch, Christian
Published: (2024)

Robustness in the Poisson Boolean model with convex grains
by: Gracar, Peter, et al.
Published: (2024)

Bond percolation does not simulate site percolation
by: Gladkov, Nikita, et al.
Published: (2024)

Phase transitions for the Widom--Rowlinson model in random environments
by: Jahnel, Benedikt, et al.
Published: (2025)

Finiteness of the percolation threshold for inhomogeneous long-range models in one dimension
by: Gracar, Peter, et al.
Published: (2022)

Chemical distance in the Poisson Boolean model with regularly varying diameters
by: Gracar, Peter, et al.
Published: (2025)

A Probabilistic Parking Process and Labeled IDLA
by: Harris, Pamela E., et al.
Published: (2025)

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

The scaling limit of fair Peano paths
by: Albin, Nathan, et al.
Published: (2021)

The Horton-Strahler Number of Conditioned Galton-Watson Trees
by: Brandenberger, Anna M., et al.
Published: (2020)

Asymptotic normality for general subtree counts in conditioned Galton--Watson trees
by: Rakotoniaina, Fameno, et al.
Published: (2026)

Percolation in the marked stationary Random Connection Model for higher-dimensional simplicial complexes
by: Pabst, Dominik
Published: (2025)

Weakly saturated random graphs
by: Bartha, Zsolt, et al.
Published: (2020)

Local limit theorem for joint subgraph counts
by: Sah, Ashwin, et al.
Published: (2024)

Explosive appearance of cores and bootstrap percolation on lattices
by: Hartarsky, Ivailo, et al.
Published: (2025)

Extremes of the zero-average Gaussian Free Field on random regular graphs
by: Hartung, Lisa, et al.
Published: (2025)

A new bound in Majority Dynamics on Random Graphs
by: Jaffe, Sean
Published: (2025)

Co-evolving vertex and edge dynamics in dense graphs
by: Athreya, Siva, et al.
Published: (2025)

The Second Phase Transition of the Contact Process on a Random Regular Graph
by: Fernley, John
Published: (2025)

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

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

Large Deviations for Markovian Graphon Processes and Associated Dynamical Systems on Networks
by: Bhamidi, Shankar, et al.
Published: (2025)

Asymptotic height of Plancherel random trees
by: Zhang, Shengjun
Published: (2026)

Speed of Convergence and Moderate Deviations of FPP on Random Geometric Graphs
by: de Lima, Lucas R., et al.
Published: (2024)

A novel approach to the giant component fluctuations
by: Corujo, Josué, et al.
Published: (2024)

The contact process on dynamical random trees with degree dependence
by: Cardona-Tobón, Natalia, et al.
Published: (2024)

On the approximation of permutons
by: Maga, Balázs
Published: (2026)

Non-equilibrium coagulation processes and subcritical percolation on evolving networks
by: Banerjee, Sayan, et al.
Published: (2025)

Discursive Voter Models on the Supercritical Scale-Free Network
by: Fernley, John
Published: (2022)

Network evolution with self-reinforcement
by: Bhamidi, Shankar, et al.
Published: (2026)

Degree-penalized contact processes
by: Bartha, Zsolt, et al.
Published: (2023)

An OSSS-type inequality for uniformly drawn subsets of fixed size
by: Berg, Jacob van den, et al.
Published: (2022)

The sharp threshold for jigsaw percolation in random graphs
by: Cooley, Oliver, et al.
Published: (2018)

A very short proof of Sidorenko's inequality for counts of homomorphism between graphs
by: Lüchtrath, Lukas, et al.
Published: (2024)

$H$-percolation with a random $H$
by: Bartha, Zsolt, et al.
Published: (2023)

Reconstructing random pictures
by: Narayanan, Bhargav, et al.
Published: (2022)