Next Article in Journal
Preface to the Special Issue “Chaos-Based Secure Communication and Cryptography”
Previous Article in Journal
The Truncated EM Method of Jump Diffusions with Markovian Switching: A Case Study of Music Signals
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Branching Random Walks with Ageing

1
Dipartimento di Matematica e Applicazioni, Università di Milano-Bicocca, Via Cozzi 53, 20125 Milano, Italy
2
Dipartimento di Scienze Statistiche, Sapienza Università di Roma, Piazzale Aldo Moro 5, 00185 Roma, Italy
3
Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133 Milano, Italy
*
Author to whom correspondence should be addressed.
Mathematics 2026, 14(6), 1088; https://doi.org/10.3390/math14061088
Submission received: 26 February 2026 / Revised: 19 March 2026 / Accepted: 21 March 2026 / Published: 23 March 2026
(This article belongs to the Section D1: Probability and Statistics)

Abstract

Branching processes are stochastic models describing the evolution of populations in which individuals reproduce and die independently over time. In the classical setting, an individual’s reproductive capacity is fixed throughout its lifetime. However, in real-world situations, fertility typically rises during a juvenile phase, peaks at maturity, and subsequently declines. In order to capture this feature, we introduce a branching random walk with ageing, as an extension of the classical branching random walk, by assigning each individual an age-dependent reproductive rate. Our model differs from classical age-dependent processes such as the Bellman–Harris model, where the remaining lifespan depends on age, while the rate of reproduction is fixed within that lifetime. As in the classical case, branching random walks with ageing are parametrised by λ > 0 , which tunes the reproductive speed and may be seen as a characteristic of the population. The thresholds of λ separating extinction and survival are the global and local critical parameters. We characterise the value of the local critical parameter and provide a lower bound for the global critical parameter. We identify a class of ageing branching random walks for which this lower bound coincides with the global critical parameter. We study how local modifications to the reproduction and ageing rates may change the critical parameters. This is of practical interest: in species preservation, one may want to lower the critical parameters, so that λ exceeds them, and there is a positive probability of survival. On the other hand, in epidemic control, the goal is to increase the critical parameters, since if λ is below them, then the epidemic is eventually going to disappear. We compute the expected number of individuals alive in a branching process with ageing and show that, contrary to the behaviour of classical branching processes, it may exhibit an initial growth even when the population is ultimately destined for extinction.

1. Introduction

Branching processes have their origins at the end of the 19th century, when Galton and Watson addressed the problem of the extinction of family surnames in Victorian England. In 1875 [1], they formulated the first mathematical model of a branching process, in which each individual in a population independently produces a random number of offspring according to a fixed probability distribution.
The problem was revisited by other authors, but the definitive rigorous treatment can be found in ref. [2], who established the correct extinction criterion in terms of the mean offspring number. The theory was further developed by Kolmogorov and Dmitriev [3], who studied multi-type branching processes. In 1963, Harris’ monograph [4], systematised and greatly extended the theory, treating in particular continuous-time branching processes and age-dependent models. Note that in the former models, breeding and death events appear at the arrival times of two independent Poisson processes, assigned to each individual. In age-dependent models, also known as Bellman–Harris models, the probability of death event depends on age (usually under the assumption that death becomes more likely as individuals age).
A parallel line of development concerns the work of Yule [5], who introduced in 1925 a pure birth process that is now recognised as one of the earliest instances of a preferential attachment process, in the context of modelling the distribution of species among genera in biology. This work anticipated the modern theory of growing random networks and is closely related to the model in ref. [6], who independently rediscovered the preferential attachment mechanism in the context of the World Wide Web and scale-free networks.
Branching processes have been proposed since the earliest studies (see for example, [7,8]), as models for populations where individuals randomly breed and die. These processes also have a long tradition (see [9,10]) in epidemic modelling. The stochastic process represents, in these two situations, the total number of individuals of the population and the total number of infected individuals, respectively.
Already in the 1970s, the terminology branching random walks appeared in the literature (see [11,12,13,14]), denoting branching processes where individuals are endowed with a position, and their position is chosen at random, given the position of their parent, according to the law of a random walk. Early contributions in this direction include the work of Hammersley [15] and Kingman [16] on the minimal displacement of branching random walks, and the subsequent development by Biggins [17], who established the now-classical Biggins martingale convergence theorem. An extension of this result, which is worth mentioning, is due to Lyons [18].
Branching random walks are a generalisation of branching processes, and the addition of an infinite space set motivates further questions. For example, while branching processes have only two phases (indefinite growth or extinction), in branching random walks, the process may survive globally, i.e., the population survives as a whole, while going extinct in any finite set (for details, see Definitions 1 and 3). This means that there are three possible phases: global and local extinction, global survival with local extinction, global and local survival. In the decades 1990–2010, several papers have been devoted to the study of branching random walks in environments where those three phases are distinct (mainly, but not only, on trees), see [19,20,21,22,23,24,25,26,27,28].
One of the most popular types of branching random walk is the continuous-time process, where individuals have an exponentially distributed lifespan and, during their lifetime, produce offspring, and place them in one of their neighbours, at the arrival times of a homogeneous Poisson process with rate proportional to λ > 0 (see Definition 2). We refer to this process as the classical continuous-time branching random walk. In the case of population modelling, λ represents the reproductive capacity, while in epidemic modelling, it represents transmissibility. Clearly, the larger λ is, the more likely it is for the population to survive, and it is possible to define at least two critical parameters λ w λ s (see Definition 3). The identification of these two parameters has an applicative relevance, since if λ < λ w , then the population goes globally extinct and if λ < λ s , then the population goes locally extinct.
In real situations, an individual’s reproductive capacity, as well as the infectiousness of an individual affected by a transmissible disease, is not constant over time. Instead, it decreases with age (in population modelling) or with time since infection (in an epidemiological context). It is therefore natural to introduce ageing branching random walks, in which reproduction occurs at the arrival times of an inhomogeneous Poisson process with a decreasing rate function (see Definition 5). We note that age-dependent branching processes have been investigated, for example, in ref. [29] (Chapter IV) and [4] (Chapter VI), but, in those studies, age dependence means that the lifespan is not exponentially distributed; therefore, the probability of dying during a given time interval depends on age. In our framework, by contrast, the lifetime is exponentially distributed, as in the classical case, while the ability to reproduce decreases over time. This definition is inspired by the concept of dissipation, which has been studied in interacting particle systems, such as spin models [30,31] and contact processes [32]. In those papers, dissipation affects the time between updates in the system: the update rate decreases over time and has been shown to produce rhythmic oscillations in macroscopic quantities.
We characterise local and global critical parameters (Theorems 1–3) of ageing branching random walks. We prove that in many cases (for example, in transitive processes), survival or extinction of ageing branching random walks depends only on the expected number of offspring. Since ageing branching random walks are a generalisation of classical continuous-time branching random walks, these results extend the characterisations of the critical parameters which can be found in ref. [33,34]. On the other hand, the theorems in ref. [34] are an essential tool in the proofs in Section 3, where we exploit the fact that an ageing branching random walk and its discrete-time counterpart share the same asymptotic behaviour.
In Section 4 and Section 5, we focus on ageing branching random walks with a breeding rate of the form λ e α t , where t represents the age of the parent. In Section 4, we study how local modifications of the rates affect the critical parameters. We prove that even modifications affecting the reproduction or ageing rates in a single site can lower or increase the critical parameters. This is of practical interest, since we may consider λ as a fixed characteristic of the population, and lowering a critical parameter can turn a population, destined for extinction, into a surviving population. On the other hand, if we are able to increase a critical parameter, a surviving population can be driven to extinction. These results build on similar questions which were addressed in ref. [35,36] and extend those works to the case of ageing branching random walks.
Section 5 is devoted to the study of the behaviour, over time, of the expected number of individuals in a branching process with ageing (Theorems 6 and 7). This behaviour differs from that of a process without ageing. In particular, the population may grow in size before declining towards extinction. This indicates that, to determine whether the process will survive or go extinct, it must be observed over a sufficiently long period of time.
In Section 6, we discuss our results and their implications for applications in species conservation, pest control, and epidemic control.

2. Branching Random Walks: With or Without Ageing

