Preprint
Article

This version is not peer-reviewed.

Exact and Approximate Constants of Motion in Stochastic Contact Processes

Submitted:

14 January 2026

Posted:

15 January 2026

You are already at the latest version

Abstract
We study a variety of stochastic contact processes --directly related to models of rumor and disease spreading-- from the viewpoint of their constants of motion, either exact or approximated. Much as in deterministic systems, constants of motion in stochastic dynamics make it possible to reduce the number of relevant variables, confining the set of accessible states, and thus facilitating their analytical treatment. For processes of rumor propagation based on the Maki-Thompson model, we show how to construct exact constants of motion as linear combinations of conserved quantities in each elementary contact event, and how they relate to the constants of motion of the corresponding mean-field equations, which are obtained as the continuous-time, large-size limit of the stochastic process. For SIR epidemic models, both in homogeneous systems and on heterogeneous networks, we find that a similar procedure produces approximate constants of motion, whose average value is preserved along the evolution. We also give examples of exact and approximate constants of motion built as nonlinear combinations of the relevant variables, whose expressions are suggested by their mean-field counterparts.
Keywords: 
;  ;  ;  ;  
Subject: 
Physical Sciences  -   Other

1. Introduction

Constants of motion are central to the analysis of dynamical processes because they constrain the regions of state space that a system can access, thereby simplifying its mathematical description [1,2]. If a physical system admits one or more invariants –be they conserved energies, masses, charges, or more abstract integral quantities– its dynamics become confined to lower-dimensional manifolds within the original state space. This reduction is not merely computationally convenient, but provides structural insight into the qualitative behavior of the system. In deterministic dynamics, constants of motion can often be used to construct reduced models or to identify families of trajectories parameterized by invariant quantities. Even in systems that are not fully integrable, partial sets of invariants can help isolate slow manifolds, determine stability boundaries, and identify geometrical constraints governing long-term behavior [3]. Although mechanical systems supply the canonical examples of conservation laws –energy, linear and angular momentum– this specific framework is only one instance of a far broader methodological scaffold. Noether’s theorem [4], which links conserved mechanical quantities to symmetries, remains important as a conceptual foundation but, in many other contexts, constants of motion are not tied to continuous symmetries in any strict sense.
Beyond classical mechanics, constants of motion appear in a wide variety of domains where they play a similarly structural, though sometimes subtler, role. In stochastic processes, for example, conservation laws often take the form of invariant probability fluxes, conserved moments, or linear combinations of state variables that remain unchanged under the stochastic evolution [5,6]. These invariants can be crucial for deriving stationary distributions, identifying metastable sets, and reducing chemical reaction networks or population models to lower-dimensional effective descriptions. In chemical kinetics, conserved quantities restrict the dynamics of reaction networks to affine subspaces, allowing substantial dimensionality reductions even when the underlying reaction kinetics are nonlinear [7,8]. In the physics of fluids and kinetic theory, generalized Hamiltonian structures give rise to Casimir invariants, which constrain the admissible evolution of distribution functions and help classify equilibria and stability properties [9,10]. Across all these settings, constants of motion act as organizing principles: they delimit the possible changes of the system along time, restrict its long-term behavior, and offer a unifying language for reduction, stability analysis, and qualitative classification.
In this contribution, we focus on the role of constants of motion in the analysis of stochastic contact processes. These are aleatory processes defined on systems formed by agents, where the state of each agent changes with time as a result of the interaction with other peers [11]. As referenced below, contact processes play a fundamental role in the mathematical modeling of a wide class of phenomena in biological and socioeconomic systems, covering disease dissemination, information transmission, and commercial or financial transactions, among many others. Here, for a variety of stochastic contact processes related to the modeling of rumor and disease propagation, we construct linear constants of motion and show how they help obtaining information on the evolution of the system. We demonstrate that, while some processes admit exact nontrivial constants of motion, others can only have approximated conserved quantities, that fluctuate randomly around their initial value as time elapses. In all cases, we compare with the conserved quantities known to exist in the mean-field version of each process. We also explore the possibility of finding nonlinear constants of motion.

2. Exact Constants of Motion in Maki-Thompson Rumor Propagation

Stylized models of rumor propagation have become one of the main applications of contact processes in the mathematical approach to social phenomena. Starting from a handful of abstract stochastic processes proposed several decades ago [12,13,14], these models have been extended to encompass a wide class of factors that influence information transfer in social systems, from mass-media dissemination [15], to networked structures [16,17], to population heterogeneity [18].
Among the most traditional models, the Maki-Thompson process [13] emulates the propagation of a rumor over a homogeneous population formed by N agents. Evolution goes on by discrete steps. At any step, each agent can be in one of three states which, by analogy with epidemiological models (see Section 3), are named susceptible (S), infected (I), and refractory (or recovered, R). Susceptible agents have not heard the rumor yet, infected agents have heard the rumor and are willing to transmit it, and refractory agents have heard the rumor but have lost interest and do not transmit it. At each evolution step, one of the infected agents is selected at random and a second agent is chosen, also at random, from the remaining of the population. If the second agent is susceptible, it becomes infected, representing the transmission of the rumor. If, on the other hand, the second agent is infected or refractory, the first agent looses interest in the rumor and becomes refractory. Typically, the process is run starting from an initial condition with many susceptible agents (for instance, S 0 = N 1 ), a few infected agents (for instance, I 0 = 1 ), and no refractory agents ( R 0 = 0 ). Evolution ends when no more infected agents are left in the population. The first column of Table 1 shows the two possible events in the format of chemical reactions. In the second column, we quote the corresponding probabilities of each reaction at step n, where S n is the number of susceptible agents at that step.

2.1. Constants of Motion

