English
Related papers

Related papers: Limit Profiles for Reversible Markov Chains

200 papers

We introduce a natural conjugate prior for the transition matrix of a reversible Markov chain. This allows estimation and testing. The prior arises from random walk with reinforcement in the same way the Dirichlet prior arises from…

Statistics Theory · Mathematics 2007-06-13 Persi Diaconis , Silke W. W. Rolles

We introduce random walks in a sparse random environment on $\mathbb Z$ and investigate basic asymptotic properties of this model, such as recurrence-transience, asymptotic speed, and limit theorems in both the transient and recurrent…

Probability · Mathematics 2016-12-01 Anastasios Matzavinos , Alexander Roitershtein , Youngsoo Seol

Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We define two cyclic to random…

Probability · Mathematics 2012-04-11 Ross G. Pinsky

Stein's method is used to prove limit theorems for random character ratios. Tools are developed for four types of structures: finite groups, Gelfand pairs, twisted Gelfand pairs, and association schemes. As one example an error term is…

Combinatorics · Mathematics 2007-05-23 Jason Fulman

This paper investigates random walks and diffusion limits on a broad class of fractal graphs generated by Edge Iterated Graph Systems (EIGS). We prove that the rescaled simple random walks converge in the…

Probability · Mathematics 2026-05-18 Ziyu Neroli

We provide a general steady-state diffusion approximation result which bounds the Wasserstein distance between the reversible measure $\mu$ of a diffusion process and the measure $\nu$ of an approximating Markov chain. Our result is…

Probability · Mathematics 2022-03-15 Thomas Bonis

We settle an open problem, raised by Y. Peres and D. Revelle, concerning the $L^2$ mixing time of the random walk on the lamplighter graph. We also provide general bounds relating the entropy decay of a Markov chain to the separation…

Probability · Mathematics 2007-05-23 Murali K. Ganapathy , Prasad Tetali

The usual random walk on a group (homogeneous both in time and in space) is determined by a probability measure on the group. In a random walk with random transition probabilities this single measure is replaced with a stationary sequence…

Probability · Mathematics 2007-05-23 Vadim A. Kaimanovich , Yuri Kifer , Ben-Zion Rubshtein

We consider, following the work of S. Kerov, random walks which are continuous-space generalizations of the Hook Walks defined by Greene-Nijenhuis-Wilf, performed under the graph of a continual Young diagram. The limiting point of these…

Probability · Mathematics 2007-05-23 Dan Romik

This paper considers the optimal scaling problem for high-dimensional random walk Metropolis algorithms for densities which are differentiable in Lp mean but which may be irregular at some points (like the Laplace density for example)…

Probability · Mathematics 2016-04-25 Alain Durmus , Sylvain Le Corff , Eric Moulines , Gareth O. Roberts

The phenomenology of turbulent relative dispersion is revisited. A heuristic scenario is proposed, in which pairs of tracers undergo a succession of independent ballistic separations during time intervals whose lengths fluctuate. This…

Fluid Dynamics · Physics 2015-06-19 Simon Thalabard , Giorgio Krstulovic , Jeremie Bec

Consider a closed surface $S$ with negative Euler characteristic, and an admissible probability measure on the fundamental group of $S$ with finite first moment with respect to some hyperbolic metric on $S$. Corresponding to each point in…

Geometric Topology · Mathematics 2023-05-09 Aitor Azemar

This study in centered on models accounting for stochastic deformations of sample paths of random walks, embedded either in $\mathbb{Z}^2$ or in $\mathbb{Z}^3$. These models are immersed in multi-type particle systems with exclusion.…

Statistical Mechanics · Physics 2007-05-23 Guy Fayolle , Cyril Furtlehner

A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…

Probability · Mathematics 2010-06-04 Florian Sobieczky

We study the exponential dissipation of entropic functionals for continuous time Markov chains and the associated convex Sobolev inequalities, including MLSI and Beckner inequalities. We propose a method that combines the Bakry \'Emery…

Probability · Mathematics 2020-05-28 Giovanni Conforti

We give a new rapid mixing result for a natural random walk on the independent sets of a graph $G$. We show that when $G$ has bounded treewidth, this random walk -- known as the Glauber dynamics for the hardcore model -- mixes rapidly for…

Data Structures and Algorithms · Computer Science 2023-10-03 David Eppstein , Daniel Frishberg

A measure on a locally compact group is called spread out if one of its convolution powers is not singular with respect to Haar measure. Using Markov chain theory, we conduct a detailed analysis of random walks on homogeneous spaces with…

Dynamical Systems · Mathematics 2023-06-22 Roland Prohaska

These notes were written for the mini-course "Extrema of log-correlated random variables: Principles and Examples" at the Introductory School held in January 2015 at the Centre International de Rencontres Math\'ematiques in Marseille. There…

Probability · Mathematics 2016-01-05 Louis-Pierre Arguin

In this article, we develop a theory for understanding the traces left by a random walk in the vicinity of a randomly chosen reference vertex. The analysis is related to interlacements but goes beyond previous research by showing weak limit…

Probability · Mathematics 2024-03-25 Steffen Dereich

We apply results from Baryshnikov, Brady, Bressler and Pemantle (2008) to compute limiting probability profiles for various quantum random walks in one and two dimensions. Using analytic machinery we show some features of the limit…

Combinatorics · Mathematics 2009-11-23 Andrew Bressler , Torin Greenwood , Robin Pemantle , Marko Petkovsek