Cargando…
Efficient message passing for cascade size distributions
How big is the risk that a few initial failures of networked nodes amplify to large cascades that endanger the functioning of the system? Common answers refer to the average final cascade size. Two analytic approaches allow its computation: (a) (heterogeneous) mean field approximation and (b) belief...
Autor principal: | Burkholz, Rebekka |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6484029/ https://www.ncbi.nlm.nih.gov/pubmed/31024066 http://dx.doi.org/10.1038/s41598-019-42873-9 |
Ejemplares similares
-
Explicit size distributions of failure cascades redefine systemic risk on finite networks
por: Burkholz, Rebekka, et al.
Publicado: (2018) -
Efficiently passing messages in distributed spiking neural network simulation
por: Thibeault, Corey M., et al.
Publicado: (2013) -
Correlations between thresholds and degrees: An analytic approach to model attacks and failure cascades
por: Burkholz, Rebekka, et al.
Publicado: (2018) -
Message Passing and Metabolism
por: Parr, Thomas
Publicado: (2021) -
Sequence alignment by passing messages
por: Yoon, Byung-Jun
Publicado: (2014)