Degree Distribution of the FKP Network Model

  • Noam Berger
  • Béla Bollobás
  • Christian Borgs
  • Jennifer Chayes
  • Oliver Riordan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2719)


Recently, Fabrikant, Koutsoupias and Papadimitriou [7] introduced a natural and beautifully simple model of network growth involving a trade-off between geometric and network objectives, with relative strength characterized by a single parameter which scales as a power of the number of nodes. In addition to giving experimental results, they proved a power-law lower bound on part of the degree sequence, for a wide range of scalings of the parameter. Here we prove that, despite the FKP results, the overall degree distribution is very far from satisfying a power law.

First, we establish that for almost all scalings of the parameter, either all but a vanishingly small fraction of the nodes have degree 1, or there is exponential decay of node degrees. In the former case, a power law can hold for only a vanishingly small fraction of the nodes. Furthermore, we show that in this case there is a large number of nodes with almost maximum degree. So a power law fails to hold even approximately at either end of the degree range. Thus the power laws found in [7] are very different from those given by other internet models or found experimentally [8].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Rev. Mod. Phys. 74 (2002), 47–97.CrossRefGoogle Scholar
  2. 2.
    A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509–512.CrossRefMathSciNetGoogle Scholar
  3. 3.
    B. Bollobás and O.M. Riordan, The diameter of a scale-free random graph, to appear in Combinatorica. (Preprint available from Scholar
  4. 4.
    B. Bollobás and O. Riordan, Mathematical results on scale-free random graphs, in Handbook of Graphs and Networks, Stefan Bornholdt and Heinz Georg Schuster (eds.), Wiley-VCH, Weinheim (2002), 1–34.CrossRefGoogle Scholar
  5. 5.
    J.M. Carlson and J. Doyle, Highly optimized tolerance: a mechanism for power laws in designed systems. Phys. Rev. E 60 (1999), 1412–1427.CrossRefGoogle Scholar
  6. 6.
    S.N. Dorogovtsev and J.F.F. Mendes, Evolution of networks, Adv. Phys. 51 (2002), 1079.CrossRefGoogle Scholar
  7. 7.
    A. Fabrikant, E. Koutsoupias and C.H. Papadimitriou, Heuristically optimized trade-offs: a new paradigm for power laws in the internet ICALP 2002, LNCS 2380, pp. 110–122.Google Scholar
  8. 8.
    M. Faloutsos, P. Faloutsos and C. Faloutsos, On power-law relationships of the internet topology, SIGCOMM 1999, Comput. Commun. Rev. 29 (1999), 251.CrossRefGoogle Scholar
  9. 9.
    R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins and E. Upfal, Stochastic models for the web graph, FOCS 2000.Google Scholar
  10. 10.
    H.M. Mahmoud and R.T. Smythe, A survey of recursive trees, Th. of Probability and Math. Statistics 51 (1995), 1–27.MathSciNetGoogle Scholar
  11. 11.
    M.D. Penrose, A strong law for the largest nearest-neighbour link between random points, J. London Math. Soc. (2) 60 (1999), 951–960.MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    M.D. Penrose, A strong law for the longest edge of the minimal spanning tree. Ann. Probab. 27 (1999), 246–260.MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    B. Pittel, Note on the heights of random recursive trees and random m-ary search trees, Random Struct. Alg. 5 (1994), 337–347.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Noam Berger
    • 1
  • Béla Bollobás
    • 2
    • 3
    • 5
  • Christian Borgs
    • 4
  • Jennifer Chayes
    • 4
  • Oliver Riordan
    • 3
    • 5
  1. 1.Department of StatisticsUniversity of CaliforniaBerkeley
  2. 2.Department of Mathematical SciencesUniversity of MemphisMemphis
  3. 3.Trinity CollegeCambridgeUK
  4. 4.Microsoft ResearchRedmond
  5. 5.Department of Pure MathematicsCambridge

Personalised recommendations