Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Combinatorial Algorithms

IWOCA 2009: Combinatorial Algorithms pp 206–217Cite as

Combinatorial Models for Cooperation Networks

  • Conference paper

  • 702 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5874))

Abstract

We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These objects serve as models for random real world networks. It is shown that under a symmetry condition for the cluster sets a local-global principle for the degree distribution holds: the degrees given locally through the choice of the cluster sets directly affect the global degree distribution of the network. Furthermore, we show a superposition property when using clusters with different properties while building a thickened tree.

This research was supported by EU FP6-NEST-Adventure Programme, Contract n° 028875 (NEMO) and by the Austrian Science Foundation FWF, Project S9604.

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   54.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. Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Modern Phys. 74(1), 47–97 (2002)

    Article  MathSciNet  Google Scholar 

  2. Bergeron, F., Flajolet, P., Salvy, B.: Varieties of increasing trees. In: Raoult, J.-C. (ed.) CAAP 1992. LNCS, vol. 581, pp. 24–48. Springer, Heidelberg (1992)

    Google Scholar 

  3. Bollobás, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica 24(1), 5–34 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.: The degree sequence of a scale-free random graph process. Random Structures Algorithms 18(3), 279–290 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Drmota, M., Gittenberger, B., Panholzer, A.: The degree distribution of thickened trees. In: DMTCS Proceedings AI, pp. 149–162 (2008)

    Google Scholar 

  6. Flajolet, P., Odlyzko, A.M.: Singularity analysis of generating functions. SIAM Journal on Discrete Mathematics 3, 216–240 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  7. Flajolet, P., Soria, M.: General combinatorial schemas: Gaussian limit distributions and exponential tails. Discrete Math. 114(1-3), 159–180 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kuba, M., Panholzer, A.: On the degree distribution of the nodes in increasing trees. J. Combin. Theory Ser. A 114(4), 597–618 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  9. Mahmoud, H.M., Smythe, R.T., Szymański, J.: On the structure of random plane-oriented recursive trees and their branches. Random Structures Algorithms 4(2), 151–176 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  10. Pittel, B.: Note on the heights of random recursive trees and random m-ary search trees. Random Structures Algorithms 5(2), 337–347 (1994)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Discrete Mathematics and Geometry, TU Wien, Wiedner Hauptstr. 8–10, A-1040, Wien, Austria

    Michael Drmota, Bernhard Gittenberger & Reinhard Kutzelnigg

Authors
  1. Michael Drmota
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernhard Gittenberger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Reinhard Kutzelnigg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    Jiří Fiala  & Jan Kratochvíl  & 

  2. School of Electrical Engineering and Computer Science, The University of Newcastle, University Drive, NSW 2308, Callaghan, Australia

    Mirka Miller

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Drmota, M., Gittenberger, B., Kutzelnigg, R. (2009). Combinatorial Models for Cooperation Networks. In: Fiala, J., Kratochvíl, J., Miller, M. (eds) Combinatorial Algorithms. IWOCA 2009. Lecture Notes in Computer Science, vol 5874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10217-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10217-2_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10216-5

  • Online ISBN: 978-3-642-10217-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation