Fetching the paper…
Reading the bibliography…
Hypergraphs, which belong to the family of higher-order networks, are a natural and powerful choice for modeling group interactions in the real world.
Hypergraph and uncertain hypergraph representation learning theory and methods
Liyan Zhang, Jingfeng Guo, Jiazheng Wang, Jing Wang, Shanshan Li, and Chunying Zhang. 2022 · 1921
Earlier work this paper cites.
The sociology of Georg Simmel . Vol. 92892
Georg Simmel. 1950 · 1950
Earlier work this paper cites.
On the evolution of random graphs
Paul Erdős and Alfréd Rényi. 1960 · 1960
Earlier work this paper cites.
Transitivity in structural models of small groups
Paul W Holland and Samuel Leinhardt. 1971 · 1971
Earlier work this paper cites.
Hypergraph clustering based on pagerank. In
Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda, and Yuichi Yoshida. 2020 · 1978
Earlier work this paper cites.
Network structure and minimum degree
Stephen B Seidman. 1983 · 1983
Earlier work this paper cites.
Modeling hypergraphs by graphs with the same mincut properties
Edmund Ihler, Dorothea Wagner, and Frank Wagner. 1993 · 1993
Earlier work this paper cites.
Collective dynamics of small-world networks
Duncan J Watts and Steven H Strogatz. 1998 · 1998
Earlier work this paper cites.
Emergence of scaling in random networks
Albert-László Barabási and Réka Albert. 1999 · 1999
Earlier work this paper cites.
Lifting Markov chains to speed up mixing. In
Fang Chen, László Lovász, and Igor Pak. 1999 · 1999
Earlier work this paper cites.
On power-law relationships of the Internet topology
Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. 1999 · 1999
Earlier work this paper cites.
Models of core/periphery structures
Stephen P Borgatti and Martin G Everett. 2000 · 2000
Earlier work this paper cites.
Temporal locality and its impact on Web proxy cache performance
Anirban Mahanti, Derek Eager, and Carey Williamson. 2000 · 2000
Earlier work this paper cites.
Normalized cuts and image segmentation
Jianbo Shi and Jitendra Malik. 2000 · 2000
Earlier work this paper cites.
Clustering and preferential attachment in growing networks
Mark EJ Newman. 2001 · 2001
Earlier work this paper cites.
Introduction to graph theory . Vol. 2
Douglas Brent West et al · 2001
Earlier work this paper cites.
The average distances in random graphs with given expected degrees
Fan Chung and Linyuan Lu. 2002 · 2002
Earlier work this paper cites.
Network motifs: Simple building blocks of complex networks
Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002 · 2002
Earlier work this paper cites.
Assortative mixing in networks
Mark EJ Newman. 2002 · 2002
Earlier work this paper cites.
Methods and metrics for cold-start recommendations. In
Andrew I Schein, Alexandrin Popescul, Lyle H Ungar, and David M Pennock. 2002 · 2002
Earlier work this paper cites.
Applied probability and queues . Vol. 2
Søren Asmussen, Soren Asmussen, and Sren Asmussen. 2003 · 2003
Earlier work this paper cites.
Scale-free networks
Albert-László Barabási and Eric Bonabeau. 2003 · 2003
Earlier work this paper cites.
Graph-based anomaly detection. In
Caleb C Noble and Diane J Cook. 2003 · 2003
Earlier work this paper cites.
Clustering large graphs via the singular value decomposition
Petros Drineas, Alan Frieze, Ravi Kannan, Santosh Vempala, and Vishwanathan Vinay. 2004 · 2004
Earlier work this paper cites.
Superfamilies of evolved and designed networks
Ron Milo, Shalev Itzkovitz, Nadav Kashtan, Reuven Levitt, Shai Shen-Orr, Inbal Ayzenshtat, Michal Sheffer, and Uri Alon. 2004 · 2004
Earlier work this paper cites.
A hypergraph model for the yeast protein complex network. In
Emad Ramadan, Arijit Tarafdar, and Alex Pothen. 2004 · 2004
Earlier work this paper cites.
Complex networks as hypergraphs
Ernesto Estrada and Juan A Rodriguez-Velazquez. 2005 · 2005
Earlier work this paper cites.
Graphs over time: Densification laws, shrinking diameters and possible explanations. In
Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. 2005 · 2005
Earlier work this paper cites.
Graph mining: Laws, generators, and algorithms
Deepayan Chakrabarti and Christos Faloutsos. 2006 · 2006
Earlier work this paper cites.
Subgraph centrality and clustering in complex hyper-networks
Ernesto Estrada and Juan A Rodríguez-Velázquez. 2006 · 2006
Earlier work this paper cites.
Systematic topology analysis and generation using degree correlations
Priya Mahadevan, Dmitri Krioukov, Kevin Fall, and Amin Vahdat. 2006 · 2006
Earlier work this paper cites.
Learning with hypergraphs: Clustering, classification, and embedding. In
Dengyong Zhou, Jiayuan Huang, and Bernhard Schölkopf. 2006 · 2006
Earlier work this paper cites.
Graph evolution: Densification and shrinking diameters
Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. 2007 · 2007
Earlier work this paper cites.
A null-model for significance testing of presence-only species distribution models
Niels Raes and Hans ter Steege. 2007 · 2007
Earlier work this paper cites.
Fast unfolding of communities in large networks
Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008 · 2008
Earlier work this paper cites.
Hypergraphs and cellular networks
Steffen Klamt, Utz-Uwe Haus, and Fabian Theis. 2009 · 2009
Earlier work this paper cites.
Towards community detection in k-partite k-uniform hypergraphs. In
Nicolas Neubauer and Klaus Obermayer. 2009 · 2009
Earlier work this paper cites.
Laplacian eigenvalues and partition problems in hypergraphs
JA Rodriguez. 2009 · 2009
Earlier work this paper cites.
Detection of overlapping communities in dynamical social networks. In
Remy Cazabet, Frederic Amblard, and Chihab Hanachi. 2010 · 2010
Earlier work this paper cites.
Community detection in graphs
Santo Fortunato. 2010 · 2010
Earlier work this paper cites.
Introducing the Graph 500
Richard C Murphy, Kyle B Wheeler, Brian W Barrett, and James A Ang. 2010 · 2010
Earlier work this paper cites.
PEGASUS: Mining peta-scale graphs
U Kang, Charalampos E Tsourakakis, and Christos Faloutsos. 2011 · 2011
Earlier work this paper cites.
Community detection in graphs using singular value decomposition
Somwrita Sarkar and Andy Dong. 2011 · 2011
Earlier work this paper cites.
HEIGEN: Spectral analysis for billion-scale graphs
U Kang, Brendan Meeder, Evangelos E Papalexakis, and Christos Faloutsos. 2012 · 2012
Earlier work this paper cites.
Automated detection of influential patents using singular values
Dohyun Kim, Bangrae Lee, Hyuck Jai Lee, Sang Pil Lee, Yeongho Moon, and Myong K Jeong. 2012 · 2012
Earlier work this paper cites.
Defining and evaluating network communities based on ground-truth. In
Jaewon Yang and Jure Leskovec. 2012 · 2012
Earlier work this paper cites.
On community detection in real-world networks and the importance of degree assortativity. In
Marek Ciglan, Michal Laclavík, and Kjetil Nørvåg. 2013 · 2013
Earlier work this paper cites.
Clustering coefficients in protein interaction hypernetworks. In
Suzanne Renick Gallagher and Debra S Goldberg. 2013 · 2013
Earlier work this paper cites.
The total variation on hypergraphs-learning on hypergraphs revisited. In
Matthias Hein, Simon Setzer, Leonardo Jost, and Syama Sundar Rangapuram. 2013 · 2013
Earlier work this paper cites.
Big graph mining: Algorithms and discoveries
U Kang and Christos Faloutsos. 2013 · 2013
Earlier work this paper cites.
GPS: A graph processing system. In
Semih Salihoglu and Jennifer Widom. 2013 · 2013
Earlier work this paper cites.
Pareto distribution
Barry C Arnold. 2014 · 2014
Earlier work this paper cites.
Real-time Twitter recommendation: Online motif detection in large dynamic graphs
Pankaj Gupta, Venu Satuluri, Ajeet Grewal, Siva Gurumurthy, Volodymyr Zhabiuk, Quannan Li, and Jimmy Lin. 2014 · 2014
Earlier work this paper cites.
Discovering social circles in ego networks
Julian Mcauley and Jure Leskovec. 2014 · 2014
Earlier work this paper cites.
Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches. In
Yuichi Yoshida. 2014 · 2014
Earlier work this paper cites.
Bundle recommendation in ecommerce. In
Tao Zhu, Patrick Harrington, Junjun Li, and Lei Tang. 2014 · 2014
Earlier work this paper cites.
Graph based anomaly detection and description: A survey
Leman Akoglu, Hanghang Tong, and Danai Koutra. 2015 · 2015
Earlier work this paper cites.
Hypergraph partitioning for multiple communication cost metrics: Model and methods
Mehmet Deveci, Kamer Kaya, Bora Uçar, and Ümit V Çatalyürek. 2015 · 2015
Earlier work this paper cites.
Ego-net community mining applied to friend suggestion
Alessandro Epasto, Silvio Lattanzi, Vahab Mirrokni, Ismail Oner Sebe, Ahmed Taei, and Sunita Verma. 2015 · 2015
Earlier work this paper cites.
Triadic closure pattern analysis and prediction in social networks
Hong Huang, Jie Tang, Lu Liu, JarDer Luo, and Xiaoming Fu. 2015 · 2015
Earlier work this paper cites.
A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox
Madhav Jha, C Seshadhri, and Ali Pinar. 2015 · 2015
Cited alongside, same era.
Corescope: Graph mining using k-core analysis—patterns, anomalies and algorithms. In
Kijung Shin, Tina Eliassi-Rad, and Christos Faloutsos. 2016 · 2016
Cited alongside, same era.
Consistency of spectral hypergraph partitioning under planted partition model
Debarghya Ghoshdastidar and Ambedkar Dukkipati. 2017 · 2017
Cited alongside, same era.
Hypergraphs and extremal optimization in 3D integrated circuit design automation
Katarzyna Grzesiak-Kopeć, Piotr Oramus, and Maciej Ogorzałek. 2017 · 2017
Cited alongside, same era.
Maintaining densest subsets efficiently in evolving hypergraphs. In
Shuguang Hu, Xiaowei Wu, and TH Hubert Chan. 2017 · 2017
Cited alongside, same era.
A new dynamic algorithm for densest subhypergraphs. In
Suman K Bera, Sayan Bhattacharya, Jayesh Choudhari, and Prantar Ghosh. 2022 · 2022
Later among the works it cites.
Graph mining: Laws, tools, and case studies
Deepayan Chakrabarti and Christos Faloutsos. 2022 · 2022
Later among the works it cites.
MiDaS: Representative sampling from real-world hypergraphs. In
Minyoung Choe, Jaemin Yoo, Geon Lee, Woonsung Baek, U Kang, and Kijung Shin. 2022 · 2022
Later among the works it cites.
On the persistence of higher-order interactions in real-world hypergraphs. In
Hyunjin Choo and Kijung Shin. 2022 · 2022
Later among the works it cites.
Inference of hyperedges and overlapping communities in hypergraphs
Martina Contisciani, Federico Battiston, and Caterina De Bacco. 2022 · 2022
Later among the works it cites.
Preferential attachment hypergraph with high modularity
Frédéric Giroire, Nicolas Nisse, Thibaud Trolliet, and Małgorzata Sulkowska. 2022 · 2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Pan Li and Olgica Milenkovic. 2017 · 2017
Cited alongside, same era.
Detecting strong ties using network motifs. In
Rahmtin Rotabi, Krishna Kamath, Jon Kleinberg, and Aneesh Sharma. 2017 · 2017
Cited alongside, same era.
Hypergraph partitioning for social networks based on information entropy modularity
Wenyin Yang, Guojun Wang, Md Zakirul Alam Bhuiyan, and Kim-Kwang Raymond Choo. 2017 · 2017
Cited alongside, same era.
Simplicial closure and higher-order link prediction
Austin R Benson, Rediet Abebe, Michael T Schaub, Ali Jadbabaie, and Jon Kleinberg. 2018a · 2018
Cited alongside, same era.
Chapel hypergraph library (CHGL). In
Louis Jenkins, Tanveer Bhuiyan, Sarah Harun, Christopher Lightsey, David Mentgen, Sinan Aksoy, Timothy Stavcnger, Marcin Zalewski, Hugh Medal, and Cliff Joslyn. 2018 · 2018
Cited alongside, same era.
Submodular hypergraphs: p-laplacians, cheeger inequalities and spectral clustering. In
Pan Li and Olgica Milenkovic. 2018 · 2018
Cited alongside, same era.
Hypergraph
Shota Saito, Danilo Mandic, and Hideyuki Suzuki. 2018 · 2018
Cited alongside, same era.
Later among the works it cites.
Higher-order components in hypergraphs
Jung-Ho Kim and K-I Goh. 2022 · 2022
Later among the works it cites.
Growth patterns and models of real-world hypergraphs
Jihoon Ko, Yunbum Kook, and Kijung Shin. 2022 · 2022
Later among the works it cites.
Vector centrality in hypergraphs
Kirill Kovalenko, Miguel Romance, Ekaterina Vasilyeva, David Aleja, Regino Criado, Daniil Musatov, Andrei M Raigorodskii, Julio Flores, Ivan Samoylenko, Karin Alfaro-Bittner, et al · 2022
Later among the works it cites.
Hypergraph assortativity: A dynamical systems perspective
Nicholas W Landry and Juan G Restrepo. 2022 · 2022
Later among the works it cites.
Higher-order motif analysis in hypergraphs
Quintino Francesco Lotito, Federico Musciotto, Alberto Montresor, and Federico Battiston. 2022 · 2022
Later among the works it cites.
Learning causal effects on hypergraphs. In
Jing Ma, Mengting Wan, Longqi Yang, Jundong Li, Brent Hecht, and Jaime Teevan. 2022 · 2022
Later among the works it cites.
Identifying maximal sets of significantly interacting nodes in higher-order networks
Federico Musciotto, Federico Battiston, and Rosario N Mantegna. 2022 · 2022
Later among the works it cites.
Core-periphery models for hypergraphs. In
Marios Papachristou and Jon Kleinberg. 2022 · 2022
Later among the works it cites.
Hypergraph simultaneous generators. In
Bahman Pedrood, Carlotta Domeniconi, and Kathryn Laskey. 2022 · 2022
Later among the works it cites.
Nonlinear feature diffusion on hypergraphs. In
Konstantin Prokopchik, Austin R Benson, and Francesco Tudisco. 2022 · 2022
Later among the works it cites.
Hypergraph cuts with general splitting functions
Nate Veldt, Austin R Benson, and Jon Kleinberg. 2022 · 2022
Later among the works it cites.
Semi-supervised hypergraph node classification on hypergraph line expansion. In
Chaoqi Yang, Ruijie Wang, Shuochao Yao, and Tarek Abdelzaher. 2022 · 2022
Later among the works it cites.
Structure of international trade hypergraphs
Sudo Yi and Deok-Sun Lee. 2022 · 2022
Later among the works it cites.
Testing community structure for hypergraphs
Mingao Yuan, Ruiqi Liu, Yang Feng, and Zuofeng Shang. 2022 · 2022
Later among the works it cites.
A survey on hypergraph representation learning
Alessia Antelmi, Gennaro Cordasco, Mirko Polato, Vittorio Scarano, Carmine Spagnuolo, and Dingqi Yang. 2023 · 2023
Later among the works it cites.
Hypercore decomposition for non-fragile hyperedges: Concepts, algorithms, observations, and applications
Fanchen Bu, Geon Lee, and Kijung Shin. 2023 · 2023
Later among the works it cites.
More recent advances in (hyper) graph partitioning
Ümit Çatalyürek, Karen Devine, Marcelo Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, et al · 2023
Later among the works it cites.
Improving the core resilience of real-world hypergraphs
Manh Tuan Do and Kijung Shin. 2023 · 2023
Later among the works it cites.
Modularity-based hypergraph clustering: Random hypergraph model, hyperedge-cluster relation, and computation
Zijin Feng, Miao Qiao, and Hong Cheng. 2023 · 2023
Later among the works it cites.
Identifying vital nodes in hypergraphs based on von Neumann entropy
Feng Hu, Kuo Tian, and Zi-Ke Zhang. 2023 · 2023
Later among the works it cites.
Contagion dynamics on hypergraphs with nested hyperedges
Jihye Kim, Deok-Sun Lee, and K-I Goh. 2023d · 2023
Later among the works it cites.
Reciprocity in directed hypergraphs: Measures, findings, and generators
Sunwoo Kim, Minyoung Choe, Jaemin Yoo, and Kijung Shin. 2023b · 2023
Later among the works it cites.
Encapsulation structure and dynamics in hypergraphs
Timothy LaRock and Renaud Lambiotte. 2023 · 2023
Later among the works it cites.
Temporal hypergraph motifs
Geon Lee and Kijung Shin. 2023 · 2023
Later among the works it cites.
Computation of node distances on hypergraphs. In
Enzhi Li and Bilal Fadlallah. 2023 · 2023
Later among the works it cites.
Hypergraphx: A library for higher-order network analysis
Quintino Francesco Lotito, Martina Contisciani, Caterina De Bacco, Leonardo Di Gaetano, Luca Gallo, Alberto Montresor, Federico Musciotto, Nicolò Ruggeri, and Federico Battiston. 2023a · 2023
Later among the works it cites.
Exact and sampling methods for mining higher-order motifs in large hypergraphs
Quintino Francesco Lotito, Federico Musciotto, Federico Battiston, and Alberto Montresor. 2023b · 2023
Later among the works it cites.
Four-set hypergraphlets for characterization of directed hypergraphs
Heechan Moon, Hyunju Kim, Sunwoo Kim, and Kijung Shin. 2023 · 2023
Later among the works it cites.
Jason Niu, Ilya D Amburg, Sinan G Aksoy, and Ahmet Erdem Sarıyüce. 2023 · 2023
Later among the works it cites.
Growing hypergraphs with preferential linking
Dahae Roh and K-I Goh. 2023 · 2023
Later among the works it cites.
Community detection in large hypergraphs
Nicolò Ruggeri, Martina Contisciani, Federico Battiston, and Caterina De Bacco. 2023 · 2023
Later among the works it cites.
Generalizing
Shota Saito and Mark Herbster. 2023 · 2023
Later among the works it cites.
High-quality hypergraph partitioning
Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, and Peter Sanders. 2023 · 2023
Later among the works it cites.
Core-periphery detection in hypergraphs
Francesco Tudisco and Desmond J Higham. 2023 · 2023
Later among the works it cites.
Distances in higher-order networks and the metric structure of hypergraphs
Ekaterina Vasilyeva, Miguel Romance, Ivan Samoylenko, Kirill Kovalenko, Daniil Musatov, Andrey Mihailovich Raigorodskii, and Stefano Boccaletti. 2023 · 2023
Later among the works it cites.
Vital node identification in hypergraphs via gravity model
Xiaowen Xie, Xiuxiu Zhan, Zike Zhang, and Chuang Liu. 2023 · 2023
Later among the works it cites.
Efficiently sampling and estimating hypergraphs by hybrid random walk. In
Lingling Zhang, Zhiwei Zhang, Guoren Wang, and Ye Yuan. 2023 · 2023
Later among the works it cites.
Representative and back-in-time sampling from real-world hypergraphs
Minyoung Choe, Jaemin Yoo, Geon Lee, Woonsung Baek, U Kang, and Kijung Shin. 2024 · 2024
Closest in time.
Higher-order correlations reveal complex memory in temporal hypergraphs
Luca Gallo, Lucas Lacasa, Vito Latora, and Federico Battiston. 2024 · 2024
Closest in time.
Scalable high-quality hypergraph partitioning
Lars Gottesbüren, Tobias Heuer, Nikolai Maas, Peter Sanders, and Sebastian Schlag. 2024 · 2024
Closest in time.
Clustering coefficients for networks with higher order interactions
Gyeong-Gyun Ha, Izaak Neri, and Alessia Annibale. 2024 · 2024
Closest in time.
Densest subhypergraph: Negative supermodular functions and strongly localized methods. In
Yufan Huang, David F Gleich, and Nate Veldt. 2024 · 2024
Closest in time.
Hypergraph patterns and collaboration structure
Jonas L Juul, Austin R Benson, and Jon Kleinberg. 2024 · 2024
Closest in time.
A survey on hypergraph neural networks: An in-depth and step-by-step guide. In
Sunwoo Kim, Soo Yong Lee, Yue Gao, Alessia Antelmi, Mirko Polato, and Kijung Shin. 2024 · 2024
Closest in time.
A survey on the densest subgraph problem and its variants
Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, and Francesco Bonchi. 2024 · 2024
Closest in time.
The simpliciality of higher-order networks
Nicholas W Landry, Jean-Gabriel Young, and Nicole Eikmeier. 2024 · 2024
Closest in time.
Hypergraph motifs and their extensions beyond binary
Geon Lee, Seokbum Yoon, Jihoon Ko, Hyunju Kim, and Kijung Shin. 2024 · 2024
Closest in time.
Hyperlink communities in higher-order networks
Quintino Francesco Lotito, Federico Musciotto, Alberto Montresor, and Federico Battiston. 2024 · 2024
Closest in time.
Hyper-distance oracles in hypergraphs
Giulia Preti, Gianmarco De Francisci Morales, and Francesco Bonchi. 2024a · 2024
Closest in time.
Higher-order null models as a lens for social systems
Giulia Preti, Adriano Fazzone, Giovanni Petri, and Gianmarco De Francisci Morales. 2024b · 2024
Closest in time.
From graphs to hypergraphs: Hypergraph projection and its reconstruction. In
Yanbang Wang and Jon Kleinberg. 2024 · 2024
Closest in time.
Hypergraph joint representation learning for hypervertices and hyperedges via cross expansion. In
Yuguang Yan, Yuanlin Chen, Shibo Wang, Hanrui Wu, and Ruichu Cai. 2024 · 2024
Closest in time.
Supplementary document for ‘A survey on hypergraph mining: Patterns, tools, and generators’
2025 · 2025
Closest in time.
Neighborhood-based hypergraph core decomposition
Naheed Anjum Arafat, Arijit Khan, Arpit Kumar Rai, and Bishwamittra Ghosh. 2023 · 2074
Closest in time.