Phase transitions in a power-law uniform hypergraph
From MaRDI portal
Publication:6118244
DOI10.1080/03610926.2022.2097265arXiv2105.04296OpenAlexW4284990305MaRDI QIDQ6118244
Publication date: 23 February 2024
Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.04296
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypergraphs with no cycle of length 4
- On 3-uniform hypergraphs without a cycle of a given length
- Consistency of spectral hypergraph partitioning under planted partition model
- Loose Hamilton cycles in hypergraphs
- Spectra, Euclidean representations and clusterings of hypergraphs
- Generating simple random graphs with prescribed degree distribution
- The largest component in a subcritical random graph with a power law degree distribution
- On the notion of cycles in hypergraphs
- Connected components in random graphs with given expected degree sequences
- Counting cliques and cycles in scale-free inhomogeneous random graphs
- Number of edges in inhomogeneous random graphs
- Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues
- Limit laws in the generalized random graphs with random vertex weights
- Sharp detection boundaries on testing dense subhypergraph
- Large Cliques in a Power-Law Random Graph
- The Volume of the Giant Component of a Random Graph with Given Expected Degrees
- On Tight Cycles in Hypergraphs
- The phase transition in inhomogeneous random graphs
- On a conditionally Poissonian graph process
- Quelques théorèmes sur les fonctions indépendantes
This page was built for publication: Phase transitions in a power-law uniform hypergraph
