:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Anand, Konrad, Feng, Weiming, Freifeld, Graham, Guo, Heng, Jerrum, Mark, Wang, Jiaheng
Format:	Preprint
Published:	2024
Subjects:	Probability Computational Geometry Discrete Mathematics Combinatorics
Online Access:	https://arxiv.org/abs/2409.07892
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sink-free orientations: a local sampler with applications
by: Anand, Konrad, et al.
Published: (2025)

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

Models of random spanning trees
by: Babson, Eric, et al.
Published: (2024)

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

Strong spatial mixing for colorings on trees and its algorithmic applications
by: Chen, Zongchen, et al.
Published: (2023)

The Squishy Grid Problem
by: Cai, Zixi, et al.
Published: (2025)

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

On the geometric $k$-colored crossing number of $K_n$
by: Hahn, Benedikt, et al.
Published: (2025)

On polynomials associated to Voronoi diagrams of point sets and crossing numbers
by: Claverol, Mercè, et al.
Published: (2023)

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

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

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

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

Limit Laws for Critical Dispersion on Complete Graphs
by: De Ambroggio, Umberto, et al.
Published: (2024)

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

Shotgun assembly of random graphs
by: Johnston, Tom, et al.
Published: (2022)

Infinite Schnyder Woods
by: Addario-Berry, Louigi, et al.
Published: (2025)

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

Approximate polymorphisms of predicates
by: Alekseev, Yaroslav, et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

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

A binomial random multigraph
by: Pelekis, Christos
Published: (2023)

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

Larger Nearly Orthogonal Sets over Finite Fields
by: Haviv, Ishay, et al.
Published: (2024)

A complete $t$-intersection theorem for families of spanning trees
by: Iarovikova, Elizaveta, et al.
Published: (2025)

Listing spanning trees of outerplanar graphs by pivot-exchanges
by: Behrooznia, Nastaran, et al.
Published: (2024)

tinygarden -- A java package for testing properties of spanning trees
by: Dubinsky, Manuel, et al.
Published: (2024)

Network fault costs based on minimum leaf spanning trees
by: Goedgebeur, Jan, et al.
Published: (2025)

Cutoff profile of the Metropolis biased card shuffling
by: Zhang, Lingfu
Published: (2022)

Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
by: Feng, Weiming, et al.
Published: (2025)

Nearly Orthogonal Sets over Finite Fields
by: Chawin, Dror, et al.
Published: (2024)

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