:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kang, Mihyun, Missethan, Michael, Schmid, Dominik
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Probability 60C05
Online Access:	https://arxiv.org/abs/2406.13341
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Majority bootstrap percolation on the permutahedron and other high-dimensional graphs
by: Collares, Maurício, et al.
Published: (2025)

The law of the circumference of sparse binomial random graphs
by: Anastos, Michael, et al.
Published: (2025)

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

A short proof of a central limit theorem for the order of the giant component and $k$-core
by: Anastos, Michael, et al.
Published: (2025)

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

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

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

Cutoff for generalised Bernoulli-Laplace urn models
by: Goenka, Ritesh, et al.
Published: (2025)

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

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

Bootstrap percolation in strong products of graphs
by: Brešar, Boštjan, et al.
Published: (2023)

Bootstrap percolation is local
by: Hartarsky, Ivailo, et al.
Published: (2024)

Central limit theorem for crossings in randomly embedded graphs
by: Arenas-Velilla, Santiago, et al.
Published: (2023)

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

Scaling limits of random graphs
by: Addario-Berry, Louigi, et al.
Published: (2024)

Central limit theorem for components in meandric systems through high moments
by: Janson, Svante, et al.
Published: (2023)

Majority dynamics on sparse random graphs
by: Chakraborti, Debsoumya, et al.
Published: (2021)

Critical level-set percolation on finite graphs and spectral gap
by: Goswami, Subhajit, et al.
Published: (2026)

Asymptotics for the number of bipartite graphs with fixed surplus
by: Clancy Jr, David
Published: (2024)

Limits of chordal graphs with bounded tree-width
by: Castellví, Jordi, et al.
Published: (2023)

Universal diameter bounds for random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2025)

Counting subgraphs in bounded-size Achlioptas processes
by: Kang, Mihyun, et al.
Published: (2026)

Sharp Fuss-Catalan thresholds in graph bootstrap percolation
by: Bartha, Zsolt, et al.
Published: (2025)

Upper tail bounds for irregular graphs
by: Basak, Anirban, et al.
Published: (2025)

Isomorphisms between dense random graphs
by: Surya, Erlang, et al.
Published: (2023)

On the upper tail of star counts in random graphs
by: Akhmejanova, Margarita, et al.
Published: (2025)

Extreme local statistics in random graphs: maximum tree extension counts
by: Araújo, Pedro, et al.
Published: (2023)

A combinatorial approach to phase transitions in random graph isomorphism problems
by: Diamantidis, Dimitris, et al.
Published: (2024)

Bootstrap percolation and $P_3$-hull number in direct products of graphs
by: Brešar, Boštjan, et al.
Published: (2024)

Large expander subgraphs in high genus triangulations
by: Lions, Tanguy, et al.
Published: (2026)

Upper tails of subgraph counts in directed random graphs
by: Park, Jiyun
Published: (2024)

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

Local limits of uniform triangulations with boundaries in high genus
by: Lions, Tanguy
Published: (2026)

Emergence in graphs with near-extreme constraints
by: Radin, Charles, et al.
Published: (2024)

Last passage percolation in lower triangular domain
by: Betea, Dan, et al.
Published: (2025)

On the jump of the cover time in random geometric graphs
by: Martinez, Carlos, et al.
Published: (2025)

Random Lipschitz functions on graphs with weak expansion
by: Işık, Senem, et al.
Published: (2024)

Normal approximation for number of edges in random intersection graphs
by: Rybarczyk, Katarzyna, et al.
Published: (2025)

Fringe trees of Patricia tries, compressed binary search trees, and three other random full binary trees
by: Janson, Svante
Published: (2024)

Asymptotics for the harmonic descent chain and applications to critical beta-splitting trees
by: Brandenberger, Anna, et al.
Published: (2025)