:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Tanaka, Ryokichi
Format:	Preprint
Published:	2025
Subjects:	Probability Discrete Mathematics
Online Access:	https://arxiv.org/abs/2502.06071
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Noise sensitivity on affine Weyl groups
by: Tanaka, Ryokichi
Published: (2024)

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

On sampling diluted Spin Glasses using Glauber dynamics
by: Efthymiou, Charilaos, et al.
Published: (2024)

Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
by: Galanis, Andreas, et al.
Published: (2023)

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

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

Sampling Simultaneous Edge-Colorings
by: Furtado-Tiwari, Ezra, et al.
Published: (2026)

Matchings on Random Regular Hypergraphs
by: Li, Zhongyang
Published: (2021)

Theory of Stochastic Drift
by: Kötzing, Timo
Published: (2024)

Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models
by: Galanis, Andreas, et al.
Published: (2026)

Subtractive random forests
by: Broutin, Nicolas, et al.
Published: (2022)

Multicoloured Hardcore Model: Fast Mixing and Queueing
by: Olesker-Taylor, Sam
Published: (2024)

The Careless Coupon Collector's Problem
by: Cruciani, Emilio, et al.
Published: (2026)

Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs
by: Austin, Henry, et al.
Published: (2026)

Probability-graphons: Limits of large dense weighted graphs
by: Abraham, Romain, et al.
Published: (2023)

Spectral Independence and Local-to-Global Techniques for Optimal Mixing of Markov Chains
by: Chen, Zongchen, et al.
Published: (2023)

On the clique number of random Cayley graphs and related topics
by: Conlon, David, et al.
Published: (2024)

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)

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)

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

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

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

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

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)

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

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)

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

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