For each event, we have constants of motion associated with each state S, I, and R. Since in a transmission event (first row of Table 1), a susceptible agent becomes infected, the number of susceptible agents, S n , plus the index of the evolution step, n, remains constant. Likewise, the difference I n n is a constant of motion. Finally, since the number of refractory agents does not change, R n remains constant as well. These three constants of motion are shown in the third column of the table. Analogous arguments show that, for an event where an infected agent becomes refractory (second row of Table 1), the associated constants of motion are S n , I n + n , and R n n . Naturally, moreover, any combination of the three constants of motion is also a constant of motion for each event.
Can we combine the constants of motion quoted above in such a way as to obtain a function of S n , I n , R n , and n that is a conserved quantity for both events? To answer this question, we consider linear combinations of the constants of motion, requiring that the identity
α 1 ( S n + n ) + β 1 ( I n n ) + γ 1 R n = α 2 S n + β 2 ( I n + n ) + γ 2 ( R n n )
holds for a suitable choice of the coefficients. In order to get a solution with constant coefficients, we must have α 1 = α 2 α , β 1 = β 2 β , and γ 1 = γ 2 γ . Equation (1) then implies
α 2 β + γ = 0 .
This linear equation has two independent solutions, for instance, α = β = γ = 1 , and α = 2 , β = 1 , γ = 0 . Replacing in the combinations of Eq. (1), we get
K 1 = S n + I n + R n ,
K 2 = 2 S n + I n + n ,
which are two quantities conserved in both events. In the first of these joint constants of motion, we recognize the total number of agents, K 1 = N , which is trivially conserved due to the fact that no agent is created or destroyed in any of the events. On the other hand, K 2 is a nontrivial conserved quantity, combining the number of susceptible and infected agents, and the index of the evolution step [19]. Its value depends on the specific initial condition chosen to run the process: K 2 = 2 S 0 + I 0 . In the following, we show how K 2 helps to get information on the evolution.

2.2. Solution for the Mean Number of Agents in Each State

Since the probability of each event (second column of Table 1) depends on S n only, it is possible to write a master equation for the probability that the number of susceptible agents is S as step n, P n ( S ) , disregarding the number of infected and refractory agents. It reads
P n + 1 ( S ) = S + 1 N 1 P n ( S + 1 ) + 1 S N 1 P n ( S ) .
From this master equation, we immediately find the evolution law for the mean number of susceptible agents, S n = S = 0 N S P n ( S ) ,
S n + 1 = 1 1 N 1 S n ,
whose solution reads
S n = 1 1 N 1 n S 0 .
Here, · n denotes the mean value, calculated at step n, over realizations of the stochastic process starting from the same initial condition S 0 . Averaging Eq. () over realizations with the same initial condition and using Eq. (7), we get the mean number of infected agents:
I n = I 0 + 2 S 0 1 1 1 N 1 n n .
The mean number of recovered agents is just R n = N S n I n .
The solution for I n , Eq. (8), makes it possible to compute, although not always analytically, some important average features of the stochastic process. For instance, in the limit of large N, where [ 1 ( N 1 ) 1 ] n exp ( n / N ) , we find the number of steps at which the number of infected agents reaches a maximum, and the value of I n at the maximum, respectively,
n max = N ln 2 S 0 N , I max = I 0 + 2 S 0 N 1 + ln 2 S 0 N .
Note that these results make sense if S 0 > N / 2 . Otherwise, the number of infected agents does not reach a maximum during the evolution. By equating I n = 0 , meanwhile, we can find implicit equations for the expected evolution step at which the process ends, and for the corresponding average number of susceptible agents. In the limit of large N, we respectively have
n end = I 0 + 2 S 0 1 exp n end N , S end = S 0 exp n end N .
For the initial condition S 0 N and I 0 0 , we find n end 1.594 N , and obtain the classical result for “the proportion of the population never hearing a rumor” [14,19], S end = 0.203 N .

2.3. Mean-Field Evolution

Mean-field differential equations for the Maki-Thompson model are found in the limits of a large number of agents and continuous time. Firstly, we note that, in continuous time, the sequential choice of infected agents of the stochastic model must be replaced by a scheme where, on the average, each infected agent has the opportunity of interacting with the rest of the population once per time unit. This is achieved if the duration of each evolution step is proportional to the inverse of the number of infected agents, concretely,
t n + 1 t n = τ I n ,
where t n is the time of occurrence of step n, I n is the corresponding number of infected agents, and τ is a constant that fixes time units. Next, combining Eqs. (6) and (11), we estimate the time derivative of the number of susceptible agents as
d S d t 1 t n + 1 t n S n + 1 S n = 1 τ N S n I n .
Within this approximation, we get
d s d t = s i τ ,
where s ( t ) = S n / N and i ( t ) = I n / N are the average fractions of susceptible and infected agents, respectively. Proceeding in the same way for the time derivatives of the number of infected and refractory agents, we find
d i d t = s i i ( i + r ) τ , d r d t = i ( i + r ) τ ,
with r ( t ) = R n / N .
Equations (13) and (14) provide the mean-field description of the Maki-Thompson model. Inspection immediately shows that the sum s + i + r is a constant of motion. This represents, of course, the conservation of the total number of agents, thus corresponding to the constant of motion of Eq. (3). From the definition of the fractions s, i, and r, we have s + i + r = 1 . A second constant of motion can be obtained by calculating the ratio between the first of Eqs. (14) and Eq. (13):
d i d s = s i i ( i + r ) s i = 2 + 1 s ,
where we have replaced r = 1 s i . Integrating with respect to s from reference values s 0 and i 0 , we find the second constant for the mean-field equations:
K mf = 2 s + i ln s s 0 2 s 0 + i 0 .
Remarkably, although the functional form of this conserved quantity does not coincide with that of K 2 in Eq. (), their numerical values in the mean-field limit are the same (up to a factor N): K 2 = N K mf . In fact, identifying the reference values s 0 and i 0 with the initial condition, s 0 = S 0 / N and i 0 = I 0 / N , we have
ln s ( t ) s 0 = ln S n S 0 = n N ,
where we have used Eq. (7) in the limit of large N. The two constants of motion of the mean-field equations play the same role as K 1 and K 2 in the Maki-Thompson model, and can be used to get the mean-field counterpart of the results found in Section 2.2 for the stochastic process.

2.4. Two Extensions of the Maki-Thompson Model

