:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Peca-Medlin, John
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics Data Structures and Algorithms Probability
Accès en ligne:	https://arxiv.org/abs/2603.00304
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Horton-Strahler number of butterfly trees
par: Peca-Medlin, John
Publié: (2025)

Heights of butterfly trees
par: Peca-Medlin, John, et autres
Publié: (2025)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
par: Kunisky, Dmitriy, et autres
Publié: (2024)

Cycle-factors of regular graphs via entropy
par: Christoph, Micha, et autres
Publié: (2025)

Quality control in sublinear time: a case study via random graphs
par: Marcussen, Cassandra, et autres
Publié: (2025)

Analysis of a Random Local Search Algorithm for Dominating Set
par: Higl, Hendrik
Publié: (2026)

Overlap Analysis of the Shortest Path Problem: Local Search, Landscapes, and Franz--Parisi Potential
par: Koehler, Frederic, et autres
Publié: (2025)

Mixing on Generalized Associahedra
par: Chang, William, et autres
Publié: (2024)

Zero-Freeness is All You Need: A Weitz-Type FPTAS for the Entire Lee-Yang Zero-Free Region
par: Shao, Shuai, et autres
Publié: (2025)

Fast Mixing in Sparse Random Ising Models
par: Liu, Kuikui, et autres
Publié: (2024)

Minimal spanning arborescence
par: Ray, Gourab, et autres
Publié: (2024)

An Easy Proof of a Weak Version of Chernoff inequality
par: Har-Peled, Sariel
Publié: (2025)

The stochastic block model has the overlap graph property for modularity
par: Bhamidi, Shankar, et autres
Publié: (2026)

Statistical inference of a ranked community in a directed graph
par: Kunisky, Dmitriy, et autres
Publié: (2024)

An Improved Upper Bound for the Euclidean TSP Constant Using Band Crossovers
par: Gaudio, Julia, et autres
Publié: (2026)

Boltzmann Sampling for Powersets without an Oracle
par: Peyen, Jean
Publié: (2026)

The Compilability Thresholds of 2-CNF to OBDD
par: de Colnet, Alexis, et autres
Publié: (2026)

Modularity and partially observed graphs
par: McDiarmid, Colin, et autres
Publié: (2021)

Polynomial-time sampling despite disorder chaos
par: Ma, Eric, et autres
Publié: (2025)

From Zero-Freeness to Strong Spatial Mixing via a Christoffel-Darboux Type Identity
par: Shao, Shuai, et autres
Publié: (2024)

Integrating High-Dimensional Functions Deterministically
par: Gamarnik, David, et autres
Publié: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
par: Kunisky, Dmitriy, et autres
Publié: (2023)

Strong spatial mixing for colorings on trees and its algorithmic applications
par: Chen, Zongchen, et autres
Publié: (2023)

Some easy optimization problems have the overlap-gap property
par: Li, Shuangping, et autres
Publié: (2024)

Approximate Counting in Local Lemma Regimes
par: Mann, Ryan L., et autres
Publié: (2025)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
par: Bansal, Nikhil, et autres
Publié: (2025)

Probabilistic estimates of the diameters of the Rubik's Cube groups
par: Hirata, So
Publié: (2024)

Local Limits of Small World Networks
par: Alimohammadi, Yeganeh, et autres
Publié: (2025)

The Metric Dimension of Sparse Random Graphs
par: Díaz, Josep, et autres
Publié: (2025)

Composition of random functions and word reconstruction
par: Chapuy, Guillaume, et autres
Publié: (2026)

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
par: Gamarnik, David, et autres
Publié: (2026)

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
par: Dhawan, Abhishek, et autres
Publié: (2026)

A Method for Generating Connected Erdos-Renyi Random Graphs
par: Chinyaev, Boris
Publié: (2025)

Sharp Online Hardness for Large Balanced Independent Sets
par: Dhawan, Abhishek, et autres
Publié: (2025)

Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models
par: Kunisky, Dmitriy
Publié: (2024)

The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs
par: Dhawan, Abhishek, et autres
Publié: (2024)

Inference of rankings planted in random tournaments
par: Kunisky, Dmitriy, et autres
Publié: (2024)

The Squishy Grid Problem
par: Cai, Zixi, et autres
Publié: (2025)

Hardness of Burning Number Problem on Regular Graphs
par: Antony, Dhanyamol, et autres
Publié: (2026)

Reconstruction of geometric random graphs with the Simple algorithm
par: Stegehuis, Clara, et autres
Publié: (2024)