Related papers: Markov chains for promotion operators

Phylogenetics uses alignments of molecular sequence data to learn about evolutionary trees relating species. Along branches, sequence evolution is modelled using a continuous-time Markov process characterised by an instantaneous rate…

A theory of symbolic dynamic systems with long-range correlations based on the consideration of the binary N-step Markov chains developed earlier in Phys. Rev. Lett. 90, 110601 (2003) is generalized to the biased case (non equal numbers of…

In this paper we complete the results of Sullivant and Sturmfels proving that many of the algebraic group-based models for Markov processes on trees are pseudo-toric. We also show in which cases these varieties are normal. This is done by…

The main topic of these notes are Markov loops, studied in the context of continuous time Markov chains on discrete state spaces. We refer to [1] and [2] for the short "history" of the subject. In contrast with these references, symmetry is…

There has been much interest in generalizing Kesten's criterion for amenability in terms of a random walk to other contexts, such as determining amenability of a deck covering group by the bottom of the spectrum of the Laplacian or entropy…

Given a sequence of i.i.d. random functions $\Psi_{n}:\mathbb{R}\to\mathbb{R}$, $n\in\mathbb{N}$, we consider the iterated function system and Markov chain which is recursively defined by $X_{0}^{x}:=x$ and…

In this work, we characterise the statistics of Markov chains by constructing an associated sequence of periodic differential operators. Studying the density of states of these operators reveals the absolutely continuous invariant measure…

We study a colored generalization of the famous simple-switch Markov chain for sampling the set of graphs with a fixed degree sequence. Here we consider the space of graphs with colored vertices, in which we fix the degree sequence and…

We develop a systematic matrix-analytic approach, based on intertwinings of Markov semigroups, for proving theorems about hitting-time distributions for finite-state Markov chains -- an approach that (sometimes) deepens understanding of the…

We generalize a result of Matom\"aki, Radziwi{\l}{\l}, and Tao, by proving an averaged version of a conjecture of Chowla and a conjecture of Elliott regarding correlations of the Liouville function, or more general bounded multiplicative…

In this paper we introduce generalised Markov numbers and extend the classical Markov theory for the discrete Markov spectrum to the case of generalised Markov numbers. In particular we show recursive properties for these numbers and find…

We prove the invertibility of the relevant single and double layer potentials associated to some generalizations of the Stokes operator on bounded domains. In order to do that, we first develop an ``algebra tool kit'' to deal with limit and…

Let $X_n, n \ge 0$ be a Markov chain with finite state space $M$. If $x,y \in M$ such that $x$ is transient we have $P^y(X_n = x) \to 0$ for $n \to \infty$, and under mild aperiodicity conditions this convergence is monotone in that for…

We introduce some natural families of distributions on rooted binary ranked plane trees with a view toward unifying ideas from various fields, including macroevolution, epidemiology, computational group theory, search algorithms and other…

For irreducible, time-homogeneous Markov networks, mutual linearity has recently been established for both occupation probabilities and network currents in the stationary regime as well as in the non-stationary regime in Laplace space. The…

We define oriented posets with correpsonding rank matrices, where linking two posets by an edge corresponds to matrix multiplication. In particular, linking chains via this method gives us fence posets, and taking traces gives us circular…

We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…

Recently we showed how, in two-dimensional scalar theories, one-loop threshold diagrams can be cut into the product of one or more tree-level diagrams arXiv:2206.09368. Using this method on the ADE series of Toda models, we computed the…

A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…

We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of the transition…