Given an at most countable set of locations (or types) X, a branching random walk (briefly BRW) is a process { η t } t T , where η t X N . In the particular case where X is a singleton, the process is named branching process. For any given t T , x X , the value η t ( x ) represents the number of individuals in x X (or of type x) alive at time t. Time can be discrete or continuous, i.e., T N or T [ 0 , + ) , respectively. The laws of the process, in continuous-time, discrete-time and with ageing, are described in Section 2.1, Section 2.2 and Section 2.4, respectively.
We consider initial configurations with only one individual placed at a fixed site x, and we denote by P x the law of the corresponding process. The evolution of the process with more complex initial conditions can be obtained by superimposition, since reproductions and death of different individuals are independent.
Definition 1.
Given a process { η t } t T , with η t X N , let x X and A X .
1.
The process survives in A, with positive probability, starting from x, if q ( x , A ) : = 1 P x ( lim sup t y A η t ( y ) > 0 ) < 1 . If A = { x } , we say that the process survives locally, with positive probability, starting from x.
2.
The process goes extinct almost surely in A, starting from x, if q ( x , A ) = 1 .
3.
The process survives globally, with positive probability, starting from x, if q ( x , X ) < 1 .
4.
The process goes globally extinct, almost surely, starting from x, if q ( x , X ) = 1 .
5.
There is strong survival in A, starting from x, if q ( x , X ) = q ( x , A ) < 1 and non-strong survival in A, if q ( x , X ) < q ( x , A ) < 1 .
6.
The process is in a pure global survival phase, starting from x, if q ( x , X ) < q ( x , x ) = 1 (we write q ( x , y ) instead of q ( x , { y } ) for all x , y X ).
Survival and extinction can be defined for single realisations of the process as well. For example, if, given x X , { η t ( x , ω ) } t 0 , is strictly positive at arbitrarily large times, we say that for this ω , there is local survival in x; if it is equal to zero for all sufficiently large t, we say that there is extinction in x. We stress that in discussions about survival, the qualifier “with positive probability” is often implicitly understood. Similarly, in the case of extinction, the phrase “almost surely” is often omitted.
Local survival at x X means that the process keeps coming back to the location x, while global survival means that there are individuals alive, somewhere in X, at all times. Clearly, local survival implies global survival. The converse does not hold: in the case of a process in a pure global survival phase, the process eventually vacates all fixed finite subsets of X, even if it does not die out. This behaviour is possible only when | X | = . Strong survival in A means that survival in A happens with positive probability, and for almost all realisations, the process either survives in A (hence globally) or goes extinct. More precisely, there is strong survival in y, starting from x, if and only if the probability of survival in y, starting from x, is positive and, conditioned on global survival, is equal to 1.
On the other hand, negation of strong survival in A means that either q ( x , X ) = 1 (almost sure global extinction) or q ( x , X ) < q ( x , A ) (positive probability of global survival, without survival in A).
The probabilities of extinction clearly depend on the law of the BRW. Also the first-moment matrix  M = ( m x y ) x , y X , where each entry m x y represents the expected number of children that an individual living at x sends to y during its lifetime, depends on the law of the process. Its computation varies according to the type of process: classical continuous-time BRWs, discrete-time BRWs and BRWs with ageing, but in all these processes, M provides important information on the asymptotic behaviour (see Theorems 1–3 for the latter case). In the classical case, the process is Markovian, since transitions depend only on the number and location of the individuals. We remark that this is not the case when reproductive capacity is affected by age. We first recall the definition of the classical BRW, in continuous or discrete time.

2.1. Continuous-Time Branching Random Walks

Classical continuous-time BRWs are assigned by the choice of the space X and of a nonnegative matrix K = ( k x y ) x , y X . Each individual has an exponentially distributed lifetime with parameter 1 (death occurs at rate 1). Fix λ > 0 : for each individual living in x, and each y X , such that k x y > 0 , we associate a Poisson process with parameter λ k x y , which represents the breeding clock. At each arrival time of this Poisson process, provided that the parent at x is still alive, a newborn is placed at y. The death and reproduction clocks associated with different individuals are independent. We note that the reproduction rate, λ k x y , is the product of the basic rate k x y and λ . We can view λ as a knob that regulates the overall speed of reproduction (due to abundance or lack of resources, the presence of a good climate, etc.), and k x y as the local proclivity for reproduction. We summarise the definition of continuous-time BRW in the following.
Definition 2.
Given an at most countable set X and a nonnegative matrix K = ( k x y ) x , y X , we denote by ( X , K ) the family of continuous-time BRWs, indexed by λ > 0 , where each individual dies at rate 1 and individuals living in x X , produce offspring and send them to y X , at rate λ k x y . All breeding and death events, for different individuals, are independent.
The law of the process is fully described by the set X, the matrix K and the parameter λ . Different values of λ correspond to different processes in the same family: λ represents the speed of the single process. With a slight abuse of notation, we often say that the family ( X , K ) is a continuous-time BRW, rather than a family of BRWs. We stress that, even if other processes that model independent births and deaths may be constructed in continuous time, when we refer to continuous-time BRWs, we assume that the process is a BRW ( X , K ) , constructed via time-homogeneous Poisson processes.
The set X is endowed with a graph structure ( X , E ) , induced by the matrix K ( E X × X being the set of edges). Given x , y X , ( x , y ) E if and only if k x y > 0 . In other words, there is an edge from x to y whenever an individual at x has a positive probability of placing some offspring in y. We say that there is a path from x to y, and we write x y , if it is possible to find a finite sequence { x i } i = 0 n , for some n N , such that x 0 = x , x n = y and ( x i , x i + 1 ) E for all i = 0 , , n 1 (observe that by definition we assume that there is always a path of length 0 from x to itself). Whenever x y and y x , we write x y . The equivalence relation ⇌ induces a partition of X: the class [ x ] of x is called an irreducible class of x. If there is only one irreducible class, the process ( X , K ) is said to be irreducible. From the matrix of reproduction rates K, we derive the first-moment matrix M = ( m x y ) x , y X , where each entry is given by m x y = λ k x y . In particular, ( x , y ) E if and only if m x y > 0 .
We note that, in the definition of continuous-time BRWs ( X , K ) , the reproduction rates along the edge ( x , y ) are given by λ k x y , while it is implicitly assumed that the death rate is equal to 1 at each site. It is not difficult to see that the introduction of a nonconstant death rate { d ( x ) } x X (in place of rate 1 at each site), does not represent a significant generalisation. Indeed, one can study the BRW with death rate 1 and reproduction rates { λ k x y / d ( x ) } x , y X ; the two processes have the same behaviours in terms of survival and extinction ([35] (Remark 2.1)). Hence, it suffices to study the behaviour of continuous-time BRWs with a death rate equal to 1 at each site.
The process is monotone in λ : larger parameters imply faster breeding. To be precise, given λ 1 < λ 2 , we can couple the two corresponding processes, in a way such that the one with λ 1 has in all sites, and at all times, almost surely, a number of individuals that does not exceed the corresponding number for the process with speed λ 2 . We note that the extinction probabilities q ( · , · ) depend on the choice of λ . This leads to the definition of critical values of λ (for a generalisation and further properties, see [37]).
Definition 3.
Let ( X , K ) be a continuous-time BRW. For any x X , there are two critical parameters: the global survival critical parameter λ w ( x ) and the local survival critical parameter λ s ( x ) (or, briefly, global and local critical parameters), defined as
λ w ( x ) : = inf λ > 0 : q ( x , X ) < 1 , λ s ( x ) : = inf λ > 0 : q ( x , x ) < 1 .
If the interval ( λ w ( x ) , λ s ( x ) ) is not empty, we say that there exists a pure global survival phase starting from x.
These values depend only on the irreducible class of x; in particular, they do not depend on x if the BRW is irreducible. In the irreducible case, we simply write λ w and λ s . Moreover, we say that the process is globally supercritical, critical or subcritical if λ > λ w , λ = λ w or λ < λ w , respectively. An analogous definition of locally supercritical, critical or subcritical is given using λ s instead of λ w . No reasonable definition of a strong local survival critical parameter is possible (see [35]).
The local survival critical parameter λ s ( x ) can be computed, thanks to a result that links it to the first-return generating function Φ ( x , x | λ ) . We recall here the definition of the coefficients and of Φ . Let
φ x y ( n ) : = x 1 , , x n 1 X { y } k x x 1 k x 1 x 2 k x n 1 y Φ ( x , y | λ ) : = n = 1 φ x y ( n ) λ n .
One can see the similarity between the coefficients φ x y ( n ) and the first-arrival probabilities (or first-return, in case x = y ) see [38] (Section 1.C). In particular, λ n φ x y ( n ) is the expected number of individuals alive at y at time n, when the initial state is just one individual at x and the process behaves like the original BRW, except that every individual reaching y at any time i < n is immediately killed (before breeding). The following characterisation holds (see [33]):
λ s ( x ) = max { λ R : Φ ( x , x | λ ) 1 } = sup { λ R : Φ ( x , x | λ ) < 1 } .
Unfortunately, the characterisation of the global survival critical parameter is far less explicit, and we are not going to use it here. We refer the interested reader to [33].

2.2. Discrete-Time Branching Random Walks

In discrete-time BRWS, individuals live one unit of time; at their death, they are replaced by their offspring. The number of children and their locations depend only on the location of the parent.
Definition 4.
Let X be an at most countable set and let S X : = { f : X N : y f ( y ) < } . Consider a family μ = { μ x } x X of probability measures on the (countable) measurable space ( S X , 2 S X ) . Denote by ( X , μ ) the discrete-time process in which each individual lives one unit of time and at their death, they are replaced by f ( y ) individuals at y, for all y X . The function f is chosen according to μ x , where x is the location of the parent. All breeding and death events, for different individuals, are independent.
In the discrete-time case, the first-moment matrix, M = ( m x y ) x , y X , has entries m x y : = f S X f ( y ) μ x ( f ) . For simplicity, we require sup x X y X m x y < + . The graph structure ( X , E ) is analogous to the continuous-time case: ( x , y ) E if and only if m x y > 0 . In order to avoid trivial situations where individuals have one offspring almost surely, we also assume that in every equivalence class (with respect to ⇌) there is at least one vertex where an individual can have, with positive probability, a number of children different from 1.
We observe that, in contrast with the continuous-time case, here, the number of children and their locations are not necessarily independent variables. For example, for any X with at least three distinct sites y , w , z , let δ i ( j ) = 1 if i = j , δ i ( j ) = 0 if i j . Choose μ x such that μ x ( f 1 ) = 1 / 3 and μ x ( f 2 ) = 2 / 3 , with f 1 = 2 δ y + δ w and f 2 = δ z . If the number of children and their locations are independent variables, then we say that the BRW is a BRW with independent diffusion. A BRW with independent diffusion is fully described by the laws ρ x , which regulate the total number of children of an individual that lives in x X , and the transition matrix P, defined as follows:
ρ x ( n ) : = μ x ( { f : y f ( y ) = n } ) , p ( x , y ) : = m x y / n 0 n ρ x ( n ) .
Note that the expected value of ρ , n 0 n ρ x ( n ) , coincides with y X m x y . For a BRW with independent diffusion, we have:
μ x ( f ) = ρ x y f ( y ) ( y f ( y ) ) ! y f ( y ) ! · y p ( x , y ) f ( y ) , f S X .