In this section, we analyze two extensions of the Maki-Thompson stochastic process, which complexify the model by adding more states accessible to agents, but can be treated along the same lines as in the preceding sections. The first extension introduces resistance to recovery for infected agents [19]. Specifically, an infected agent must attempt transmission to infected or refractory agents a total of M times before becoming in turn refractory. This variant is formulated by introducing M states of infection, I ( m ) ( m = 0 , , M 1 ), where m indicates the number of transmission events already attempted by the agents in that state. Table 2 summarizes the relevant events, probabilities, and constants of motion. The original model is recovered for M = 1 .
Proceeding as in Section 2.1, we can find M equations for the M + 2 coefficients of a linear combination which gives a constant of motion for all the events of the model. We thus have two independent solutions. Not unexpectedly, one of them corresponds to the trivial constant of motion N = S n + m = 0 M 1 I n ( m ) + R n , namely, the total number of agents. The second, nontrivial joint constant of motion is
K = ( M + 1 ) S n + m = 0 M 1 ( M m ) I n ( m ) + n .
For this extension of the Maki-Thompson model, the probability of having S susceptible agents at step n, P n ( S ) , also satisfies the master equation (5), so that the solution for S n given by Eq. (7) still holds. Now, however, the existence of a constant of motion cannot be used to find the number of infected agents I ( m ) for each value of m, but rather the combination m = 0 M 1 ( M m ) I n ( m ) .
The mean-field equations for the present model are
d s d t = s τ m = 0 M 1 i ( m ) , d i d t ( 0 ) = s τ m = 0 M 1 i ( m ) 1 s τ i ( 0 ) , d i d t ( m ) = 1 s τ i ( m 1 ) i ( m ) , m = 1 , , M 1 , d r d t = 1 s τ i ( M 1 ) ,
with i ( m ) = I ( m ) / N , and s and r defined as in the preceding section. Direct calculation shows that, together with s + m = 0 M 1 i ( m ) + r = 1 , the quantity
K mf = ( M + 1 ) s + m = 0 M 1 ( M m ) i ( m ) ln s s 0 = ( M + 1 ) s 0 + m = 0 M 1 ( M m ) i 0 ( m ) ,
with s 0 and i 0 ( m ) the initial values of the corresponding variables. For large N, in full analogy with the original Maki-Thompson model, the numerical value of K mf coincides with that of K in Eq. (18) up to a factor N: K = N K mf .
In the second extension of the Maki-Thompson model considered here, which incorporates resistance to infection, a susceptible agent must be contacted M times by any infected agent to become infected. To formulate this variant, we introduce S n ( m ) as the number of susceptible agents, that, at step n, have already been contacted m times by infected agents ( m = 0 , 1 , , M 1 ). Events, probabilities, and constants of motion are listed in Table 3. The original model is reobtained for M = 1 .
As in the first extension of the Maki-Thompson process, two independent constants of motion can be found. The first, trivial one is the total number of agents, N = m = 0 M 1 S n ( m ) + I n + R n . The second joint constant of motion reads
K = m = 0 M 1 ( M m + 1 ) S n ( m ) + I n + n .
Now, the master equations for the different sub-classes of susceptible agents are coupled to each other, and so are the equations for the corresponding average numbers of agents. Nevertheless, it is possible to find their general solution. For an initial condition where no susceptible agent has yet been contacted by an infected agent, S 0 ( 0 ) = S 0 and S 0 ( m ) = 0 for m = 1 , , M 1 , the solution reads
S ( m ) n = n m 1 1 N 1 n m S 0 ( N 1 ) m .
Replacing into Eq. (21) gives the average number of infected agents I n . With this result, it is possible to evaluate the step n at which the number of agents reaches a maximum, the height of the maximum, the total duration of the process, and the number of surviving susceptible agents, much as done in Section 2.2 for the original model. These calculations are not included here for the sake of brevity.
In the mean-field limit we have
d s d t ( 0 ) = s ( 0 ) i τ , d s d t ( m ) = i τ s ( m 1 ) s ( m ) , m = 1 , , M 1 , d i d t = s ( M 1 ) i τ 1 τ 1 m = 0 M 1 s ( m ) i , d r d t = 1 τ 1 m = 0 M 1 s ( m ) i ,
with s ( m ) = S ( m ) / N , and i and r defined as in the preceding section. The nontrivial constant of motion for these equations is
K mf = m = 0 M 1 ( M m + 1 ) s n ( m ) + i n ln s s 0 = m = 0 M 1 ( M m + 1 ) s 0 ( m ) + i 0 .
In full analogy with the cases considered above, in the mean-field limit, the value of this constant of motion is related to that of Eq. (21) as K = N K mf .

3. Approximate Constants of Motion in SIR Epidemics

The SIR (susceptible-infected-recovered) model for epidemic propagation is among the most fundamental mathematical representations of the spreading of a contagious disease in a population of interacting agents. It belongs to a wide class of models where contact processes are used to describe the elementary events intervening in disease dissemination [20,21,22]. In the SIR model, the contact of an infected agent and a susceptible agent may lead the latter to become infected. In contrast with the Maki-Thompson model studied above, however, the transition from the infected state to the recovered state occurs spontaneously, without intervention of other agents. Recovered agents, in turn, cannot change their state.
Although the SIR model is frequently formulated in terms of mean field equations [22], it also admits several versions in the form of a stochastic contact process. By analogy with the Maki-Thompson process, at each time step, we here choose an infected agent at random. With probability u, the agent becomes recovered. With the complementary probability, 1 u , another agent is chosen at random from the whole population and, if this second agent is susceptible, it becomes infected. Table 4 shows the elementary events of the model, their probabilities, and the corresponding constants of motion.
Proceeding as for the Maki-Thompson model to find joint conserved quantities for the stochastic process, we note that –since, now, the process is defined by three individual events– the coefficients in a linear combination of the individual constants of motion must satisfy two conditions,
α β = β γ = 0 ,
instead of the only condition of Eq. (2). Consequently, there is only one independent solution, α = β = γ = 1 , corresponding to the trivial constant of motion N = S n + I n + R n . Thus, the SIR stochastic process has no other conserved quantity.
We note, however, that the first event in Table 4, on the one hand, and the second and third events, on the other, have their own constants of motion, respectively,
K 1 = S n + I n + n , K 2 = S n + I n .
This suggests that a combination of K 1 and K 2 , weighted with the total probabilities of the corresponding events,
K ˜ n = u K 1 + ( 1 u ) K 2 = S n + I n + u n ,
may play a role similar to that of a constant of motion, although not being an exactly conserved quantity itself. To assess this conjecture, we explicitly calculate the stochastic evolution of K ˜ n , finding
K ˜ n + 1 = K ˜ n ( 1 u ) , with probability u , K ˜ n + u , with probability 1 u .
This stochastic process represents a one-dimensional symmetric random walk: its mean value and variance evolve as
K ˜ n + 1 = K ˜ n , σ n + 1 2 = σ n 2 + u ( 1 u ) ,
respectively. In other words, K ˜ n is an approximate constant of motion, in the sense that its mean value is a conserved quantity. Its standard deviation, in turn, grows as n 1 / 2 , like in any ordinary diffusion process. Note that, in combination with the trivial constant of motion N, K ˜ n straightforwardly yields the mean number of recovered agents over realizations with initial condition R 0 :
R n = R 0 + u n .
The approximate constant of motion K ˜ n acquires relevance when considering the mean-field version of the SIR model. To show this, first, we use the master equation of the process,
P n + 1 ( S , I ) = u P n ( S , I + 1 ) + ( 1 u ) S + 1 N 1 P n ( S + 1 , I 1 ) + 1 ( 1 u ) S N 1 P n ( S , I ) ,
to find evolution equations for the mean numbers S n and I n :
S n + 1 = 1 1 u N 1 S n , I n + 1 = I n + ( 1 u ) S n N 1 u .
The solution to the first of these equations is
S n = 1 1 u N 1 n S 0
for any fixed initial condition S 0 . Next, from Eqs. (32) and operating as for the Maki-Thompson model, we get the mean-field description:
d s d t = ( 1 u ) s i τ , d i d t = ( 1 u ) s i τ u i τ , d r d t = u i τ .
Now, calculating d i / d s and integrating with respect to s, we find a mean-field constant of motion:
K mf = s + i u 1 u ln s s 0 = s 0 + i 0 .
Much as in Eq. (17), in the mean-field limit we can write
ln s ( t ) s 0 = ln S n S 0 = ( 1 u ) n N ,
where we have used Eq. (33). Comparing Eq. (27), this shows that, in the limit, the approximate constant of motion K ˜ n coincides with the exact mean-field conserved quantity K mf up to a multiplicative constant: K ˜ n = N K mf .
The main panel of Figure 1 illustrates the evolution of the number of susceptible and infected agents along three realizations of the stochastic process, for a system with N = 100 agents and recovery probability u = 0.3 , from an initial condition with one infected agent and no refractory agents. A comparison with the mean evolution given by Eqs. (32) is provided. The inset shows the evolution of the approximate constant of motion K ˜ n , together with its expected mean value and standard deviation.

