Image de couverture de livre

Theory of Stochastic Drift

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Kötzing, Timo
Format:	Preprint
Publié:	2024
Sujets:	Probability Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Noise sensitivity on affine Weyl groups
par: Tanaka, Ryokichi
Publié: (2024)

Multicoloured Hardcore Model: Fast Mixing and Queueing
par: Olesker-Taylor, Sam
Publié: (2024)

On sampling diluted Spin Glasses using Glauber dynamics
par: Efthymiou, Charilaos, et autres
Publié: (2024)

Sampling Simultaneous Edge-Colorings
par: Furtado-Tiwari, Ezra, et autres
Publié: (2026)

Matchings on Random Regular Hypergraphs
par: Li, Zhongyang
Publié: (2021)

Cutoff for congestion dynamics and related generalized exclusion processes
par: Tanaka, Ryokichi
Publié: (2025)

Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models
par: Galanis, Andreas, et autres
Publié: (2026)

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

Subtractive random forests
par: Broutin, Nicolas, et autres
Publié: (2022)

The Careless Coupon Collector's Problem
par: Cruciani, Emilio, et autres
Publié: (2026)

Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs
par: Austin, Henry, et autres
Publié: (2026)

Probability-graphons: Limits of large dense weighted graphs
par: Abraham, Romain, et autres
Publié: (2023)

Spectral Independence and Local-to-Global Techniques for Optimal Mixing of Markov Chains
par: Chen, Zongchen, et autres
Publié: (2023)

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

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

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)

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

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

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)

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

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

Shotgun assembly of random graphs
par: Johnston, Tom, et autres
Publié: (2022)

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

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)

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

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

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

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

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

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

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)

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

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

Group Testing: An Information Theory Perspective
par: Aldridge, Matthew, et autres
Publié: (2019)