2.3. The Discrete-Time Counterpart of a Continuous-Time BRW

For any continuous-time BRW, we associate a discrete-time BRW, which we call its discrete-time counterpart. Time in the discrete-time counterpart represents generation: at time n + 1 , the only individuals alive are those who are offspring of individuals of the n-th generation. If we define
ρ x ( i ) = 1 1 + λ k ( x ) λ k ( x ) 1 + λ k ( x ) i , p ( x , y ) = k x y k ( x ) , k ( x ) : = y X k x y ,
then it is easy to show that μ x satisfies Equation (3).
Note that the two processes do not share the same time clock and some individuals of the n-th generation may be born after individuals of the m-th generation, even if n > m . However, the total number of individuals ever born at each site is the same for both processes. This means that the continuous-time BRW survives (in A, strongly in A or globally) with the same probability as its discrete-time counterpart.

2.4. BRW with Ageing

In the classical continuous-time BRW, each individual maintains its reproductive capacity throughout their entire life (the Poisson clock that regulates breeding is time-homogeneous, i.e., it has a constant parameter λ ). In real life, such a capacity typically decays with age. It is therefore natural to extend the definition of BRW to the case where breeding occurs at the arrival times of an inhomogeneous Poisson process.
Definition 5.
Given an at most countable set X and a family R : = { r x y } x , y X , where each r x y L l o c 1 ( [ 0 , + ) ) , we denote by ( X , R ) the family of BRWs, indexed by λ > 0 , defined as follows. Each individual dies at rate 1, and an individual living in x X , produces offspring and sends them to y X , at the arrival times of a Poisson point process of intensity λ r x y ( t t ¯ ) , where t ¯ 0 is the time of birth of the parent. All breeding and death events, for different individuals, are independent. These processes are called BRWs with ageing or ageing BRWs.
In an ageing BRW, the average number of children placed in y by an individual at x during its lifetime is
m x y = λ 0 r x y ( s ) exp ( s ) d s .
As in the discrete-time case, we require sup x X y X m x y < + . The graph structure ( X , E ) is again defined in terms of the first-moment matrix: ( x , y ) E if and only if m x y > 0 .
We note that continuous-time BRWs are a particular case of ageing BRWs, where r x y ( s ) = k x y , for all s [ 0 , + ) . As for classical continuous-time BRWs, the family is monotone in λ . Therefore, we are able to define the critical parameters λ w ( · ) and λ s ( · ) of ( X , R ) , as in Definition 3. We call the family ageing BRW or BRW with ageing. Clearly, breeding is subject to ageing, in common sense, when functions r x y are eventually non-increasing. Nevertheless, we use this terminology for all choices of the family R .
For any given λ > 0 , the process { η t } t 0 , where η t ( x ) is the number of individuals alive in x at time t, is not a Markov process, unless the intensities are constant functions, i.e., the process coincides with a continuous-time classical BRW. The process becomes Markovian once we keep track of the age of each individual, that is, we consider the process { η t , A n , t } t 0 , n N , where A n , t ( x ) represents the age, at time t, of the n-th individual born in the site x.
We observe that a choice of more general lifetimes does not provide a meaningful generalisation, as long as we are only interested in the first-moment matrix. Indeed, if each individual at x has a random lifetime with cumulative distribution function T x , then by writing r ˜ x y ( s ) = r x y ( s ) ( 1 T x ( s ) ) exp ( s ) , we get
m x y = λ 0 r x y ( s ) ( 1 T x ( s ) ) d s = λ 0 r ˜ x y ( s ) exp ( s ) d s .
For any ageing BRW, we associate its discrete-time counterpart, where time represents generation. We may compute the measure μ x , which rules the number and locations of children of a parent living at x
μ x ( f ) = 0 y X exp ( λ 0 t r x y ( s ) d s ) ( λ 0 t r x y ( s ) d s ) f ( y ) f ( y ) ! exp ( t ) d t .
We note that the asymptotic behaviour of a BRW with ageing and of its discrete-time counterpart coincide: the two processes share the same extinction probabilities, and they also share the same first-moment matrix. Moreover, even if the ageing BRW is not Markovian, its discrete-time counterpart is, since it takes into account the children that an individual produces, during their whole life.

3. Survival and Extinction of a BRW with Ageing

Since BRWs with ageing share the first-moment matrix with their discrete-time counterpart, whenever survival depends only on the first moments of the process, we are able to carry the results for the latter, to the former. In particular, we are able to fully characterise local survival.
Theorem 1.
Let ( X , R ) be an ageing BRW. Let K = ( k x y ) x , y X be the matrix defined by
k x y = 0 r x y ( s ) exp ( s ) d s .
Denote by k x y ( n ) the entries of its n-th power. Fix λ > 0 and x X . The process survives locally at x if and only if
λ lim sup n + k x x ( n ) n > 1 .
Equivalently, λ s ( x ) = 1 / lim sup n + k x x ( n ) n and
λ s ( x ) = sup { λ R : Φ ( x , x | λ ) < 1 } .
Proof. 
For any fixed λ , the ageing BRW has the same extinction probabilities as its discrete-time counterpart, which is given by the reproduction measures in Equation (5), and the same first-moment matrix M = ( m x y ) , defined by Equation (4). The claim is a direct consequence of ([34] (Theorem 2.4)), which links local survival with the first-moment matrix and allows us to use the characterisation in Equation (6). □
In general, it is more difficult to characterise global survival. The following result provides a sufficient condition for global extinction, which is similar to the one for local extinction, stated in Theorem 1.
Theorem 2.
Let ( X , R ) be an ageing BRW. Let k x y ( n ) be as in Theorem 1. Given a fixed x X , λ w ( x ) 1 / lim inf n + y X k x y ( n ) n . Equivalently, if λ < 1 / lim inf n + y X k x y ( n ) n , then the process goes extinct almost surely.
Proof. 
Using the discrete-time counterpart of the BRW, the claim follows from ([34] (Theorem 2.5.2)). □
If the discrete-time counterpart has some symmetries, such as transitivity or quasi-transitivity, then it is possible to characterise the global critical parameters. Quasi-transitivity corresponds to the fact that there is a finite subset X 0 X such that for all x X there exists an automorphism γ : X X , with γ ( x ) X 0 , and the reproduction laws are γ -invariant. If | X 0 | = 1 , then the process is said to be transitive. A larger class of BRWs, which includes the transitive and quasi-transitive case, is the class of F -BRW (see, for example, [34] (Section 2.4)). Roughly speaking, from the viewpoint of their reproduction laws, these processes have a finite number of “types of neighbourhoods”.
Theorem 3.
Let ( X , R ) be an ageing BRW and suppose that its discrete-time counterpart is an F -BRW. Fix x X , λ > 0 : λ w ( x ) 1 / lim inf n + y X k x y ( n ) n . Equivalently, there is global survival, starting from x, if and only if λ > 1 / lim inf n + y X k x y ( n ) n .
Proof. 
The claim follows from ([34] (Theorem 2.5.3)), which states that the same holds for the discrete-time counterpart of the process. □

4. Critical Parameters Under Local Modifications