3.1. SIR Epidemics on Random Networks

An important extension of epidemiological models based on contact processes, aimed at approaching a more realistic representation of social structure, consists in considering populations distributed on a network [23,24,25]. In this variant, agents are situated at the network nodes, and network links represent their mutual contacts, so that infection can only occur between neighbor agents. The heterogeneity induced by the network of contacts on the population structure implies that susceptible and infected agents have more chances of, respectively, becoming infected and transmitting the infection when their number of neighbors –namely, their degree– is larger. The mathematical description of the process thus requires discerning between agents with different degrees. For each possible degree k, we denote by S ( k ) , I ( k ) , and R ( k ) , the corresponding number of agents in each state of the SIR epidemics.
The SIR stochastic contact process on networks is here implemented as follows. At each evolution step, we choose at random a network link connected to (at least) one infected agent. With probability u, this infected agent becomes recovered. With the complementary probability, 1 u , if the second agent connected to the chosen link is susceptible, it becomes infected. Clearly, since one link is chosen at each step, the probability that any given infected or susceptible agent becomes involved in an event now depends on the respective degree k. The second column of Table 5 quotes the probabilities for each event in the case of a network with links distributed at random and with no statistical correlation between the degrees of neighbor agents.
Linear combinations of the constants of motion in the third column of Table 5 show that the only independent conserved quantities common to all the events are, trivially, the total number of agents with each degree k, N ( k ) = S n ( k ) + I n ( k ) + R n ( k ) , for k = 1 , 2 , . Meanwhile, a combination analogous to K ˜ n in Eq. (27), namely,
K ˜ n ( 0 ) = S n + I n + u n = k S n ( k ) + I n ( k ) + u n ,
where S n and I n are the total numbers of susceptible and infected agents at step n, satisfies the same stochastic evolution equation as K ˜ n in Eq. (28), and is thus an approximate constant of motion.
It turns out, however, that K ˜ n ( 0 ) is just but one among infinitely many combinations that act as approximate constants of motion for the SIR model on networks. To see this, consider for example the quantities Q n ( γ ) = k ( k / z ) γ [ S n ( k ) + I n ( k ) ] , for any value of the exponent γ , where z is the mean number of neighbors per network site. In an event as in the first line of Table 5, where an infected agent becomes recovered at step n, we have Q n + 1 ( γ ) = Q n ( γ ) ( k n / z ) γ , where k n is the degree of the infected agent involved in that event. On the other hand, for the events in the second and third rows, we have Q n + 1 ( γ ) = Q n ( γ ) . Averaging over the possible values of k n with their corresponding probabilities (second column of Table 5), it turns out that the quantity
K ˜ n ( γ ) = Q n ( γ ) + u m = 0 n 1 Θ m ( γ ) = k k z γ S n ( k ) + I n ( k ) + u m = 0 n 1 Θ m ( γ ) ,
with
Θ m ( γ ) = k k γ + 1 I m ( k ) z γ k k I m ( k ) ,
is driven by the stochastic process
K ˜ n + 1 ( γ ) = K ˜ n ( γ ) ( 1 u ) Θ n ( γ ) , with probability u , K ˜ n ( γ ) + u Θ n ( γ ) , with probability 1 u ;
cf. Eq. (28). For this process,
K ˜ ( γ ) n + 1 = K ˜ ( γ ) n , σ n + 1 2 = σ n 2 + u ( 1 u ) Θ n ( γ ) 2 ,
give the evolution of the mean value and the standard deviation of K ˜ n ( γ ) ; cf. Eq. (29). In other words, K ˜ n ( γ ) is an approximate constant of motion for any value of γ . Linear combinations of K ˜ n ( γ ) for different values of γ would produce infinitely many other approximate conserved quantities.
Mean-field equations for the stochastic SIR model on networks are obtained by assigning to each event a duration which appropriately takes into account the probability that an infected agent of degree k becomes involved in that event. Equation (11) now becomes
t n + 1 t n = τ k n k k I n ( k ) τ k n ϑ n ,
with ϑ n defined as in the caption of Table 5. Here, k n is the degree of the infected agent involved at step n and, as in Eq. (11), τ fixes time units. The resulting equations for the fractions s ( k ) = S ( k ) / N , i ( k ) = I ( k ) / N , and r ( k ) = R ( k ) / N are
d s d t ( k ) = ( 1 u ) k s ( k ) z τ k k z i ( k ) , d i d t ( k ) = ( 1 u ) k s ( k ) z τ k k z i ( k ) u i ( k ) τ , d r d t ( k ) = u i ( k ) τ ,
for each degree k. Operating on these equations, it can be straightforwardly shown that the quantity
K mf = k k z s ( k ) + i ( k ) u 1 u z k ln s ( k ) s 0 ( k )
is a constant of motion, with s 0 ( k ) the initial density of susceptible agents with k neighbors. We stress that, in spite of its functional form, the last term in the right-hand side of Eq. (44) is independent of k, as it becomes clear if the first of Eqs. (43) is rewritten as
1 k d d t ln s ( k ) = 1 u z τ k k i ( k ) z .
Comparing Eqs. (44) and (38), we realize that the approximate constant of motion of the stochastic process to be related to K mf is K ˜ n ( 1 ) . Up to a factor N, the summations in both constants are the same, so that the comparison must be carried out between the last term in the right-hand side of each equation. In the stochastic process, the mean evolution of susceptible agents is
S ( k ) n = 1 ( 1 u ) k z ( N 1 ) n S 0 ( k ) .
Replacing in the last term of Eq. (44), we get
u 1 u z k ln s ( k ) s 0 ( k ) = u n N ,
in the large-N limit. As for the last term of Eq. (38) with γ = 1 , u m Θ m ( 1 ) , Eq. (39) implies that, if infected agents are evenly distributed over the network, we can approximate Θ m ( 1 ) = k 2 / z 2 for all m. Within this approximation, which should improve as the system size grows, we have
u m = 0 n 1 Θ m ( 1 ) = u n k 2 z 2 .
Taking into account Eq. (46), it is clear that the expected proportionality K ˜ n ( 1 ) = N K mf only holds if k 2 = z 2 , i. e. for a regular random network [26], where all agents have the same number of neighbors. Note that this condition is verified, in particular, for a fully connected network, where k = N 1 for all agents. In this case, all agents can interact with each other, and we recover the SIR epidemic model without network.
Figure 2 shows, in the main panel, results for three realizations of the SIR stochastic process on Erdos-Rényi random networks [26] with N = 100 agents, and recovery probability u = 0.2 , from an initial condition with one infected agent and no refractory agents. On the average, each agent has z = 10 neighbors. Full curves stand for the evolution of the total number of susceptible and infected agents, respectively, S n and I n . Dashed curves correspond to their expected values, averaged over realizations of both the evolution and the underlying network. The inset shows the evolution of the approximate constant of motion K ˜ n ( 1 ) , given by Eq. (38) for γ = 1 . The horizontal dashed line indicates its expected mean value, z N .

