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 α∈(0,∞) 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 α=1. Interestingly, for the number of loose 2-cycle, phase transition occurs at both α=1 and α=2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.