English
Related papers

Related papers: Markov chains arising from biased random derangeme…

200 papers

Consider a Markov process \omega_t at equilibrium and some event C (a subset of the state-space of the process). A natural measure of correlations in the process is the pairwise correlation \Pr[\omega_0,\omega_t \in C] - \Pr[\omega_0 \in…

Probability · Mathematics 2012-08-24 Alan Hammond , Elchanan Mossel , Gábor Pete

The dynamics in games involving multiple players, who adaptively learn from their past experience, is not yet well understood. We analyzed a class of stochastic games with Markov strategies in which players choose their actions…

Probability · Mathematics 2018-04-30 Shohei Hidaka

This paper studies the long-term behaviour of a continuous time Markov chain formed by two non-negative integer valued components that evolve subject to a competitive interaction. In the absence of interaction the Markov chain is just a…

Probability · Mathematics 2019-10-02 Vadim Shcherbakov , Stanislav Volkov

In probability theory, equalities are much less than inequalities. In this paper, we find a series of equalities which characterize the symmetry of the forming times of a family of similar cycles for discrete-time and continuous-time Markov…

Probability · Mathematics 2014-07-21 Chen Jia , Daquan Jiang , Minping Qian

We introduce and study Maker/Breaker-type positional games on random graphs. Our main concern is to determine the threshold probability $p_{F}$ for the existence of Maker's strategy to claim a member of $F$ in the unbiased game played on…

Combinatorics · Mathematics 2007-05-23 Milos Stojakovic , Tibor Szabo

Let A be a finite set and X a sequence of A-valued random variables. We do not assume any particular correlation structure between these random variables; in particular, X may be a non-Markovian sequence. An adapted embedding of X is a…

Probability · Mathematics 2008-02-14 Manuel Lladser

We develop Markov chain mixing time estimates for a class of Markov chains with restricted transitions. We assume transitions may occur along a cycle of $n$ nodes and on $n^\gamma$ additional edges, where $\gamma < 1$. We find that the…

Probability · Mathematics 2015-06-26 Balázs Gerencsér

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…

Probability · Mathematics 2014-12-04 Shaun McKinlay , Konstantin Borovkov

There is a well-established theory linking certain semi-Markov chains and continuous-time random walks to time-fractional equations and anomalous diffusion. In this work, we go beyond the semi-Markov framework by considering some…

Probability · Mathematics 2026-02-27 Lorenzo Facciaroni , Costantino Ricciuti , Enrico Scalas

Given a random binary sequence $X^{(n)}$ of random variables, $X_{t},$ $t=1,2,...,n$, for instance, one that is generated by a Markov source (teacher) of order $k^{*}$ (each state represented by $k^{*}$ bits). Assume that the probability of…

Machine Learning · Computer Science 2011-01-04 Joel Ratsaby

We study the ergodic behaviour of a discrete-time process $X$ which is a Markov chain in a stationary random environment. The laws of $X_t$ are shown to converge to a limiting law in (weighted) total variation distance as $t\to\infty$.…

Probability · Mathematics 2019-07-29 Balazs Gerencser , Miklos Rasonyi

A deck of $n$ cards are shuffled by repeatedly taking off the top card, flipping it with probability $1/2$, and inserting it back into the deck at a random position. This process can be considered as a Markov chain on the group $B_n$ of…

Combinatorics · Mathematics 2023-03-15 Fumihiko Nakano , Taizo Sadahiro , Tetsuya Sakurai

The divergence of a group is a quasi-isometry invariant defined in terms of pairs of points and lengths of paths avoiding a suitable ball around the identity. In this paper we study "random divergence'', meaning the divergence at two points…

Group Theory · Mathematics 2023-03-20 Antoine Goldsborough , Alessandro Sisto

Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. If only…

Combinatorics · Mathematics 2010-02-08 Christos A. Athanasiadis , Persi Diaconis

In this note we consider a Markov chain formed by a finite system of interacting birth-and-death processes on a finite state space. We study an asymptotic behaviour of the Markov chain as its state space becomes large. In particular, we…

Probability · Mathematics 2016-11-14 Vadim Shcherbakov , Anatoly Yambartsev

We study the asymptotic behaviour of Markov chains $(X_n,\eta_n)$ on $\mathbb{Z}_+ \times S$, where $\mathbb{Z}_+$ is the non-negative integers and $S$ is a finite set. Neither coordinate is assumed to be Markov. We assume a moments bound…

Probability · Mathematics 2014-07-18 Nicholas Georgiou , Andrew R. Wade

In this article, we prove that a small random perturbation of dynamical system with multiple stable equilibria converges to a Markov chain whose states are neighborhoods of the deepest stable equilibria, under a suitable time-rescaling,…

Probability · Mathematics 2021-03-02 Fraydoun Rezakhanlou , Insuk Seo

We bound separations between the entangled and classical values for several classes of nonlocal $t$-player games. Our motivating question is whether there is a family of $t$-player XOR games for which the entangled bias is $1$ but for which…

Quantum Physics · Physics 2018-11-28 Tom Bannink , Jop Briët , Harry Buhrman , Farrokh Labib , Troy Lee

A general setting for nested subdivisions of a bounded real set into intervals defining the digits $X_1,X_2,...$ of a random variable $X$ with a probability density function $f$ is considered. Under the weak condition that $f$ is almost…

Probability · Mathematics 2026-01-14 Jesper Møller

We consider a sequence of Markov chains $(\mathcal X^n)_{n=1,2,...}$ with $\mathcal X^n = (X^n_\sigma)_{\sigma\in\mathcal T}$, indexed by the full binary tree $\mathcal T = \mathcal T_0 \cup \mathcal T_1 \cup ...$, where $\mathcal T_k$ is…

Probability · Mathematics 2014-06-17 Peter Czuppon , Peter Pfaffelhuber