4. Nonlinear and “Failed” Constants of Motion

The conserved quantities derived for the stochastic processes discussed in the preceding sections were built as linear combinations of the constants of motion associated to each event, which we have quoted in Table 1 to Table 5. Nothing precludes, however, that a suitably chosen nonlinear combination of the individual constants of motion can fulfill that role for the whole process. To illustrate this situation, we consider a variant of the Maki-Thompson model of rumor propagation analyzed in Section 2, where the contact between two infected agents results in both agents becoming refractory. Any other event occurs as in the original model. Table 6 lists the events, their probabilities, and the individual constants of motion for this variant.
The only linear combination of the constants of motion in Table 6 which acts as a conserved quantity for the three events is, not unexpectedly, the total number of agents N = S n + I n + R n . In principle, thus, we cannot rely on other combinations to get information on the evolution of the stochastic process. However, some algebra on the mean-field equations,
d s d t = s i τ , d i d t = s i i ( 2 i + r ) τ , d r d t = i ( 2 i + r ) τ ,
shows that
K mf = i + 1 s + 2 ln s s 0 i 0 + 1 s 0
is a constant of motion along the mean-field dynamics. This suggests that a constant of motion for the stochastic process, now involving a nonlinear combination of the number of agents in each state, may in fact exist.
To explore this possibility, we first write down the master equation for the probability P n ( S , I ) that, at step n, the numbers of susceptible and infected agents are S and I, respectively:
P n + 1 ( S , I ) = S + 1 N 1 P n ( S + 1 , I 1 ) + I + 1 N 1 P n ( S , I + 2 ) + 1 S + I N 1 P n ( S , I + 1 ) ,
where each term in the right-hand side represents the contribution of one of the events in Table 6. From this master equation, we reobtain Eq. (6) for the evolution of S n . For I n , in turn, we get
I n + 1 = I n + 1 N 1 S n 2 ( I n 1 ) R n ,
with R n = N S n I n . Taking into account the evolution laws for S n and I n , Eqs. (52) and (6), it turns out that the combination
K ˜ = I n + N 2 S n 2 N 2 n
is preserved along the evolution. Note however that the nature of this constant of motion is different from that of the examples considered in the preceding sections. In fact, it does not coincide with either a combination of the variables S n and I n or the mean value of any such combination. Rather, it is a nonlinear combination of mean values. In any case, in view of the solution for S n given by Eq. (7), in the limit of large N, K ˜ coincides with the mean-field constant of motion K mf given by Eq. (50). Moreover, using the solution for S n and the form of K ˜ , it is possible to find the solution for the mean number of infected agents, which reads
I n = I 0 + N 2 + 2 n N 2 S 0 1 1 N 1 n N + 2 .
Finally, we consider a complementary variant of the Maki-Thompson process, where an infected agent must necessarily contact a refractory agent to become in turn refractory. Namely, the contact between two infected agents produces no change. Table 7 shows the relevant parameters. As in the preceding variant, the only linear constant of motion is the total number of agents, N = S n + I n + R n .
For this process, the mean-field equations read
d s d t = s i τ , d i d t = ( s r ) i τ , d r d t = r i τ .
Taking the ratio of the first and third of these equations, it becomes apparent that the product
K mf = s r = s 0 r 0
is a conserved quantity. In order to relate K mf to a constant of motion for the stochastic process, it is convenient to use the master equation for the probability P n ( S , R ) :
P n + 1 ( S , R ) = S + 1 N 1 P n ( S + 1 , R ) + R 1 N 1 P n ( S , R 1 ) + 1 S + R N 1 P n ( S , R ) ,
which yields
S R n + 1 = S R n .
In other words, the product K ˜ n = S n R n is an approximate conserved quantity for the stochastic process, whose mean value is proportional to the constant of motion of the mean-field equations: K ˜ n = N 2 K mf .
As a final warning, we remark that the mean number of susceptible and refractory agents here evolve as
S n = 1 1 N 1 n S 0 , R n = 1 + 1 N 1 n R 0 ,
from initial conditions S 0 and R 0 . If, operating as for the preceding variant in Eq. (53), we naively compute the product
S n R n = 1 1 ( N 1 ) 2 n S 0 R 0 ,
we get a quantity that is not a constant of motion, but decreases monotonically as n grows. In other words, in the present case, a combination of stochastic variables inspired by a conserved quantity at the mean-field level, fails to give origin to a constant of motion. Only in the limit N does the procedure work, yielding a conserved quantity which, as expected, is proportional to that of the mean-field equations.

