Related papers: Characterization of the critical values of branchi…

In this paper we show that the random degree constrained process (a time-evolving random graph model with degree constraints) has a local weak limit, provided that the underlying host graphs are high degree almost regular. We, moreover,…

In this work, we characterize cluster-invariant point processes for critical branching spatial processes on R d for all large enough d when the motion law is $\alpha$-stable or has a finite discrete range. More precisely, when the motion is…

We focus on the existence and characterization of the limit for a certain critical branching random walks in time-space random environment in one dimension which was introduced by M. Birnkenr et.al. Each particle performs simple random walk…

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…

We study a model of growing population that competes for resources. At each time step, all existing particles reproduce and the offspring randomly move to neighboring sites. Then at any site with more than one offspring, the particles are…

Let $\left\{ S_{n},n\geq 0\right\} $ be a random walk whose increment distribution belongs without centering to the domain of attraction of an $% \alpha $-stable law, i.e., there are some scaling constants $a_{n}$ such that the sequence…

We consider a critical branching particle system in $\R^d$, composed of individuals of a finite number of types $i\in\{1,...,K\}$. Each individual of type $i$ moves independently according to a symmetric $\alpha_i$-stable motion. We assume…

We investigate a branching random walk where the displacements are independent from the branching mechanism and have a stretched exponential distribution. We describe the positions of the particles in the vicinity of the rightmost particle…

We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…

In this note, we investigate fundamental relations between exploration processes in random graphs, and branching processes. We formulate a class of models that we call {\em rank-$k$ random graphs}, and that are special in that their…

We consider an interacting particle process on a graph which, from a macroscopic point of view, looks like $\Z^d$ and, at a microscopic level, is a complete graph of degree $N$ (called a patch). There are two birth rates: an inter-patch one…

Random graphs are a central element of the study of complex dynamical networks such as the internet, the brain, or socioeconomic phenomena. New methods to generate random graphs can spawn new applications and give insights into more…

Let $\mm_n, n=0,1,...$ be the supercritical branching random walk, in which the number of direct descendants of one individual may be infinite with positive probability. Assume that the standard martingale $W_n$ related to $\mm_n$ is…

In the present paper, we characterize the behavior of supercritical branching processes in random environment with linear fractional offspring distributions, conditioned on having small, but positive values at some large generation. As it…

We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…

A critical branching process $\left\{ Z_{k},k=0,1,2,...\right\} $ in a random environment is considered. A conditional functional limit theorem for the properly scaled process $\left\{ \log Z_{pu},0\leq u<\infty \right\} $ is established…

We consider a branching random walk on a $d$-ary tree of height $n$ ($n \in \mathbb{N}$), under the presence of a hard wall which restricts each value to be positive, where $d$ is a natural number satisfying $d\geqslant2$. The question of…

The extremal process of a branching random walk is the point measure recording the position of particles alive at time $n$, shifted around the expected position of the minimal position. Madaule proved that this point measure converges, as…

We propose a one parameter family of random walk processes on hypergraphs, where a parameter biases the dynamics of the walker towards hyperedges of low or high cardinality. We show that for each value of the parameter the resulting process…