Cover Image

Mixing times of a Burnside process Markov chain on set partitions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Paguyo, J. E.
Format:	Preprint
Published:	2022
Subjects:	Probability Combinatorics 60J10, 60C05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Burnside process on parking functions and Dyck paths
by: Feng, Ivan Z., et al.
Published: (2026)

The $k$-Plancherel measure and a Finite Markov Chain
by: Linusson, Svante, et al.
Published: (2025)

Geometric Bounds on the Fastest Mixing Markov Chain
by: Olesker-Taylor, Sam, et al.
Published: (2021)

Limit distributions for cycles of random parking functions
by: Paguyo, J. E., et al.
Published: (2025)

Up-down chains and scaling limits: application to permuton- and graphon-valued diffusions
by: Féray, Valentin, et al.
Published: (2025)

Central limit theorem for crossings in randomly embedded graphs
by: Arenas-Velilla, Santiago, et al.
Published: (2023)

Limit Profiles for Separation Distance
by: Francis, Peter E., et al.
Published: (2026)

The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational
by: Sylvester, John
Published: (2021)

The global and local limit of the continuous-time Mallows process
by: Adamczak, Radosław, et al.
Published: (2024)

Hitting times in the stochastic block model
by: Ottolini, Andrea
Published: (2024)

Diameter and mixing time of the giant component in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

Random rotor walks and i.i.d. sandpiles on Sierpinski graphs
by: Kaiser, Robin, et al.
Published: (2022)

Cutoff for Rewiring Dynamics on Perfect Matchings
by: Olesker-Taylor, Sam
Published: (2021)

Clumsy and Careless: Stationary-Entry Flux in Non-monotone Coupon Collectors
by: Long, Christopher D.
Published: (2026)

On convergence rate bounds for a class of nonlinear Markov chains
by: Shchegolev, Alexander, et al.
Published: (2022)

Cutoff for generalised Bernoulli-Laplace urn models
by: Goenka, Ritesh, et al.
Published: (2025)

Lonely passenger problem: the more buses there are, the more lonely passengers there will be
by: Tóth, Imre Péter
Published: (2025)

Explicit cutoff profiles for colored top-$m$-to-random shuffles
by: Feng, Ivan Z.
Published: (2026)

A Nordhaus--Gaddum problem for the spectral gap of a graph
by: Kim, Sooyeong, et al.
Published: (2024)

On the rate of convergence in the weak invariance principle for dependent random variables with applications to Markov chains
by: Grama, Ion, et al.
Published: (2024)

A Chinese restaurant process for multiset permutations
by: Stark, Dudley
Published: (2025)

The dual Burnside process
by: Feng, Ivan Z.
Published: (2025)

Tight universal bounds on the height times the width of random trees
by: Donderwinkel, Serte, et al.
Published: (2024)

Critical beta-splitting, via contraction
by: Kolesnik, Brett
Published: (2024)

On the structure of the sandpile identity element on Sierpinski gasket graphs
by: Kaiser, Robin, et al.
Published: (2026)

Average height for Abelian sandpiles and the looping constant on Sierpinski graphs
by: Heizmann, Nico, et al.
Published: (2023)

The Ballot Event for Two-Player Coupon Collection: A Renewal--Catalan Asymptotic
by: Long, Christopher D.
Published: (2026)

A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
by: Park, Jungeun, et al.
Published: (2024)

The largest common subtree of two random trees
by: Angel, Omer, et al.
Published: (2025)

Solving Poisson's equation for Wasserstein contractive Markov chains
by: Hofstadler, Julian
Published: (2026)

Meeting times of Markov chains via singular value decomposition
by: van Belle, Thomas, et al.
Published: (2024)

Probabilistic Zero Forcing with Vertex Reversion
by: Brennan, Zachary
Published: (2024)

A partition method for bounding continuous-time Markov chain models of general reaction network
by: Ballif, Guillaume, et al.
Published: (2025)

Critical trees are neither too short nor too fat
by: Addario-Berry, Louigi, et al.
Published: (2023)

Tighter Bounds on the Expected Absorbing Time of Ungarian Markov Chains
by: Shen, Eric
Published: (2024)

Genealogies of records of stochastic processes with stationary increments as unimodular trees
by: Baccelli, François, et al.
Published: (2024)

Convergence of Markov chain transition probabilities
by: Scheutzow, Michael, et al.
Published: (2020)

Simulating Simple Random Walks With a Deck of Cards
by: Alves, Raphael, et al.
Published: (2024)

Spectral gap of nonreversible Markov chains
by: Chatterjee, Sourav
Published: (2023)

Tóth's buses and the "detachment process''
by: Engländer, János
Published: (2025)