English
Related papers

Related papers: The asymptotic shape theorem for the frog model on…

200 papers

A two-type version of the frog model on $\mathbb{Z}^d$ is formulated, where active type $i$ particles move according to lazy random walks with probability $p_i$ of jumping in each time step ($i=1,2$). Each site is independently assigned a…

Probability · Mathematics 2019-02-06 Maria Deijfen , Timo Hirscher , Fabio Lopes

We study the joint asymptotic behavior of spacings between particles at the edge of multilevel Dyson Brownian motions, when the number of levels tends to infinity. Despite the global interactions between particles in multilevel Dyson…

Probability · Mathematics 2014-09-09 Vadim Gorin , Mykhaylo Shkolnikov

Consider a Poisson process on $\mathbb{R}$ with intensity $f$ where $0 \leq f(x)<\infty$ for ${x}\geq 0$ and ${f(x)}=0$ for $x<0$. The "points" of the process represent sleeping frogs. In addition, there is one active frog initially located…

Probability · Mathematics 2017-02-08 Josh Rosenberg

The asymptotic nature of perturbative expansions in quantum field theory can arise from the factorial growth in the number of Feynman diagrams with loop order, as with instantons, or from a series of individual diagrams whose values grow…

High Energy Physics - Theory · Physics 2025-12-11 Luen Clingerman , Matthew D. Schwartz

Using methods of Marklof and Str\"ombergsson we establish several limit laws for metric parameters of random Cayley graphs of finite abelian groups with respect to a randomly chosen set of generators of a fixed size. Doing so we settle a…

Dynamical Systems · Mathematics 2017-06-13 Uri Shapira , Reut Zuck

Critical catalytic branching random walk on d-dimensional integer lattice is investigated for all d. The branching may occur at the origin only and the start point is arbitrary. The asymptotic behavior, as time grows to infinity, is…

Probability · Mathematics 2015-02-17 Ekaterina Bulinskaya

We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…

Probability · Mathematics 2023-02-14 E. Filichkina , E. Yarovaya

This doctoral thesis undertakes an in-depth exploration of limiting shape theorems across diverse mathematical structures, with a specific focus on subadditive processes within finitely generated groups exhibiting polynomial growth rates,…

Probability · Mathematics 2024-08-22 Lucas R. de Lima

In this paper we study long-term evolution of a finite system of locally interacting birth-and-death processes labelled by vertices of a finite connected graph. A detailed description of the asymptotic behaviour is obtained in the case of…

Probability · Mathematics 2015-06-19 Vadim Shcherbakov , Stanislav Volkov

We study the frog model with death on the biregular tree $\mathbb{T}_{d_1,d_2}$. Initially, there is a random number of awake and sleeping particles located on the vertices of the tree. Each awake particle moves as a discrete-time…

Probability · Mathematics 2020-06-04 Elcio Lebensztayn , Jaime Utria

In this paper, we consider the formal power series whose n-th coefficient is the number of copies of a given finite graph in the ball of radius n centred at the identity element in the Cayley graph of a finitely generated group and call it…

Group Theory · Mathematics 2011-12-13 Satoshi Kamei

The growth-fragmentation equation models systems of particles that grow and split as time proceeds. An important question concerns the large time asymptotic of its solutions. Doumic and Escobedo ($2016$) observed that when growth is a…

Probability · Mathematics 2019-04-30 Benedetta Cavalli

We consider a random interacting particle system, known as the frog model, on infinite Galton-Watson trees allowing offspring zero and one. The system starts with one awake particle (frog) at the root of the tree and a random number of…

Probability · Mathematics 2020-11-23 Sebastian Müller , Gundelinde Maria Wiegel

We study the asymptotic behavior for asymmetric neuronal dynamics in a network of linear Hopfield neurons. The interaction between the neurons is modeled by random couplings which are centered i.i.d. random variables with finite moments of…

Probability · Mathematics 2020-06-08 Olivier Faugeras , Émilie Soret , Etienne Tanré

Consider a system of interacting particles indexed by the nodes of a graph whose vertices are equipped with marks representing parameters of the model such as the environment or initial data. Each particle takes values in a countable state…

Probability · Mathematics 2022-10-18 Ankan Ganguly , Kavita Ramanan

We study a discrete-time interacting particle system with continuous state space which is motivated by a mathematical model for turnover through branching in actin filament networks. It gives rise to transient clusters reminiscent of actin…

Probability · Mathematics 2024-10-01 Cecilia González-Tokman , Dietmar B. Oelz

Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…

Probability · Mathematics 2019-06-06 Shiba Biswal , Nicolas Lanchier

We consider a system of two coupled parabolic PDEs introduced in [1] to model motility of eukaryotic cells. We study the asymptotic behavior of solutions in the limit of a small parameter related to the width of the interface in phase field…

Analysis of PDEs · Mathematics 2016-02-05 Leonid Berlyand , Mykhailo Potomkin , Volodymyr Rybalko

We study the macroscopic evolution of the growing cluster in the exactly solvable corner growth model with independent exponentially distributed waiting times. The rates of the exponentials are given by an addivitely separable function of…

Probability · Mathematics 2021-03-08 Elnur Emrah , Christopher Janjigian , Timo Seppäläinen

We prove a quantitative, finitary version of Trofimov's result that a connected, locally finite vertex-transitive graph G of polynomial growth admits a quotient with finite fibres on which the action of Aut(G) is virtually nilpotent with…

Combinatorics · Mathematics 2021-02-03 Romain Tessera , Matthew Tointon