|
[1]
|
Klein, D.J. and Randi, M. (1993) Resistance Distance. Journal of Mathematical Chemistry, 12, 81-95. [Google Scholar] [CrossRef]
|
|
[2]
|
Monnig, N.D. and Meyer, F.G. (2016) The Resistance Perturbation Distance: A Metric for the Analysis of Dynamic Networks. Discrete Applied Mathematics, 236, 347-386. [Google Scholar] [CrossRef]
|
|
[3]
|
Berlingerio, M., Koutra, D., Eliassi-Rad, T., et al. (2013) Network Similarity via Multiple Social Theories. International Conference on Advances in Social Networks Analysis and Mining, Niagara, 25-28 August 2013, 1439-1440. [Google Scholar] [CrossRef]
|
|
[4]
|
Soundarajan, S., Eliassirad, T. and Gallagher, B. (2014) A Guide to Selecting a Network Similarity Method.
|
|
[5]
|
Ahmed, N.K., Neville, J., Rossi, R.A., et al. (2015) Fast Parallel Graphlet Counting for Large Networks. Knowledge & Information Systems, 1-34.
|
|
[6]
|
Donnat, C. and Holmes, S. (2018) Tracking Network Dynamics: A Review of Distances and Similarity Metrics.
|
|
[7]
|
Conci, A. and Kubrusly, C.S. (2018) Distance between Sets—A Survey.
|
|
[8]
|
Jurman, G., Visintainer, R. and Furlanello, C. (2011) An Introduction to Spectral Distances in Networks. Neural Nets WIRN10—Proceedings of the 20th Italian Workshop on Neural Nets, Salerno, 27-29 May 2010, 227-234.
|
|
[9]
|
Kelmans, A.K. (1996) On Graphs with the Maximum Number of Spanning Trees. Random Structures & Algorithms, 9, 177-192. [Google Scholar] [CrossRef]
|
|
[10]
|
Jurman, G., Visintainer, R., Filosi, M., et al. (2015) The HIM Glocal Metric and Kernel for Network Comparison and Classification. 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA), Paris, 19-21 October 2015, 1-10. [Google Scholar] [CrossRef]
|
|
[11]
|
Papadimitriou, P., Dasdan, A. and Garcia-Molina, H. (2010) Web Graph Similarity for Anomaly Detection. Journal of Internet Services & Applications, 1, 19-30. [Google Scholar] [CrossRef]
|
|
[12]
|
Koutra, D., Shah, N., Vogelstein, J.T., et al. (2016) Delta C on: Principled Massive-Graph Similarity Function with Attribution. ACM Transactions on Knowledge Discovery from Data, 10, 1-43. [Google Scholar] [CrossRef]
|
|
[13]
|
Shuman, D.I., Narang, S.K., Frossard, P., et al. (2013) The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains. IEEE Signal Processing Magazine, 30, 83-98. [Google Scholar] [CrossRef]
|
|
[14]
|
Donnat, C., Zitnik, M., Hallac, D., et al. (2018) Spectral Graph Wavelets for Structural Role Similarity in Networks.
|
|
[15]
|
Coppersmith, D., Feige, U. and Shearer, J. (1996) Random Walks on Regular and Irregular Graphs. SIAM Journal on Discrete Mathematics, 9, 301-308. [Google Scholar] [CrossRef]
|
|
[16]
|
Yang, Y.J. and Klein, D.J. (2013) A Recursion Formula for Resistance Distances and Its Applications. Discrete Applied Mathematics, 161, 2702-2715. [Google Scholar] [CrossRef]
|
|
[17]
|
FDLG (1984) Random Walks and Electric Networks. Carus Mathematical Monograph.
|
|
[18]
|
Spielman, D.A. and Srivastava, N. (2008) Graph Sparsification by Effective Resistances. STOC’08: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, Victoria, 17-20 May 2008, 563-568. [Google Scholar] [CrossRef]
|
|
[19]
|
Spielman, D.A. and Teng, S.H. (2014) Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems. SIAM Journal on Matrix Analysis & Applications, 35, 835-885. [Google Scholar] [CrossRef]
|
|
[20]
|
Orecchia, L. and Vishnoi, N.K. (2010) Towards an SDP-Based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition.
|
|
[21]
|
Srivastava, N. (2010) Spectral Sparsification and Restricted Invertibility. Yale University, New Haven.
|