Spreading on a complex network avoiding certain motifs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Spreading of either information or matter can often be treated as a network problem. It can be of great importance to be able to estimate the likelihood that spreading through a network reaches essentially the entire network while still not reaching certain sub-classes of the network. We show that excluding nodes and edges from the network has a subtle effect on the percolation. We study two specific examples of degree distributions (exponential and scale free) for which analytical solutions can be obtained. The two cases exhibit qualitatively different behavior.
4 pages, 3 figures

Keywords

Disordered Systems and Neural Networks, Statistical Mechanics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/222521

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0903.1199
 http://arxiv.org/abs/0903.1199

Collections

arXiv