Skip to main content
SpringerLink
Log in
Book cover

Intelligent Information Systems Symposium

IIS 2013: Language Processing and Intelligent Information Systems pp 234–244Cite as

Study on the Estimation of the Bipartite Graph Generator Parameters

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7912))

Abstract

One of possible ways of studying dynamics of real life networks is to identify models of network growth that fit a given network.

In this paper, we consider the evolution of bipartite graphs generated from graph generator proposed in [1]. We propose a method of capturing generator parameters from the network and evaluate it on artificial networks generated from the very same generator.

It seems possible to discover these parameters from the network to an extent allowing for generation of similar graphs in terms of several graph metrics.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chojnacki, S.: Analiza technicznych własności systemów rekomendujących za pomocą algorytmów losowych. PhD thesis, Institute of Computer Science, Polish Academy of Sciences, Warsaw, English title: Analysis of Technical Properties of Recommender Systems with Random Graphs (2012)

    Google Scholar 

  2. Krebs, V.E.: Uncloaking terrorist networks. First Monday 7(4) (2002)

    Google Scholar 

  3. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, KDD 2005, pp. 177–187. ACM, New York (2005)

    Chapter  Google Scholar 

  4. Berger-Wolf, T.Y., Saia, J.: A framework for analysis of dynamic social networks. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2006, pp. 523–528. ACM, New York (2006)

    Chapter  Google Scholar 

  5. Kumar, R., Novak, J., Tomkins, A.: Structure and evolution of online social networks. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2006, pp. 611–617. ACM, New York (2006)

    Chapter  Google Scholar 

  6. Birmelé, E.: A scale-free graph model based on bipartite graphs. Discrete Appl. Math. 157(10), 2267–2284 (2009)

    Google Scholar 

  7. Zheleva, E., Sharara, H., Getoor, L.: Co-evolution of social and affiliation networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2009, pp. 1007–1016. ACM, New York (2009)

    Chapter  Google Scholar 

  8. Guillaume, J.L., Latapy, M.: Bipartite structure of all complex networks. Inf. Process. Lett. 90(5), 215–221 (2004)

    Google Scholar 

  9. Erdös, P., Rényi, A.: On the evolution of random graphs. In: Publication of The Mathematical Institute of the Hungarian Academy of Sciences, pp. 17–61 (1960)

    Google Scholar 

  10. Barabasi, A.: Linked - how everything is connected to everything else and what it means for business, science, and everyday life. Plume (2003)

    Google Scholar 

  11. Vázquez, A.: Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations. Phys. Rev. E 67, 056104 (2003)

    Google Scholar 

  12. White, D.R., Kejzar, N., Tsallis, C., Farmer, D., White, S.: Generative model for feedback networks. Phys. Rev. E 73(1) (January 2006)

    Google Scholar 

  13. Liu, Z., Lai, Y.C., Ye, N., Dasgupta, P.: Connectivity distribution and attack tolerance of general networks with both preferential and random attachments. Physics Letters A 303(5-6), 337–344 (2002)

    Article  MATH  Google Scholar 

  14. Fotouhi, B., Rabbat, M.G.: Network growth with arbitrary initial conditions: Analytical results for uniform and preferential attachment. CoRR abs/1212.0435 (December 2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Polish Academy of Sciences, ul. Jana Kazimierza 5, 01-237, Warsaw, Poland

    Robert A. Kłopotek

Authors
  1. Robert A. Kłopotek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, Polish Academy of Sciences, ul. Jana Kazimierza 5, 01-248, Warsaw, Poland

    Mieczysław A. Kłopotek , Jacek Koronacki , Małgorzata Marciniak  & Agnieszka Mykowiecka , ,  & 

  2. Institute of Computer Science, Polish Academy of Sciences, ul. Brzegi 55, 80-045, Gdańsk, Poland

    Sławomir T. Wierzchoń

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kłopotek, R.A. (2013). Study on the Estimation of the Bipartite Graph Generator Parameters. In: Kłopotek, M.A., Koronacki, J., Marciniak, M., Mykowiecka, A., Wierzchoń, S.T. (eds) Language Processing and Intelligent Information Systems. IIS 2013. Lecture Notes in Computer Science, vol 7912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38634-3_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38634-3_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38633-6

  • Online ISBN: 978-3-642-38634-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation