Related papers: Cover time for countable Markov shifts
We study a class of Gibbs measures of classical particle spin systems with spin space $S=\mathbb{R}^{m}$ and unbounded pair interaction, living on a metric graph given by a typical realization $\gamma $ of a random point process in…
We provide conditions that classify cover times for sequences of random walks on random graphs into two types: One type (Type 1) is the class of cover times that are of the order of the maximal hitting times scaled by the logarithm of the…
Under very general conditions the hitting time of a set by a stochastic process is a stopping time. We give a new simple proof of this fact. The section theorems for optional and predictable sets are easy corollaries of the proof.
For a dynamical system, we study the set of points $\cal W$ whose orbit approximates any chosen point at certain specified rates. Our basic setting is that of left shift acting on topological Markov chains endowed with a local weak Gibbs…
We study a class of strongly irreducible, multidimensional, topological Markov shifts, comparing two notions of "symmetric measure": exchangeability and the Gibbs (or conformal) property. We show that equilibrium measures for such shifts…
We present a general method to derive continuity estimates for conditional probabilities of general (possibly continuous) spin models sub jected to local transformations. Such systems arise in the study of a stochastic time-evolution of…
We study the thermodynamic formalism for particular types of sub-additive sequences on a class of subshifts over countable alphabets. The subshifts we consider include factors of irreducible countable Markov shifts under certain conditions.…
Using the results of Ding, Lee, Peres [3], we develop formulas to compute the hitting times and cover times for random walks on groups. We developed an explicit formula for hitting times in terms of the irreducible representations of the…
We give a sufficiently detailed account on the construction of marked Gibbs measures in the high temperature and low fugacity regime. This is proved for a wide class of underlying spaces and potentials such that stability and integrability…
There has been much interest in generalizing Kesten's criterion for amenability in terms of a random walk to other contexts, such as determining amenability of a deck covering group by the bottom of the spectrum of the Laplacian or entropy…
We study the protective measurement of a qubit by a second qubit acting as a probe. Consideration of this model is motivated by the possibility of its experimental implementation in multiqubit systems such as trapped ions. In our scheme,…
Given a traversal algorithm, cover time is the expected number of steps needed to visit all nodes in a given graph. A smaller cover time means a higher exploration efficiency of traversal algorithm. Although random walk algorithms have been…
Covering relations are a topological tool for detecting periodic orbits, symbolic dynamics and chaotic behavior for autonomous ODE. We extend the method of the covering relations onto systems with a time dependent perturbation. As an…
We consider matching with shifts for Gibbsian sequences. We prove that the maximal overlap behaves as $c\log n$, where $c$ is explicitly identified in terms of the thermodynamic quantities (pressure) of the underlying potential. Our…
Countable state Markov shifts are a natural generalization of the well-known subshifts of finite type. They are the subject of current research both for their own sake and as models for smooth dynamical systems. In this paper, we…
We derive an exact closed-form analytical expression for the distribution of the cover time for a random walk over an arbitrary graph. In special case, we derive simplified exact expressions for the distributions of cover time for a…
The measurement of time durations or instants of ocurrence of events has been frequently modelled ``operationally'' by coupling the system of interest to a ``clock''. According to several of these models the operational approach is limited…
How long does it take a random searcher to visit all sites of a given domain? This time, known as the cover time, is a key observable to quantify the efficiency of exhaustive searches, which require a complete exploration of an area and not…
We prove that if $\Sigma_{\mathbf A}(\mathbb N)$ is an irreducible Markov shift space over $\mathbb N$ and $f:\Sigma_{\mathbf A}(\mathbb N) \rightarrow \mathbb R$ is coercive with bounded variation then there exists a maximizing probability…
We give a set of equivalent conditions for a potential on a Countable Markov Shift to have strong positive recurrence, which is also equivalent to having exponential decay of correlations. A key ingredient of our proofs is quantifying how…