Related papers: Markov chains for promotion operators
The preparation of the stationary distribution of irreducible, time-reversible Markov chains is a fundamental building block in many heuristic approaches to algorithmically hard problems. It has been conjectured that quantum analogs of…
The purpose of this paper is to study the time average behavior of Markov chains with transition probabilities being kernels of completely continuous operators, and therefore to provide a sufficient condition for a class of Markov chains…
Motivated by the Lam--Pylyavskyy inequalities for Schur functions, we give a far reaching multivariate generalization of Fishburn's correlation inequality for the number of linear extensions of posets. We then give a multivariate…
We generalize the concept of basin of attraction of a stable state in order to facilitate the analysis of dynamical systems with noise and to assess stability properties of metastable states and long transients. To this end we examine the…
We give an algorithmic-bijective proof of Macdonald's reduced word identity in the theory of Schubert polynomials, in the special case where the permutation is dominant. Our bijection uses a novel application of David Little's generalized…
We prove a generalization of the well-known theorems by Borg and Hochstadt for periodic self-adjoint Schr\"odinger operators without a spectral gap, respectively, one gap in their spectrum, in the matrix-valued context. Our extension of the…
Counting linear extensions is a fundamental problem in poset theory. It is known to be #P-complete, with polynomial-time formulas available in special cases. In this work, we develop new recursive formulas for counting linear extensions of…
The first author recently introduced toric promotion, an operator that acts on the labelings of a graph $G$ and serves as a cyclic analogue of Sch\"utzenberger's promotion operator. Toric promotion is defined as the composition of certain…
In [10], a `Markovian stick-breaking' process which generalizes the Dirichlet process $(\mu, \theta)$ with respect to a discrete base space ${\mathfrak X}$ was introduced. In particular, a sample from from the `Markovian stick-breaking'…
We introduce generalized arrow diagrams and generalized Reidemeister moves for diagrams of links in Seifert fibered spaces. We give a presentation of the fundamental group of the link complement. As a corollary we are able to compute the…
A Markov chain is considered whose states are orderings of an underlying fixed tree and whose transitions are local "random-to-front" reorderings, driven by a probability distribution on subsets of the leaves. The eigenvalues of the…
We consider a simple discrete-time Markov chain with values in $[0,\infty)^{Z^d}$. The Markov chain describes various interesting examples such as oriented percolation, directed polymers in random environment, time discretizations of binary…
We analyze families of Markov chains that arise from decomposing tensor products of irreducible representations. This illuminates the Burnside-Brauer Theorem for building irreducible representations, the McKay Correspondence, and Pitman's…
We extend our previous study of Markov chains on finite commutative rings (arXiv:1605.05089) to arbitrary finite rings with identity. At each step, we either add or multiply by a randomly chosen element of the ring, where the addition…
We consider a discrete-time Markov chain $(X^t,Y^t)$, $t=0,1,2,...$, where the $X$-component forms a Markov chain itself. Assume that $(X^t)$ is Harris-ergodic and consider an auxiliary Markov chain ${\hat{Y}^t}$ whose transition…
In category theory circles it is well-known that the Schreier theory of group extensions can be understood in terms of the Grothendieck construction on indexed categories. However, it is seldom discussed how this relates to extensions of…
Consider a list of labeled objects that are organized in a heap. At each time, object $j$ is selected with probability $p_j$ and moved to the top of the heap. This procedure defines a Markov chain on the set of permutations which is…
In this work we survey on connections of Markov chains and the theory of multiple orthogonality. Here we mainly concentrate on give a procedure to generate stochastic tetra diagonal Hessenberg matrices, coming from some specific families of…
We study the matrices Q_k of in-forests of a weighted digraph G and their connections with the Laplacian matrix L of G. The (i,j) entry of Q_k is the total weight of spanning converging forests (in-forests) with k arcs such that i belongs…
We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and…