相关论文: Properties of the Promotion Markov Chain on Linear…

We develop two models for Bayesian estimation and selection in high-order, discrete-state Markov chains. Both are based on the mixture transition distribution, which constructs a transition probability tensor with additive mixing of…

The advent of deep learning and recurrent neural networks revolutionized the field of time-series processing. Therefore, recent research on spectrum prediction has focused on the use of these tools. However, spectrum prediction, which…

This paper introduces the concept of random context representations for the transition probabilities of a finite-alphabet stochastic process. Processes with these representations generalize context tree processes (a.k.a. variable length…

In this paper, we analyze the dynamics of spreading processes taking place over time-varying networks. A common approach to model time-varying networks is via Markovian random graph processes. This modeling approach presents the following…

We consider Markov chains with random transition probabilities which, moreover, fluctuate randomly with time. We describe such a system by a product of stochastic matrices, $U(t)=M_t\cdots M_1$, with the factors $M_i$ drawn independently…

We study a variable length Markov chain model associated with a group of stationary processes that share the same context tree but each process has potentially different conditional probabilities. We propose a new model selection and…

Rooted bifurcating trees are mathematical objects used to model evolutionary relationships and arise naturally in both coalescent theory and phylogenetics. Recent numerical representations of tree topologies, known as F-matrices, allow for…

Consider a compact metric space $S$ and a pair $(j,k)$ with $k \ge 2$ and $1 \le j \le k$. For any probability distribution $\theta \in P(S)$, define a Markov chain on $S$ by: from state $s$, take $k$ i.i.d. ($\theta$) samples, and jump to…

In the last decade, some algebraic tools have been successfully applied to phylogenetic reconstruction. These tools are mainly based on the knowledge of equations describing algebraic varieties associated to phylogenetic trees evolving…

Let $X_{t}$ and $Y_{t}$ be two Markov chains, on state spaces $\Omega \subset \hat{\Omega}$. In this paper, we discuss how to prove bounds on the spectrum of $X_{t}$ based on bounds on the spectrum of $Y_{t}$. This generalizes work of…

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…

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…

Perturbation analysis of Markov chains provides bounds on the effect that a change in a Markov transition matrix has on the corresponding stationary distribution. This paper compares and analyzes bounds found in the literature for finite…

Let S be a denumerable state space and let P be a transition probability matrix on S. If a denumerable set M of nonnegative matrices is such that the sum of the matrices is equal to P, then we call M a partition of P. Let K denote the set…

We consider hidden Markov models indexed by a binary tree where the hidden state space is a general metric space. We study the maximum likelihood estimator (MLE) of the model parameters based only on the observed variables. In both…

We consider a discrete-time Markov chain, called fragmentation process, that describes a specific way of successively removing objects from a linear arrangement. The process arises in population genetics and describes the ancestry of the…

We analyze random walks on a class of semigroups called ``left-regular bands''. These walks include the hyperplane chamber walks of Bidigare, Hanlon, and Rockmore. Using methods of ring theory, we show that the transition matrices are…

We study a broad class of random labelled trees in which integer-valued labels evolve along the edges according to increments in $\{-1, 0, 1\}$. These models include e.g. branching random walks, embedded complete and incomplete binary…

In this paper, we study a biased version of the nearest-neighbor transposition Markov chain on the set of permutations where neighboring elements $i$ and $j$ are placed in order $(i,j)$ with probability $p_{i,j}$. Our goal is to identify…

Discrete latent space models have recently achieved performance on par with their continuous counterparts in deep variational inference. While they still face various implementation challenges, these models offer the opportunity for a…