5. Conclusion

In this paper, we have considered a variety of stochastic contact processes where agents in a population change their individual state through random events of pair interaction. The focus has been put on the existence of conserved quantities, and on the role of these constants of motion in the mathematical analysis of such processes. Our procedure can be summarized as follows. For each elementary interaction event in the process, we first identify its individual constants of motion, which immediately derive from the changes in the state of the involved agents. Then, we find combinations of the individual constants of motion that are conserved quantities of all the interaction events and, therefore, are strictly conserved along the whole dynamics. In principle, these combinations could be arbitrary functions of the individual constants of motion, but we have mainly considered linear combinations, for which the procedure can be carried out systematically. Individual constants of motion can also be weighted by the probabilities of the corresponding events, and then linearly combined to get approximately conserved quantities, which fluctuate randomly around a well defined value as the system evolves. Exact and approximate constants of motion can finally be used to ease the analytical treatment by reducing the number of relevant independent variables. Comparison with their counterparts in a mean-field description of the dynamics also proves to be meaningful: in the appropriate limit, the values of stochastic and mean-field conserved quantities usually coincide with each other.
For the Maki-Thompson model of rumor propagation, which is defined by two possible interaction events with three accessible states, the above procedure yields two exact constants of motion. The first, trivial one is just the total number of agents. Together with the second constant of motion, it reduces the state space of the system to one single dimension which, using the master equation of the stochastic process, yields the full solution to the problem. Moreover, in the continuous-time limit for large systems, the values of the two constants of motion coincide with those found for the corresponding mean-field equations, even when their functional forms are not the same. Extensions of the Maki-Thompson model, adding intermediate states to the evolution of each agent, also contain two exact constants of motion. However, since the state space in now higher-dimensional, the usefulness of the conserved quantities in solving the problem is more limited.
In the SIR model of disease spreading, where agents can access three different states as well, the number of possible elementary events grows to three and, consequently, there is only one exact constant of motion, namely, the number of agents. However, it is still possible to find an approximate nontrivial conserved quantity. Its dynamics coincide with those of a symmetric random walker, so that its mean value remains constant while its standard deviation grows as the square root of the number of steps. Thus, this approximate constant of motion plays the same role, with respect to the evolution averaged over realizations, as the exact nontrivial conserved quantity of the Maki-Thompson model, and allows for the full solution to the stochastic problem in terms of the mean values of the relevant variables. Moreover, as in the case of rumor propagation, its value coincides with a constant of motion of the mean-field equations in the appropriate limit. Similar results are obtained for the SIR model evolving on random networks, although in this case the exact coincidence with the mean-field constant of motion is restricted to the case of regular networks.
Finally, we have considered a couple of stochastic processes in which the corresponding mean-field equations suggest the existence of conserved quantities given by nonlinear combinations of the constants of motion of the elementary events. In these cases, it was possible to show that a suitable extension of the mean-field conserved quantities to the level of the stochastic description does yield approximate constants of motion, although not all extensions successfully connect conserved quantities at the two levels.
Although the models for rumor and disease propagation considered in this paper provide a fair illustration of how conserved quantities in stochastic process yield useful information on their evolution, and give insight on the connection with mean-field descriptions, it is clear that these examples do not exhaust the possible uses of such techniques. Stochastic models for chemical reactions [5,27], biological population dynamics [28,29,30,31], and socioeconomic phenomena [11,32] are foreseeable fields of application of the same approach.