From now on, unless otherwise stated, all processes in the paper will be irreducible. In BRWs, an interesting topic is how the behaviour of the process changes after local modifications of the reproduction laws. In continuous-time BRWs, local changes may affect the value of critical parameters. This phenomenon has been investigated in detail in ref. [36], and extended to more general families of BRWs in ref. [37]. To be precise, we formally define local modifications of ageing BRWs. Note that the definition also covers the case of continuous-time BRWs, since these processes are particular cases of ageing BRWs, where the reproduction rates are constant.
Definition 6.
Let ( X , R ) and ( X , R * ) be two ageing BRWs, defined on the same space X. If the following set is finite
{ x X : y X , r x y r x y * } ,
then we say that ( X , R ) is a local modification of ( X , R * ) (and vice versa).
Let ( X , K ) be an irreducible continuous-time BRW, with critical parameters λ w and λ s , and consider a local modification ( X , K * ) . Let λ w * and λ s * be the critical parameters of ( X , K * ) . It has been proven (see [36] (Corollary 2, Corollary 3, Figure 1)) that if ( X , K ) has a pure global survival phase (i.e. λ w < λ s ), then it is not possible to increase λ w through local modifications of the parameters, that is, λ w * λ w . Moreover, if λ w λ w * , this means that λ w * = λ s * < λ w . Equivalently, if λ w * < λ s * , then λ w = λ w * .
In some cases, these results can also be exploited to retrieve the value of the global critical parameter. Indeed, suppose that ( X , K ) is an F -BRW (recall that examples are quasi-transitive BRWs) and λ w < λ s . A local modification ( X , K * ) is highly likely to lack the property of being an F -BRW. In this case, we do not have an explicit expression for λ w * , but we have the lower bound in Theorem 2, and we know that λ w * λ w . On the other hand, the value of λ s * is known, by Theorem 1. If we are able to prove that λ w * < λ w , or that λ s * λ w , then we know that λ w * = λ s * .
The goal of this section is twofold. On the one hand, we study what happens to the critical parameters of an ageing BRW after local modifications, using Theorem 4. On the other hand, we compare an ageing BRW with the classical continuous-time BRW that shares the same first-moment matrix. In particular, we investigate the presence or absence of the pure global survival phase.
We note that the results in ref. [36], which deal with the critical parameters of continuous-time BRWs under local changes, cannot be applied directly to ageing BRWs, since, in general, an ageing BRW and a continuous-time BRW, even if they have the same first-moment matrix, may have different behaviours. Instead, we make use of the following result that applies to the family of ageing BRWs. We omit the proof, since it is a direct application of the theorems in ref. [37].
Theorem 4.
Let ( X , R ) and ( X , R * ) be two ageing BRWs. Denote by λ w , λ s , λ w * , λ s * , the critical parameters of the two processes. Suppose that λ w < λ s and that ( X , R ) is a local modification of ( X , R * ) . Then we have the following.
1.
λ w * λ w .
2.
If λ w * < λ s * , then λ w * = λ w .
3.
If λ s * λ w , then λ w * = λ s * λ w . If λ s * > λ w , then λ w * = λ w < λ s * .
In the following examples, we consider irreducible processes; therefore, λ s and λ w do not depend on the vertices. In these examples X = T d , the homogeneous tree of degree d > 3 , and we write xy for vertices x , y T d that are adjacent. It is well known that rapidly growing trees, such as homogeneous trees, are the ideal setting where populations may survive on the graph, although they eventually vacate any finite portion of the graph itself (for early papers on BRWs on trees, see [20,21,24,25,27]). We formally state this fact by recalling the example of the continuous-time BRW, which is adapted to the graph structure, i.e., the breeding may occur only along the edges of the graph, and homogeneous in the sense that it spreads equally along any edge (Example 1). The critical parameters of this BRW are well-known. They are evaluated, for example, in (ref. [35] (Example 4.2)). We provide a proof for the sake of completeness. This proof, for the computation of λ s , is different from the one in ref. [35], and exploits the first-return generating function Φ and its connection with λ s (see Equations (1) and (2)).
Example 1.
Fix k > 0 and consider the continuous-time BRW ( X , K ) on the homogeneous tree T d of degree d 3 , where K is defined as k times the adjacency matrix of T d . The critical parameters satisfy
λ w = 1 k d < 1 2 k d 1 = λ s .
Hence, there exists a pure global survival phase.
Proof. 
The total number of individuals alive at time t coincides with the same quantity for a continuous-time branching process with rate λ k d (equivalently, this is the BRW on the singleton X = { x } , with K = ( k x x ) , k x x = k d ). Since a branching process survives if and only if the expectation of the offspring distribution is larger than 1, λ w = 1 / k d .
In order to compute λ s , we make use of the characterisation in Equation (2). Fix a vertex o and call it the root, and name x 1 one of the neighbours of o. From rotational invariance and absence of cycles, we get
Φ T d ( o , o | λ ) = d λ k · Φ T d ( x 1 , o | λ ) , Φ T d ( x 1 , o | λ ) = λ k + ( d 1 ) λ k · Φ T d 2 ( x 1 , o | λ ) .
By solving the quadratic equation, we obtain
Φ T d ( o , o | λ ) = d 1 1 4 ( d 1 ) λ 2 k 2 2 ( d 1 ) ,
whence, from Equation (2), λ s = 1 / ( 2 k d 1 ) . □
In the following examples, we study how local modifications of this process may or may not affect the critical parameters. The next example is a local modification of Example 1 and generalises ([36] (Example 1)), where the case k = 1 was studied. We observe that the addition of a fast local reproduction can destroy the pure global survival phase: when k o o is small, the critical parameters coincide with those in Example 1; for intermediate values the global critical parameter is unchanged, while the local one decreases in k o o ; for large values of k o o they coincide.
Example 2.
Fix a vertex o T d and call it the root of the tree. Consider the continuous-time BRW ( X , K * ) , with K * = ( k x y * ) given by
k x y * = k if x y , k o o if x = y = o ,
where k and k o o are two nonnegative parameters. Let λ w * and λ s * be the two critical parameters of the process. Then we have the following explicit expressions.
1.
If k o o k ( d 2 ) d 1 , then λ w * = 1 k d < λ s * = 1 2 k d 1 .
2.
If k ( d 2 ) d 1 < k o o k d ( d 2 ) d 1 , then λ w * = 1 k d < λ s * = ( d 2 ) k o o + d k o o 2 + 4 k 2 2 ( d k ) 2 + ( d 1 ) k o o 2 .
3.
If k d ( d 2 ) d 1 k o o , then λ w * = λ s * = ( d 2 ) k o o + d k o o 2 + 4 k 2 2 ( d k ) 2 + ( d 1 ) k o o 2 .
In particular, if k o o < k d ( d 2 ) / ( d 1 ) , then λ w * < λ s * ; if k o o k d ( d 2 ) / ( d 1 ) , then λ w * = λ s * .
Proof. 
Let Φ * be the first-return generating function of the BRW and let Φ T d be the corresponding one of the BRW on T d , described in Example 1. It is easy to see that
Φ * ( o , o | λ ) = Φ T d ( o , o | λ ) + k o o λ = d 1 1 4 ( d 1 ) λ 2 k 2 2 ( d 1 ) + k o o λ .
From the above expression of Φ * and Equation (2), we derive the values of λ s * , for different values of k o o . Since this BRW is a modification of the one in Example 1, if we use the notation λ w and λ s for the critical parameters in that example, from ([36] (Corollary 2)), we know that if λ s * > λ w , then λ w * = λ w . Moreover, if λ s * λ w , then λ w * = λ s * . □
Now we add ageing to the process in Example 2. In the following examples, ageing is modelled by an exponential decay in the time of the birth rate. In Example 3, each location is affected by age and ageing affects the root and the other vertices of the tree differently.
Example 3.
Let o be a fixed vertex in the homogeneous tree T d , and fix positive real numbers k , k o o , α , α 0 . Let ( T d , R * ) be the ageing BRW, with the following reproduction rate functions
r x y * = k o o · exp ( α o t ) if x = y = o , k · exp ( α o t ) if x = o , y o , k · exp ( α t ) if x o , y x .
Let λ w * and λ s * be its global and local survival critical parameters, respectively. Let λ w and λ s be the global and local survival critical parameters of the process with k o o = 0 and α o = α . There exist k 1 and k 2 , depending on d , k , α , α o , such that k 2 > max ( 0 , k 1 ) , is increasing in α 0 and the following hold.
1.
If α 0 + 1 α + 1 > d 2 ( d 1 ) , then k 1 > 0 and for k o o [ 0 , k 1 ) , λ w = λ w * < λ s * = λ s .
2.
If α 0 + 1 α + 1 d 2 ( d 1 ) and k o o ( 0 , k 2 ) , then λ w = λ w * < λ s * < λ s .
3.
If k o o k 2 , then λ w * = λ s * < λ w .
Proof. 
Let us denote by ( T d , R ) , the ageing BRW, with reproduction rate functions
r x y = k · exp ( α t ) , if x y .
Note that ( T d , R ) is a particular case of ( T d , R * ) , where α o = α and k o o = 0 . First, we determine its critical parameters, λ w and λ s . The discrete-time counterpart of ( T d , R ) shares the first-moment matrix with the discrete-time counterpart of the continuous-time BRW ( T d , K ) , K = ( k x y ) x , y T d , k x y = k / ( α + 1 ) if xy, k x y = 0 otherwise. Since the discrete-time counterparts of ( T d , R ) and ( T d , K ) are transitive BRWs (although the first is an ageing BRW and the second is a continuous-time BRW), their critical parameters depend only on the first-moment matrix and thus they also share the global and local critical parameters. Hence, as shown in Example 1, λ w = ( α + 1 ) / ( k d ) , λ s = ( α + 1 ) / ( 2 k d 1 ) . Clearly, for all d 3 , the process has a pure global survival phase.
Now we note that ( T d , R * ) , when α o α and k o o 0 , is a local modification of ( T d , R ) . If we fix α , α o , k and k o o , then the families of processes ( T d , R * ) and ( T d , R ) , indexed by λ , are ordered families of BRWs. Therefore, we are able to apply Theorem 4, and claim that λ w * λ w = ( α + 1 ) / ( k d ) , and that λ s * λ w if and only if λ w * = λ s * .
In order to compute λ s * , we note that we can use the discrete-time counterpart of ( T d , R * ) , which coincides with the one of the continuous-time BRW that shares the same expected number of offspring at each site. Since, by Theorem 1, the value of the local survival critical parameter depends only on the first-moment matrix, we are left with the task of studying the continuous-time BRW ( T d , K * ) , with K * = ( k x y * ) x , y T d ,
k x y * = k o o α o + 1 if x = y = o , k α o + 1 if x = o , y x , k α + 1 if x o , y x .
The values of k x y * are computed by evaluating the expected number of children:
k x y * = 0 r x y * exp ( α x t ) exp ( t ) d t = k x y α x + 1 ,
where we put α x : = α , when x o , and k x y = k , when x o , xy.
We proceed to evaluate the first-return generating function Φ * in comparison with the generating function Φ T d calculated in Example 1. Note that the first-return paths can be partitioned according to the first step. If the first step is along the loop ( o , o ) , then the expected number of children along this path is λ k o o / ( α o + 1 ) ; if the first step is from o to x (xo), then the path is entirely contained in T d and the expected number of first-return children is the same and in ( T d , K ) , multiplied by ( α + 1 ) / ( α o + 1 ) (since the contribution of the expected number of children of the first step is λ k / ( 1 + α o ) instead of k λ / ( 1 + α ) ). Therefore, we have
Φ * ( o , o | λ ) = α + 1 α o + 1 · Φ T d ( o , o | λ k / ( α + 1 ) ) + λ k o o α o + 1 = α + 1 α o + 1 · d 1 1 4 ( d 1 ) ( λ k / ( α + 1 ) ) 2 2 ( d 1 ) + λ k o o α o + 1 .
Since the square root decreases in λ , and is real if and only if λ α + 1 2 k d 1 , then
Φ * ( o , o | λ ) Φ * o , o | α + 1 2 k d 1 = α + 1 α o + 1 d 2 ( d 1 ) + k o o α o + 1 α + 1 2 k d 1 .
The last quantity is not larger than 1 if k o o k 1 : = α o + 1 α + 1 d 2 ( d 1 ) 2 k d 1 . This implies that, if k o o k 1 , then λ s * = λ s = α + 1 2 k d 1 and λ w * = λ w = α + 1 k d . Note that k 1 > 0 if and only if α 0 + 1 α + 1 > d 2 ( d 1 ) , otherwise it is not possible that k o o > k 1 .
On the other hand, since
Φ * o , o | α + 1 k d = α + 1 α o + 1 · d 1 1 4 ( d 1 ) / d 2 2 ( d 1 ) + k o o α o + 1 α + 1 k d = α + 1 α o + 1 d ( 3 d ) 2 ( d 1 ) + k o o k d α + 1 α o + 1 ,
equals 1 if k o o = k 2 : = k d α o + 1 α + 1 + d ( d 3 ) 2 ( d 1 ) , then λ s * = λ w * if k o o k 2 . □
We remark that, in order to study the behaviour and the critical parameters of the general process in Example 3, we cannot assume that the critical parameters coincide with the ones of the continuous-time BRW with the same first-moment matrix. This is only true for the local critical parameter, but in general it is not true for the global parameter, which depends not only on the first moments but also on the offspring distribution.
Nevertheless, if the BRW is quasi-transitive, then the global critical parameter depends only on the first-moment matrix (the same is true for F -BRW). Since the process in Example 3 is not a quasi-transitive BRW (nor an F -BRW), the trick is to find a transitive ageing BRW ( T d , R ) , of which ( T d , R * ) is a local modification. Then, on the one hand, we can apply Theorem 4, and compare λ s * to λ w ; on the other hand, we use the fact that the critical parameters of ( T d , R ) coincide with those of the continuous-time BRW with the same first-moment matrix. We also stress that from the expression of Φ * ( o , o | λ ) in Equations (2) and (7), one could derive (through easy, but tedious computation) the explicit expression of λ s * (as in ([36] (Example 1)), see [39]).
The behaviour of the process in Example 3 can be seen from two different perspectives, according to the fact that we might use the process as a model for the spread of an endangered species or for disease/pest control. In such models, we can view λ as a fixed parameter which is a characteristic of the population.
In the case of endangered species, we see that encouraging local reproduction can lower the survival critical parameters, but ageing also plays a role. Indeed, the strength of the local reproduction rate, necessary to obtain λ w * < λ or λ s * < λ , depends on the ageing parameters. Controlling the fertility decay with age, together with the reproduction rates, becomes a reasonable strategy to prevent extinction. On the other hand, in the case of pest/disease control, identifying sites where local reproduction drives the survival of the population, could be of great importance: tampering with the local reproduction rates and the fertility decay in these sites may increase the global and local survival critical parameters above the given parameter λ , driving this population to extinction.
In Example 3, we have seen that the addition of local reproduction, which takes into account the ageing parameter, in a single site, can destroy the pure global survival phase. In Example 4, we see that in some cases, modifying just the ageing parameter may eliminate the pure global survival phase.
Example 4.
Let o be a fixed vertex in the homogeneous tree T d , and fix positive real numbers k , k * , α , α 0 . Let ( T d , R * ) be the ageing BRW, with the following reproduction rate functions
r x y * = k * · exp ( α o t ) if x = y , k · exp ( α o t ) if x = o , y o , k · exp ( α t ) if x o , y x .
Let λ w * and λ s * be its global and local survival critical parameters, respectively. Then, for any given k and k * , there are choices of α and α o such that λ w * < λ s * and other choices such that λ w * = λ s * . In particular, for any given k and k * , there are values of α such that, for some values of α o we have λ w * < λ s * and for some other values of α o we have λ w * = λ s * .
Proof. 
Let us denote by ( T d , R ) , the ageing BRW, with α = α o . We proceed as in Example 3. The discrete-time counterpart of ( T d , R ) shares the first-moment matrix with the discrete-time counterpart of the continuous-time BRW ( T d , K ) , K = ( k x y ) x , y T d , k x y = k / ( α + 1 ) if xy, k x x = k * . Since ( T d , R ) and ( T d , K ) are transitive BRWs, their critical parameters depend only on the first-moment matrix and share the global and local critical parameters. The critical parameter for global survival coincides with that of a branching process with an expected number of children equal to ( k d + k * ) / ( α + 1 ) , thus λ w = ( α + 1 ) / ( k d + k * ) . To compute λ s , we write the first-return generating function Φ ( o , o | λ ) of ( T d , K ) , as
Φ ( o , o | λ ) = d 2 ( d 1 ) 1 λ k * α + 1 1 λ k * α + 1 2 4 ( d 1 ) λ 2 k 2 ( α + 1 ) 2 = d 2 ( d 1 ) 1 1 λ k * α + 1 2 4 ( d 1 ) λ 2 k 2 ( α + 1 ) 2 + ( d 2 ) λ k * 2 ( d 1 ) ( α + 1 )
Using the characterisation in Equation (6), we obtain λ s = ( α + 1 ) / ( k * + 2 k d 1 ) , which is strictly larger than λ w , for any choice of the parameters.
Now, we observe that, if α o α , then ( T d , R * ) is a local modification of ( T d , R ) . We may compute λ s * , using the first-return generating function Φ * of ( T d , R * ) . Indeed Φ * ( o , o | λ ) has the following expression:
α + 1 α o + 1 · d 2 ( d 1 ) 1 1 λ k * ( α + 1 ) 2 4 ( d 1 ) ( λ k ) 2 ( α + 1 ) 2 + d 2 2 ( d 1 ) λ k * α + 1
If Φ * ( o , o | λ w ) > 1 , then by Theorem 4, λ s * = λ w * < λ w = ( α + 1 ) / ( k d + k * ) . We note that Φ * ( o , o | λ w ) is equal to
α + 1 α o + 1 · d d ( 1 λ k * / ( k d + k * ) 2 4 ( d 1 ) ( λ k / ( k d + k * ) 2 2 ( d 1 ) + d 2 2 ( d 1 ) λ k * k d + k *
We know that for all α = α o , we get the process ( T d , R ) , which has a pure global survival phase. If α o = 0 , then for every sufficiently large α , the quantity Φ * ( o , o | λ w ) is larger than 1, and there is no pure global survival phase. On the other hand, once we have chosen such a large α , there exist sufficiently small values α o > 0 such that the above quantity is still larger than 1, and thus λ w * = λ s * . This concludes the proof. □
In Examples 3 and 4, we see that we can take transitive BRWs that have a pure global survival phase and perform a local modification (of the reproduction and/or of the ageing parameters) that lowers the critical parameters and removes the pure global survival phase. It is natural to wonder if it is possible to take a transitive BRW, which does not have the pure global survival phase, and perform local modifications on the reproduction and ageing parameters to destroy this phase. The answer is negative, as Theorem 5 and Corollary 1 show.
Theorem 5.
An irreducible ageing BRW with a pure global survival phase cannot be a local modification of an irreducible ageing BRW with no pure global survival phase and such that there is strong survival, for all values of λ, for which there is local survival with positive probability.
Proof. 
Let ( X , R ) be a BRW with a pure global phase (i.e. λ w < λ s ) and let ( X , R * ) be one of its local modifications, with critical parameters λ w * = λ s * . Let A X be the finite set such that r x y r x y * x A , y X . Consider now λ ( λ w , λ s ) and suppose that λ w * = λ s * . By Theorem 4, we have λ w * λ w . Denote by q ( · , · ) and by q * ( · , · ) the extinction probabilities of ( X , R ) and ( X , R * ) , respectively, and recall that these quantities depend on the choice of λ . Fix λ ( λ w , λ s ) . By the definition of critical parameters, for that choice of λ , q ( x , X ) < q ( x , x ) = 1 holds for every x X . Since ( X , R ) is irreducible, we have q ( x , x ) = q ( x , C ) , for all x X , and for all non-empty, finite C X . In particular, we can take C = A and note that q ( x , x ) = q ( x , A ) , for all x X .
According to a generalisation of ([36] (Theorem 3)) (see [37]), from q ( x , X ) < q ( x , A ) , we deduce that q * ( x , X ) < q * ( x , A ) = q * ( x , x ) for all x X . Since λ > λ w λ s * , ( X , R * ) survives locally, with positive probability. In other words, q * ( x , x ) < 1 , for all x X . This implies that for our choice of λ , ( X , R * ) there is local survival, with positive probability, but no strong survival (that is, local and global survival have both positive probability, but these probabilities are different). This completes the proof. □
It is easy to prove that Theorem 5 implies the following corollary.
Corollary 1.
An irreducible, ageing BRW with a pure global survival phase cannot be a local modification of an irreducible, quasi-transitive, ageing BRW, with no pure global survival phase.
Proof. 
By ([35] (Corollary 3.2)), we know that for an irreducible quasi-transitive BRW, either q ( x , x ) = 1 for all x X , or q ( x , x ) = q ( x , X ) < 1 for all x X . This means that for all values of λ such that there is local survival with positive probability, there is strong survival, and by Theorem 5, we know that this BRW cannot be a local modification of a BRW with pure global survival phase. □
We summarise the main results of this section in Table 1: in the first and second columns, we write the characteristics of the original process and of its modification, respectively. The third column explains which modifications we must perform. Note that the key is to work on the hubs, that is, on sites where reproduction from the site to itself is possible. The modifications may involve both reproduction and ageing rates (first two cases) or only the ageing rates (third and fourth cases). The fourth column tells us where to find the example or result where we discussed the corresponding situation.

5. The Expected Number of Individuals in an Ageing BRW

In the previous section, we studied the critical parameters of ageing BRWs, subjected to local modifications. We exploited the fact that the long-term behaviour of BRWs coincides with their discrete-time counterparts and, in many cases, this behaviour depends only on the first moments of the offspring distributions. In particular, in those cases, the ageing BRW survives with positive probability (or goes extinct) if and only if the continuous-time BRW, with the same expectation of the offspring distribution, does.
Nevertheless, we know that the laws of an ageing BRW and of a continuous-time (classical) BRW are different. In this section, we investigate the expected number of individuals alive in an ageing BRW and in a continuous-time BRW, as a function of time. We recall that, by the law of large numbers, when the process η t starts from a sufficiently large number N of initial individuals, the normalised process η t / N is close to the expected number of individuals alive at time t. For classical branching processes, this statement is made precise by Kurtz’s limit theorems [40,41]: the supremum, over t in a fixed time interval, of the difference between η t / N and its expectation converges to zero almost surely. Consequently, the expected number of individuals at time t captures, with high probability, the qualitative behaviour of the system, indicating when the total population tends to increase or decrease. To keep things simple, we consider branching processes, rather than BRWs.
Let S t denote the expected number of individuals that are alive at time t 0 , for a classical continuous-time branching process, with rate λ . It is well-known that S t satisfies the differential equation S t ˙ = ( λ 1 ) S t , where by S t ˙ we mean the derivative of S t , with respect to t (see, for example, ([29] (Chapter III))). Its solution is S t = S 0 · e ( λ 1 ) t , where S 0 is the initial number of individuals in the population.
Consider now the ageing branching process with r ( t ) = e α t , for all t 0 , α > 0 . This means that the ability of each individual to reproduce decreases exponentially with time. The following result gives the expression of the expected number of individuals in this ageing branching process.
Theorem 6.
Fix α > 0 . Let ( X , R ) be the ageing branching process, where X = { x } and r ( t ) = e α t , for all t 0 . Let V t be the expected number of individuals that are alive at time t 0 . Then, for all fixed λ > 0 , V t is as follows.
1.
If λ α , V t = V 0 λ λ α e ( λ α 1 ) t α λ α e t .
2.
If λ = α , then V t = V 0 ( 1 + λ t ) e t .
Proof. 
Recalling that each individual has an exponentially distributed lifetime of parameter 1, the expected number of offspring produced up to time t by an individual born at time 0 is given by
0 t e x 0 x λ e α s d s + t + e x 0 t λ e α s d s .
Let V t denote the expected number of individuals alive at time t 0 , and let N t be the total number of individuals born up to time t. Clearly N 0 = V 0 , since at time 0 the only individuals present are the initial ones. Moreover, N ˙ s d s is the expected number of births in the infinitesimal time interval d s .
The number V t can be decomposed into the number of initial individuals that are still alive, plus the number of individuals that were born at time s > 0 and are still alive. Each of the initial individuals V 0 has an exponential lifetime with parameter 1, hence survives until time t with probability e t . This yields a contribution V 0 e t . On the other hand, consider an individual born at time s [ 0 , t ] . They survive at least until time t with probability e ( t s ) . The expected number of individuals born in ( 0 , t ) , still alive at time t, is equal to 0 t N ˙ s e ( t s ) d s . Adding these two contributions, we obtain
V t = V 0 e t + 0 t N ˙ s e ( t s ) d s .
We compute N ˙ t , separating the contribution of individuals alive at time 0, from the one of individuals born at time s > 0 :
N ˙ t = λ V 0 e ( α + 1 ) t + λ 0 t N ˙ s e ( α + 1 ) ( t s ) d s .
We note that in the first summand, we take into account that the initial population N 0 = V 0 reproduces with rate λ e α t , provided it has survived up to time t (which occurs with probability e t ). The second summand represents the contribution of all individuals born at times s ( 0 , t ) : each individual reproduces, at time t, with a rate λ e α ( t s ) , provided that it has survived up to an age ( t s ) , an event that occurs with probability e ( t s ) .
  • Now, we differentiate the two members of Equation (8), with respect to t.
V t ˙ = d d t V 0 e t + d d t 0 t N ˙ s e ( t s ) d s = V 0 e t + N ˙ t + 0 t N ˙ s d d t e ( t s ) d s = V 0 e t + N ˙ t 0 t N ˙ s e ( t s ) d s .
From Equations (8) and (10), we get V ˙ t = N ˙ t V t and
N ˙ t = V ˙ t + V t .
Therefore, Equation (9) can be rewritten as
N ˙ t = λ V 0 e ( α + 1 ) t + λ 0 t ( V ˙ s + V s ) e ( α + 1 ) ( t s ) d s .
If we differentiate Equation (11), we get
N ¨ t = V ¨ t + V ˙ t ;
while differentiating Equation (12) gives
N ¨ t = ( α + 1 ) λ V 0 e ( α + 1 ) t + λ ( V ˙ t + V t ) λ 0 t ( V ˙ s + V s ) ( α + 1 ) e ( α + 1 ) ( t s ) d s = ( α + 1 ) N ˙ t + λ ( V ˙ t + V t ) = ( λ α 1 ) ( V ˙ t + V t ) .
From Equation (13), we have V ¨ t = N ¨ t V ˙ t . Together with Equation (14), this yields the following differential equations (where V 0 is the number of initial individuals):
V ¨ t = V ˙ t ( λ α 2 ) + V t ( λ α 1 ) ; V ˙ 0 = ( λ 1 ) V 0 .
It is easy to check that the two cases in the statement of Theorem 6 are the solutions of (15). □
We want to compare the function V t of the ageing branching process in Theorem 6 with the function S t of a continuous-time branching process that has the same first moment. To this aim, in the following definition, we define a branching process equivalent to ( X , R ) . The term is justified by the fact that the two processes share the same destiny (they both survive with positive probability, or they both go almost surely extinct) and that they have the same expected number of offspring.
Definition 7.
Fix α , λ > 0 and let ( X , R ) be the ageing branching process defined in Theorem 6. The equivalent branching process is the continuous-time branching process, where individuals breed at the arrival times of a Poisson process of rate λ / ( 1 + α ) and die at rate 1.
We are now ready to state the following result, which compares the expectations of the number of individuals in these two processes.
Theorem 7.
Fix α , λ > 0 and let ( X , R ) be the ageing branching process, where r ( t ) = e α t , for all t 0 ( X = { x } ). Let ( X , λ / ( 1 + α ) ) be its equivalent branching process. Denote by V t and S t the expected number of individuals who are alive at time t 0 , in ( X , R ) and in ( X , λ / ( 1 + α ) ) , respectively. Suppose that V 0 = S 0 . As t , the possible cases are the following.
1.
If λ > α + 1 , then both V t and S t tend to infinity and V t λ λ α V 0 e ( λ α 1 ) t is eventually larger than S t .
2.
If λ = α + 1 , then S t = V 0 , for all t 0 , and V t V 0 λ .
3.
If α < λ < α + 1 , then both V t and S t tend to 0, V t λ λ α V 0 e ( λ α 1 ) t and S t is eventually larger than V t .
4.
If λ = α , then both V t and S t tend to 0, V t α t V 0 e t and S t is eventually larger than V t .
5.
If λ < α , then both V t and S t tend to 0, V t α α λ V 0 e t and S t is eventually larger than V t .
Proof. 
We need to compare the asymptotic behaviour of S t = V 0 · e ( λ / ( α + 1 ) 1 ) t and V t as computed in Theorem 6: V t = V 0 λ λ α e ( λ α 1 ) t α λ α e t if λ α , while V t = V 0 ( 1 + λ t ) e t if λ = α . We analyse the asymptotic behaviour of V t in comparison with S t in the five possible regimes:
1.
λ > α + 1 . Here λ / ( α + 1 ) > 1 and λ α 1 > 0 , so S t and
V t λ λ α V 0 e ( λ α 1 ) t , as t .
Since λ α 1 > λ / ( α + 1 ) 1 , V t grows faster than S t . Therefore, both populations grow exponentially, with V t eventually larger than S t .
2.
λ = α + 1 . Then, λ / ( α + 1 ) = 1 and λ α = 1 , hence S t = S 0 for all t 0 , and
V t = V 0 ( λ α e t ) V 0 λ , as t .
3.
α < λ < α + 1 . In this regime λ / ( α + 1 ) < 1 and 1 < λ α 1 < 0 . As t , S t 0 and
V t λ λ α V 0 e ( λ α 1 ) t 0 .
Since λ α 1 < λ / ( α + 1 ) 1 , V t decays faster than S t , and S t is eventually larger than V t .
4.
λ = α . Then, as t ,
V t = V 0 ( 1 + λ t ) e t λ V 0 t e t 0 ,
while S t = V 0 e 1 1 + λ t 0 . Since e t decays faster than e t / ( 1 + λ ) , V t decays faster than S t and S t is eventually larger than V t .
5.
λ < α . Here, as t ,
V t α α λ V 0 e t , S t = V 0 e t · e λ t / ( α + 1 ) .
Since λ / ( α + 1 ) < 1 , both functions converge to 0, V t decays faster than S t and S t is eventually larger than V t .
We note that, while the qualitative asymptotic behaviour of V t and S t are the same (diverging, converging to a finite positive limit or to 0), the quantitative behaviour differs. If λ 1 and α > 0 , only cases 3-4-5 of Theorem 7 are possible and S t and V t decay exponentially, although with different speed. The most striking difference between S t and V t appears with λ > 1 . Whenever λ > 1 , for small values of t, V t is increasing (this is due to the initial condition in Equation (15)). In particular, if λ ( 1 , α + 1 ) , S t decreases for all t 0 while V t increases for small values of t (cases 3-4-5 in Theorem 7, with λ > 1 ). As an exemplification of the possible cases when λ > 1 , see Figure 1. We note that cases 4 and 5 are quite similar; therefore, the last one is not displayed in this figure. Even if we observe these differences in the behaviour of ageing branching processes and classical branching processes (hence where the space X is a singleton), we mention that similar phenomena can be observed by comparing ageing BRWs with classical BRWs, where | X | > 1 (see [39]).

6. Conclusions

Branching random walks are stochastic processes that mainly model two quantities: the number of individuals in a population that breeds and dies, and the number of infected individuals during an epidemic outbreak. Branching events correspond to reproduction/infection events. The random walk part mimics the dispersion of children in the proximity of the parent or the contagion of social contacts. In both scenarios, individuals are endowed with a random lifespan, which represents the actual time during which the individual is fertile or contagious.
In the classical case, events occur at the arrival times of homogeneous Poisson processes, that is, lifespans and time intervals between breeding events are exponentially distributed. This assumption ensures Markovianity, but fails to capture more realistic features such as the dependence of the remaining lifetime and/or of the fertility on age. Several related models have been proposed to overcome this problem. Age-dependent branching processes, where an individual’s remaining lifetime depends on age (see [4,29]) are perhaps the first attempt towards more realistic models. In these processes, reproduction rates do not depend on age. Recently, processes that take into account a change, over time, in the speed of updates, have appeared in the literature. In particular, we refer the reader to refs. [42,43,44,45], where the process is affected by a so-called stochastic resetting: at random times, the parameters are changed, and this produces a phenomenon of ultraslow diffusion. Another line of research can be found in ref. [30,31,32], where the updating rate decays exponentially in time.
Following the ideas of ref. [30,31,32], we defined a new family of stochastic processes: ageing branching random walks. These are branching processes where lifespans are age-independent, while reproduction/infection events occur at the arrival times of an inhomogeneous Poisson process, which slows down as age increases. These processes are completely described by the spatial structure of interactions (reproduction/infection rates between sites), an intensity parameter λ , which tunes the reproduction/infection speed and can be seen as an intrinsic characteristic of the population and the ageing function. We study the model where ageing implies that the reproduction rates are multiplied by exp ( α t ) , with α > 0 .
Our results focus on three main aspects: the characterisation of the asymptotic behaviour of the process, distinguishing among global extinction, global survival with local extinction, and local survival (Section 3); the influence of local modifications of the interaction and ageing parameters on the destiny of the population (Section 4); the evolution, on the average, of the population when affected by reproductive ageing, as compared to non-ageing situations (Section 5). The results in Section 3 are based on, and extend, the theorems in ref. [34], where critical parameters of non-ageing branching random walks were characterised. The influence of local modifications on the fate of the process has been previously tackled in ref. [35,36]. In both sections, an essential key is to draw a parallel between ageing, non-Markovian, branching random walks and their discrete-time counterpart, which is a classical branching random walk. We believe that this approach, bridging the continuous-time non-Markovian setting with the well-understood discrete-time theory, opens the door to further investigations of more general ageing phenomena in the context of branching processes.
To understand the practical applications of the critical parameters, we observe that in real situations, one aims either at survival (protecting endangered species, for example) or at extinction (epidemic or pest control). Increasing or decreasing the intensity λ would seem to be the most natural option, but it might be impractical, since that would require a global change of the characteristics of the population. It is therefore important to understand if and how local changes affect survival. Moreover, when the model space is infinite, it is possible to observe local extinction (the population disappears from any finite set), while there is global survival (the population persists as a whole). Thus, the observation of the process on a finite set provides exhaustive information on the asymptotic behaviour only if there is no pure global survival phase, that is, when λ w = λ s . Indeed, when λ w < λ < λ s , one might think that the population is destined to extinction, which is true from a local point of view, but local changes may lower λ s below λ and thus imply that the population, after those changes, survives locally. Our results show that, in a population where reproduction/infection rates are affected by age, local changes of the ageing rates can change its ultimate fate (see Table 1).
For endangered species, given a λ such that there is local or global extinction, increasing the local reproduction rate and/or reducing the fertility decay rate, even at one single location, can put the population in the range of local survival. On the other hand, if the population is sustained by a local environment where reproduction is fast and ageing slow, disrupting this ecosystem might lead to extinction. In disease (or pest) control, an infectious disease, destined to disappear, could turn into an epidemic outbreak if a community increases the frequency of contacts (higher reproduction rates) and/or lowers the speed of decay of transmissibility. On the contrary, a disease which persists thanks to some hubs, that is, sites with faster reproduction rates and/or slower ageing, can disappear once we isolate and treat those hubs.
The importance of hubs, or hot spots, has been pointed out by earlier works on mathematical epidemic modelling, both from a theoretical point of view [46,47] and through numerical simulations [48,49]. Our study confirms this importance: the treatment or creation of hubs can change the ultimate fate of a population or of an epidemic. In addition, we now know that even tampering only with the ageing rates can produce sizeable changes in the behaviour of the process.
While Section 4 shows that the behaviour of the process cannot be predicted by observation only on finite sets, Section 5 tells that, even when we consider the space as a singleton, it is important to observe populations for a sufficiently large amount of time. In fact, in classical branching processes, the expected number of individuals alive at time t, can show only three behaviours: it increases for all t 0 (supercritical case), it remains constant (critical case), or it decreases for all t 0 (subcritical case). The introduction of an ageing parameter enriches the landscape of possibilities. In particular, in the subcritical case, there are cases where the expected number of individuals increases at the initial stages of the process, and only subsequently declines.
In conclusion, our results underline the role of ageing in population and epidemiological modelling. We should consider ageing as a factor, along with the reproductive speed and the interaction landscape, that determines the destiny of the population. Moreover, the introduction of this factor in branching models enlarges the realm of possible behaviours, providing a more realistic setting. Future work should focus on the short-term behaviour of ageing processes with multiple sites, and on both short and long-term behaviour of ageing BRW with constraints on the number of individuals in some/all sites. This could be investigated both through simulations and via the theoretical study of models with a small number of sites.

Author Contributions

Conceptualisation, D.B. and F.Z.; methodology, D.B. and F.Z.; formal analysis, D.B., E.M. and F.Z.; investigation, D.B., E.M. and F.Z.; writing—original draft preparation, D.B., E.M. and F.Z.; writing—review and editing, D.B., E.M. and F.Z.; validation, E.M.; visualisation, D.B., E.M. and F.Z. All authors have read and agreed to the published version of the manuscript.

Funding

Elena Montanaro received financial support from the PhD program at Università La Sapienza.

Data Availability Statement

No new data were created or analysed in this study.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Galton, F.; Watson, H.W. On the probability of the extinction of families. J. Anthropol. Inst. Great Br. Irel. 1875, 4, 138–144. [Google Scholar]
  2. Steffensen, J.F. Om Sandsynligheden for at Afkommet uddør. Mat. Tidsskr. B 1930, 19–23. [Google Scholar]
  3. Kolmogorov, A.N.; Dmitriev, N.A. Branching stochastic processes. Dokl. Akad. Nauk SSSR 1947, 56, 5–8. [Google Scholar]
  4. Harris, T.E. The Theory of Branching Processes; Springer: Berlin/Heidelberg, Germany, 1963. [Google Scholar]
  5. Yule, G.U. A mathematical theory of evolution, based on the conclusions of Dr. J. C. Willis, F.R.S. Philos. R. Soc. B 1925, 213, 21–87. [Google Scholar] [CrossRef]
  6. Barabási, A.-L.; Albert, R. Emergence of scaling in random networks. Science 1999, 286, 509–512. [Google Scholar] [CrossRef]
  7. Feller, W. The birth and death processes as diffusion processes. J. Math. Pures Appl. 1959, 9, 301–345. [Google Scholar]
  8. Kendall, D.G. Birth-and-death processes, and the theory of carcinogenesis. Biometrika 1960, 47, 13–21. [Google Scholar] [CrossRef]
  9. Clancy, D.; O’Neill, P. Approximation of epidemics by inhomogeneous birth-and-death processes. Stoch. Process. Appl. 1998, 73, 233–245. [Google Scholar] [CrossRef]
  10. Griffiths, D.A. Multivariate birth-and-death processes as approximations to epidemic processes. J. Appl. Probab. 1973, 10, 15–26. [Google Scholar] [CrossRef]
  11. Athreya, K.; Ney, P. Limit theorems for the means of branching random walks. In Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes; Academia: Prague, Czech Republic, 1973; pp. 63–72. [Google Scholar]
  12. Asmussen, S.; Kaplan, N. Branching random walks I. Stoch. Process. Appl. 1976, 4, 1–13. [Google Scholar] [CrossRef]
  13. Joffe, A.; Moncayo, A.R. Random variables, trees, and branching random walks. Adv. Math. 1973, 10, 401–416. [Google Scholar] [CrossRef][Green Version]
  14. Kaplan, N.; Asmussen, S. Branching random walks II. Stoch. Proc. Appl. 1976, 4, 15–31. [Google Scholar] [CrossRef]
  15. Hammersley, J.M. Postulates for subadditive processes. Ann. Probab. 1974, 2, 652–680. [Google Scholar] [CrossRef]
  16. Kingman, J.F.C. The first birth problem for an age-dependent branching process. Ann. Probab. 1975, 3, 790–801. [Google Scholar] [CrossRef]
  17. Biggins, J.D. Martingale convergence in the branching random walk. J. Appl. Probab. 1977, 14, 25–37. [Google Scholar] [CrossRef]
  18. Lyons, R. A simple path to Biggins’ martingale convergence for branching random walk. In Classical and Modern Branching Processes; Springer: New York, NY, USA, 1997; pp. 217–221. [Google Scholar]
  19. Benjamini, I.; Peres, Y. Markov chains indexed by trees. Ann. Probab. 1994, 22, 219–243. [Google Scholar] [CrossRef]
  20. Liggett, T.M. Branching random walks and contact processes on homogeneous trees. Probab. Theory Relat. Fields 1996, 106, 495–519. [Google Scholar] [CrossRef]
  21. Liggett, T.M. Branching random walks on finite trees. In Perplexing Problems in Probability, Progress in Probability 44; Birkhäuser Boston: Boston, MA, USA, 1999; pp. 315–330. [Google Scholar]
  22. Machado, F.P.; Popov, S. One-dimensional branching random walk in a Markovian random environment. J. Appl. Probab. 2000, 37, 1157–1163. [Google Scholar] [CrossRef]
  23. Machado, F.P.; Menshikov, M.V.; Popov, S. Recurrence and transience of multitype branching random walks. Stoch. Proc. Appl. 2001, 91, 21–37. [Google Scholar] [CrossRef]
  24. Machado, F.P.; Popov, S. Branching random walk in random environment on trees. Stoch. Proc. Appl. 2003, 106, 95–106. [Google Scholar] [CrossRef][Green Version]
  25. Madras, N.; Schinazi, R. Branching random walks on trees. Stoch. Proc. Appl. 1992, 42, 255–267. [Google Scholar] [CrossRef]
  26. Müller, S. Recurrence for branching Markov chains. Electron. Commun. Probab. 2008, 13, 576–605. [Google Scholar] [CrossRef]
  27. Pemantle, R.; Stacey, A.M. The branching random walk and contact process on Galton–Watson and nonhomogeneous trees. Ann. Probab. 2001, 29, 1563–1590. [Google Scholar] [CrossRef]
  28. Stacey, A.M. Branching random walks on quasi-transitive graphs. Combin. Probab. Comput. 2003, 12, 345–358. [Google Scholar] [CrossRef]
  29. Athreya, K.B.; Ney, P.E. Branching Processes; Springer: Berlin/Heidelberg, Germany, 1972. [Google Scholar]
  30. Cerf, R.; Dai Pra, P.; Formentin, M.; Tovazzi, D. Rhythmic behavior of an Ising Model with dissipation at low temperature. ALEA 2021, 18, 439–467. [Google Scholar] [CrossRef]
  31. Collet, F.; Dai Pra, P.; Formentin, M. Collective periodicity in mean-field models of cooperative behavior. Nonlinear Differ. Equ. Appl. 2015, 22, 1461–1482. [Google Scholar] [CrossRef]
  32. Dai Pra, P.; Marini, E. Noise-induced oscillations for the mean-field dissipative contact process. Electron. J. Probab. 2025, 30, 98. [Google Scholar] [CrossRef]
  33. Bertacchi, D.; Zucca, F. Characterization of the critical values of branching random walks on weighted graphs through infinite-type branching processes. J. Stat. Phys. 2009, 134, 53–65. [Google Scholar] [CrossRef][Green Version]
  34. Bertacchi, D.; Zucca, F. A generating function approach to branching random walks. Braz. J. Probab. Stat. 2017, 31, 229–253. [Google Scholar] [CrossRef][Green Version]
  35. Bertacchi, D.; Zucca, F. Strong local survival of branching random walks is not monotone. Adv. Appl. Probab. 2014, 46, 400–421. [Google Scholar] [CrossRef][Green Version]
  36. Bertacchi, D.; Zucca, F. On the critical parameters of branching random walks. Mathematics 2025, 13, 2962. [Google Scholar] [CrossRef]
  37. Bertacchi, D.; Zucca, F. Critical parameters of germ-monotone families of branching random walks. arXiv 2026, arXiv:2602.21062. [Google Scholar] [CrossRef]
  38. Woess, W. Denumerable Markov Chains, Generating Functions, Boundary Theory, Random Walks on Trees; EMS Textbooks in Mathematics; European Mathematical Society (EMS): Zürich, Switzerland, 2009. [Google Scholar]
  39. Montanaro, E. Stochastic Models for Infections. Ph.D. Thesis, Università La Sapienza, Roma, Italy, 2026. (manuscript in preparation). [Google Scholar]
  40. Kurtz, T.G. Solutions of ordinary differential equations as limits of pure jump Markov processes. J. Appl. Probab. 1970, 7, 49–58. [Google Scholar] [CrossRef]
  41. Kurtz, T.G. Limit theorems for sequences of jump Markov processes approximating ordinary differential processes. J. Appl. Probab. 1971, 8, 344–356. [Google Scholar] [CrossRef]
  42. Liang, Y.; Wei, Q.; Wang, W.; Cherstvy, A.G. Ultraslow diffusion processes under stochastic resetting. Phys. Fluids 2025, 37, 032014. [Google Scholar] [CrossRef]
  43. Vinod, D.; Cherstvy, A.G.; Wang, W.; Metzler, R.; Sokolov, I.M. Nonergodicity of reset geometric Brownian motion. Phys. Rev. E 2022, 105, L012106. [Google Scholar] [CrossRef] [PubMed]
  44. Vinod, D.; Cherstvy, A.G.; Metzler, R.; Sokolov, I.M. Time-averaging and nonergodicity of reset geometric Brownian motion with drift. Phys. Rev. E 2022, 106, 034137. [Google Scholar] [CrossRef]
  45. Stojkoski, V.; Sandev, T.; Kocarev, L.; Pal, A. Geometric Brownian motion under stochastic resetting: A stationary yet nonergodic process. Phys. Rev. E 2021, 104, 014121. [Google Scholar] [CrossRef]
  46. Dezso, Z.; Barabási, A.-L. Halting viruses in scale-free networks. Phys. Rev. E 2002, 65, 055103. [Google Scholar] [CrossRef]
  47. Volz, E. SIR dynamics in random networks with heterogeneous connectivity. J. Math. Biol. 2008, 56, 293–310. [Google Scholar] [CrossRef]
  48. Buzna, L.; Peters, K.; Helbing, D. Modelling the dynamics of disaster spreading in networks. Phys. A Stat. Mech. Its Appl. 2006, 363, 132–140. [Google Scholar] [CrossRef]
  49. Okabe, Y.; Shudo, A. Microscopic Numerical Simulations of Epidemic Models on Networks. Mathematics 2021, 9, 932. [Google Scholar] [CrossRef]
Figure 1. The expected value of individuals of the ageing branching process with breeding intensity λ e α t ( V t , blue, solid line) and of the continuous-time branching process with intensity λ / ( 1 + α ) ( S t , red, dashed line) as functions of the time variable t when λ > 1 . The initial condition is V 0 for both processes. The four regimes 1, 2, 3 and 4 of Theorem 7 are exemplified: λ > α + 1 , λ = α + 1 , α < λ < α + 1 , λ = α . The plot of the case λ < α is qualitatively equivalent to the case λ = α , and therefore we omit it.
Figure 1. The expected value of individuals of the ageing branching process with breeding intensity λ e α t ( V t , blue, solid line) and of the continuous-time branching process with intensity λ / ( 1 + α ) ( S t , red, dashed line) as functions of the time variable t when λ > 1 . The initial condition is V 0 for both processes. The four regimes 1, 2, 3 and 4 of Theorem 7 are exemplified: λ > α + 1 , λ = α + 1 , α < λ < α + 1 , λ = α . The plot of the case λ < α is qualitatively equivalent to the case λ = α , and therefore we omit it.
Mathematics 14 01088 g001
Table 1. The first and second columns list the characteristics of the original and of the modified processes, respectively. The parameters of the original process, λ w and λ s , are compared with those of the modified process, λ w * and λ s * . Smaller parameter values make survival more likely, whereas larger values increase the probability of extinction. We provide instructions for the local modification (third column) and indicate where examples and proofs can be found (fourth column).
Table 1. The first and second columns list the characteristics of the original and of the modified processes, respectively. The parameters of the original process, λ w and λ s , are compared with those of the modified process, λ w * and λ s * . Smaller parameter values make survival more likely, whereas larger values increase the probability of extinction. We provide instructions for the local modification (third column) and indicate where examples and proofs can be found (fourth column).
Original BRW Modified BRWInstructionsWhere
transitivenot transitiveadd one hub
no hubsone hubreduce ageing at hubExample 3
λ w < λ s λ w * = λ s * λ w
not transitivetransitivereduce reprod. at hub
one hubno hubsincrease ageing at hubExample 3
λ w = λ s λ w λ w * < λ s *
transitivenot transitivereduce ageing
all sites are hubsall sites are hubsat one siteExample 4
λ w < λ s λ w * = λ s * λ w
not transitivetransitiveincrease ageing
all sites are hubsall sites are hubsat one siteExample 4
λ w = λ s λ w λ w * < λ s *
transitivetransitive or notIMPOSSIBLECorollary 1
λ w = λ s λ w * < λ s *
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Bertacchi, D.; Montanaro, E.; Zucca, F. Branching Random Walks with Ageing. Mathematics 2026, 14, 1088. https://doi.org/10.3390/math14061088

AMA Style

Bertacchi D, Montanaro E, Zucca F. Branching Random Walks with Ageing. Mathematics. 2026; 14(6):1088. https://doi.org/10.3390/math14061088

Chicago/Turabian Style

Bertacchi, Daniela, Elena Montanaro, and Fabio Zucca. 2026. "Branching Random Walks with Ageing" Mathematics 14, no. 6: 1088. https://doi.org/10.3390/math14061088

APA Style

Bertacchi, D., Montanaro, E., & Zucca, F. (2026). Branching Random Walks with Ageing. Mathematics, 14(6), 1088. https://doi.org/10.3390/math14061088

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop