Related papers: A Perron-Frobenius Theorem for Strongly Aperiodic …

Let $x_1, \dots, x_n$ be points in a metric space and define the distance matrix $D \in \mathbb{R}^{n \times n}$ by ${D}_{ij} = d(x_i, x_j)$. The Perron-Frobenius Theorem implies that there is an eigenvector $v \in \mathbb{R}^n_{}$ with…

This paper proposes a flexible framework for inferring large-scale time-varying and time-lagged correlation networks from multivariate or high-dimensional non-stationary time series with piecewise smooth trends. Built on a novel and unified…

We prove that certain asymptotic moments exist for some random distance expanding dynamical systems and Markov chains in random dynamical environment, and compute them in terms of the derivatives at the $0$ of an appropriate pressure…

We consider expansions of vectors by a general class of multidimensional continued fraction algorithms. If the expansion is eventually periodic, then we describe the possible structure of a matrix corresponding to the repetend, and use it…

We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and…

The asymptotic probability theory of conjugacy classes of the finite general linear and unitary groups leads to a probability measure on the set of all partitions of natural numbers. A simple method of understanding these measures in terms…

We introduce a new, relatively simple, line-breaking construction of the $\alpha$-stable tree which realises its random finite-dimensional distributions. This is a direct analogue of Aldous' line-breaking construction of the Brownian…

We develop a Thermodynamic Formalism for bounded continuous potentials defined on the sequence space $X\equiv E^{\mathbb{N}}$, where $E$ is a general Borel standard space. In particular, we introduce meaningful concepts of entropy and…

This paper examines the consensus problem on time-varying matrix-weighed undirected networks. First, we introduce the matrix-weighted integral network for the analysis of such networks. Under mild assumptions on the switching pattern of the…

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…

The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dependency graphs and give normality criteria in this context.…

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…

The absence of time-reversal symmetry is a fundamental property of many nonlinear time series. Here, we propose a new set of statistical tests for time series irreversibility based on standard and horizontal visibility graphs. Specifically,…

This paper gives a method for computing distributions associated with patterns in the state sequence of a hidden Markov model, conditional on observing all or part of the observation sequence. Probabilities are computed for very general…

We consider Markov chains with random transition probabilities which, moreover, fluctuate randomly with time. We describe such a system by a product of stochastic matrices, $U(t)=M_t\cdots M_1$, with the factors $M_i$ drawn independently…

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…

Let $G$ be a multiplicative subsemigroup of the general linear group $\Gl(\mathbb{R}^d)$ which consists of matrices with positive entries such that every column and every row contains a strictly positive element. Given a $G$--valued random…

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

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…

We fix $d \geq 2$ and denote $\mathcal S$ the semi-group of $d \times d$ matrices with non negative entries. We consider a sequence $(A_n, B_n)_{n \geq 1} $ of i. i. d. random variables with values in $\mathcal S\times \mathbb R_+^d$ and…