- Physical Review Journals
All JournalsPhysics Magazine

Physical Review E

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Characterizing network directedness using the containing pseudospectral frontier of the network Laplacian

Christopher J. Keylock

Maurizio Carbone

PDF

Phys. Rev. E 113, 034314 – Published 25 March, 2026

DOI: https://doi.org/10.1103/lbfb-69mf

Abstract

A large number of complex systems can be represented as directed networks, where the connections (edge weights) between nodes (system states) are such that the flux of the quantity of interest (e.g., energy or information) from node i to j is not equal to that from j to i. The network Laplacian underpins a suite of techniques for studying diffusion and random walks on networks, but many such methods have been developed for undirected graphs. In this paper, we propose a method for characterizing the relative degree of directedness of a network. Our approach is based on the pseudospectrum of the Laplacian and examines the difference in the nature of the “containing pseudospectral frontier” between the Laplacian itself and a variant formed by removing its non-normal structure. The distance between the containing and comparator frontiers then characterizes relative directedness as a function of the shape of the underlying pseudospectral surface. We demonstrate how this metric's behavior is consistent with that expected for a cyclic permutation adjacency matrix and is appropriate for a network where directedness is controlled systematically. We also extend an existing definition of network directedness and then apply our method in detail to a network capturing the Lagrangian dynamics of a turbulent flow. Two local maxima for our metric arise in distinct regions of the complex plane, but the eigenvalues driving these maxima are dominated by nodes from the network that are both very similar to each other and highly atypical in terms of the physics they embody. These nodes are also very different in nature from those highlighted by a stochastic differential equation model for these dynamics that successfully captures many key features of turbulence. This highlights the sensitivity of our approach and its potential utility in model validation, in addition to network characterization.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (49)

  1. A. Bombelli, B. F. Santos, and L. Tavasszy, Analysis of the air cargo transport network using a complex network theory perspective, Trans. Res. E: Logist. Trans. Rev. 138, 101959 (2020).
  2. M. Zhang, T. Huang, Z. Guo, and Z. He, Complex-network-based traffic network analysis and dynamics: A comprehensive review, Physica A 607, 128063 (2022).
  3. R. Su, B. Chen, S. Wang, and C. Duan, Energy technical resilience assessment based on complex network analysis - A case study of China, Appl. Energy 364, 123231 (2024).
  4. R. L. Shreve, Infinite topologically random channel networks, J. Geol. 75, 178 (1967).
  5. E. D. Mainas, The analysis of criminal and terrorist organisations as social network structures: A quasi-experimental study, Intl. J. Police Sci. Manag. 14, 264 (2012).
  6. J. Senk, B. Kriener, M. Djurfeldt, N. Voges, H.-J. Jiang, L. Schüttler, G. Gramelsberger, M. Diesmann, H. E. Plesser, and S. J. van Albada, Connectivity concepts in neuronal network modeling, PLOS Comput. Biol. 18, e1010086 (2022).
  7. M. K. P. So, A. M. Y. Chu, A. Tiwari, and J. N. L. Chan, On topological properties of COVID-19: Predicting and assessing pandemic risk with network statistics, Sci. Rep. 11, 5112 (2021).
  8. Y. Zou, R. V. Donner, N. Marwan, J. F. Donges, and J. Kurths, Complex network approaches to nonlinear time series analysis, Phys. Rep. 787, 1 (2019).
  9. C. J. Keylock and M. Carbone, Complex network approach to turbulent velocity gradient dynamics: High- and low-probability Lagrangian paths, Phys. Rev. Fluids 10, 054606 (2025).
  10. F. Chung, Spectral Graph Theory (American Mathematical Society, Providence, RI, 1997).
  11. F. R. K. Chung, Laplacians and the Cheeger inequality for directed graphs, Ann. Comb. 9, 1 (2005).
  12. Y. Li and Z.-L. Zhang, Digraph Laplacian and the degree of asymmetry, Internet Math. 8, 381 (2012).
  13. M. Asllani, R. Lambiotte, and T. Carletti, Structure and dynamical behavior of non-normal networks, Sci. Adv. 4, eaau9403 (2018).
  14. L. N. Trefethen and M. Embree, Spectra and Pseudospectra: The Behavior of Non-normal Matrices and Operators (Princeton University Press, Princeton, NJ, 2005).
  15. F. Göbel and A. Jagers, Random walks on graphs, Stochast. Proc. Appl. 2, 311 (1974).
  16. M. Fiedler, A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory, Czech. Math. J. 25, 619 (1975).
  17. F. Chung and S.-T. Yau, Discrete Green's functions, J. Comb. Theory Ser. A 91, 191 (2000).
  18. A. Barabási and R. Albert, Emergence of scaling in random networks, Science 286, 509 (1999).
  19. P. Erdös and A. Rényi, On the evolution of random graphs, Mat. Kutató Int. Közl. 5, 17 (1960).
  20. D. J. Watts and S. H. Strogatz, Collective dynamics of ‘‘small-world’’ networks, Nature (London) 393, 440 (1998).
  21. A. Vázquez, R. Pastor-Satorras, and A. Vespignani, Large-scale topological and dynamical properties of the internet, Phys. Rev. E 65, 066130 (2002).
  22. V. M. Eguìluz, D. R. Chialvo, G. A. Cecchi, M. Baliki, and A. V. Apkarian, Scale-free brain functional networks, Phys. Rev. Lett. 94, 018102 (2005).
  23. P. Henrici, Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices, Numer. Math. 4, 24 (1962).
  24. S. C. Reddy, P. J. Schmid, and D. S. Henningson, Pseudospectra of the Orr-Sommerfeld operator, SIAM J. Appl. Math. 53, 15 (1993).
  25. L. N. Trefethen, A. E. Trefethen, S. C. Reddy, and T. A. Driscoll, Hydrodynamic stability without eigenvalues, Science 261, 578 (1993).
  26. S. A. Orszag, Accurate solution of the Orr-Sommerfeld equation, J. Fluid Mech. 50, 689 (1971).
  27. L. N. Trefethen, Computation of pseudospectra, Acta Numer. 8, 247 (1999).
  28. T. G. Wright and L. N. Trefethen, Pseudospectra of rectangular matrices, IMA J. Numer. Anal. 22, 501 (2002).
  29. N. J. Higham, Matrix nearness problems and applications, in Applications of Matrix Theory, edited by M. J. C. Gover and S. Barnett (Oxford University Press, Oxford, 1989), pp. 1–27.
  30. R. W. Daniel and B. Kouvaritakis, The choice and use of normal matrix approximations to transfer-function matrices of multivariable control systems, Intl. J. Control 37, 1121 (1983).
  31. C.-Y. Kao, U. Jönsson, and H. Fujioka, Characterization of robust stability of a class of interconnected systems, Automatica 45, 217 (2009).
  32. I. Schur, On the characteristic roots of a linear substitution with an application to the theory of integral equations, Math. Ann. 66, 488 (1909).
  33. R. Byers, A bisection method for measuring the distance of a stable matrix to the unstable matrices, SIAM J. Sci. Stat. Comput. 9, 875 (1988).
  34. E. Mengi and M. L. Overton, Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix, IMA J. Numer. Analys. 25, 648 (2005).
  35. R. Rossi and N. Ahmed, The network data repository with interactive graph analytics and visualization, in Proceedings of the AAAI Conference on Artificial Intelligence (Association for the Advancement of Artificial Intelligence, Washington, DC, 2015), Vol. 29, pp. 4292–4293.
  36. Network data repository, https://networkrepository.com/bn-cat-mixed-species-brain-1.php.
  37. S. Jiang, J. A. Lu, J. Zhou, and Q. Dai, Fiedler value: The cumulated dynamical contribution value of all edges in a complex network, Phys. Rev. E 109, 054301 (2024).
  38. D. Knoke and J. H. Kuklinski, Network Analysis (Sage, London, 1982).
  39. C. J. Keylock, The Schur decomposition of the velocity gradient tensor for turbulent flows, J. Fluid Mech. 848, 876 (2018).
  40. M. Wilczek and C. Meneveau, Pressure Hessian and viscous contributions to velocity gradient statistics based on Gaussian random fields, J. Fluid Mech. 756, 191 (2014).
  41. L. Chevillard, C. Meneveau, L. Biferale, and F. Toschi, Modeling the pressure Hessian and viscous Laplacian in turbulence: Comparisons with direct numerical simulation and implications on velocity gradient dynamics, Phys. Fluids 20, 101504 (2008).
  42. C. J. Keylock, Turbulence at the Lee bound: Maximally non-normal vortex filaments and the decay of a local dissipation rate, J. Fluid Mech. 881, 283 (2019).
  43. R. Betchov, An inequality concerning the production of vorticity in isotropic turbulence, J. Fluid Mech. 1, 497 (1956).
  44. M. Carbone and M. Wilczek, Only two Betchov homogeneity constraints exist for isotropic turbulence, J. Fluid Mech. 948, R2 (2022).
  45. C. J. Keylock and M. Carbone, Communities for the Lagrangian dynamics of the turbulent velocity gradient tensor: A network participation approach, Physica D 481, 134826 (2025).
  46. B. J. Cantwell, Exact solution of a restricted Euler equation for the velocity gradient tensor, Phys. Fluids A 4, 782 (1992).
  47. Johns Hopkins turbulence database, https://turbulence.idies.jhu.edu/home; H. Yu, K. Kanov, E. Perlman, J. Graham, E. Frederix, R. Burns, A. Szalay, G. Eyink, and C. Meneveau, Studying Lagrangian dynamics of turbulence using on-demand fluid particle tracking in a public turbulence database, J. Turbul. 13, 1 (2012); Y. Li, E. Perlman, M. Wan, Y. Yang, C. Meneveau, R. Burns, S. Chen, A. Szalay, and G.Eyink, A public turbulence database cluster and applications to study Lagrangian evolution of velocity increments in turbulence, ibid. 9, 31 (2008).
  48. C. R. Johnson, Numerical determination of the field of values of a general complex matrix, SIAM J. Numer. Anal. 15, 595 (1978).
  49. D. L. Donoho and I. M. Johnstone, Adapting to unknown smoothness via wavelet shrinkage, J. Am. Stat. Assoc. 90, 1200 (1995).

Outline

Information

Phys. Rev. E 113, 034314– Published 25 March, 2026
  • Received 22 September 2025
  • Accepted 5 March 2026
Crossmark - Check for updates button
Creative Commons Logo

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation