Materials for Higher-order organization of complex networks

Implementations of our methods and the datasets used in our experiments are available on our project web site:

[1]  O. Bagasra,et al.  Proceedings of the National Academy of Sciences , 1914, Science.

[2]  Journal of Molecular Biology , 1959, Nature.

[3]  P. Holland,et al.  A Method for Detecting Structure in Sociometric Data , 1970, American Journal of Sociology.

[4]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .

[5]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[6]  Michael I. Jordan,et al.  Advances in Neural Information Processing Systems 30 , 1995 .

[7]  E. Kandel,et al.  Proceedings of the National Academy of Sciences of the United States of America. Annual subject and author indexes. , 1990, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[9]  Andrzej M. Borzyszkowski,et al.  Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science , 1993 .

[10]  Jack Dongarra,et al.  Applied Parallel Computing Industrial Computation and Optimization , 1996, Lecture Notes in Computer Science.

[11]  D. Riddle.  C. Elegans II , 1998 .

[12]  J. Ashby.  References and Notes , 1999 .

[13]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: applications in VLSI domain , 1999, IEEE Trans. Very Large Scale Integr. Syst..

[14]  David S. Munro,et al.  In: Software-Practice and Experience , 2000 .

[15]  김삼묘,et al.  “Bioinformatics” 특집을 내면서 , 2000 .

[16]  J. Rodri´guez.  On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs , 2002 .

[17]  Tapio Elomaa,et al.  Principles of Data Mining and Knowledge Discovery , 2002, Lecture Notes in Computer Science.

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

[19]  Jon M. Kleinberg,et al.  Overview of the 2003 KDD Cup , 2003, SKDD.

[20]  Klaus Jansen,et al.  Experimental and Efficient Algorithms , 2003, Lecture Notes in Computer Science.

[21]  S. Mangan,et al.  Structure and function of the feed-forward loop network motif , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[22]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[23]  S. Mangan,et al.  The coherent feedforward loop serves as a sign-sensitive delay element in transcription networks. , 2003, Journal of molecular biology.

[24]  Albert-László Barabási,et al.  Aggregation of topological motifs in the Escherichia coli transcriptional regulatory network , 2004, BMC Bioinformatics.

[25]  Daniel Boley,et al.  Principal Direction Divisive Partitioning , 1998, Data Mining and Knowledge Discovery.

[26]  N. Turner.  PLOS Biology , 2004, BMJ : British Medical Journal.

[27]  O. Sporns,et al.  Motifs in Brain Networks , 2004, PLoS biology.

[28]  Igor Jurisica,et al.  Modeling interactome: scale-free or geometric? , 2004, Bioinform..

[29]  Craig E. Wills,et al.  Proceedings of the 13th international conference on World Wide Web , 2004 .

[30]  Sebastiano Vigna,et al.  UbiCrawler: a scalable fully distributed Web crawler , 2004, Softw. Pract. Exp..

[31]  GusfieldDan.  Introduction to the IEEE/ACM Transactions on Computational Biology and Bioinformatics , 2004 .

[32]  Hinrich Schütze,et al.  Introduction to information retrieval , 2008 .

[33]  Robert L. Grossman,et al.  Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining , 2005, KDD 2005.

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

[35]  Jordi Bascompte,et al.  Interaction strength combinations and the overfishing of a marine food web. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

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

[37]  Sebastian Wernicke,et al.  Efficient Detection of Network Motifs , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[38]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[39]  Dimitrios Gunopulos,et al.  Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining , 2006, KDD 2006.

[40]  Sebastian Wernicke,et al.  FANMOD: a tool for fast network motif detection , 2006, Bioinform..

[41]  J. A. Rodríguez,et al.  Linear and Multilinear Algebra , 2007 .

[42]  U. Alon.  Network motifs: theory and experimental approaches , 2007, Nature Reviews Genetics.

[43]  BMC Bioinformatics , 2005 .

[44]  Olaf Sporns,et al.  Network structure of cerebral cortex shapes functional connectivity on multiple time scales , 2007, Proceedings of the National Academy of Sciences.

