We study stochastic pairwise interaction network systems whereby a finite population of agents, identified with the nodes of a (directed) graph, update their states in response to both individual mutations and pairwise interactions with their neighbors. The considered class of systems includes the main epidemic models —such as the SIS, SIR, and SIRS models—, certain social dynamics models —such as the voter and antivoter models—, as well as evolutionary dynamics on graphs. Since these stochastic systems fall into the class of finite-state Markov chains, they always admit stationary distributions. We analyze the asymptotic behavior of the stationary distributions of stochastic pairwise interaction network systems in the limit as the population size grows large, while the interaction network maintains certain mixing properties. Our approach relies on the use of Lyapunov-type functions to obtain concentration results on these stationary distributions. Notably, our results are not limited to fully mixed population models, as they do apply to a much broader spectrum of interaction network structures, including, e.g., Erdos-Renyi random graphs.

An invariance principle based concentration result for large-scale stochastic pairwise interaction network systems

Sandro Zampieri
2026

Abstract

We study stochastic pairwise interaction network systems whereby a finite population of agents, identified with the nodes of a (directed) graph, update their states in response to both individual mutations and pairwise interactions with their neighbors. The considered class of systems includes the main epidemic models —such as the SIS, SIR, and SIRS models—, certain social dynamics models —such as the voter and antivoter models—, as well as evolutionary dynamics on graphs. Since these stochastic systems fall into the class of finite-state Markov chains, they always admit stationary distributions. We analyze the asymptotic behavior of the stationary distributions of stochastic pairwise interaction network systems in the limit as the population size grows large, while the interaction network maintains certain mixing properties. Our approach relies on the use of Lyapunov-type functions to obtain concentration results on these stationary distributions. Notably, our results are not limited to fully mixed population models, as they do apply to a much broader spectrum of interaction network structures, including, e.g., Erdos-Renyi random graphs.
2026
   Extracting Essential Information and Dynamics from Complex Networks
   MIUR
   PRIN
   2022MBC2EZ
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/3580718
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? ND
  • OpenAlex 0
social impact