References

  1. Arnold, V. I. Mathematical Methods of Classical Mechanics; Springer: Berlin, Germany, 1989. [Google Scholar]
  2. Strogatz, S. H. Nonlinear Dynamics and Chaos, 3rd ed.; CRC Press: Boca Raton, FL, 2024. [Google Scholar]
  3. Jose, J. V.; Saletan, E. J. Classical Dynamics; Cambridge University Press: Cambridge, UK, 1998. [Google Scholar]
  4. Goldstein, H.; Poole, C. P.; Safko, J. L. Classical Mechanics, 3rd ed.; Addison-Wesley: Boston, MA, 2002. [Google Scholar]
  5. van Kampen, N. G. Stochastic Processes in Physics and Chemistry, 3rd ed.; North-Holland: Amsterdam, Netherlands, 2009. [Google Scholar]
  6. Reichl, L. E. A Modern Course in Statistical Physics, 4th ed.; Wiley-VCH: Weinheim, Germany, 2016. [Google Scholar]
  7. Haken, H. Synergetics: An Introduction; Springer: Berlin, Germany, 1983. [Google Scholar]
  8. Yablonsky, G. S.; Branco, D.; Marin, G. B.; Constales, D. New invariant expressions in chemical kinetics. Entropy 2020, 22, 373. [Google Scholar] [CrossRef] [PubMed]
  9. Morrison, P. J. Hamiltonian description of the ideal fluid. Rev. Mod. Phys. 1998, 70, 467–521. [Google Scholar] [CrossRef]
  10. Yoshida, Z. Kinetic theory with Casimir invariants – Toward understanding of self-organization by topological constraints. Entropy 2025, 27, 5. [Google Scholar] [CrossRef] [PubMed]
  11. Liggett, T. M. Stochastic Interacting Systems: Contact, Voter and Exclusion Processes; Springer: Berlin, Germany, 1999. [Google Scholar]
  12. Daley, D.; Kendall, D. G. Stochastic rumours. J. Inst. Math. Appl. 1965, 1, 42–55. [Google Scholar] [CrossRef]
  13. Maki, D. P.; Thompson,M.MathematicalModels and Applications; Prentice-Hall: Englewood Cliffs, NJ, 1973, Chap. 9.
  14. Sudbury, A. The proportion of the population never hearing a rumour. J. Appl. Prob. 1985, 22, 443–446. [Google Scholar] [CrossRef]
  15. Yang, S.; Liu, S.; Su, K.; Chen, J. A rumor propagation model considering media effect and suspicion mechanism under public emergencies. Mathematics 2024, 12, 1906. [Google Scholar] [CrossRef]
  16. Zanette, D. H. Dynamics of rumor propagation on small-world networks. Phys. Rev. E 2002, 65, 041908. [Google Scholar] [CrossRef] [PubMed]
  17. Nekovee, M.; Moreno, Y.; Bianconi, G.; Marsili, M. Theory of rumour spreading in complex social networks. Physica A 2007, 374, 457–470. [Google Scholar] [CrossRef]
  18. Su, Z.; Wang, A.; Gao, X; Li, T.; Zheng, Y. A dynamics-based model of multi-state rumor propagation with triple identities. Sci. Rep. 2025, 15, 39590. [Google Scholar] [CrossRef] [PubMed]
  19. Duan, Y.; Ganesh, A. The proportion of the population never hearing a rumour. Queueing Syst. 2021, 99, 231–241. [Google Scholar] [CrossRef]
  20. Anderson, R. M.; May, M. C. Infectious Diseases of Humans; Oxford University Press: Oxford, UK, 1991. [Google Scholar]
  21. Hethcote, H. W. The mathematics of infectious diseases. SIAM Rev. 2000, 42, 599–653. [Google Scholar] [CrossRef]
  22. Murray, J. D. Mathematical Biology, 3rd ed.; Springer: Berlin, Germany, 2002. [Google Scholar]
  23. Moreno, Y.; Pastor Satorras, R.; Vespignani, A. Epidemic outbreaks in complex heterogeneous networks. Eur. Phys. J. B 2002, 26, 521–529. [Google Scholar] [CrossRef]
  24. Boccaletti, S.; Latora, V.; Moreno, Y.; Chávez, M.; Hwang, D. U. Complex networks: Structure and dynamics. Phys. Rep. 2006, 424, 175–308. [Google Scholar] [CrossRef]
  25. Barrat, A.; Barthélemy, M.; Vespignani, A. Dynamical Processes on Complex Networks; Cambridge University Press: Cambridge, UK, 2008. [Google Scholar]
  26. Newman, M. Networks. An Introduction; Oxford University Press: Oxford, UK, 2018. [Google Scholar]
  27. Schnoerr, S.; Sanguinetti, G.; Grima, R. Comparison of different moment-closure approximations for stochastic chemical kinetics. J. Chem. Phys. 2015, 143, 185101. [Google Scholar] [CrossRef] [PubMed]
  28. McKane, A. J.; Newman, T. J. Stochastic models in population biology and their deterministic analogs. Phys. Rev. E 2004, 70, 041902. [Google Scholar] [CrossRef] [PubMed]
  29. Dobramysl, U.; Mobilia, M.; Pleimling, M.; Täuber, U. C. Stochastic population dynamics in spatially extended predator-prey systems. J. Phys. A: Math. Theor. 2018, 51, 063001. [Google Scholar] [CrossRef]
  30. Araujo, G. An evolutionary game theory for event-driven ecological population dynamics. Theory Biosci. 2025, 144, 95–105. [Google Scholar] [CrossRef] [PubMed]
  31. Nicoletti, G.; Padmanabha, P.; Azaele, S.; Suweis, S.; Rinaldo, A.; Maritan, A. Emergent encoding of dispersal network topologies in spatial metapopulation models. Proc. Natl. Acad. Sci. USA 2023, 120, e2311548120. [Google Scholar] [CrossRef] [PubMed]
  32. Akhmetzhanov, A. R.; Worden, L.; Dushoff, J. Effects of mixing in threshold models of social behavior. Phys. Rev. E 2013, 88, 012816. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Three realizations of the SIR stochastic process defined by the events of Table 4, with N = 100 , u = 0.3 , and initial conditions S 0 = N 1 and I 0 = 1 . In the main panel, curves show the evolution of the number of susceptible and infected agents, S n and I n , as a function of the evolution step n. Each color correspond to a single realization. Note that each realization ends when the number of infected agents reaches zero. Dashed curves represent the solutions of Eqs. (32) for the mean values S n and I n . The inset shows the evolution of the approximate constant of motion K ˜ n , Eq. (27), for the same realizations. The horizontal dashed line is the expected mean value, K ˜ n = S 0 + I 0 , and the dashed curves indicate the corresponding standard deviation, σ n , given by Eq. (29).
