相关论文: Markov chains arising from biased random derangeme…

We consider biased $(1:b)$ Walker-Breaker games: Walker and Breaker alternately claim edges of the complete graph $K_n$, Walker taking one edge and Breaker claiming $b$ edges in each round, with the constraint that Walker needs to choose…

We study the Markov chain $x_{n+1}=ax_n+b_n$ on a finite field $\mathbb{F}_p$, where $a \in \mathbb{F}_p$ is fixed and $b_n$ are independent and identically distributed random variables in $\mathbb{F}_p$. Conditionally on the Riemann…

We investigate the global chirality distribution of the quantum walk on the line when decoherence is introduced either through simultaneous measurements of the chirality and particle position, or as a result of broken links. The first…

Convergence of order $O(1/\sqrt{n})$ is obtained for the distance in total variation between the Poisson distribution and the distribution of the number of fixed size cycles in generalized random graphs with random vertex weights. The…

Mahlmann and Schindelhauer (2005) defined a Markov chain which they called $k$-Flipper, and showed that it is irreducible on the set of all connected regular graphs of a given degree (at least 3). We study the 1-Flipper chain, which we call…

We show how to generate random derangements efficiently by two different techniques: random restricted transpositions and sequential importance sampling. The algorithm employing restricted transpositions can also be used to generate random…

Let $T_{n,m}=\mathbb Z_n\times\mathbb Z_m$, and define a random mapping $\phi\colon T_{n,m}\to T_{n,m}$ by $\phi(x,y)=(x+1,y)$ or $(x,y+1)$ independently over $x$ and $y$ and with equal probability. We study the orbit structure of such…

We study a two-player, zero-sum, stochastic game with incomplete information on one side in which the players are allowed to play more and more frequently. The informed player observes the realization of a Markov chain on which the payoffs…

We continue our consideration of a class of models describing the reversible dynamics of $N$ Boolean variables, each with $K$ inputs. We investigate in detail the behavior of the Hamming distance as well as of the distribution of orbit…

We study a class of Markovian systems of $N$ elements taking values in $[0,1]$ that evolve in discrete time $t$ via randomized replacement rules based on the ranks of the elements. These rank-driven processes are inspired by variants of the…

A discrete time branching process where the offspring distribution is generation-dependent, and the number of reproductive individuals is controlled by a random mechanism is considered. This model is a Markov chain but, in general, the…

We consider the ground state of the XY model on an infinite chain at zero temperature. Following Bennett, Bernstein, Popescu, and Schumacher we use entropy of a sub-system as a measure of entanglement. Vidal, Latorre, Rico and Kitaev…

We study a class of dissipative PDE's perturbed by a bounded random kick force. It is assumed that the random force is non-degenerate, so that the Markov process obtained by the restriction of solutions to integer times has a unique…

A cyclic random walk is a random walk whose transition probabilities/rates can be written as a superposition of the empirical measures of a family of finite cycles. This identifies a convex set of models. We discuss the problem of…

We consider a family of continuous time symmetric random walks indexed by $k\in \mathbb{N}$, $\{X_k(t),\,t\geq 0\}$. For each $k\in \mathbb{N}$ the matching random walk take values in the finite set of states…

In the paper we consider the controlled continuous-time Markov chain describing the interacting particles system with the finite number of types. The system is controlled by two players with the opposite purposes. The limiting game as the…

In this paper we consider Markov chains with transition rates that depend on a small parameter $\varepsilon$. Under a mild assumption on the asymptotics of these transition rates, we describe the behavior of the chain at various…

A one-dimensional confined Nonlinear Random Walk is a tuple of $N$ diffeomorphisms of the unit interval driven by a probabilistic Markov chain. For generic such walks, we obtain a geometric characterization of their ergodic stationary…

In this article, we investigate the condensation phenomena for a class of nonreversible zero-range processes on a fixed finite set. By establishing a novel inequality bounding the capacity between two sets, and by developing a robust…

We study the long-time behavior of decoupled continuous-time random walks characterized by superheavy-tailed distributions of waiting times and symmetric heavy-tailed distributions of jump lengths. Our main quantity of interest is the…