The probabilities of node-to-node diffusion in fixed networks

Maia King

No dfq8y, SocArXiv from Center for Open Science

Abstract: Network transmission of infection or information can have serious social, economic and political effects. Heuristics are often used to address the computationally hard optimal seeding problem, and to approximate SIR models of epidemics. This paper develops a new heuristic for the probabilities of node-to-node diffusion in networks. The simple formula uses De Morgan’s laws to eliminate the double counting of signals found in diffusion centrality. It provides a new measure of centrality — word-of-mouth centrality — which gives the average probability that a signal emitted by a node will be received by other nodes in the network by diffusion. The paper also gives two further centrality measures for the cases when some nodes obstruct or conceal signals, called obstructed centrality and visibility centrality.

Date: 2020-05-05
New Economics Papers: this item is included in nep-net
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://osf.io/download/5eb13b7b62d4ab01396c4d75/

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:osf:socarx:dfq8y

DOI: 10.31219/osf.io/dfq8y

Access Statistics for this paper

More papers in SocArXiv from Center for Open Science
Bibliographic data for series maintained by OSF ().