Related papers: Point process convergence for branching random wal…

We provide a generalization of Theorem 1 in Bartkiewicz, Jakubowski, Mikosch and Wintenberger (2011) in the sense that we give sufficient conditions for weak convergence of finite dimensional distributions of the partial sum processes of a…

Random walks in random scenery are processes defined by $$Z_n:=\sum_{k=1}^n\omega_{S_k}$$ where $S:=(S_k,k\ge 0)$ is a random walk evolving in $\mathbb{Z}^d$ and $\omega:=(\omega_x, x\in{\mathbb Z}^d)$ is a sequence of i.i.d. real random…

We prove that the maximal and minimal displacement of branching random walks with mean offspring number $\rho>1$ on free products of finite groups grows linearly almost surely. More precisely, we establish that the linear speed for the…

We analyze a class of continuous time random walks in $\mathbb R^d,d\geq 2,$ with uniformly distributed directions. The steps performed by these processes are distributed according to a generalized Dirichlet law. Given the number of changes…

Given a supercritical branching random walk $\{Z_n\}_{n\geq 0}$ on $\mathbb{R}$, let $Z_n([y,\infty))$ be the number of particles located in $[y,\infty)\subset\mathbb{R}$ at generation $n$. Let $m$ be the mean of the offspring law of…

We study point process convergence for sequences of iid random walks. The objective is to derive asymptotic theory for the extremes of these random walks. We show convergence of the maximum random walk to the Gumbel distribution under the…

We are interested in the randomly biased random walk on the supercritical Galton--Watson tree. Our attention is focused on a slow regime when the biased random walk $(X_n)$ is null recurrent, making a maximal displacement of order of…

We consider point process convergence for sequences of iid random walks. The objective is to derive asymptotic theory for the largest extremes of these random walks. We show convergence of the maximum random walk to the Gumbel or the…

In a recent paper of Eichelsbacher and Koenig (2008) the model of ordered random walks has been considered. There it has been shown that, under certain moment conditions, one can construct a k-dimensional random walk conditioned to stay in…

Consider a critical branching random walk on $\mathbb{R}$. Let $Z^{(n)}(A)$ be the number of individuals in the $n$-th generation located in $A\in \mathcal{B}(\mathbb{R})$ and $Z_{n}:=Z^{(n)}(\mathbb{R})$ denote the population of the $n$-th…

In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…

In this paper, we consider the subcritical branching random walk in a random environment. We assume the branching and the step jump are independent; and the branching is in random envirenment, i.e., the particles in generation $n$ produce…

A Galton-Watson branching process with immigration evolving in a random environment is considered. Its associated random walk is assumed to be oscillating. We prove a functional limit theorem in which the process under consideration is…

By a random process with immigration at random times we mean a shot noise process with a random response function (response process) in which shots occur at arbitrary random times. The so defined random processes generalize random processes…

We consider a system of $N$ particles on the real line that evolves through iteration of the following steps: 1) every particle splits into two, 2) each particle jumps according to a prescribed displacement distribution supported on the…

Dendritic spines, which are small protrusions on the dendrites of a neuron, are of interest in neuroscience as they are related to cognitive processes such as learning and memory. We analyse the distribution of spine locations on six…

Let $X_n(k)$ be the number of vertices at level $k$ in a random recursive tree with $n+1$ vertices. We prove a functional limit theorem for the vector-valued process $(X_{[n^t]}(1),\ldots, X_{[n^t]}(k))_{t\geq 0}$, for each $k\in\mathbb N$.…

Let $\left\{ Z_{n},n=0,1,2,...\right\} $ be a critical branching process in i.i.d. random environment, $Z_{r,n}$ be the number of particles in the process at moment $0\leq r\leq n-1$ that have a positive number of descendants in generation…

We consider local times of the simple random walk on the $b$-ary tree of depth $n$ and study a point process which encodes the location of the vertex with the maximal local time and the properly centered maximum over leaves of each subtree…

We consider a class of branching-selection particle systems on $\R$ similar to the one considered by E. Brunet and B. Derrida in their 1997 paper "Shift in the velocity of a front due to a cutoff". Based on numerical simulations and…