Related papers: Self-repellent branching random walk

We consider a discrete-time continuous-space random walk, with a symmetric jump distribution, under stochastic resetting. Associated with the random walker are cost functions for jumps and resets, and we calculate the distribution of the…

We consider a branching random walk on $\mathbb{Z}$ started by $n$ particles at the origin, where each particle disperses according to a mean-zero random walk with bounded support and reproduces with mean number of offspring $1+\theta/n$.…

In this work, we study the task of distributed optimization over a network of learners in which each learner possesses a convex cost function, a set of affine equality constraints, and a set of convex inequality constraints. We propose a…

Branching Brownian Motion describes a system of particles which diffuse in space and split into offsprings according to a certain random mechanism. In virtue of the groundbreaking work by M. Bramson on the convergence of solutions of the…

Aiming to understand the distribution of fitness levels of individuals in a large population undergoing selection, we study the particle configurations of branching Brownian motion where each particle independently moves as Brownian motion…

We adapt ideas and concepts developed in optimal transport (and its martingale variant) to give a geometric description of optimal stopping times of Brownian motion subject to the constraint that the distribution of the stopping time is a…

We consider active Brownian particles that intermittently switch between active and inactive states. Such behavior is ubiquitous at all scales, from bacteria to animals and in artificial active systems. We derive exact expressions for key…

Consider a supercritical branching random walk on the real line. The consistent maximal displacement is the smallest of the distances between the trajectories followed by individuals at the $n$th generation and the boundary of the process.…

In this work we study the problem of targeting signals in networks using entropy information measurements to quantify the cost of targeting. We introduce a penalization rule that imposes a restriction to the long paths and therefore focus…

We calculate the time-evolution of a discrete-time fragmentation process in which clusters of particles break up and reassemble and move stochastically with size-dependent rates. In the continuous-time limit the process turns into the…

We study the NP-hard problem of approximating a Minimum Routing Cost Spanning Tree in the message passing model with limited bandwidth (CONGEST model). In this problem one tries to find a spanning tree of a graph $G$ over $n$ nodes that…

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)$.…

A symmetric random walk $X$ whose jumps have diffuse law, looked at up to an independent geometric random time, splits at the minimum into two independent and identically distributed pieces. The same for the maximum. It is natural to ask,…

We study a minimal model of self-propelled particle in a crowded single-file environment. We extend classical models of exclusion processes (previously analyzed for diffusive and driven tracer particles) to the case where the tracer…

In this work we study a branching particle system of diffusion processes on the real line interacting through their rank in the system. Namely, each particle follows an independent Brownian motion, but only K $\ge$ 1 particles on the far…

We consider the exclusion process on segments of the integers in a site-dependent random environment. We assume to be in the ballistic regime in which a single particle has positive linear speed. Our goal is to study the mixing time of the…

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…

This paper considers a distributed stochastic optimization problem where the goal is to minimize the time average of a cost function subject to a set of constraints on the time averages of a related stochastic processes called penalties. We…

We consider a random walk on $\Z$ that branches at the origin only. In the supercritical regime we establish a law of large number for the maximal position $M_n$. Then we determine all possible limiting law for the sequence $M_n -\alpha n$…

Herein, we analyze an efficient branching particle method for asymptotic solutions to a class of continuous-discrete filtering problems. Suppose that $t\to X_t$ is a Markov process and we wish to calculate the measure-valued process…