A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence

  • Colin Cooper
  • Tomasz Radzik
  • Yiannis Siantos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7323)

Abstract

We develop a fast method for finding all high degree vertices of a connected graph with a power law degree sequence. The method uses a biassed random walk, where the bias is a function of the power law c of the degree sequence.

Let G(t) be a t-vertex graph, with degree sequence power law c ≥ 3 generated by a generalized preferential attachment process which adds m edges at each step. Let S a be the set of all vertices of degree at least t a in G(t). We analyze a biassed random walk which makes transitions along undirected edges {x,y} proportional to (d(x)d(y)) b , where d(x) is the degree of vertex x and b > 0 is a constant parameter. Choosing the parameter b = (c − 1)(c − 2)/(2c − 3), the random walk discovers the set S a completely in \(\widetilde{O}(t^{1-2ab(1-\epsilon)})\) steps with high probability. The error parameter ε depends on c,a and m. We use the notation \(\tilde O(x)\) to mean O(x log k x) for some constant k > 0.

The cover time of the entire graph G(t) by the biassed walk is \(\widetilde{O}(t)\). Thus the expected time to discover all vertices by the biassed walk is not much higher than in the case of a simple random walk Θ(t logt).

The standard preferential attachment process generates graphs with power law c = 3. Choosing search parameter b = 2/3 is appropriate for such graphs. We conduct experimental tests on a preferential attachment graph, and on a sample of the underlying graph of the www with power law c ~3 which support the claimed property.

Keywords

Random Walk Degree Distribution Preferential Attachment Degree Sequence Cover Time 
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.
    Achlioptas, D., Clauset, A., Kempe, D., Moore, C.: On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. J. ACM 56(4) (2009)Google Scholar
  2. 2.
    Aldous, D., Fill, J.A.: Reversible Markov chains and random walks on graphs (1995), http://stat-www.berkeley.edu/pub/users/aldous/RWG/book.html
  3. 3.
    Baeza-Yates, R., Castillo, C., Marin, M., Rodriguez, A.: Crawling a country: Better strategies than breadth-first for web page ordering. In: Proc. 14th International Conference on World Wide Web, pp. 864–872. ACM Press (2005)Google Scholar
  4. 4.
    Barabási, A., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.: The degree sequence of a scale-free random graph process. Random Structures and Algorithms 18, 279–290 (2001)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Brautbar, M., Kearns, M.: Local algorithms for finding interesting individuals in large networks. In: Proceedings of ICS 2010, pp. 188–199 (2010)Google Scholar
  7. 7.
    Cooper, C.: The age specific degree distribution of web-graphs. Combinatorics Probability and Computing 15, 637–661 (2006)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Cooper, C., Frieze, A.: A general model web graphs. Random Structures and Algorithms 22(3), 311–335 (2003)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Cooper, C., Frieze, A.: The cover time of the preferential attachment graphs. Journal of Combinatorial Theory B(97), 269–290 (2007)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Flaxman, A.D., Vera, J.: Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 1–15. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: A walk in Facebook: Uniform sampling of users in online social networks. CoRR, abs/0906.0060 (2009)Google Scholar
  12. 12.
    Ikeda, S., Kubo, I., Okumoto, N., Yamashita, M.: Impact of Local Topological Information on Random Walks on Finite Graphs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, Springer, Heidelberg (2003)Google Scholar
  13. 13.
    Lovász, L.: Random walks on graphs: A survey. Bolyai Society Mathematical Studies 2, 353–397 (1996)Google Scholar
  14. 14.
    Stutzbach, D., Rejaie, R., Duffield, N.G., Sen, S., Willinger, W.: On unbiased sampling for unstructured peer-to-peer networks. In: Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement IMC 2006, pp. 27–40 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Colin Cooper
    • 1
  • Tomasz Radzik
    • 1
  • Yiannis Siantos
    • 1
  1. 1.Department of InformaticsKing’s CollegeLondonUK

Personalised recommendations