Related papers: Limit theorems for radial random walks on pxq-matr…

We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for…

For a finite set of points $P$ in $R^d$, the function $d_P: R^d \to R^+$ measures Euclidean distance to the set $P$. We study the number of critical points of $d_P$ when $P$ is a Poisson process. In particular, we study the limit behavior…

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…

Quantum trajectories are Markov processes modeling the evolution of a quantum system subjected to repeated independent measurements. Under purification and irreducibility assumptions, these Markov processes admit a unique invariant measure…

In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…

We consider Bernoulli first-passage percolation on the triangular lattice in which sites have 0 and 1 passage times with probability $p$ and $1-p$, respectively. For each $p\in(0,p_c)$, let $\mathcal {B}(p)$ be the limit shape in the…

Let $\{X_{k,i};i\geq 1,k\geq 1\}$ be an array of i.i.d. random variables and let $\{p_n;n\geq 1\}$ be a sequence of positive integers such that $n/p_n$ is bounded away from 0 and $\infty$. For $W_n=\max_{1\leq i<j\leq…

Consider an nxn random matrix X with i.i.d. nonnegative entries with bounded density, mean m, and finite positive variance sigma^2. Let M be the nxn random Markov matrix with i.i.d. rows obtained from X by dividing each row of X by its sum.…

There has been a great deal of work establishing that random linear codes are as list-decodable as uniformly random codes, in the sense that a random linear binary code of rate $1 - H(p) - \epsilon$ is $(p,O(1/\epsilon))$-list-decodable…

Let $(X_n)_{n\ge 1}$ be a Markov chain on a measurable state space $X$, and let $S_n = \sum_{k=1}^n f(X_k)$ be the associated Markov walk. For $y>0$, denote by $\tau_y$ the first time at which $y+S_n$ becomes non-positive. Assuming that the…

In Micchelli's paper "Interpolation of scattered data: distance matrices and conditionally positive functions", deep results were obtained concerning the invertibility of matrices arising from radial basis function interpolation. In…

The spherical functions of the noncompact Grassmann manifolds over the real or complex numbers or the quaternions with rank q and dimension parameter p can be seen as Heckman-Opdam hypergeometric functions of type BC, when the double coset…

We prove a {\it{quenched}} large deviation principle (LDP) for a simple random walk on a supercritical percolation cluster on $\Z^d$, $d\geq 2$.. We take the point of view of the moving particle and first prove a quenched LDP for the…

It is well known that random walks in one dimensional random environment can exhibit subdiffusive behavior due to presence of traps. In this paper we show that the passage times of different traps are asymptotically independent exponential…

A step-reinforced random walk is a discrete-time non-Markovian process with long range memory. At each step, with a fixed probability p, the positively step-reinforced random walk repeats one of its preceding steps chosen uniformly at…

For a generalized step reinforced random walk, starting from the origin, the first step is taken according to the first element of an innovation sequence. Then in subsequent epochs, it recalls a past epoch with probability proportional to a…

This paper develops limit theorems for random variables with network dependence, without requiring the individuals in the network to be located in a Euclidean or metric space. This distinguishes our approach from most existing limit…

We prove that a random linear code over F_q, with probability arbitrarily close to 1, is list decodable at radius (1-1/q-\epsilon) with list size L=O(1/\epsilon^2) and rate R=\Omega_q(\epsilon^2/(log^3(1/\epsilon))). Up to the…

Let $X_1,X_2, \ldots $ be independent random uniform points in a bounded domain $A \subset \mathbb{R}^d$ with smooth boundary. Define the coverage threshold $R_n$ to be the smallest $r$ such that $A$ is covered by the balls of radius $r$…

We consider a minimal model of one-dimensional discrete-time random walk with step-reinforcement, introduced by Harbola, Kumar, and Lindenberg (2014): The walker can move forward (never backward), or remain at rest. For each $n=1,2,\cdots$,…