相关论文: Maximum on a random time interval of a random walk…

We prove that the law of a random walk $X_n$ is determined by the one-dimensional distributions of $\max(X_n, 0)$ for $n = 1, 2, \ldots$, as conjectured recently by Lo\"ic Chaumont and Ron Doney. Equivalently, the law of $X_n$ is determined…

Let $\{X(t):t\in[0,\infty)\}$ be a centered Gaussian process with stationary increments and variance function $\sigma^2_X(t)$. We study the exact asymptotics of ${\mathbb{P}}(\sup_{t\in[0,T]}X(t)>u)$ as $u\to\infty$, where $T$ is an…

Let $X$ be the constrained random walk on $\mathbb{Z}_+^d$ $d >2$, having increments $e_1$, $-e_i+e_{i+1}$ $i=1,2,3,...,d-1$ and $-e_d$ with probabilities $\lambda$, $\mu_1$, $\mu_2$,...,$\mu_d$, where $\{e_1,e_2,..,e_d\}$ are the standard…

We study the one-dimensional branching random walk in the case when the step size distribution has a stretched exponential tail, and, in particular, no finite exponential moments. The tail of the step size $X$ decays as $\mathbb{P}[X \geq…

Consider a branching random walk $(G_u)_{u\in \mathbb T}$ on the general linear group $\textrm{GL}(V)$ of a finite dimensional space $V$, where $\mathbb T$ is the associated genealogical tree with nodes $u$. For any starting point $v \in V…

We consider an asymptotically stable multidimensional random walk $S(n)=(S_1(n),\ldots, S_d(n) )$. Let $\tau_x:=\min\{n>0: x_{1}+S_1(n)\le 0\}$ be the first time the random walk $S(n)$ leaves the upper half-space. We obtain the asymptotics…

We consider general transformations of random walks on groups determined by Markov stopping times and prove that the asymptotic entropy (resp., rate of escape) of the transformed random walks is equal to the asymptotic entropy (resp., rate…

We study randomly stopped sums via their asymptotic scales. First, finiteness of moments is considered. To generalise this study, asymptotic scales applicable to the class of all heavy-tailed random variables are used. The stopping is…

We consider random walks with independent but not necessarily identical distributed increments. Assuming that the increments satisfy the well-known Lindeberg condition, we investigate the asymptotic behaviour of first-passage times over…

Let $X_1,X_2,...$ be independent variables, each having a normal distribution with negative mean $-\beta<0$ and variance 1. We consider the partial sums $S_n=X_1+...+X_n$, with $S_0=0$, and refer to the process $\{S_n:n\geq0\}$ as the…

Given a random walk on a free group, we study the random walks it induces on the group's quotients. We show that the spectrum of asymptotic entropies of the induced random walks has no isolated points, except perhaps its maximum.

For a distribution $F^{*\tau}$ of a random sum $S_{\tau}=\xi_1+...+\xi_{\tau}$ of i.i.d. random variables with a common distribution $F$ on the half-line $[0,\infty)$, we study the limits of the ratios of tails…

We consider a random walk with death in $[-N,N]$ moving in a time dependent environment. The environment is a system of particles which describes a current flux from $N$ to $-N$. Its evolution is influenced by the presence of the random…

Recently, many streaming algorithms have utilized generalizations of the fact that the expected maximum distance of any $4$-wise independent random walk on a line over $n$ steps is $O(\sqrt{n})$. In this paper, we show that $4$-wise…

Let (S_n)_{n\in\N} be a Z-valued random walk with increments from the domain of attraction of some \alpha-stable law and let (\xi(i))_{i\in\Z} be a sequence of iid random variables. We want to investigate U-statistics indexed by the random…

A random walk in a sparse random environment is a model introduced by Matzavinos et al. [Electron. J. Probab. 21, paper no. 72: 2016] as a generalization of both a simple symmetric random walk and a classical random walk in a random…

Consider a subcritical branching random walk $\{Z_k\}_{k\geq 0}$ with offspring distribution $\{p_k\}_{k\geq 0}$ and step size $X$. Let $M_n$ denote the rightmost position reached by $\{Z_k\}_{k\geq 0}$ up to generation $n$, and define $M…

Through a straightforward Bayesian approach we show that under some general conditions a maximum running time, namely the number of discrete steps performed by a computer program during its execution, can be defined such that the…

Consider a Markov chain $(X_n)_{n\geqslant 0}$ with values in the state space $\mathbb X$. Let $f$ be a real function on $\mathbb X$ and set $S_0=0,$ $S_n = f(X_1)+\cdots + f(X_n),$ $n\geqslant 1$. Let $\mathbb P_x$ be the probability…

Let \begin{equation*} S_{0}=0,\quad S_{n}=X_{1}+...+X_{n},\ n\geq 1, \end{equation*} be a random walk whose increments belong without centering to the domain of attraction of a stable law with scaling constants $a_{n}$, that provide…