Characterizing Distances of Networks on the Tensor Manifold

  • Bipul Islam
  • Ji Liu
  • Romeil SandhuEmail author
Conference paper
Part of the Studies in Computational Intelligence book series (SCI, volume 881)


At the core of understanding dynamical systems is the ability to maintain and control the systems behavior that includes notions of robustness, heterogeneity, and/or regime-shift detection. Recently, to explore such functional properties, a convenient representation has been to model such dynamical systems as a weighted graph consisting of a finite, but very large number of interacting agents. This said, there exists very limited relevant statistical theory that is able cope with real-life data, i.e., how does perform analysis and/or statistics over a “family” of networks as opposed to a specific network or network-to-network variation. Here, we are interested in the analysis of network families whereby each network represents a “point” on an underlying statistical manifold. To do so, we explore the Riemannian structure of the tensor manifold developed by Pennec previously applied to Diffusion Tensor Imaging (DTI) towards the problem of network analysis. In particular, while this note focuses on Pennec definition of “geodesics” amongst a family of networks, we show how it lays the foundation for future work for developing measures of network robustness for regime-shift detection. We conclude with experiments highlighting the proposed distance on synthetic networks and an application towards biological (stem-cell) systems.


Computational geometry Graph theory Control 



This work was supported by the U.S. Air Force Office of Scientific Research (AFOSR) grant FA9550-18-1-0130 and National Science Foundation (NSF) grant ECCS-1749937.


  1. 1.
    Barabasi, A.: The network takeover. Nat. Phys. 8, 14–16 (2012)CrossRefGoogle Scholar
  2. 2.
    Demetrius, L., Manke, T.: Robustness and network evolution: entropic principle. Stat. Mech. Appl. Physica A 346, 682–696 (2005)CrossRefGoogle Scholar
  3. 3.
    West, J., Bianconi, G., Severini, S., Teschendorff, A.: Differential network entropy reveals cancer system hallmarks. Nat. (Sci. Rep.) 2, 802 (2012)Google Scholar
  4. 4.
    Barbasi, A., Albert, R.: Emergence of scaling networks. Science 286, 509–512 (1999)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Fan Chung, R.K.: Spectral Graph Theory. American Mathematical Society (1997)Google Scholar
  6. 6.
    Hoory, S., Linial, N., Widgerson, A.: Expander Graphs and Their Applications. American Mathematical Society (2006)Google Scholar
  7. 7.
    Stauffer, D., Aharony, A.: Introduction to Percolation Theory. Taylor and Francis (1994)Google Scholar
  8. 8.
    Borgatti, S.: Centrality and network flow. Soc. Netw. 27, 55–71 (2005)CrossRefGoogle Scholar
  9. 9.
    Ghoshal, G., Barabasi, A.: Ranking stability and super-stable nodes in complex networks. Nat. Commun. 2, 394 (2011)CrossRefGoogle Scholar
  10. 10.
    Varadhan, S.R.S.: Large Deviations and Applications. SIAM (1984)Google Scholar
  11. 11.
    Ollivier, Y.: Ricci curvature of Markov chains on metric spaces. J. Funct. Anal. (2009)Google Scholar
  12. 12.
    Ollivier, Y.: Ricci curvature of metric spaces. Math. Acad. Sci. (2007)Google Scholar
  13. 13.
    Sandhu, R., Georgiou, T., Reznik, E., Zhu, L., Kolesov, I., Senbabaoglu, Y., Tannenbaum, A.: Graph curvature for differentiating cancer networks. Nat. (Sci. Rep.) (2015)Google Scholar
  14. 14.
    Sandhu, R., Georgiou, T., Tannenbaum, A.: Ricci curvature: an economic indicator for market fragility and systemic risk. Sci. Adv. 2, e1501495 (2016)CrossRefGoogle Scholar
  15. 15.
    Pennec, X., Fillard, P., Ayache, N.: A riemannian framework for tensor computing. IJCV 66, 41–66 (2005)CrossRefGoogle Scholar
  16. 16.
    Arsingy, V., Fillard, P., Pennec, X., Ayache, N.: Log-Euclidean metrics for fast and simple calculus on diffusion tensors. Magn. Reson. Med. 56, 411–421 (2006)CrossRefGoogle Scholar
  17. 17.
    Jupp, P., Mardia, K.: A unfied view of the theory of directional statistics. Int. Stat. Rev. (1989)Google Scholar
  18. 18.
    Moakher, M.: Means and averaging in the group of rotations. SIAM J. Matrix Anal. Appl. 24, 1–16 (2002)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Edelman, A., Arias, T., Smith, S.: The geometry of algorithms with orthonganlity constraints. SIAM J. Matrix Anal. Appl. (2002)Google Scholar
  20. 20.
    DoCarmo, M.: Riemannian Geometry. Birkhauser (1992)Google Scholar
  21. 21.
    Fletcher, P., Joshi, S.: Principal geodesic analysis on symmetric spaces: statistics of diffusion tensors. In: ECCV (2004)Google Scholar
  22. 22.
    Nomizu, K.: Invariant affine connections on homogeneous spaces. Am. J. Math. (1954)Google Scholar
  23. 23.
    Rathi, Y., Tannenbaum, A., Michailovich, O.: Segmenting images on the tensor manifold. In: CVPR (2007)Google Scholar
  24. 24.
    Helgason, S.: Differential Geometry, Lie Groups, and Symmetric Spaces (1978)Google Scholar
  25. 25.
    Lott, J., Villani, C.: Ricci curvature for metric-measure spaces via optimal transport. Ann. Math. (2009)Google Scholar
  26. 26.
    Sturm, K.: On the geometry of metric measure spaces. Acta Math (2006)Google Scholar
  27. 27.
    Bauer, F., Jost, J., Liu, S.: Ollivier-Ricci curvature and the spectrum of the normalized graph laplace operator. arXiv (2013)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Stony Brook UniversityStony BrookUSA

Personalised recommendations