The operation of squaring (coproduct followed by product) in a combinatorial Hopf algebra is shown to induce a Markov chain in natural bases. Chains constructed in this way include widely studied methods of card shuffling, a natural “rock-breaking” process, and Markov chains on simplicial complexes. Many of these chains can be explictly diagonalized using the primitive elements of the algebra and the combinatorics of the free Lie algebra. For card shuffling, this gives an explicit description of the eigenvectors. For rock-breaking, an explicit description of the quasi-stationary distribution and sharp rates to absorption follow
The study of sequences of dependent random variables arose at the beginning of the twentieth century...
Abstract For a Markov chain, both the detailed balance condition and the cycle Kolmogorov condition ...
Abstract. We study the generation of uniformly distributed linear extensions using Markov chains. In...
AbstractThe “carries” when n random numbers are added base b form a Markov chain with an “amazing” t...
Abstract. The “carries ” when n random numbers are added base b form a Markov chain with an “amazing...
Submitted on 6/17/08; minor revisions on 9/13/08 The number of “carries ” when n random integers are...
We develop a general theory of Markov chains realizable as random walks on R-trivial monoids. It pro...
This paper surveys and relates the basic concepts of process algebra and the modelling of continuous...
This paper surveys and relates the basic concepts of process algebra and the modelling of continuous...
AbstractMarkov chains are widely used to determine system performance and reliability characteristic...
Diaconis and others have shown that certain Markov chains exhibit a "cutoff phenomenon" in which, af...
Recently, Diaconis, Pang, and Ram defined a random walk on the elements of two types of combinatoria...
We develop a general theory of Markov chains realizable as random walks on $\mathscr R$-tri...
This monograph studies two classical computational problems: counting the elements of a finite set o...
For a Markov chain, both the detailed balance condition and the cycle Kolmogorov condition are algeb...
The study of sequences of dependent random variables arose at the beginning of the twentieth century...
Abstract For a Markov chain, both the detailed balance condition and the cycle Kolmogorov condition ...
Abstract. We study the generation of uniformly distributed linear extensions using Markov chains. In...
AbstractThe “carries” when n random numbers are added base b form a Markov chain with an “amazing” t...
Abstract. The “carries ” when n random numbers are added base b form a Markov chain with an “amazing...
Submitted on 6/17/08; minor revisions on 9/13/08 The number of “carries ” when n random integers are...
We develop a general theory of Markov chains realizable as random walks on R-trivial monoids. It pro...
This paper surveys and relates the basic concepts of process algebra and the modelling of continuous...
This paper surveys and relates the basic concepts of process algebra and the modelling of continuous...
AbstractMarkov chains are widely used to determine system performance and reliability characteristic...
Diaconis and others have shown that certain Markov chains exhibit a "cutoff phenomenon" in which, af...
Recently, Diaconis, Pang, and Ram defined a random walk on the elements of two types of combinatoria...
We develop a general theory of Markov chains realizable as random walks on $\mathscr R$-tri...
This monograph studies two classical computational problems: counting the elements of a finite set o...
For a Markov chain, both the detailed balance condition and the cycle Kolmogorov condition are algeb...
The study of sequences of dependent random variables arose at the beginning of the twentieth century...
Abstract For a Markov chain, both the detailed balance condition and the cycle Kolmogorov condition ...
Abstract. We study the generation of uniformly distributed linear extensions using Markov chains. In...