Directed network Laplacians and random graph models

We consider spectral methods that uncover hidden structures in directed networks. We establish and exploit connections between node reordering via (a) minimizing an objective function and (b) maximizing the likelihood of a random graph model. We focus on two existing spectral approaches that build and analyse Laplacian-style matrices via the minimization of frustration and trophic incoherence. These algorithms aim to reveal directed periodic and linear hierarchies, respectively. We show that reordering nodes using the two algorithms, or mapping them onto a specified lattice, is associated with new classes of directed random graph models. Using this random graph setting, we are able to compare the two algorithms on a given network and quantify which structure is more likely to be present. We illustrate the approach on synthetic and real networks, and discuss practical implementation issues.

[1]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[2]  Guillermo Ricardo Simari,et al.  Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm , 2022 .

[3]  S. Agrawal,et al.  Measuring Circular Supply Chain Risk: A Bayesian Network Methodology , 2021, Sustainability.

[4]  Michalis Vazirgiannis,et al.  Clustering and Community Detection in Directed Networks: A Survey , 2013, ArXiv.

[5]  Marcus Kaiser,et al.  Nonoptimal Component Placement, but Short Processing Paths, due to Long-Distance Projections in Neural Systems , 2006, PLoS Comput. Biol..

[6]  H. Luetkepohl.  The Handbook of Matrices , 1996 .

[7]  S. Shen-Orr,et al.  Networks Network Motifs : Simple Building Blocks of Complex , 2002 .

[8]  Stephen H. Levine,et al.  Several measures of trophic structure applicable to complex food webs , 1980 .

[9]  P. Grindrod.  Range-dependent random graphs and their application to modeling large small-world Proteome datasets. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Hemant Tyagi,et al.  An extension of the angular synchronization problem to the heterogeneous setting , 2020, Foundations of Data Science.

[11]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[12]  A. Singer.  Angular Synchronization by Eigenvectors and Semidefinite Programming. , 2009, Applied and computational harmonic analysis.

[13]  F. Chung.  Spectral Graph Theory, Regional Conference Series in Math. , 1997 .

[14]  R. S. MacKay,et al.  How directed is a directed network? , 2020, Royal Society Open Science.

[15]  Delbert Dueck,et al.  Clustering by Passing Messages Between Data Points , 2007, Science.

[16]  Desmond J. Higham,et al.  A Nonlinear Spectral Method for Core-Periphery Detection in Networks , 2018, SIAM J. Math. Data Sci..

[17]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[18]  C. Kenyon,et al.  The nematode Caenorhabditis elegans. , 1988, Science.

[19]  David F. Gleich,et al.  PageRank beyond the Web , 2014, SIAM Rev..

[20]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[21]  Christos Nicolaides,et al.  Rationing social contact during the COVID-19 pandemic: Transmission risk and social benefits of US locations , 2020, Proceedings of the National Academy of Sciences.

[22]  D. Higham,et al.  Periodic Reordering , 2008 .

[23]  Samuel Johnson,et al.  Digraphs are different: why directionality matters in complex systems , 2019, Journal of Physics: Complexity.

[24]  F. Chung.  Laplacians and the Cheeger Inequality for Directed Graphs , 2005 .

[25]  Christos Nicolaides,et al.  Rationing social contact during the COVID-19 pandemic: Transmission risk and social benefits of US locations , 2020, Proceedings of the National Academy of Sciences.

[26]  Desmond J. Higham,et al.  Unravelling small world networks , 2003 .

[27]  D. Fisher,et al.  Echo chambers in climate science , 2019, Environmental Research Communications.

[28]  Johan A. K. Suykens,et al.  Magnetic Eigenmaps for Visualization of Directed Networks , 2016, ArXiv.

[29]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[31]  He Sun,et al.  Hermitian matrices for clustering directed graphs: insights and applications , 2019, AISTATS.

[32]  Johan A. K. Suykens,et al.  Magnetic eigenmaps for community detection in directed networks , 2016, Physical review. E.

[33]  Jure Leskovec,et al.  Higher-order organization of complex networks , 2016, Science.

[34]  Tian Zheng,et al.  Spectral Clustering for Directed Networks , 2020, COMPLEX NETWORKS.

[35]  Stephen Jarvis,et al.  Graph Hierarchy: A novel approach to understanding hierarchical structures in complex networks. , 2020 .