相关论文: A new path method for exponential ergodicity of Ma…
We study the limiting behavior of a random dynamic system driven by a stochastic chain. Our main interest is in the chains that are not necessarily ergodic but rather decomposable into ergodic classes. To investigate the conditions under…
This paper gathers together different conditions which are all equivalent to geometric ergodicity of time-homogeneous Markov chains on general state spaces. A total of 34 different conditions are presented (27 for general chains plus 7 just…
We observe n possibly dependent random variables, the distribution of which is presumed to be stationary even though this might not be true, and we aim at estimating the stationary distribution. We establish a non-asymptotic deviation bound…
The preparation of the stationary distribution of irreducible, time-reversible Markov chains is a fundamental building block in many heuristic approaches to algorithmically hard problems. It has been conjectured that quantum analogs of…
We consider two classes of natural stochastic processes on finite unlabeled graphs. These are Euclidean stochastic optimization algorithms on the adjacency matrix of weighted graphs and a modified version of the Metropolis MCMC algorithm on…
Most work on wireless network throughput ignores the temporal correlation inherent to wireless channels because it degrades tractability. To better model and quantify the temporal variations of wireless network throughput, this paper…
It is known that the Dobrushin's ergodicity coefficient is one of the effective tools to study a behavior of non-homogeneous Markov chains. In the present paper, we define such an ergodicity coefficient of a positive mapping defined on…
We study a stochastic SIS (susceptible-infected-susceptible) epidemic dynamics on network, under the effect of a Markovian regime-switching. We first prove the existence of a unique global positive solution, and find a positive invariant…
Stochastic reaction networks are dynamical models of biochemical reaction systems and form a particular class of continuous-time Markov chains on $\mathbb{N}^n$. Here we provide a fundamental characterisation that connects structural…
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…
In this paper we study the central limit theorem for additive functionals of stationary Markov chains with general state space by using a new idea involving conditioning with respect to both the past and future of the chain. Practically, we…
A common tool in the practice of Markov Chain Monte Carlo is to use approximating transition kernels to speed up computation when the desired kernel is slow to evaluate or intractable. A limited set of quantitative tools exist to assess the…
We study the ergodic properties of two classes of random dynamical systems: a type of Markov chain which we call the \textit{alternating random walk} and a certain stochastic billiard system which describes the motion of a free-moving rough…
We derive novel results on the ergodic theory of irreducible, aperiodic Markov chains. We show how to optimally steer the network flow to a stationary distribution over a finite or infinite time horizon. Optimality is with respect to an…
Improved rates of convergence for ergodic homogeneous Markov chains are studied. In comparison to the earlier papers the setting is also generalised to the case without a unique dominated measure. Examples are provided where the new bound…
We study the problem of stationarity and ergodicity for autoregressive multinomial logistic time series models which possibly include a latent process and are defined by a GARCH-type recursive equation. We improve considerably upon the…
We are concerned with the asymptotics of the Markov chain given by the post-jump locations of a certain piecewise-deterministic Markov process with a state-dependent jump intensity. We provide sufficient conditions for such a model to…
Random sampling of large Markov matrices with a tunable spectral gap, a nonuniform stationary distribution, and a nondegenerate limiting empirical spectral distribution (ESD) is useful. Fix $c>0$ and $p>0$. Let $A_n$ be the adjacency matrix…
Stochastic models of reaction networks are becoming increasingly important in Systems Biology. In these models, the dynamics is generally represented by a continuous-time Markov chain whose states denote the copy-numbers of the constituent…
This paper is motivated by examples from stochastic reaction network theory. The $Q$-matrix of a stochastic reaction network can be derived from the reaction graph, an edge-labelled directed graph encoding the jump vectors of an associated…