2013
DOI: 10.1007/s00285-013-0744-9
|View full text |Cite
|
Sign up to set email alerts
|

Spreading dynamics on complex networks: a general stochastic approach

Abstract: Dynamics on networks is considered from the perspective of Markov stochastic processes. We partially describe the state of the system through network motifs and infer any missing data using the available information. This versatile approach is especially well adapted for modelling spreading processes and/or population dynamics. In particular, the generality of our systematic framework and the fact that its assumptions are explicitly stated suggests that it could be used as a common ground for comparing existin… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(16 citation statements)
references
References 36 publications
0
16
0
Order By: Relevance
“…A mean-field description of the time evolution can be written in the spirit of existing formalisms (18,29). Here we give a brief description of how the mean-field equations are obtained and provide the full system in SI Appendix.…”
Section: Network Structure and Epidemic Dynamicsmentioning
confidence: 99%
“…A mean-field description of the time evolution can be written in the spirit of existing formalisms (18,29). Here we give a brief description of how the mean-field equations are obtained and provide the full system in SI Appendix.…”
Section: Network Structure and Epidemic Dynamicsmentioning
confidence: 99%
“…We follow the system through a heterogeneous mean-field approximation, where individuals are distinguished by their states (S or I) and by their number of connections (degree k ). This formalism allows us to describe the evolution of both the epidemics and the underlying network even in the presence of significant heterogeneity [ 14 18 ]. The mean-field approximation is given by and where Θ si and Θ is are mean-field quantities giving the average probability that a link stemming from a susceptible (infectious) node leads to an infectious (susceptible) node, respectively.…”
Section: Resultsmentioning
confidence: 99%
“…Connectivity patterns beyond edges are commonly described in terms of small subgraphs called motifs (or graphlets). There is increasing interest in algorithmic methods to count motifs [6,7,8,9,10], or the relation between motifs and network functions, like the spread of epidemics [11,12,13,14,15,16]. Motifs can describe the tendency for clustering and other forms of network organization [17,18,19].…”
Section: Introductionmentioning
confidence: 99%