Fetching the paper…
Reading the bibliography…
Higher-order network analysis uses the ideas of hypergraphs, simplicial complexes, multilinear and tensor algebra, and more, to study complex systems.
Spread of information through a population with socio-structural bias: I. assumption of transitivity
Anatol Rapoport · 1953
Earlier work this paper cites.
Clustering and hierarchy in interpersonal relations: Testing two graph theoretical models on 742 sociomatrices
James A Davis · 1970
Earlier work this paper cites.
Foundations of the PARAFAC procedure: Models and conditions for an “explanatory” multi-mode factor analysis
Richard A Harshman · 1970
Earlier work this paper cites.
Graphs and Hypergraphs
Claude Berge · 1973
Earlier work this paper cites.
The strength of weak ties
Mark S Granovetter · 1973
Earlier work this paper cites.
Theoretical foundations for centrality measures
Noah E Friedkin · 1991
Earlier work this paper cites.
Multilevel hypergraph partitioning: applications in vlsi domain
George Karypis, Rajat Aggarwal, Vipin Kumar, and Shashi Shekhar · 1999
Earlier work this paper cites.
The PageRank citation ranking: Bringing order to the web
Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd · 1999
Earlier work this paper cites.
Graph partitioning models for parallel computing
Bruce Hendrickson and Tamara G. Kolda · 2000
Earlier work this paper cites.
Hypergraph cuts with general splitting functions
Nate Veldt, Austin R Benson, and Jon Kleinberg · 2001
Earlier work this paper cites.
Network motifs: Simple building blocks of complex networks
R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon · 2002
Earlier work this paper cites.
Learning with local and global consistency
Dengyong Zhou, Olivier Bousquet, Thomas Navin Lal, Jason Weston, and Bernhard Schölkopf · 2003
Earlier work this paper cites.
Large dynamic graphs: What can researchers learn from them?
Fan Chung Graham · 2004
Earlier work this paper cites.
Year of the network
SIAM · 2004
Earlier work this paper cites.
Subgraph centrality and clustering in complex hyper-networks
Ernesto Estrada and Juan A. Rodríguez-Velázquez · 2005
Earlier work this paper cites.
The why, how, and when of representations for complex systems
Leo Torres, Ann S. Blevins, Danielle S. Bassett, and Tina Eliassi-Rad · 2006
Earlier work this paper cites.
Strongly local hypergraph diffusions for clustering and semi-supervised learning
Meng Liu, Nate Veldt, Haoyu Song, Pan Li, and David F Gleich · 2011
Earlier work this paper cites.
High-ordered random walks and generalized Laplacians on hypergraphs
Linyuan Lu and Xing Peng · 2011
Earlier work this paper cites.
Large-scale automated synthesis of human functional neuroimaging data
Tal Yarkoni, Russell A Poldrack, Thomas E Nichols, David C Van Essen, and Tor D Wager · 2011
Cited alongside, same era.
Are web users really Markovian?
Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan, and Tamas Sarlos · 2012
Cited alongside, same era.
A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally
Michael W Mahoney, Lorenzo Orecchia, and Nisheeth K Vishnoi · 2012
Cited alongside, same era.
Most tensor problems are np-hard
Christopher J Hillar and Lek-Heng Lim · 2013
Cited alongside, same era.
Spectral redemption in clustering sparse networks
Florent Krzakala, Cristopher Moore, Elchanan Mossel, Joe Neeman, Allan Sly, Lenka Zdeborová, and Pan Zhang · 2013
Cited alongside, same era.
Memory in network flows and its effects on spreading dynamics and community detection
Non-backtracking PageRank
Francesca Arrigo, Desmond J Higham, and Vanni Noferini · 2019
Later among the works it cites.
Beyond non-backtracking: non-cycling network centrality measures
Francesca Arrigo, Desmond J Higham, and Vanni Noferini · 2019
Later among the works it cites.
A framework for second-order eigenvector centralities and clustering coefficients
Francesca Arrigo, Desmond J Higham, and Francesco Tudisco · 2019
Later among the works it cites.
Three hypergraph eigenvector centralities
Austin R Benson · 2019
Later among the works it cites.
Simplicial models of social contagion
Iacopo Iacopini, Giovanni Petri, Alain Barrat, and Vito Latora · 2019
Later among the works it cites.
Graph-based semi-supervised & active learning for edge flows
Junteng Jia, Michael T Schaub, Santiago Segarra, and Austin R Benson · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Martin Rosvall, Alcides V. Esquivel, Andrea Lancichinetti, Jevin D. West, and Renaud Lambiotte · 2014
Cited alongside, same era.
PageRank beyond the web
David F Gleich · 2015
Cited alongside, same era.
Multilinear pagerank
David F Gleich, Lek-Heng Lim, and Yongyang Yu · 2015
Cited alongside, same era.
Using local spectral methods to robustify graph-based learning algorithms
David F Gleich and Michael W Mahoney · 2015
Cited alongside, same era.
Higher-order organization of complex networks
Austin R Benson, David F Gleich, and Jure Leskovec · 2016
Cited alongside, same era.
Two’s company, three (or more) is a simplex
Chad Giusti, Robert Ghrist, and Danielle S Bassett · 2016
Cited alongside, same era.
The spacey random walk: A stochastic process for higher-order data
Austin R Benson, David F Gleich, and Lek-Heng Lim · 2017
Cited alongside, same era.
From networks to optimal higher-order models of complex systems
Renaud Lambiotte, Martin Rosvall, and Ingo Scholtes · 2019
Later among the works it cites.
HodgeNet: Graph neural networks for edge data
T Mitchell Roddenberry and Santiago Segarra · 2019
Later among the works it cites.
Hypernetwork science via high-order hypergraph walks
Sinan G Aksoy, Cliff Joslyn, Carlos Ortiz Marrero, Brenda Praggastis, and Emilie Purvine · 2020
Later among the works it cites.
Networks beyond pairwise interactions: structure and dynamics
Federico Battiston, Giulia Cencetti, Iacopo Iacopini, Vito Latora, Maxime Lucas, Alice Patania, Jean-Gabriel Young, and Giovanni Petri · 2020
Later among the works it cites.
Dynamical systems on hypergraphs
Timoteo Carletti, Duccio Fanelli, and Sara Nicoletti · 2020
Later among the works it cites.
Ergodicity coefficients for higher-order stochastic processes
Dario Fasino and Francesco Tudisco · 2020
Later among the works it cites.
Quadratic decomposable submodular function minimization: Theory and practice
Pan Li, Niao He, and Olgica Milenkovic · 2020
Later among the works it cites.
Hodge Laplacians on graphs
Lek-Heng Lim · 2020
Later among the works it cites.
Multibody interactions and nonlinear consensus dynamics on networked systems
Leonie Neuhäuser, Andrew Mellor, and Renaud Lambiotte · 2020
Later among the works it cites.
Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
Michael T Schaub, Austin R Benson, Paul Horn, Gabor Lippner, and Ali Jadbabaie · 2020
Later among the works it cites.
Higher-order network analysis takes off, fueled by old ideas and new data
Austin R Benson, David F Gleich, and Desmond J Higham · 2021
Closest in time.
Persistent homology of geospatial data: A case study with voting
Michelle Feng and Mason A Porter · 2021
Closest in time.