Measuring Structural Similarities of Graphs in Linear Time

  • Zheng Fang
  • You Li
  • Jie Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7402)


Measuring graph similarities is an important topic with numerous applications. Early algorithms often incur quadratic time or higher, making it unpractical to use for graphs of very large scales. We present in this paper the first-known linear-time algorithm for solving this problem. Our algorithm, called Random Walker Termination (RWT), is based on random walkers and time series. Three major graph models, that is, the Erdős-Rényi random graphs, the Watts-Strogatz small world graphs, and the Barabási-Albert preferential attachment graphs are used to generate graphs of different sizes. We show that the RWT algorithm performs well for all three graph models. Our experiment results agree with the actual similarities of generated graphs. Built on stochastic process, RWT is sufficiently stable to generate consistent results. We use the graph edge rerouting test and the cross model test to demonstrate that RWT can effectively identify structural similarities between graphs.


Graph Model Random Graph Sink Node Preferential Attachment Diffusion Kernel 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74(1), 47–97 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Cha, S.H.: Comprehensive survey on distance / similarity measures between probability density functions. International Journal of Mathematical Models and Methods in Applied Sciences 1(4), 300–307 (2007)MathSciNetGoogle Scholar
  3. 3.
    Erdős, P., Rényi, A.: On the evolution of random graphs. Publication of the Methematical Institute of the Hungarian Academy of Sciences, 17–61 (1960)Google Scholar
  4. 4.
    Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2002, pp. 538–543. ACM (2002)Google Scholar
  5. 5.
    Kondor, R.I., Lafferty, J.D.: Diffusion kernels on graphs and other discrete input spaces. In: Proceedings of the Nineteenth International Conference on Machine Learning, ICML 2002, pp. 315–322 (2002)Google Scholar
  6. 6.
    Lovasz, L.: Random walks on graphs: A survey. Combinatorics, Paul Erdos is Eighty 2, 1–46 (1993)MathSciNetGoogle Scholar
  7. 7.
    Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: a versatile graph matching algorithm and its application to schema matching. In: Proceedings on 18th International Conference on Data Engineering, pp. 117–128 (2002)Google Scholar
  8. 8.
    Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393(6684), 440–442 (1998)CrossRefGoogle Scholar
  9. 9.
    Zager, L.A., Verghese, G.C.: Graph similarity scoring and matching. Applied Mathematics Letters 21(1), 86–94 (2008)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Zheng Fang
    • 1
  • You Li
    • 1
  • Jie Wang
    • 1
  1. 1.Department of Computer ScienceUniversity of MassachusettsLowellUSA

Personalised recommendations