Advertisement

The Power of Local Information in Social Networks

  • Christian Borgs
  • Michael Brautbar
  • Jennifer Chayes
  • Sanjeev Khanna
  • Brendan Lucier
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7695)

Abstract

We study the power of local information algorithms for optimization problems on social and technological networks. We focus on sequential algorithms where the network topology is initially unknown and is revealed only within a local neighborhood of vertices that have been irrevocably added to the output set. This framework models the behavior of an external agent that does not have direct access to the network data, such as a user interacting with an online social network.

We study a range of problems under this model of algorithms with local information. When the underlying graph is a preferential attachment network, we show that one can find the root (i.e. initial node) in a polylogarithmic number of steps, using a local algorithm that repeatedly queries the visible node of maximum degree. This addresses an open question of Bollobás and Riordan. This result is motivated by its implications: we obtain polylogarithmic approximations to problems such as finding the smallest subgraph that connects a subset of nodes, finding the highest-degree nodes, and finding a subgraph that maximizes vertex coverage per subgraph size.

Motivated by problems faced by recruiters in online networks, we also consider network coverage problems on arbitrary graphs. We demonstrate a sharp threshold on the level of visibility required: at a certain visibility level it is possible to design algorithms that nearly match the best approximation possible even with full access to the graph structure, but with any less information it is impossible to achieve a non-trivial approximation. We conclude that a network provider’s decision of how much structure to make visible to its users can have a significant effect on a user’s ability to interact strategically with the network.

Keywords

Local Information Local Algorithm Online Social Network Preferential Attachment Good Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alon, N., Rubinfeld, R., Vardi, S., Xie, N.: Space-efficient local computation algorithms. In: SODA, pp. 1132–1139 (2012)Google Scholar
  2. 2.
    Andersen, R., Chung, F.R.K., Lang, K.J.: Local graph partitioning using pagerank vectors. In: FOCS, pp. 475–486 (2006)Google Scholar
  3. 3.
    Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Bollobás, B.: Mathematical results on scale-free random graphs. In: Handbook of Graphs and Networks: From the Genome to the Internet (2003)Google Scholar
  5. 5.
    Bollobás, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica 24(1), 5–34 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.E.: The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18(3), 279–290 (2001)zbMATHCrossRefGoogle Scholar
  7. 7.
    Brautbar, M., Kearns, M.: Local algorithms for finding interesting individuals in large networks. In: Innovations in Theoretical Computer Science (ITCS), pp. 188–199 (2010)Google Scholar
  8. 8.
    Doerr, B., Fouz, M., Friedrich, T.: Social networks spread rumors in sublogarithmic time. In: STOC, pp. 21–30 (2011)Google Scholar
  9. 9.
    Easley, D., Kleinberg, J.: Networks, Crowds, and Markets, reasoning about a Highly Connected World. Cambridge University Press (2010)Google Scholar
  10. 10.
    Faloutsos, C., McCurley, K.S., Tomkins, A.: Fast discovery of connection subgraphs. In: KDD, pp. 118–127 (2004)Google Scholar
  11. 11.
    Giakkoupis, G., Sauerwald, T.: Rumor spreading and vertex expansion. In: SODA, pp. 1623–1641 (2012)Google Scholar
  12. 12.
    Giakkoupis, G., Schabanel, N.: Optimal path search in small worlds: dimension matters. In: STOC, pp. 393–402 (2011)Google Scholar
  13. 13.
    Goldreich, O.: Introduction to Testing Graph Properties. In: Goldreich, O. (ed.) Property Testing. LNCS, vol. 6390, pp. 105–141. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  14. 14.
    Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374–387 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Hassidim, A., Kelner, J.A., Nguyen, H.N., Onak, K.: Local graph partitions for approximation and testing. In: FOCS, pp. 22–31 (2009)Google Scholar
  16. 16.
    Kleinberg, J.M.: The small-world phenomenon: an algorithm perspective. In: STOC, pp. 163–170 (2000)Google Scholar
  17. 17.
    Naor, M., Stockmeyer, L.: What can be computed locally? In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 184–193. ACM, New York (1993)CrossRefGoogle Scholar
  18. 18.
    Rubinfeld, R., Shapira, A.: Sublinear time algorithms. SIAM Journal on Discrete Math. 25, 1562–1588 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  19. 19.
    Rubinfeld, R., Tamir, G., Vardi, S., Xie, N.: Fast local computation algorithms. In: ITCS, pp. 223–238 (2011)Google Scholar
  20. 20.
    Spielman, D.A., Teng, S.-H.: A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. CoRR abs/0809.3232 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Christian Borgs
    • 1
  • Michael Brautbar
    • 2
  • Jennifer Chayes
    • 1
  • Sanjeev Khanna
    • 2
  • Brendan Lucier
    • 1
  1. 1.Microsoft Research New EnglandUSA
  2. 2.Computer and Information ScienceUniversity of PennsylvaniaUSA

Personalised recommendations