Papers
Topics
Authors
Recent
Search
2000 character limit reached

Daley–Kendall Rumor Model Analysis

Updated 1 December 2025
  • The Daley–Kendall rumor model is a mathematical framework that partitions a closed population into ignorants, spreaders, and stiflers to study information dynamics.
  • It uses quadratic interaction terms and deterministic ODE approximations to capture transitions, revealing key threshold phenomena and final size relations.
  • Advanced extensions incorporate stochastic processes, non-Markovian delays, and network topology effects to refine predictions of rumor propagation.

The Daley–Kendall rumor model is a foundational mathematical framework for the analysis of information propagation dynamics in closed populations, structurally analogous to SIR epidemic models but characterized by stifling mechanisms unique to rumor processes. The model partitions individuals into ignorants, spreaders, and stiflers and employs quadratic interaction terms to capture the competition between rumor transmission and cessation. Advanced limit theorems, network generalizations, and non-Markovian extensions frame its contemporary treatment in the literature.

1. Model Definition and Governing Equations

The DK rumor model operates on a closed, homogeneously-mixed population of size NN (or N+1N+1 in some conventions). Each individual occupies one of three mutually exclusive states:

  • Ignorant (II): Has not heard the rumor.
  • Spreader (SS): Actively propagates the rumor.
  • Stifler (RR): Knows the rumor but refuses to spread it.

The discrete-time process is modeled by a continuous-time Markov chain, or, in the infinite-population limit, by deterministic ODEs. Let I(t)I(t), S(t)S(t), R(t)R(t) denote the fractions (or counts) of ignorants, spreaders, and stiflers at time tt; the normalization I(t)+S(t)+R(t)=1I(t)+S(t)+R(t)=1 applies throughout. The mean-field evolution is:

N+1N+10

where N+1N+11 is the transmission rate and N+1N+12 governs conversion of spreaders into stiflers via either N+1N+13–N+1N+14 or N+1N+15–N+1N+16 encounters (0807.1458, Lebensztayn et al., 2010). The quadratic terms N+1N+17 encapsulate the dual mechanism of stifling—spreaders cease spreading when encountering either other spreaders or stiflers.

2. Stochastic Formulation and Limit Theorems

On a finite population, the DK process is a density-dependent continuous-time Markov chain. Three fundamental transitions define its generator:

  • N+1N+18 (ignorant becomes spreader)
  • N+1N+19 (initiating spreader becomes stifler)
  • II0 (spreader becomes stifler)

The fluid limit as II1 leads to the deterministic ODE system above. Rigorous convergence results hold:

Extensions to non-Markovian delay mechanisms alter DK’s evolution from ODEs to Volterra integral equations, replacing memoryless transitions with general sojourn and incubation times. Functional LLN and CLT results obtain in this setting, with explicit characterizations of variance kernels and asymptotic behavior (Coletti et al., 2024).

3. Analytical Structure, First Integral, and Phase Portrait

The classical DK ODE admits both explicit and implicit solutions. Detailed phase-plane analysis yields:

  • First Integral (Hamiltonian): II4 is invariant along trajectories, partitioning the phase triangle into non-crossing orbits (Ragagnin, 2016).
  • General Solution: II5 is expressed implicitly as a function of II6 via II7 for some constant II8 fixed by initial conditions. The passage of time parametrizes the trajectory in integral form.
  • Final Size Relation: The terminal state II9 solves the transcendental equation arising from the first integral, refining earlier asymptotic “final size” formulas and offering precise computation of outbreak impact (Ragagnin, 2016).

Stability analysis along the SS0 equilibrium segment reveals a threshold SS1 demarcating Lyapunov-stable equilibria—solutions approach rest states along constant-level Hamiltonian contours.

4. Network Topology and Generalizations

The DK model’s homogeneous-mixing assumptions are subject to rigorous extension on complex networks:

  • Degree-based Mean-field: For populations structured by degree SS2, state fractions SS3 follow block-wise ODEs accounting for neighbor distributions as SS4 (Naimi et al., 2013, 0807.1458).
  • Generalized Stifling Rates: The DK framework admits splitting SS5 into SS6 (spreader–spreader stifling) and SS7 (spreader–stifler stifling). This separation reveals distinct roles: SS8 controls outbreak tempo/peak, SS9 governs coverage/final reach (Naimi et al., 2013).
  • Threshold Phenomena: In random graphs and homogeneous networks, the critical threshold for rumor propagation is RR0 (DK with RR1), but with forgetting (RR2), it becomes RR3. On uncorrelated scale-free networks, RR4 as RR5 (0807.1458).
  • Assortativity and Topology Effects: Assortative mixing (positive degree correlations) speeds up initial rumor spread but impacts final reach variably depending on RR6; scale-free networks are characterized by super-spreader dynamics and nontrivial outbreak thresholds (0807.1458).

