The Node Vector Distance Problem in Complex Networks

  • Michele Coscia, Andres Gomez-Lievano, James Mcnerney, Frank Neffke
  • ACM Computing Surveys, November 2021, ACM (Association for Computing Machinery)
  • DOI: 10.1145/3416509

Estimating the distance of propagation events on networks

Photo by Alina Grubnyak on Unsplash

Photo by Alina Grubnyak on Unsplash

What is it about?

This paper presents a collection of techniques that estimate how far a propagation event went on a network. A propagation event could be a disease infecting individuals on a social network, a word-of-mouth marketing campaign on a social media, or a power failure over the electricity grid.

Why is it important?

The problem of estimating the distance between two nodes on a network is well understood, studied, and has countless application scenario. Estimating the distance between two sets of nodes is equally important and applicable, but we do not have a comprehensive understanding of the problem. This paper sheds light on this problem, classifying the various solutions that have been proposed in the literature, and advancing a few new ones.

Read Publication

http://dx.doi.org/10.1145/3416509

The following have contributed to this page: Michele Coscia

In partnership with:

Link to ACM (Association for Computing Machinery) showcase

join the fight against climate change

Our simple summaries of climate research help you take action

Read now

climate-change.info