Related papers: Reversible Markov chains: variational representati…

In this paper, we study dynamical properties as hypercyclicity, supercyclicity, frequent hypercyclicity and chaoticity for transition operators associated to countable irreductible Markov chains. As particular cases, we consider simple…

Several well-known results from the random matrix theory, such as Wigner's law and the Marchenko--Pastur law, can be interpreted (and proved) in terms of non-backtracking walks on a certain graph. Orthogonal polynomials with respect to the…

This paper introduces an extension of the Markov switching GARCH model where the volatility in each state is a convex combination of two different GARCH components with time varying weights. This model has the dynamic behavior to capture…

We establish non-asymptotic error bounds for the classical Maximal Likelihood Estimation of the transition matrix of a given Markov chain. Meanwhile, in the reversible case, we propose a new reversibility-preserving online Symmetric…

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 analyse the structure of imprecise Markov chains and study their convergence by means of accessibility relations. We first identify the sets of states, so-called minimal permanent classes, that are the minimal sets capable of containing…

Anomalous triangle graphs for the divergence of the axial-vector current are studied using the dispersive approach generalized for the case of higher orders of perturbation theory. The validity of this procedure is proved up to two-loop…

A sequence of Markov chains is said to exhibit (total variation) cutoff if the convergence to stationarity in total variation distance is abrupt. We consider reversible lazy chains. We prove a necessary and sufficient condition for the…

Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical data analysis and signal processing and (ii) characterising classes of dynamical…

Motivated by applications arising in networked systems, this work examines controlled regime-switching systems that stem from a mean-variance formulation. A main point is that the switching process is a hidden Markov chain. An additional…

In this paper, we develop a general theory for the estimation of the transition probabilities of reversible Markov chains using the maximum entropy principle. A broad range of physical models can be studied within this approach. We use…

A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the…

We study ergodic properties of nonlinear Markov chains and stochastic McKean-Vlasov equations. For nonlinear Markov chains we obtain sufficient conditions for existence and uniqueness of an invariant measure and uniform ergodicity. We also…

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…

Suppose that $X_1, \ldots , X_n$ are continuous semimartingales that are reversible and have nondegenerate crossings. Then the corresponding rank processes can be represented by generalized Stratonovich integrals, and this representation…

This article investigates correlational properties of two-dimensional chaotic maps on the unit circle. We give analytical forms of higher-order covariances. We derive the characteristic function of their simultaneous and lagged ergodic…

The three electromagnetic properties appearing in Maxwell's equations are dielectric permittivity, electrical conductivity and magnetic permeability. The study of point diffractors in a homogeneous, isotropic, linear medium suggests the use…

Computational procedures for the stationary probability distribution, the group inverse of the Markovian kernel and the mean first passage times of an irreducible Markov chain, are developed using perturbations. The derivation of these…

Deriving Bayesian inference for exponential random graph models (ERGMs) is a challenging "doubly intractable" problem as the normalizing constants of the likelihood and posterior density are both intractable. Markov chain Monte Carlo (MCMC)…

In this note, we realize the half-steps of a general class of Markov chains as alternating projections with respect to the reverse Kullback-Leibler divergence between convex sets of joint probability distributions. Using this…