English
Related papers

Related papers: A self-regulating and patch subdivided population

200 papers

The stacked contact process is a stochastic model for the spread of an infection within a population of hosts located on the $d$-dimensional integer lattice. Regardless of whether they are healthy or infected, hosts give birth and die at…

Probability · Mathematics 2014-10-16 Nicolas Lanchier , Yuan Zhang

In this paper we consider three classes of interacting particle systems on $\mathbb Z$: independent random walks, the exclusion process, and the inclusion process. We allow particles to switch their jump rate (the rate identifies the type…

We consider a broad class of continuous-time two-type population size-dependent Markov Branching Processes. The offspring distribution can depend on the current (alive) and total (dead and alive) populations. Using stochastic approximation…

Probability · Mathematics 2023-04-04 Khushboo Agarwal , Veeraruna Kavitha

The graph invariant examined in this paper is the largest eigenvalue of the adjacency matrix of a graph. Previous work demonstrates the tight relationship between this invariant, the birth and death rate of a contagion spreading on the…

Social and Information Networks · Computer Science 2022-10-27 V. Cherniavskyi , G. Dennis , S. R. Kingan

A decomposable strongly critical Galton-Watson branching process with $N$ types of particles labelled $1,2,...,N$ is considered in which a type~$i$ parent may produce individuals of types $j\geq i$ only. This model may be viewed as a…

Probability · Mathematics 2014-02-28 Vladimir Vatutin

Compartmental epidemic models with dynamics that evolve over a graph network have gained considerable importance in recent years but analysis of these models is in general difficult due to their complexity. In this paper, we develop two…

Populations and Evolution · Quantitative Biology 2023-05-31 Sei Zhen Khong , Lanlan Su

We consider a time-continuous branching random walk on a one-dimensional lattice on which there is one center (lattice point) of particle generation, called branching source. The generation of particles in the branching source is described…

Probability · Mathematics 2023-12-19 E. Filichkina , E. Yarovaya

To study later spatial evolutionary games based on the multitype contact process, we first focus in this paper on the conditions for survival/extinction in the presence of only one strategy, in which case our model consists of a variant of…

Probability · Mathematics 2025-07-09 Jonas Köppl , Nicolas Lanchier , Max Mercer

We consider a continuous-time branching random walk in the inhomogeneous breeding potential $\beta|.|^p$, where $\beta > 0$, $p \geq 0$. We prove that the population almost surely explodes in finite time if $p > 1$ and doesn't explode if $p…

Probability · Mathematics 2013-02-19 Sergey Bocharov , Simon C. Harris

We introduce and study an interacting particle system evolving on the $d$-dimensional torus $(\mathbb Z/N\mathbb Z)^d$. Each vertex of the torus can be either empty or occupied by an individual of type $\lambda \in (0,\infty)$. An…

Probability · Mathematics 2023-06-21 Adrián González Casanova , András Tóbiás , Daniel Valesin

Consider a continuous time Markov chain with rates Q in the state space \Lambda\cup\{0\} with 0 as an absorbing state. In the associated Fleming-Viot process N particles evolve independently in \Lambda with rates Q until one of them…

Probability · Mathematics 2009-05-12 Amine Asselah , Pablo A. Ferrari , Pablo Groisman

We consider a birth-death process with the birth rates $i\lambda$ and death rates $i\mu +i(i-1)\theta$, where $i$ is the current state of the process. A positive competition rate $\theta$ is assumed to be small. In the supercritical case…

Probability · Mathematics 2015-06-19 Serik Sagitov , Altynay Shaimerdenova

The present paper brings a new class of interacting jump processes into focus. We start from a single-colony $C^\Lambda$-process, which arises as the continuum-mass limit of a $\Lambda$-Cannings individual-based population model, where…

Probability · Mathematics 2015-04-23 Andreas Greven , Frank den Hollander , Sandra Kliem , Anton Klimovsky

Branching processes in a varying environment encompass a wide range of stochastic demographic models, and their complete understanding in terms of limit behaviour poses a formidable research challenge. In this paper, we conduct a thorough…

Probability · Mathematics 2025-11-18 Serik Sagitov , Alexey Lindo , Yerakhmet Zhumayev

Population structure affects the outcome of natural selection. Static population structures can be described by graphs, where individuals occupy the nodes, and interactions occur along the edges. General conditions for evolutionary success…

Populations and Evolution · Quantitative Biology 2020-01-08 Benjamin Allen , Gabor Lippner , Martin A. Nowak

We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…

Statistical Mechanics · Physics 2015-05-13 R. Juhász , G. Ódor

We consider a neighbourhood random walk on a quadrant, $\{(X_1(t),X_2(t),\varphi(t)):t\geq 0\}$, with state space \begin{eqnarray*} \mathcal{S}&=&\{(n,m,i):n,m=0,1,2,\ldots;i=1,2,\ldots,k(n,m)\}. \end{eqnarray*} Assuming start in state…

Probability · Mathematics 2023-02-07 Małgorzata M. O'Reilly , Zbigniew Palmowski , Anna Aksamit

We study the spreading dynamics on graphs with a power law degree distribution p_k ~ k^-gamma with 2<gamma<3, as an example of a branching process with diverging reproductive number. We provide evidence that the divergence of the second…

Disordered Systems and Neural Networks · Physics 2009-11-11 Alexei Vazquez

Place an active particle at the root of a $d$-ary tree and a single dormant particle at each non-root site. In discrete time, active particles move towards the root with probability $p$ and, otherwise, away from the root to a uniformly…

Probability · Mathematics 2023-03-29 Emma Bailey , Matthew Junge , Jiaqi Liu

In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…

Data Structures and Algorithms · Computer Science 2016-12-28 Colin Cooper , Robert Elsasser , Hirotaka Ono , Tomasz Radzik