Phase transition in a power-law uniform hypergraph

Abstract

We propose a power-law $m$-uniform random hypergraph on $n$ vertexes. In this hypergraph, each vertex is independently assigned a random weight from a power-law distribution with exponent $\alpha \in (0,\infty )$ and the hyperedge probabilities are defined as functions of the random weights. We characterize the number of hyperedge and the number of loose 2-cycle. There is a phase transition phenomenon for the number of hyperedge at $\alpha =1$. Interestingly, for the number of loose 2-cycle, phase transition occurs at both $\alpha =1$ and $\alpha =2$.

References in corpus (7)

• Complex Networks as Hypergraphs
• Generating simple random graphs with prescribed degree distribution
• Random hypergraphs and their applications
• A General Formalism for Inhomogeneous Random Graphs
• Consistency of Spectral Hypergraph Partitioning under Planted Partition Model
• Loose Hamilton cycles in hypergraphs
• Counting cliques and cycles in scale-free inhomogeneous random graphs