相关论文: One-dimensional linear recursions with Markov-depe…

Let $X_1,X_2,...$ be a sequence of random variables satisfying the distributional recursion $X_1=0$ and $X_n= X_{n-I_n}+1$ for $n=2,3,...$, where $I_n$ is a random variable with values in $\{1,...,n-1\}$ which is independent of…

Given a sequence $(M_{n},Q_{n})_{n\ge 1}$ of i.i.d. random variables with generic copy $(M,Q)$ such that $M$ is a regular $d\times d$ matrix and $Q$ takes values in $\mathbb{R}^{d}$, we consider the random difference equation (RDE)…

We introduce and analyze a new class of monotone stochastic recursions in a regenerative environment which is essentially broader than that of Markov chains. We prove stability theorems and apply our results {to three canonical models in…

Let $(M_{n},S_{n})_{n\ge 0}$ be a Markov random walk with positive recurrent driving chain $(M_{n})_{n\ge 0}$ having countable state space $\mathcal{S}$ and stationary distribution $\pi$. It is shown in this note that, if the dual sequence…

The upper extremes of a Markov chain with regulary varying stationary marginal distribution are known to exhibit under general conditions a multiplicative random walk structure called the tail chain. More generally, if the Markov chain is…

We consider a stochastic recurrence equation of the form $Z_{n+1} = A_{n+1} Z_n+B_{n+1}$, where $\mathbb{E}[\log A_1]<0$, $\mathbb{E}[\log^+ B_1]<\infty$ and $\{(A_n,B_n)\}_{n\in\mathbb{N}}$ is an i.i.d. sequence of positive random vectors.…

We present here two standalone results from a forthcoming work on the analysis of Markov chains using the representation theory of $S_n$. First, we give explicit formulas for the decompositions of tensor powers of the defining and standard…

Positive dependencies have been compared in the literature under rather strong assumptions such as equality of conditional distributions, exchangeability, or stationarity. We establish supermodular ordering results for distributions that…

A switching random walk, commonly known under the misnomer `oscillating random walk', is a real-valued Markov chain whose distribution of increments is determined by the sign of the current position. We explicitly identify an invariant…

We consider a Markov-modulated Brownian motion reflected to stay in a strip [0,B]. The stationary distribution of this process is known to have a simple form under some assumptions. We provide a short probabilistic argument leading to this…

For continuous-time Markov chains and open unimolecular chemical reaction networks, we prove that any two stationary currents are linearly related upon perturbations of a single edge's transition rates, arbitrarily far from equilibrium. We…

We consider a class of multiplicative processes which, added with stochastic reset events, give origin to stationary distributions with power-law tails -- ubiquitous in the statistics of social, economic, and ecological systems. Our main…

We analyze certain stationary fields with linear regressions and quadratic conditional variances. This classic probabilistic problem leads somewhat unexpectedly to stationary Markov processes closely tied to non-commutative probability…

A block Markov chain is a Markov chain whose state space can be partitioned into a finite number of clusters such that the transition probabilities only depend on the clusters. Block Markov chains thus serve as a model for Markov chains…

In this paper, we first show the existence of solutions to the following system of nonlinear equations \begin{eqnarray*}\left\{\begin{array}{l} a_{11}x_1+a_{12}x_2+a_{13}x_3+\cdots+a_{1n}x_{n} =…

We consider a class of discrete time Markov chains with state space [0,1] and the following dynamics. At each time step, first the direction of the next transition is chosen at random with probability depending on the current location. Then…

A classical problem for Markov chains is determining their stationary (or steady-state) distribution. This problem has an equally classical solution based on eigenvectors and linear equation systems. However, this approach does not scale to…

We study random two-dimensional spanning forests in the plane that can be viewed both in the discrete case and in their appropriately taken scaling limits as a uniformly chosen spanning tree with some Poissonian deletion of edges or points.…

We examine a recursive sequence in which $s_n$ is a literal description of what the binary expansion of the previous term $s_{n-1}$ is not. By adapting a technique of Conway, we determine limiting behaviour of $\{s_n\}$ and dynamics of a…

We consider an autoregressive model on $\mathbb{R}$ defined by the recurrence equation $X_n=A_nX_{n-1}+B_n$, where $\{(B_n,A_n)\}$ are i.i.d. random variables valued in $\mathbb{R}\times\mathbb{R}^+$ and $\mathbb {E}[\log A_1]=0$ (critical…