Randomizing Hypergraphs Preserving Degree Correlation and Local Clustering

  title={Randomizing Hypergraphs Preserving Degree Correlation and Local Clustering},
  author={Kazuki Nakajima and Kazuyuki Shudo and Naoki Masuda},
  journal={IEEE Transactions on Network Science and Engineering},
Many complex systems involve direct interactions among more than two entities and can be represented by hypergraphs, in which hyperedges encode higher-order interactions among an arbitrary number of nodes. To analyze structures and dynamics of given hypergraphs, a solid practice is to compare them with those for randomized hypergraphs that preserve some specific properties of the original hypergraphs. In the present study, we propose a family of such reference models for hypergraphs, called the… 

Figures and Tables from this paper

What makes a reaction network"chemical"?
Background: Reaction networks (RNs) comprise a set X of species and a set R of reactions Y → Y ′, each converting a multiset of educts Y ⊆ X into a multiset Y ′ ⊆ X of products. RNs are equivalent to
Higher-order rich-club phenomenon in collaborative research grants
Modern scientific work, including writing papers and submitting research grant proposals, increasingly involves researchers from different institutions. In grant collaborations, it is known that


Random graphs with arbitrary degree distributions and their applications.
It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.
Systematic topology analysis and generation using degree correlations
This work presents a new, systematic approach for analyzing network topologies, introducing the dK-series of probability distributions specifying all degree correlations within d-sized subgraphs of a given graph G, and demonstrates that these graphs reproduce, with increasing accuracy, important properties of measured and modeled Internet topologies.
Exact sampling of graphs with prescribed degree correlations
This work develops an exact method to construct and sample graphs with a specified joint-degree matrix, which is a matrix providing the number of edges between all the sets of nodes of a given degree, for all degrees, thus completely specifying all pairwise degree correlations, and additionally, the degree sequence itself.
Simplicial SIS model in scale-free uniform hypergraph
The hypergraph offers a platform to study structural properties emerging from more complicated and higher-order than pairwise interactions among constituents and dynamical behavior such as the spread
Configuring Random Graph Models with Fixed Degree Sequences
This work studies the subtle but important decisions underlying the specification of a configuration model, and investigates the role these choices play in graph sampling procedures and a suite of applications, placing particular emphasis on the importance of specifying the appropriate graph labeling under which to consider a null model.
Constructing and sampling graphs with a prescribed joint degree distribution
An algorithm for constructing simple graphs from a given joint degree distribution, and a Monte Carlo Markov chain method for sampling them, and it is shown that the state space of simple graphs with a fixed degree distribution is connected via endpoint switches.
Generative hypergraph clustering: From blockmodels to modularity
This work proposes a probabilistic generative model of clustered hypergraphs with heterogeneous node degrees and edge sizes and derives an inference algorithm that generalizes the Louvain graph community detection method, and a faster, specialized variant in which edges are expected to lie fully within clusters.
Coupled dynamics on hypergraphs: Master stability of steady states and synchronization.
This work generalizes the master stability approach to hypergraphs and provides a blueprint for how to generalize dynamical structures and results from graphs tohypergraphs.
The effect of heterogeneity on hypergraph contagion models
A hyperdegree-based mean-field description of the dynamics of the susceptible–infected–susceptible model on hypergraphs is presented and it is found that explosive transitions can be suppressed by heterogeneity in the link degree distribution when links and triangles are chosen independently or when link and triangle connections are positively correlated when compared to the uncorrelated case.
2.5K-graphs: From sampling to generation
This paper proposes a complete, practical methodology for generating graphs that resemble a real graph of interest and proposes an efficient algorithm for generating topologies that have the exact target JDD and a c̅(k) close to the target.