Image de couverture de livre

Shotgun assembly of random graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Johnston, Tom, Kronenberg, Gal, Roberts, Alexander, Scott, Alex
Format:	Preprint
Publié:	2022
Sujets:	Combinatorics Discrete Mathematics Probability
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A multidimensional Ramsey Theorem
par: Girão, António, et autres
Publié: (2022)

Canonical labelling of random regular graphs
par: Isaev, Mikhail, et autres
Publié: (2026)

Minimum stationary values of sparse random directed graphs
par: Cai, Xing Shi, et autres
Publié: (2020)

Spread blow-up lemma with an application to perturbed random graphs
par: Nenadov, Rajko, et autres
Publié: (2024)

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

Infinite Schnyder Woods
par: Addario-Berry, Louigi, et autres
Publié: (2025)

A binomial random multigraph
par: Pelekis, Christos
Publié: (2023)

On the clique number of random Cayley graphs and related topics
par: Conlon, David, et autres
Publié: (2024)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
par: Gamarnik, David, et autres
Publié: (2023)

Speeding up random walk mixing by starting from a uniform vertex
par: Díaz, Alberto Espuny, et autres
Publié: (2022)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
par: Chinyaev, Boris
Publié: (2025)

A threshold for online balancing of sparse i.i.d. vectors
par: Altschuler, Dylan J., et autres
Publié: (2025)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
par: Gurvits, Leonid, et autres
Publié: (2023)

Limit Laws for Critical Dispersion on Complete Graphs
par: De Ambroggio, Umberto, et autres
Publié: (2024)

Zero-One Laws for Random Feasibility Problems
par: Altschuler, Dylan J.
Publié: (2023)

Expected Length of the Longest Common Subsequence of Multiple Strings
par: Li, Ray, et autres
Publié: (2025)

Approximate polymorphisms of predicates
par: Alekseev, Yaroslav, et autres
Publié: (2025)

Record-biased permutations and their permuton limit
par: Bouvel, Mathilde, et autres
Publié: (2024)

A Proof of Talagrand's Creating Large Sets Conjecture
par: Fang, Xuan, et autres
Publié: (2025)

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

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
par: Kunisky, Dmitriy, et autres
Publié: (2024)

Sunflowers in set systems with small VC-dimension
par: Balogh, József, et autres
Publié: (2024)

Counterexamples to an Extremal Conjecture for Random Cycle-Factors
par: Gajjala, Rishikesh
Publié: (2026)

A lower bound on the spectrum of unimodular networks
par: Rahman, Mustazee
Publié: (2016)

Random 0/1-polytopes expand rapidly
par: Guo, He, et autres
Publié: (2026)

Cutoff profile of the Metropolis biased card shuffling
par: Zhang, Lingfu
Publié: (2022)

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
par: Bencs, Ferenc, et autres
Publié: (2023)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
par: Wang, Geyang, et autres
Publié: (2025)

Recoverable systems and the maximal hard-core model on the triangular lattice
par: Wang, Geyang, et autres
Publié: (2026)

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

The number of random 2-SAT solutions is asymptotically log-normal
par: Chatterjee, Arnab, et autres
Publié: (2024)

Canonical labelling of sparse random graphs
par: Verbitsky, Oleg, et autres
Publié: (2024)

Twin-width of sparse random graphs
par: Hendrey, Kevin, et autres
Publié: (2023)

First order complexity of finite random structures
par: Demin, Danila, et autres
Publié: (2024)

Playing Sudoku on random 3-regular graphs
par: Dippel, Jack, et autres
Publié: (2025)

Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
par: Galanis, Andreas, et autres
Publié: (2023)

Rapid mixing of the flip chain over non-crossing spanning trees
par: Anand, Konrad, et autres
Publié: (2024)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
par: Aigner-Horev, Elad, et autres
Publié: (2023)

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

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