Multiple propagation paths enhance locating the source of diffusion in complex networks

January 09, 2019 Β· Declared Dead Β· πŸ› Physica A: Statistical Mechanics and its Applications

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Łukasz Gajewski, Krzysztof Suchecki, Janusz HoΕ‚yst arXiv ID 1901.02931 Category physics.soc-ph Cross-listed cs.SI Citations 15 Venue Physica A: Statistical Mechanics and its Applications Last Checked 3 months ago
Abstract
We investigate the problem of locating the source of diffusion in complex networks without complete knowledge of nodes' states. Some currently known methods assume the information travels via a single, shortest path, which by assumption is the fastest way. We show that such a method leads to the overestimation of propagation time for synthetic and real networks, where multiple shortest paths as well as longer paths between vertices exist. We propose a new method of source estimation based on maximum likelihood principle, that takes into account existence multiple shortest paths. It shows up to 1.6 times higher accuracy in synthetic and real networks.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted