相关论文: Why is Kemeny's constant a constant?
In the context of a random walk on an undirected graph, Kemeny's constant can measure the average travel time for a random walk between two randomly chosen vertices. We are interested in graphs that behave counter-intuitively in regard to…
We consider a simple but important class of metastable discrete time Markov chains, which we call perturbed Markov chains. Basically, we assume that the transition matrices depend on a parameter $\varepsilon$, and converge as $\varepsilon$.…
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…
We study a class of Markov chains that model the evolution of a quantum system subject to repeated measurements. Each Markov chain in this class is defined by a measure on the space of matrices. It is then given by a random product of…
A sufficient condition is given for a class of quantum birth and death chains on the non-negative integers to possess invariant states. The result is applied to generalised one-atom masers and to the Jaynes-Cummings one-atom maser with…
It will be argued here that the cosmological constant problem exists because of the way the vacuum is defined in quantum field theory. It has been known for some time that for QFT to be gauge invariant certain terms--such as part of the…
In this paper we prove a sharp quantitative version of the Kendall's Theorem. The Kendal Theorem states that under some mild conditions imposed on a probability distribution on positive integers (i.e. probabilistic sequence) one can prove…
Studying the behaviour of Markov processes at boundary points of the state space has a long history, dating back all the way to William Feller. With different motivations in mind entrance and exit questions have been explored for different…
We establish general theorems quantifying the notion of recurrence --- through an estimation of the moments of passage times --- for irreducible continuous-time Markov chains on countably infinite state spaces. Sharp conditions of…
For the 1-dimensional Kuramoto-Sivashinsky equation with random forcing term, existence and uniqueness of solutions is proved. Then, the Markovian semigroup is well defined; its properties are analyzed, in order to provide sufficient…
We investigate recurrence and transience of Branching Markov Chains (BMC) in discrete time. Branching Markov Chains are clouds of particles which move (according to an irreducible underlying Markov Chain) and produce offspring…
If the state space of a homogeneous continuous-time Markov chain is too large, making inferences - here limited to determining marginal or limit expectations - becomes computationally infeasible. Fortunately, the state space of such a chain…
The cosmological constant problem is explained by a theory based on the discrete space-time hypothesis. The calculated cosmological constant value is of the order of 10^-52[m]^-2 or equivalent to about 0.7 of the critical mass density. It…
A knot invariant is called skein if it is determined by a finite number of skein relations. In the paper we discuss some basic properties of skein invariants and mention some known examples of skein invariants.
The probabilistic description of finite classical systems often leads to linear kinetic equations. A set of physically motivated mathematical requirements is accordingly formulated. We show that it necessarily implies that solutions of such…
We study discrete time Markov processes with periodic or open boundary conditions and with inhomogeneous rates in the bulk. The Markov matrices are given by the inhomogeneous transfer matrices introduced previously to prove the…
The upper extremes of a Markov chain with regulary varying stationary marginal distribution are known to exhibit under general conditions a multiplicative random walk structure called the tail chain. More generally, if the Markov chain is…
Markov numbers are integers that appear in the solution triples of the Diophantine equation, $x^2+y^2+z^2=3xyz$, called the Markov equation. A classical topic in number theory, these numbers are related to many areas of mathematics such as…
We consider a time-homogeneous Markov chain $X_n$, $n\ge0$, valued in ${\bf R}$. Suppose that this chain is transient, that is, $X_n$ generates a $\sigma$-finite renewal measure. We prove the key renewal theorem under condition that this…
The asymptotic variance is an important criterion to evaluate the performance of Markov chains, especially for the central limit theorems. We give the variational formulas for the asymptotic variance of discrete-time (non-reversible) Markov…