Related papers: Markov chains for promotion operators
We introduce and develop the theory of UMEL-shellable posets. These are posets equipped with an edge-lexicographical labeling satisfying certain uniformity and monotonicity properties. This framework encompasses classical families of…
Denote by $V$ the poset consisting of the elements $\{A,B,C\}$ with cover relations $\{A\lessdot B, A\lessdot C\}$. We show that $P$-strict promotion, as defined by Bernstein, Striker, and Vorland, on $P$-strict labelings of $V\times…
With view to applications, we here give an explicit correspondence between the following two: (i) the set of symmetric and positive measures $\rho$ on one hand, and (ii) a certain family of generalized Markov transition measures $P$, with…
We develop a method for analyzing the mixing times for a quite general class of Markov chains on the complete monomial group G \wr S_n (the wreath product of a group G with the permutation group S_n) and a quite general class of Markov…
We provide a general framework for computing upper bounds on mixing times of finite Markov chains when its minimal ideal is left zero. Our analysis is based on combining results by Brown and Diaconis with our previous work on stationary…
We consider a Markov chain on invertible $n\times n$ matrices with entries in $\mathbb{Z}_2$ which moves by picking an ordered pair of distinct rows and add the first one to the other, modulo $2$. We establish a logarithmic Sobolev…
We consider refined versions of Markov chains related to juggling introduced by Warrington. We further generalize the construction to juggling with arbitrary heights as well as infinitely many balls, which are expressed more succinctly in…
Consider a finite irreducible Markov chain with invariant distribution $\pi$. We use the inner product induced by $\pi$ and the associated heat operator to simplify and generalize some results related to graph partitioning and the small-set…
This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity. A classical…
It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…
This paper investigates the extension complexity of polytopes by exploiting the correspondence between non-negative factorizations of slack matrices and randomized communication protocols. We introduce a geometric characterization of…
We consider a diffusion given by a small noise perturbation of a dynamical system driven by a potential function with a finite number of local minima. The classical results of Freidlin and Wentzell show that the time this diffusion spends…
Promotion permutations have recently been associated to each rectangular standard Young tableau by Gaetz--Pechenik--Pfannerer--Striker--Swanson. Here we relate promotion permutations to the Robinson--Schensted (RS) correspondence. More…
This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs…
We consider a Markov chain obtained by random iterations of Lipschitz maps $T_i$ chosen with a probability $p_i(x)$ depending on the current position $x$. We assume this system has a property of "contraction on average", that is $\sum_i…
Connection matrices are one of the central tools in Conley's approach to the study of dynamical systems, as they provide information on the existence of connecting orbits in Morse decompositions. They may be considered a generalisation of…
We provide a unified framework to compute the stationary distribution of any finite irreducible Markov chain or equivalently of any irreducible random walk on a finite semigroup $S$. Our methods use geometric finite semigroup theory via the…
We present an equivariant bijection between two actions--promotion and rowmotion--on order ideals in certain posets. This bijection simultaneously generalizes a result of R. Stanley concerning promotion on the linear extensions of two…
We introduce a class of posets, which includes both ribbon posets (skew shapes) and $d$-complete posets, such that their number of linear extensions is given by a determinant of a matrix whose entries are products of hook lengths. We also…
This paper studies Hoeffding's inequality for Markov chains under the generalized concentrability condition defined via integral probability metric (IPM). The generalized concentrability condition establishes a framework that interpolates…