Related papers: Double Coset Markov Chains
We consider Markov chains on partially ordered sets that generalize the success-runs and remaining life chains in reliability theory. We find conditions for recurrence and transience and give simple expressions for the invariant…
We consider a model for a queue in which only a fixed number $N$ of customers can join. Each customer joins the queue independently at an exponentially distributed time. Assuming further that the service times are independent and follow an…
From the point of view of stochastic analysis the Caputo and Riemann-Liouville derivatives of order $\al \in (0,2)$ can be viewed as (regularized) generators of stable L\'evy motions interrupted on crossing a boundary. This interpretation…
A key task in Bayesian machine learning is sampling from distributions that are only specified up to a partition function (i.e., constant of proportionality). One prevalent example of this is sampling posteriors in parametric distributions,…
Quantum walks on graphs have been shown in certain cases to mix quadratically faster than their classical counterparts. Lifted Markov chains, consisting of a Markov chain on an extended state space which is projected back down to the…
We propose a Markov chain simulation method to generate simple connected random graphs with a specified degree sequence and level of clustering. The networks generated by our algorithm are random in all other respects and can thus serve as…
In this paper we investigate generalizations of Kazhdan's property $(T)$ to the setting of uniformly convex Banach spaces. We explain the interplay between the existence of spectral gaps and that of Kazhdan projections. Our methods employ…
Double cosets appear in many contexts in combinatorics, for example in the enumeration of certain objects up to symmetries. Double cosets in a quotient of the form $H\backslash G / H$ have an inverse, and can be their own inverse. In this…
We consider continuous-time Markov chain on a finite state space X. We assume X can be clustered into several subsets such that the intra-transition rates within these subsets are of order $\mathcal{O}(\frac{1}{\epsilon})$ comparing to the…
The main aim of the present set of notes is to give new, short and essentially self-contained proofs of some classical, as well as more recent, results about random walks on groups. For instance, we shall see that the drift characterization…
Full Bayesian computational inference for model determination in undirected graphical models is currently restricted to decomposable graphs, except for problems of very small scale. In this paper we develop new, more efficient methodology…
Rowmotion is a certain well-studied bijective operator on the distributive lattice $J(P)$ of order ideals of a finite poset $P$. We introduce the rowmotion Markov chain ${\bf M}_{J(P)}$ by assigning a probability $p_x$ to each $x\in P$ and…
We study the generalized doubling method for pairs of representations of $G\times GL_k$ where $G$ is a symplectic group, split special orthogonal group or split general spin group. We analyze the poles of the local integrals, and prove that…
The cutoff phenomenon describes a sharp transition in the convergence of a family of ergodic finite Markov chains to equilibrium. Many natural families of chains are believed to exhibit cutoff, and yet establishing this fact is often…
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…
Continuous time random walks and Langevin equations are two classes of stochastic models for describing the dynamics of particles in the natural world. While some of the processes can be conveniently characterized by both of them, more…
Let X and Y be independent transient Markov chains on the same state space that have the same transition probabilities. Let L denote the ``loop-erased path'' obtained from the path of X by erasing cycles when they are created. We prove that…
A key task in Bayesian statistics is sampling from distributions that are only specified up to a partition function (i.e., constant of proportionality). However, without any assumptions, sampling (even approximately) can be #P-hard, and few…
In this work we define two kinds of crested product for reversible Markov chains, which naturally appear as a generalization of the case of crossed and nested product, as in association schemes theory, even if we do a construction that…
Consider a Markov process \omega_t at equilibrium and some event C (a subset of the state-space of the process). A natural measure of correlations in the process is the pairwise correlation \Pr[\omega_0,\omega_t \in C] - \Pr[\omega_0 \in…