Imagen de Portada

Mixing on Generalized Associahedra

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chang, William, Defant, Colin, Frishberg, Daniel
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Data Structures and Algorithms Probability
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Fast Mixing in Sparse Random Ising Models
por: Liu, Kuikui, et al.
Publicado: (2024)

Minimal spanning arborescence
por: Ray, Gourab, et al.
Publicado: (2024)

Heights of butterfly trees
por: Peca-Medlin, John, et al.
Publicado: (2025)

Overlap Analysis of the Shortest Path Problem: Local Search, Landscapes, and Franz--Parisi Potential
por: Koehler, Frederic, et al.
Publicado: (2025)

Analysis of a Random Local Search Algorithm for Dominating Set
por: Higl, Hendrik
Publicado: (2026)

Zero-Freeness is All You Need: A Weitz-Type FPTAS for the Entire Lee-Yang Zero-Free Region
por: Shao, Shuai, et al.
Publicado: (2025)

The Horton-Strahler number of butterfly trees
por: Peca-Medlin, John
Publicado: (2025)

An Easy Proof of a Weak Version of Chernoff inequality
por: Har-Peled, Sariel
Publicado: (2025)

Burning rooted graph products
por: Peca-Medlin, John
Publicado: (2026)

From Zero-Freeness to Strong Spatial Mixing via a Christoffel-Darboux Type Identity
por: Shao, Shuai, et al.
Publicado: (2024)

Integrating High-Dimensional Functions Deterministically
por: Gamarnik, David, et al.
Publicado: (2024)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

Some easy optimization problems have the overlap-gap property
por: Li, Shuangping, et al.
Publicado: (2024)

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

Polynomial-time sampling despite disorder chaos
por: Ma, Eric, et al.
Publicado: (2025)

An Improved Upper Bound for the Euclidean TSP Constant Using Band Crossovers
por: Gaudio, Julia, et al.
Publicado: (2026)

Boltzmann Sampling for Powersets without an Oracle
por: Peyen, Jean
Publicado: (2026)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
por: Kunisky, Dmitriy, et al.
Publicado: (2023)

The Compilability Thresholds of 2-CNF to OBDD
por: de Colnet, Alexis, et al.
Publicado: (2026)

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

Cycle-factors of regular graphs via entropy
por: Christoph, Micha, et al.
Publicado: (2025)

Approximate Counting in Local Lemma Regimes
por: Mann, Ryan L., et al.
Publicado: (2025)

Quality control in sublinear time: a case study via random graphs
por: Marcussen, Cassandra, et al.
Publicado: (2025)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
por: Bansal, Nikhil, et al.
Publicado: (2025)

Modularity and partially observed graphs
por: McDiarmid, Colin, et al.
Publicado: (2021)

A Method for Generating Connected Erdos-Renyi Random Graphs
por: Chinyaev, Boris
Publicado: (2025)

Local Limits of Small World Networks
por: Alimohammadi, Yeganeh, et al.
Publicado: (2025)

The Metric Dimension of Sparse Random Graphs
por: Díaz, Josep, et al.
Publicado: (2025)

Inference of rankings planted in random tournaments
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

Rapid Mixing at the Uniqueness Threshold
por: Chen, Xiaoyu, et al.
Publicado: (2024)

Statistical inference of a ranked community in a directed graph
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

Edge-Tilting Field Dynamics: Rapid Mixing at the Uniqueness Threshold and Optimal Mixing for Swendsen-Wang Dynamics
por: Chen, Xiaoyu, et al.
Publicado: (2026)

A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
por: Kuszmaul, William
Publicado: (2025)

Improved Mixing of Critical Hardcore Model
por: Chen, Zongchen, et al.
Publicado: (2025)

The Squishy Grid Problem
por: Cai, Zixi, et al.
Publicado: (2025)

Mixing of general biased adjacent transposition chains
por: Gheissari, Reza, et al.
Publicado: (2025)

Rapid Mixing on Random Regular Graphs beyond Uniqueness
por: Chen, Xiaoyu, et al.
Publicado: (2025)

The Mixed Birth-death/death-Birth Moran Process
por: Brewster, David A., et al.
Publicado: (2025)

Cover time of random subgraphs of the hypercube
por: Cooper, Colin, et al.
Publicado: (2025)

A Combinatorial Characterization of Constant Mixing Time
por: Lau, Lap Chi, et al.
Publicado: (2025)