Related papers: Self-repellent branching random walk
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 study dropout regularization in continuous-time models through the lens of random-batch methods -- a family of stochastic sampling schemes originally devised to reduce the computational cost of interacting particle systems. We construct…
The transport equation of active motion is generalised to consider time-fractional dynamics for describing the anomalous diffusion of self-propelled particles observed in many different systems. In the present study, we consider an…
In order to approximate the exit time of a one-dimensional diffusion process, we propose an algorithm based on a random walk. Such an algorithm was already introduced in both the Brownian context and in the Ornstein-Uhlenbeck context. Here…
We consider a population of particles with unit life length. Dying each particle produces offspring whose size depends on the random environment specifying the reproduction law of all particles of the given generation and on the number of…
Consider branching Brownian motion in which we begin with one particle at the origin, particles independently move according to Brownian motion, and particles split into two at rate one. It is well-known that the right-most particle at time…
The exact mean time between encounters of a given particle in a system consisting of many particles undergoing random walks in discrete time is calculated, on both regular and complex networks. Analytical results are obtained both for…
The $N$-branching Brownian motion with selection ($N$-BBM) is a particle system consisting of $N$ independent particles that diffuse as Brownian motions in $\mathbb{R}$, branch at rate one, and whose size is kept constant by removing the…
In this thesis, branching Brownian motion (BBM) is a random particle system where the particles diffuse on the real line according to Brownian motions and branch at constant rate into a random number of particles with expectation greater…
We investigate the minimum cost of a wide class of combinatorial optimization problems over random bipartite geometric graphs in $\mathbb{R}^d$ where the edge cost between two points is given by a $p$-th power of their Euclidean distance.…
A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…
The diffusion properties of self-propelled particles which move at constant speed and, in addition, reverse their direction of motion repeatedly are investigated. The internal dynamics of particles triggering these reversal processes is…
We consider conservative cross-diffusion systems for two species where individual motion rates depend linearly on the local density of the other species. We develop duality estimates and obtain stability and approximation results. We first…
Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$ and consider a simple symmetric random walk that is killed upon hitting one of the obstacles. For $d \geq 2$ and $p$ strictly above the critical…
We study the height of the maximal particle at time $t$ of a one dimensional branching Brownian motion with a space-dependent branching rate. The branching rate is set to zero in finitely many intervals (obstacles) of order $t$. We obtain…
We consider branching random walk in spatial random branching environment (BRWRE) in dimension one, as well as related differential equations: the Fisher-KPP equation with random branching and its linearized version, the parabolic Anderson…
We develop Random Batch Methods for interacting particle systems with large number of particles. These methods use small but random batches for particle interactions, thus the computational cost is reduced from $O(N^2)$ per time step to…
We consider a $\mathbb{R}^d$-valued branching random walk with a stationary and ergodic environment $\xi=(\xi_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$. With the help of the…
We consider a standard binary branching Brownian motion on the real line. It is known that the maximal position $M_t$ among all particles alive at time $t$, shifted by $m_t = \sqrt{2} t - \frac{3}{2\sqrt{2}} \log t$ converges in law to a…
Using a high performance computer cluster, we run simulations regarding an open problem about d-dimensional critical branching random walks in a random IID environment The environment is given by the rule that at every site independently,…