Advertisement

On the Growth of Large Independent Sets in Scale-Free Networks

Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 289)

Abstract

Independent sets are sets of mutually non-adjacent vertices of a network. For example, independent sets in social networks represent groups of people, who do not know anybody else within the group. In this paper, we investigate the growth of large independent sets in the famous Barabási-Albert (BA) model of scale-free complex networks. We formulate recurrent relations describing the cardinality of typical large independent sets and show that this cardinality seems to scale linearly with network size. This holds not only for the original BA model, where a new vertex brings a constant number of edges to the network, but also when the number of incoming edges is just bounded from above by a constant. Our finding is of a fundamental importance for community detection problems, since vertices of an independent set are naturally unlikely to belong to the same community. In other words, the number of communities in scale-free networks seems to be bounded from below by a linear function of network size.

Keywords

independent sets complex networks scale-free networks 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47–97 (2002)CrossRefMATHGoogle Scholar
  2. 2.
    Andrade, D.V., Resende, M.G.C., Werneck, R.F.: Fast local search for the maximum independent set problem. J. Heuristics 18(4), 525–547 (2012)CrossRefGoogle Scholar
  3. 3.
    Barabási, A.L.: Scale-free networks: A decade and beyond. Science 325(5939), 412–413 (2009)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Burguillo, J.C., Dorronsoro, B.: Using complex network topologies and self-organizing maps for time series prediction. In: Zelinka, I., Chen, G., Rössler, O.E., Snasel, V., Abraham, A. (eds.) Nostradamus 2013: Prediction, Model. & Analysis. AISC, vol. 210, pp. 323–332. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  6. 6.
    Dubec, P., Plucar, J., Rapant, L.: Case study of evolutionary process visualization using complex networks. In: Zelinka, I., Chen, G., Rössler, O.E., Snasel, V., Abraham, A. (eds.) Nostradamus 2013: Prediction, Model. & Analysis. AISC, vol. 210, pp. 125–135. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  7. 7.
    Feo, T.A., Resende, M.G.C., Smith, S.H.: A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42(5), 860–878 (1994)CrossRefMATHGoogle Scholar
  8. 8.
    Halldórsson, M.M., Radhakrishnan, J.: Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica 18(1), 145–163 (1997)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Proceedings of a Symposium on the Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)CrossRefGoogle Scholar
  10. 10.
    Leskovec, J., Lang, K.J., Mahoney, M.W.: Empirical comparison of algorithms for network community detection. In: Rappa, M., Jones, P., Freire, J., Chakrabarti, S. (eds.) Proceedings of the 19th International Conference on World Wide Web, WWW 2010, pp. 631–640. ACM, New York (2010)CrossRefGoogle Scholar
  11. 11.
    Luby, M.: A simple parallel algorithm for the maximal independent set problem. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 1–10. ACM, New York (1985)CrossRefGoogle Scholar
  12. 12.
    Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27–64 (2007)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Watts, D.J.: Small Worlds. Princeton University Press (1999)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Institute of Applied Informatics, Faculty of Informatics and Information TechnologiesSlovak University of TechnologyBratislavaSlovakia

Personalised recommendations