Related papers: Absorption in Time-Varying Markov Chains: Graph-Ba…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
Many driven systems alternate between bursts of activity and quiescence and can become trapped in an absorbing state, such as complete inactivity in reaction-diffusion processes or extinction in predator-prey dynamics. It is generally…
We study quasi-stationary distributions and quasi-limiting behavior of Markov chains in general reducible state spaces with absorption. We propose a set of assumptions dealing with particular situations where the state space can be…
We study the absorbing state transition in particulate systems under spatially inhomogeneous driving using a modified random organization model. For smoothly varying driving the steady state results map onto the homogeneous absorbing state…
We consider the problem of estimating the expected time to find a maximum degree node on a graph using a (parameterized) biased random walk. For assortative graphs the positive degree correlation serves as a local gradient for which a bias…
We consider periodic Markov chains with absorption. Applying to iterates of this periodic Markov chain criteria for the exponential convergence of conditional distributions of aperiodic absorbed Markov chains, we obtain exponential…
In this paper we consider the problem of graph-based transductive classification, and we are particularly interested in the directed graph scenario which is a natural form for many real world applications. Different from existing research…
This paper introduces the Attracting Random Walks model, which describes the dynamics of a system of particles on a graph with $n$ vertices. At each step, a single particle moves to an adjacent vertex (or stays at the current one) with…
Consider a Markov chain with finite state $\{0, 1, ..., d\}$. We give the generation functions (or Laplace transforms) of absorbing (passage) time in the following two situations : (1) the absorbing time of state $d$ when the chain starts…
In this paper, a simple transient Markov process with an absorbing point is used to investigate the qualitative behavior of a large scale storage network of non reliable file servers where files can be duplicated. When the size of the…
The switch Markov chain has been extensively studied as the most natural Markov Chain Monte Carlo approach for sampling graphs with prescribed degree sequences. We use comparison arguments with other, less natural but simpler to analyze,…
In this paper, we consider absorbing Markov chains $X_n$ admitting a quasi-stationary measure $\mu$ on $M$ where the transition kernel $\mathcal P$ admits an eigenfunction $0\leq \eta\in L^1(M,\mu)$. We find conditions on the transition…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
Adaptive Monte Carlo methods can be viewed as implementations of Markov chains with infinite memory. We derive a general condition for the convergence of a Monte Carlo method whose history dependence is contained within the simulated…
We consider a general model in which there is a coupled dynamics of node states and links states in a network. This coupled dynamics coevolves with dynamical changes of the topology of the network caused by a link rewiring mechanism. Such…
This work is devoted to the almost sure stabilization of adaptive control systems that involve an unknown Markov chain. The control system displays continuous dynamics represented by differential equations and discrete events given by a…
We study the problem of learning the transition matrices of a set of Markov chains from a single stream of observations on each chain. We assume that the Markov chains are ergodic but otherwise unknown. The learner can sample Markov chains…
This article studies the expected occupancy probabilities on an alphabet. Unlike the standard situation, where observations are assumed to be independent and identically distributed (iid), we assume that they follow a regime switching…
We establish the existence and uniqueness of quasi-stationary and quasi-ergodic measures for almost surely absorbed discrete-time Markov chains under weak conditions. We obtain our results by exploiting Banach lattice properties of…
Absorbing phase transitions (APTs) are widespread in non-equilibrium systems, spanning condensed matter, epidemics, earthquakes, ecology, and chemical reactions. APTs feature an absorbing state in which the system becomes entrapped, along…