Manos Papagelis
Francesco Bonchi
Aristides Gionis
ABSTRACT
Small changes in the network topology can have dramatic effects on its capacity to disseminate information. In this paper, we consider the problem of adding a small number of ghost edges in the network in order to minimize the average shortest-path distance between nodes, towards a smaller-world network. We formalize the problem of suggesting ghost edges and we propose a novel method for quickly evaluating the importance of ghost edges in sparse graphs. Through experiments on real and synthetic data sets, we demonstrate that our approach performs very well, for a varying range of conditions, and it outperforms sensible baselines.
- E. D. Demaine and M. Zadimoghaddam. Minimizing the diameter of a network using shortcut edges. In SWAT, 2010. Google Scholar
Digital Library
- K. P. Eswaran and R. E. Tarjan. Augmentation problems. SIAM J. Comput., 5(4), 1976.Google Scholar
- S. Kandula and R. Mahajan. Sampling biases in network path measurements and what to do about it. In IMC, 2009. Google ScholarDigital Library
- J. Kleinberg. The small-world phenomenon: an algorithm perspective. In STOC, 2000. Google ScholarDigital Library
- A. Meyerson and B. Tagiku. Minimizing average shortest path distances via shortcut edge addition. In APPROX-RANDOM, 2009. Google ScholarDigital Library
- Y. Tian, Q. He, Q. Zhao, X. Liu, and W.-c. Lee. Boosting social network connectivity with link revival. In CIKM, 2010. Google ScholarDigital Library
- T. Watanabe and A. Nakamura. Edge-connectivity augmentation problems. J. Comput. Syst. Sci., 35, 1987. Google ScholarDigital Library
Index Terms
- Suggesting ghost edges for a smaller world
Recommendations
Refining Social Graph Connectivity via Shortcut Edge Addition
Small changes on the structure of a graph can have a dramatic effect on its connectivity. While in the traditional graph theory, the focus is on well-defined properties of graph connectivity, such as biconnectivity, in the context of a social graph, ...
Weight assignment on edges towards improved community detection
IDEAS '19: Proceedings of the 23rd International Database Applications & Engineering SymposiumDuring the last few decades the problem of community detection in social networks has become an important and challenging computational task. Consequently, a number of algorithms have been proposed in the relevant literature, some of which seem to solve ...
Stability of small-world networks of neural populations
At large scales the brain is a complex network of anatomical structures, or neural populations, with the small-world characteristics of dense local clustering between neighboring populations and a short path length between any two populations. There ...
Comments