Figure 1. Three realizations of the SIR stochastic process defined by the events of Table 4, with N = 100 , u = 0.3 , and initial conditions S 0 = N 1 and I 0 = 1 . In the main panel, curves show the evolution of the number of susceptible and infected agents, S n and I n , as a function of the evolution step n. Each color correspond to a single realization. Note that each realization ends when the number of infected agents reaches zero. Dashed curves represent the solutions of Eqs. (32) for the mean values S n and I n . The inset shows the evolution of the approximate constant of motion K ˜ n , Eq. (27), for the same realizations. The horizontal dashed line is the expected mean value, K ˜ n = S 0 + I 0 , and the dashed curves indicate the corresponding standard deviation, σ n , given by Eq. (29).
Preprints 194317 g001
Figure 2. Three realizations of the SIR stochastic process defined by the events of Table 5, with N = 100 , u = 0.2 , and initial conditions S 0 = N 1 and I 0 = 1 . The system evolves on an Erdos-Rényi random network, different for each realization, with an average of z = 10 neighbors per site. In the main panel, curves show the evolution of the total number of susceptible and infected agents, S n and I n , as a function of the evolution step n. Each color correspond to a single realization. Dashed curves represent the mean values of S n and I n averaged over realizations of the evolution and the underlying network. for the same realizations, the inset shows the evolution of the approximate constant of motion K ˜ n ( 1 ) , given by Eq. (38) with γ = 1 . The horizontal dashed line is the expected mean value, K ˜ ( 1 ) n = z N .
Figure 2. Three realizations of the SIR stochastic process defined by the events of Table 5, with N = 100 , u = 0.2 , and initial conditions S 0 = N 1 and I 0 = 1 . The system evolves on an Erdos-Rényi random network, different for each realization, with an average of z = 10 neighbors per site. In the main panel, curves show the evolution of the total number of susceptible and infected agents, S n and I n , as a function of the evolution step n. Each color correspond to a single realization. Dashed curves represent the mean values of S n and I n averaged over realizations of the evolution and the underlying network. for the same realizations, the inset shows the evolution of the approximate constant of motion K ˜ n ( 1 ) , given by Eq. (38) with γ = 1 . The horizontal dashed line is the expected mean value, K ˜ ( 1 ) n = z N .
Preprints 194317 g002
Table 1. Events in the Maki-Thompson model. First column: each event represented as a chemical reaction between susceptible (S), infected (I), and refractory (R) agents. In the second row, { I , R } stands for either I or R. Second column: probability of each event. Third column: constants of motion associated with each state (S, I, and R) in each event.
Table 1. Events in the Maki-Thompson model. First column: each event represented as a chemical reaction between susceptible (S), infected (I), and refractory (R) agents. In the second row, { I , R } stands for either I or R. Second column: probability of each event. Third column: constants of motion associated with each state (S, I, and R) in each event.
event probability constants of motion
I + S I + I S n / ( N 1 ) S n + n , I n n , R n
I + { I , R } R + { I , R } 1 S n / ( N 1 ) S n , I n + n , R n n
Table 2. Events in the first extension of the Maki-Thompson model, where M transmission attempts to infected or refractory agents are needed for an infected agent to become refractory. In the first column, I indicates any of the I ( m ) . In the second column, I n = m = 0 M 1 I n ( m ) . For brevity, the third column only shows the constants of motion which combine numbers of agents and the index of the evolution step n. All the other numbers of agents are also constants of motion. The first and second rows hold for m = 0 , , M 1 and m = 0 , , M 2 , respectively. In the second and third rows, { I , R } stands for either I or R.
Table 2. Events in the first extension of the Maki-Thompson model, where M transmission attempts to infected or refractory agents are needed for an infected agent to become refractory. In the first column, I indicates any of the I ( m ) . In the second column, I n = m = 0 M 1 I n ( m ) . For brevity, the third column only shows the constants of motion which combine numbers of agents and the index of the evolution step n. All the other numbers of agents are also constants of motion. The first and second rows hold for m = 0 , , M 1 and m = 0 , , M 2 , respectively. In the second and third rows, { I , R } stands for either I or R.
event probability constants of motion
I ( m ) + S I ( m ) + I ( 0 ) I n ( m ) S n / I n ( N 1 ) S n + n , I n ( 0 ) n
I ( m ) + { I , R } I ( m + 1 ) + { I , R } I n ( m ) [ 1 S n / ( N 1 ) ] / I n I n ( m ) + n , I n ( m + 1 ) n
I ( M 1 ) + { I , R } R + { I , R } I n ( M 1 ) [ 1 S n / ( N 1 ) ] / I n I n ( M 1 ) + n , R n n
Table 3. As in Table 2, for the second extension of the Maki-Thompson model, where M transmission attempts to a susceptible agent are needed for the agent to become infected. In the second column, S n = m = 0 M 1 S n ( m ) . The first row holds for m = 0 , , M 2 .
Table 3. As in Table 2, for the second extension of the Maki-Thompson model, where M transmission attempts to a susceptible agent are needed for the agent to become infected. In the second column, S n = m = 0 M 1 S n ( m ) . The first row holds for m = 0 , , M 2 .
event probability constants of motion
I + S ( m ) I + S ( m + 1 ) S n ( m ) / ( N 1 ) S n ( m ) + n , S n ( m + 1 ) n
I + S ( M 1 ) I + I S n ( M 1 ) / ( N 1 ) S n ( M 1 ) + n , I n
I + { I , R } R + { I , R } 1 S n / ( N 1 ) I n + n , R n n
Table 4. As in Table 1 for the SIR epidemiological model.
Table 4. As in Table 1 for the SIR epidemiological model.
event probability constants of motion
I R u S n , I n + n , R n n
I + S I + I ( 1 u ) S n / ( N 1 ) S n + n , I n n , R n
I + { I , R } I + { I , R } ( 1 u ) [ 1 S n / ( N 1 ) ] S n , I n , R n
Table 5. Events in the SIR epidemiological model evolving on a random, degree-uncorrelated network. The first row holds for every value of the degree k. The second and third rows hold for every pair k, k . In the third row, { I ( k ) , R ( k ) } stands for either I ( k ) or R ( k ) , and N ( k ) is the total number of agents with degree k . Moreover, ϑ n = k k I n ( k ) and ζ n = ϑ n z ( N 1 ) are normalization constants, with z the mean number of neighbors per site. In the first two rows, for brevity, the third column only shows the constants of motion which combine numbers of agents and the index of the evolution step n. All the other numbers of agents are also constants of motion for both events.
Table 5. Events in the SIR epidemiological model evolving on a random, degree-uncorrelated network. The first row holds for every value of the degree k. The second and third rows hold for every pair k, k . In the third row, { I ( k ) , R ( k ) } stands for either I ( k ) or R ( k ) , and N ( k ) is the total number of agents with degree k . Moreover, ϑ n = k k I n ( k ) and ζ n = ϑ n z ( N 1 ) are normalization constants, with z the mean number of neighbors per site. In the first two rows, for brevity, the third column only shows the constants of motion which combine numbers of agents and the index of the evolution step n. All the other numbers of agents are also constants of motion for both events.
event probability constants of motion
I ( k ) R ( k ) u k I n ( k ) / ϑ n I n ( k ) + n , R n ( k ) n
I ( k ) + S ( k ) I ( k ) + I ( k ) ( 1 u ) k k I n ( k ) S n ( k ) / ζ n S n ( k ) + n , I n ( k ) n
I ( k ) + { I ( k ) , R ( k ) } I ( k ) + { I ( k ) , R ( k ) } ( 1 u ) k k I n ( k ) [ N ( k ) S n ( k ) ] / ζ n S n ( k ) , I n ( k ) , R n ( k ) k
Table 6. As in Table 1, for a variant of the Maki-Thompson model of rumor propagation where the contact of two infected agents results in both agents becoming refractory.
Table 6. As in Table 1, for a variant of the Maki-Thompson model of rumor propagation where the contact of two infected agents results in both agents becoming refractory.
event probability constants of motion
I + S I + I S n / ( N 1 ) S n + n , I n n , R n
I + I R + R ( I n 1 ) / ( N 1 ) S n , I n + 2 n , R n 2 n
I + R R + R R n / ( N 1 ) S n , I n + n , R n n
Table 7. As in Table 1, for a variant of the Maki-Thompson model of rumor propagation where the contact of two infected agents produces no change.
Table 7. As in Table 1, for a variant of the Maki-Thompson model of rumor propagation where the contact of two infected agents produces no change.
event probability constants of motion
I + S I + I S n / ( N 1 ) S n + n , I n n , R n
I + I I + I ( I n 1 ) / ( N 1 ) S n , I n , R n
I + R R + R R n / ( N 1 ) S n , I n + n , R n n
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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated