Related papers: Markov chains for promotion operators

We give a generalization of the ergodic theorem for semi-Markov linear-type processes. This generalization is proved for the case when a common support of distributions defining this process is not arithmetic. Also we give an uniform…

This paper aims at improving the convergence to equilibrium of finite ergodic Markov chains via permutations and projections. First, we prove that a specific mixture of permuted Markov chains arises naturally as a projection under the KL…

Local to global machinery plays an important role in the study of simplicial complexes, since the seminal work of Garland [G] to our days. In this work we develop a local to global machinery for general posets. We show that the high…

We define a finite Markov chain, called generalized crested product, which naturally appears as a generalization of the first crested product of Markov chains. A complete spectral analysis is developed and the $k$-step transition…

Promotion and evacuation are bijections on the set of linear extensions of a finite poset first defined by Schutzenberger. This paper surveys the basic properties of these two operations and discusses some generalizations.

In this paper we consider a simple Markov chain for bipartite graphs with given degree sequence on $n$ vertices. We show that the mixing time of this Markov chain is bounded above by a polynomial in $n$ in case of {\em semi-regular} degree…

Schubert polynomials were discovered by A. Lascoux and M. Sch\"utzenberger in the study of cohomology rings of flag manifolds in 1980's. These polynomials generalize Schur polynomials, and form a linear basis of multivariate polynomials. In…

We study piecewise linear Markov maps, with countable Markov partitions, inspired by a problem of the Mikl\'os Schweitzer competition in 2022. We introduce $\ell$-Markov partitions and apply ideas of symbolic dynamics to our systems,…

Markov chains for probability distributions related to matrix product states and 1D Hamiltonians are introduced. With appropriate 'inverse temperature' schedules, these chains can be combined into a random approximation scheme for ground…

We present here two standalone results from a forthcoming work on the analysis of Markov chains using the representation theory of $S_n$. First, we give explicit formulas for the decompositions of tensor powers of the defining and standard…

We introduce the notion of a generalized oscillating tableau and define a promotion operation on such tableaux that generalizes the classical promotion operation on standard Young tableaux. As our main application, we show that this…

The asymptotic probability theory of conjugacy classes of the finite general linear and unitary groups leads to a probability measure on the set of all partitions of natural numbers. A simple method of understanding these measures in terms…

All one-condition generalized inverses of the Markovian kernel I - P, where P is the transition matrix of a finite irreducible Markov chain, can be uniquely specified in terms of the stationary probabilities and the mean first passage times…

We define piecewise-linear and birational analogues of the toggle-involutions on order ideals of posets studied by Striker and Williams and use them to define corresponding analogues of rowmotion and promotion that share many of the…

The complex irreducible representations of the symmetric group carry an important canonical basis called the Kazhdan-Lusztig basis. Although it is difficult to express how general permutations act on this basis, some distinguished…

We show that given a poset P and and a subposet Q, the integer points obtained by restricting linear extensions of P to Q can be explained via integer lattice points of a generalized permutohedron.

We prove dispersive estimates for two models~: the adjacency matrix on a discrete regular tree, and the Schr\"odinger equation on a metric regular tree with the same potential on each edge/vertex. The latter model can be thought of as an…

We prove generalized Cheeger inequalities for eigenvalues of Laplacians for reversible Markov chains. Then we apply Hassannezhad and Miclo's convergence result to obtain Jammes Cheeger inequalities for Steklov eigenvalues. In particular, we…

Findings by M. L. Lyra, S. Mayboroda and M. Filoche relate invertibility and positivity of a class of discrete Schr\"odinger matrices with the existence of the "Landscape Function", which provides an upper bound on all eigenvectors…

We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application…