Imagen de Portada

Limit Laws for Critical Dispersion on Complete Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	De Ambroggio, Umberto, Makai, Tamás, Panagiotou, Konstantinos, Steibel, Annika
Formato:	Preprint
Publicado:	2024
Materias:	Probability Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Dispersion on the Complete Graph
por: De Ambroggio, Umberto, et al.
Publicado: (2023)

Canonical labelling of random regular graphs
por: Isaev, Mikhail, et al.
Publicado: (2026)

Dispersion on the Complete Graph
por: Umberto De Ambroggio, et al.
Publicado: (2024)

Small maximal clusters are very unlikely in critical random graphs
por: De Ambroggio, Umberto
Publicado: (2024)

Zero-One Laws for Random Feasibility Problems
por: Altschuler, Dylan J.
Publicado: (2023)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
por: Chinyaev, Boris
Publicado: (2025)

Limit Laws for Consensus Protocols on the Complete Graph
por: Becker, Julian, et al.
Publicado: (2026)

Record-biased permutations and their permuton limit
por: Bouvel, Mathilde, et al.
Publicado: (2024)

A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers
por: Pham, Huy Tuan
Publicado: (2024)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

Sunflowers in set systems with small VC-dimension
por: Balogh, József, et al.
Publicado: (2024)

Spread blow-up lemma with an application to perturbed random graphs
por: Nenadov, Rajko, et al.
Publicado: (2024)

A threshold for online balancing of sparse i.i.d. vectors
por: Altschuler, Dylan J., et al.
Publicado: (2025)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
por: Gurvits, Leonid, et al.
Publicado: (2023)

Speeding up random walk mixing by starting from a uniform vertex
por: Díaz, Alberto Espuny, et al.
Publicado: (2022)

Shotgun assembly of random graphs
por: Johnston, Tom, et al.
Publicado: (2022)

Infinite Schnyder Woods
por: Addario-Berry, Louigi, et al.
Publicado: (2025)

Expected Length of the Longest Common Subsequence of Multiple Strings
por: Li, Ray, et al.
Publicado: (2025)

Approximate polymorphisms of predicates
por: Alekseev, Yaroslav, et al.
Publicado: (2025)

A Proof of Talagrand's Creating Large Sets Conjecture
por: Fang, Xuan, et al.
Publicado: (2025)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
por: Tiskin, Alexander
Publicado: (2022)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
por: Gamarnik, David, et al.
Publicado: (2023)

Minimum stationary values of sparse random directed graphs
por: Cai, Xing Shi, et al.
Publicado: (2020)

Counterexamples to an Extremal Conjecture for Random Cycle-Factors
por: Gajjala, Rishikesh
Publicado: (2026)

A binomial random multigraph
por: Pelekis, Christos
Publicado: (2023)

A lower bound on the spectrum of unimodular networks
por: Rahman, Mustazee
Publicado: (2016)

Random 0/1-polytopes expand rapidly
por: Guo, He, et al.
Publicado: (2026)

Graph-theoretical estimates of the diameters of the Rubik's Cube groups
por: Hirata, So
Publicado: (2024)

Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration
por: Bangachev, Kiril, et al.
Publicado: (2024)

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
por: Bencs, Ferenc, et al.
Publicado: (2023)

Cutoff profile of the Metropolis biased card shuffling
por: Zhang, Lingfu
Publicado: (2022)

Diameter Bounds for Friends-and-Strangers Graphs
por: Akella, Amogh, et al.
Publicado: (2025)

The Fundamental Limits of Recovering Planted Subgraphs
por: Lee, Daniel, et al.
Publicado: (2025)

Bounds on the Complete Forcing Number of Graphs
por: Ebrahimi, Javad B., et al.
Publicado: (2024)

Covering Complete Geometric Graphs by Monotone Paths
por: Dumitrescu, Adrian, et al.
Publicado: (2025)

Rapid mixing of the flip chain over non-crossing spanning trees
por: Anand, Konrad, et al.
Publicado: (2024)

On the clique number of random Cayley graphs and related topics
por: Conlon, David, et al.
Publicado: (2024)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
por: Aigner-Horev, Elad, et al.
Publicado: (2023)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
por: Wang, Geyang, et al.
Publicado: (2025)

An Explicit Formula for Vertex Enumeration in the CUT(n) Polytope via Probabilistic Methods
por: Marić, Nevena
Publicado: (2025)