Midas: Representative sampling from real-world hypergraphs
Graphs are widely used for representing pairwise interactions in complex systems. Since
such real-world graphs are large and often evergrowing, sampling a small representative …
such real-world graphs are large and often evergrowing, sampling a small representative …
Sampling hypergraphs with given degrees
There is a well-known connection between hypergraphs and bipartite graphs, obtained by
treating the incidence matrix of the hypergraph as the biadjacency matrix of a bipartite …
treating the incidence matrix of the hypergraph as the biadjacency matrix of a bipartite …
HYGENE: A Diffusion-based Hypergraph Generation Method
Hypergraphs are powerful mathematical structures that can model complex, high-order
relationships in various domains, including social networks, bioinformatics, and …
relationships in various domains, including social networks, bioinformatics, and …
[HTML][HTML] Structure and dynamics analysis of brain functional hypernetworks based on the null models
C Cheng, Y Li, C Wang, Y Yang, H Guo - Brain Research Bulletin, 2025 - Elsevier
Brain functional hypernetworks that can characterize the complex and multivariate
interactions among multiple brain regions have been widely used in the diagnosis and …
interactions among multiple brain regions have been widely used in the diagnosis and …
Representative and Back-In-Time Sampling from Real-world Hypergraphs
Graphs are widely used for representing pairwise interactions in complex systems. Since
such real-world graphs are large and often evergrowing, sampling subgraphs is useful for …
such real-world graphs are large and often evergrowing, sampling subgraphs is useful for …
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence
Partite, 3-uniform hypergraphs are 3-uniform hypergraphs in which each hyperedge
contains exactly one point from each of the 3 disjoint vertex classes. We consider the degree …
contains exactly one point from each of the 3 disjoint vertex classes. We consider the degree …
Neighborhood-based hypergraph core decomposition
We propose neighborhood-based core decomposition: a novel way of decomposing
hypergraphs into hierarchical neighborhood-cohesive subhypergraphs. Alternative …
hypergraphs into hierarchical neighborhood-cohesive subhypergraphs. Alternative …
Uniform Sampling of Negative Edge Weights in Shortest Path Networks
L Geis, D Allendorf, T BlÃĪsius, A Leonhardt… - arxiv preprint arxiv …, 2024 - arxiv.org
We consider a maximum entropy edge weight model for shortest path networks that allows
for negative weights. Given a graph $ G $ and possible weights $\mathcal {W} $ typically …
for negative weights. Given a graph $ G $ and possible weights $\mathcal {W} $ typically …
Construction of simplicial complexes with prescribed degree-size sequences
TC Yen - Physical Review E, 2021 - APS
We study the realizability of simplicial complexes with a given pair of integer sequences,
representing the node degree distribution and the facet size distribution, respectively. While …
representing the node degree distribution and the facet size distribution, respectively. While …
Hypergraph animals
MPH Stumpf - Physical Review E, 2024 - APS
Here we introduce simple structures for the analysis of complex hypergraphs, hypergraph
animals. These structures are designed to describe the local node neighborhoods of nodes …
animals. These structures are designed to describe the local node neighborhoods of nodes …