Generalizations incorporate heterogeneous subgroups (multiple spreader/stifler classes) with individualized transmission and stifling rates to reflect behavioral diversity in real-world informational epidemics (Isea et al., 2016).

5. Performance Metrics, Asymptotic Behavior, and Peak Characterization

Principal outcomes of the DK model include the quantification of reliability and efficiency:

  • Reliability: Final fraction of stiflers RR7 is computed via degree distributions and auxiliary integrals (e.g., RR8). In homogeneous mixing, RR9 links directly to the final value of this accumulation (Naimi et al., 2013).
  • Efficiency: Determined by the extinction time of spreaders, i.e., the time required for I(t)I(t)0 to drop below threshold or I(t)I(t)1 to saturate (Naimi et al., 2013).
  • Maximum Spreaders/Peak: The maximum proportion of spreaders during the process, I(t)I(t)2 a.s. as I(t)I(t)3 in the classical DK and Maki–Thompson models (Lebensztayn et al., 10 Jul 2025). Probabilistic variants (with parameters I(t)I(t)4, I(t)I(t)5) yield modified peak heights, with higher stifling probability I(t)I(t)6 or lower transmission probability I(t)I(t)7 reducing the peak magnitude.

A random time-change argument and density-dependent limit theorem (Ethier–Kurtz) underpin the almost-sure convergence of peak spreader proportions.

6. Quasi-Stationary and Pre-Absorption Dynamics

Absorption occurs when all spreaders vanish (I(t)I(t)8). Quasi-stationary distribution (QSD) analysis reveals:

  • Classical QSD is trivial—all mass at I(t)I(t)9 (single ignorant left with one spreader)—but modified absorption conditioning (e.g., killing at S(t)S(t)0 on first return) admits nontrivial QSDs with explicit path-sum formulas for occupation densities (Ben-Ari et al., 28 Nov 2025).
  • The ratio-of-expectations distribution (mean occupation measure before absorption) is a more informative pre-absorption stochastic descriptor, especially for transient analysis (Ben-Ari et al., 28 Nov 2025).

Large-deviation and saddle-point techniques approximate QSDs for large S(t)S(t)1, recovering deterministic DK trajectories as distribution peaks.

7. Structural Properties, Graph-Theoretic Classification, and Extensions

The DK model embeds naturally in broader interaction-driven ODE frameworks governed by the dependency graph of state interactions:

  • Graph-theoretic Monotonicity: Transition graph as DAG; dependency graph conditions guarantee convergence to equilibrium S(t)S(t)2, exponential decay of transient states, and finite total exposure (i.e., S(t)S(t)3) (Chan et al., 4 Nov 2025).
  • Robustness and Modifications: Removing edges in the dependency graph can transition decay rates from exponential to algebraic; small structural changes induce qualitative flips in asymptotic behavior.
  • Heterogeneities and Couplings: DK generalizations accommodate multiple spreader/stifler subpopulations, time-varying rates, or coupling to epidemic processes (rumor-dependent SIR), reshaping equilibrium and outbreak characteristics (Isea et al., 2016, Chan et al., 4 Nov 2025).

These abstractions support systematic exploration of rumor dynamics in epidemiological, social, and network-theoretic contexts.


Summary Table: Central Mechanisms and Equations in the DK Model

Mechanism/Parameter DK Equation / Structure Reference
Ignorant–Spreader (SI) S(t)S(t)4 (0807.1458, Lebensztayn et al., 2010)
Spreader–Stifler (SR) S(t)S(t)5 (0807.1458, Naimi et al., 2013)
Stifler Formation S(t)S(t)6 (0807.1458, Lebensztayn et al., 2010)
Peak Spreaders S(t)S(t)7 (Lebensztayn et al., 10 Jul 2025)
First Integral S(t)S(t)8 (see section 3 above) (Ragagnin, 2016)
Reliability, Efficiency S(t)S(t)9, Extinction Time (Naimi et al., 2013, 0807.1458)

The Daley–Kendall rumor model remains central in rigorous studies of information propagation and stochastic rumor dynamics. Its analytic tractability, extensive theoretical underpinnings, and sensitivity to structural and probabilistic extensions make it a canonical tool for understanding spreading phenomena in both abstract and real-world network contexts.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Daley--Kendall Rumor Model.