[45]  Jure Leskovec,et al.  The dynamics of viral marketing , 2005, EC '06.

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

[47]  Daniel B. Stouffer,et al.  Evidence for the existence of a robust pattern of prey selection in food webs , 2007, Proceedings of the Royal Society B: Biological Sciences.

[48]  Sunita Sarawagi,et al.  Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA, August 24-27, 2008 , 2008, KDD.

[49]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[50]  Matthieu Latapy,et al.  Main-memory triangle computations for very large (sparse (power-law)) graphs , 2008, Theor. Comput. Sci..

[51]  Tomoyuki Ishida,et al.  The 28 th International Conference on Distributed Computing Systems Workshops , 2008 .

[52]  William W. Cohen,et al.  Proceedings of the 23rd international conference on Machine learning , 2006, ICML 2008.

[53]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[54]  Ulrik Brandes,et al.  Advances in Social Network Analysis and Mining , 2009 .

[55]  R. Rosenfeld.  Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[56]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[57]  Jonathan Cohen,et al.  Graph Twiddling in a MapReduce World , 2009, Computing in Science & Engineering.

[58]  Jordi Bascompte,et al.  Disentangling the Web of Life , 2009, Science.

[59]  Juliana Freire,et al.  Proceedings of the 19th international conference on World wide web , 2010, WWW 2010.

[60]  Christopher D. Manning,et al.  Introduction to Information Retrieval , 2010, J. Assoc. Inf. Sci. Technol..

[61]  Niels Taatgen,et al.  Proceedings of ICCM - 2010- Tenth International Conference on Cognitive Modeling , 2010 .

[62]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[63]  Anagha Joshi,et al.  Enrichment and aggregation of topological motifs are independent organizational principles of integrated interaction networks. , 2011, Molecular bioSystems.

[64]  Zhi-Li Zhang,et al.  Commute Times for a Directed Graph using an Asymmetric Laplacian , 2011 .

[65]  Béat Hirsbrunner,et al.  2010 IEEE 30th International Conference on Distributed Computing Systems Workshops (ICDCSW 2010) : Genoa, Italy, 21 - 25 June 2010 ; [proceedings] , 2011 .

[66]  Sergio Gómez,et al.  Detecting communities of triangles in complex networks using spectral optimization , 2010, Comput. Commun..

[67]  Elisa Bertino,et al.  Proceedings of the 20th international conference on World wide web , 2011, WWW 2011.

[68]  Ian Davidson,et al.  Proceedings of the 2012 SIAM International Conference on Data Mining , 2012 .

[69]  Junho Lee,et al.  Nictation, a dispersal behavior of the nematode Caenorhabditis elegans, is regulated by IL2 neurons , 2011, Nature Neuroscience.

[70]  Shuliang Wang,et al.  Data Mining and Knowledge Discovery , 2005, Mathematical Principles of the Internet.

[71]  Elchanan Mossel,et al.  Spectral redemption in clustering sparse networks , 2013, Proceedings of the National Academy of Sciences.

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

[73]  T. Michoel,et al.  The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees , 2013, PloS one.

[74]  Jure Leskovec,et al.  Overlapping Communities Explain Core–Periphery Organization of Networks , 2014, Proceedings of the IEEE.

[75]  Luca Trevisan,et al.  Multi-way spectral partitioning and higher-order cheeger inequalities , 2011, STOC '12.

[76]  Moni Naor,et al.  Proceedings of the 5th conference on Innovations in theoretical computer science , 2014, ITCS 2014.

[77]  Martin Rosvall,et al.  Memory in network flows and its effects on spreading dynamics and community detection , 2013, Nature Communications.

[78]  T. Michoel,et al.  The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration , 2014, PloS one.

[79]  Tamara G. Kolda,et al.  Wedge sampling for computing clustering coefficients and triangle counts on large graphs † , 2013, Stat. Anal. Data Min..

[80]  L. Trevisan.  Notes on Expansion , Sparsest Cut , and Spectral Graph Theory , 2015 .

[81]  L. Christophorou.  Science , 2018, Emerging Dynamics: Science, Energy, Society and Values.

[82]  Physics Reports , 2022 .