Related papers: Improved critical drift estimates for the frog mod…

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 consider the ensemble of N-dimensional random symmetric matrices A that have, in average, p non-zero elements per row. We study the asymptotic behavior of the norm of A in the limit of infinitely increasing N and p. We prove that the…

We study analytically the late time statistics of the number of particles in a growing tree model introduced by Aldous and Shields. In this model, a cluster grows in continuous time on a binary Cayley tree, starting from the root, by…

In this paper we analyze the asymptotic behaviour as $p\to 1^+$ of solutions $u_p$ to $$ \left\{ \begin{array}{rclr} -\Delta_pu&=&\lambda|\nabla u|^{p-2}\nabla u\cdot\frac{x}{|x|^2}+ f&\quad \mbox{ in } \Omega,\\ u_p&=&0 &\quad \mbox{ on…

We explore the properties of run-and-tumble particles moving in a piecewise-linear "ratchet" potential by deriving analytic results for the system's steady-state probability density, current, entropy production rate, extractable power, and…

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 show tight upper and lower bounds for switching lemmas obtained by the action of random $p$-restrictions on boolean functions that can be expressed as decision trees in which every vertex is at a distance of at most $t$ from some leaf,…

Place an $A$-particle at each site of a graph independently with probability $p$ and otherwise place a $B$-particle. $A$- and $B$-particles perform independent continuous time random walks at rates $\lambda_A$ and $\lambda_B$, respectively,…

We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…

We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…

Consider branching Brownian motion with absorption in which particles move independently as one-dimensional Brownian motions with drift $-\rho$, each particle splits into two particles at rate one, and particles are killed when they reach…

We consider a stochastic process that describes several particles interacting by either merging or annihilation. When two particles merge, they combine their masses; when annihilation occurs, only the particle of smallest mass survives.…

In the present paper, we determine the full spectrum of the simple random walk on finite, complete $d$-ary trees. We also find an eigenbasis for the transition matrix. As an application, we apply our results to get a lower bound for the…

We first study a model, introduced recently in \cite{ES}, of a critical branching random walk in an IID random environment on the $d$-dimensional integer lattice. The walker performs critical (0-2) branching at a lattice point if and only…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

For the last ten years, almost every theoretical result concerning the expected run time of a randomized search heuristic used drift theory, making it the arguably most important tool in this domain. Its success is due to its ease of use…

Let $\{Z_n\}_{n\geq 0 }$ be a $d$-dimensional supercritical branching random walk started from the origin. Write $Z_n(S)$ for the number of particles located in a set $S\subset\mathbb{R}^d$ at time $n$. Denote by…

The Random First Order Transition Theory (RFOT) predicts that transport proceeds by cooperative movement of particles in domains whose sizes increase as a liquid is compressed above a characteristic volume fraction, $\phi_d$. The rounded…

Motivated by various recent experimental findings, we propose a dynamical model of intermittently self-propelled particles: active particles that recurrently switch between two modes of motion, namely an active run-state and a turn state,…

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…