Related papers: Why is Kemeny's constant a constant?
Kemeny's constant measures how fast a random walker moves around in a graph. Expressions for Kemeny's constant can be quite involved, and for this reason, many lines of research focus on graphs with structure that makes them amenable to…
Given an infinitesimal perturbation of a discrete-time finite Markov chain, we seek the states that are stable despite the perturbation, \textit{i.e.} the states whose weights in the stationary distributions can be bounded away from $0$ as…
Markov processes are widely used models for investigating kinetic networks. Here we collate and present a variety of results pertaining to kinetic network models, in a unified framework. The aim is to lay out explicit links between several…
In this paper we continue the study of conditional Markov chains (CMCs) with finite state spaces, that we initiated in Bielecki, Jakubowski and Niew\k{e}g\l owski (2015). Here, we turn our attention to the study of Markov consistency and…
We report on a fundamental role of a non-normalized formal steady state, i.e., an infinite invariant density, in a semi-Markov process where the state is determined by the inter-event time of successive renewals. The state describes certain…
We introduce the concept of asymptotic period for an irreducible and aperiodic, discrete-time Markov chain X on a countable state space, and develop the theory leading to its formal definition. The asymptotic period of X equals one - its…
The partial sum of the states of a Markov chain or more generally a Markov source is asymptotically normally distributed under suitable conditions. One of these conditions is that the variance is unbounded. A simple combinatorial…
It is shown how a natural representation of perpetuities as asymptotically homogeneous in space Markov chains allows to prove various asymptotic tail results for stable perpetuities and limit theorems for unstable ones. Some of these…
If $(C_n)$ is a Markov chain on a discrete state space ${\mathcal{S}}$, a Markov chain $(C_n,M_n)$ on the product space ${\mathcal{S}}\times{\mathcal{S}}$, the cat and mouse Markov chain, is constructed. The first coordinate of this Markov…
For a Markov chain $Y$ with values in a Polish space, consider the entrance chain, obtained by sampling $Y$ at the moments when it enters a fixed set $A$ from its complement $A^c$. Similarly, consider the exit chain, obtained by sampling…
Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer $k$-th order Markov chains, for arbitrary $k$, from finite data by applying Bayesian methods to both…
We establish convergence to an invariant measure as time tends to infinity, for a large class of (possibly non-Markovian) stochastic volatility models. Our arguments are based on a novel coupling idea for Markov chains which also extends to…
A sequence of real numbers (x_n) is Benford if the significands, i.e. the fraction parts in the floating-point representation of (x_n) are distributed logarithmically. Similarly, a discrete-time irreducible and aperiodic finite-state Markov…
A wide class of ``counting'' problems have been studied in Computer Science. Three typical examples are the estimation of - (i) the permanent of an $n\times n$ 0-1 matrix, (ii) the partition function of certain $n-$ particle Statistical…
During the past 15 years, several extensions of the concepts noise sensitivity and noise stability, first coined in~\cite{schramm2000}, has been studied. The purpose in this paper is to give definitions of this concepts in the setting of…
In this work, a variant of the birth and death chain with constant intensities, originally introduced by Bruno de Finetti way back in 1957, is revisited. This fact is also underlined by the choice of the title, which is clearly a literal…
A brief review of the development of Chern-Simons gauge theory since its relation to knot theory was discovered in 1988 is presented. The presentation is done guided by a dictionary which relates knot theory concepts to quantum field theory…
Nonlinear Markov chains with finite state space have been introduced in Kolokoltsov (2010). The characteristic property of these processes is that the transition probabilities do not only depend on the state, but also on the distribution of…
We consider continuous-time Markov chain on a finite state space X. We assume X can be clustered into several subsets such that the intra-transition rates within these subsets are of order $\mathcal{O}(\frac{1}{\epsilon})$ comparing to the…
The invariant measure is a fundamental object in the theory of Markov processes. In finite dimensions a Markov process is defined by transition rates of the corresponding stochastic matrix. The Markov tree theorem provides an explicit…