Nonlinear Laplacian for Digraphs and its Applications to Network Analysis

In this work, we introduce a new Markov operator associated with a digraph, which we refer to as a nonlinear Laplacian. Unlike previous Laplacians for digraphs, the nonlinear Laplacian does not rely on the stationary distribution of the random walk process and is well defined on digraphs that are not strongly connected. We show that the nonlinear Laplacian has nontrivial eigenvalues and give a Cheeger-like inequality, which relates the conductance of a digraph and the smallest non-zero eigenvalue of its nonlinear Laplacian. Finally, we apply the nonlinear Laplacian to the analysis of real-world networks and obtain encouraging results.

[1]  Daniel A. Spielman,et al.  Spectral Graph Theory and its Applications , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[2]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[3]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

[4]  Britta Ruhnau,et al.  Eigenvector-centrality - a node-centrality? , 2000, Soc. Networks.

[5]  Weixiong Zhang,et al.  An Efficient Spectral Algorithm for Network Community Discovery and Its Applications to Biological and Social Networks , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[6]  Phillip Bonacich,et al.  Some unique properties of eigenvector centrality , 2007, Soc. Networks.

[7]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[8]  Robert E. Ulanowicz,et al.  Comparative ecosystem trophic structure of three U.S. mid-Atlantic estuaries , 1997 .

[9]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[10]  Stephen Lin,et al.  Graph Embedding and Extensions: A General Framework for Dimensionality Reduction , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Edwin R. Hancock,et al.  Spectral embedding of graphs , 2003, Pattern Recognit..

[12]  R. Merris.  Laplacian matrices of graphs: a survey , 1994 .

[13]  Anand Louis,et al.  Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms , 2014, STOC.

[14]  Weimin Han,et al.  Numerical Solution of Ordinary Differential Equations: Atkinson/Numerical , 2009 .

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

[16]  Mo Chen,et al.  Directed Graph Embedding , 2007, IJCAI.

[17]  Bruce Hendrickson,et al.  An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations , 1995, SIAM J. Sci. Comput..

[18]  Prasad Raghavendra,et al.  The Complexity of Approximating Vertex Expansion , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[19]  Bernhard Schölkopf,et al.  Learning from labeled and unlabeled data on a directed graph , 2005, ICML.

[20]  Emanuele Viola,et al.  Pseudorandom Bits for Polynomials , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[21]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.

[22]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[23]  Sarah Rothstein,et al.  An Introduction To The Theory Of Graph Spectra , 2016 .

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

[25]  Zhi-Li Zhang,et al.  Digraph Laplacian and the Degree of Asymmetry , 2012, Internet Math..

[26]  David F. Gleich,et al.  Heat kernel based community detection , 2014, KDD.

[27]  Fan Chung Graham,et al.  Local Partitioning for Directed Graphs Using PageRank , 2007, Internet Math..

[28]  Frank Bauer.  Normalized graph Laplacians for directed graphs , 2011 .

[29]  Fan Chung Graham,et al.  The Diameter and Laplacian Eigenvalues of Directed Graphs , 2006, Electron. J. Comb..

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

[31]  F. Chung.  Random walks and local cuts in graphs , 2007 .

[32]  Fan Chung Graham,et al.  Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[33]  Francesco Masulli,et al.  A survey of kernel and spectral methods for clustering , 2008, Pattern Recognit..

[34]  Peter Donnelly,et al.  Superfamilies of Evolved and Designed Networks , 2004 .

[35]  David Gleich.  Hierarchical Directed Spectral Graph Partitioning MS&E 337 - Information Networks , 2006 .

[36]  Fan Chung,et al.  The heat kernel as the pagerank of a graph , 2007, Proceedings of the National Academy of Sciences.

[37]  Thorsten Joachims,et al.  Transductive Learning via Spectral Graph Partitioning , 2003, ICML.

[38]  F. Chung.  A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank , 2009 .