Nonparametric modeling of higher-order interactions via hypergraphons
From MaRDI portal
Recommendations
Cites work
- A Decomposition for Three-Way Arrays
- A measure-theoretic approach to the theory of dense hypergraphs
- A nonparametric view of network models and Newman–Girvan and other modularities
- A survey of statistical network models
- Central limit theorems for the large-spin asymptotics of quantum spins
- Coauthorship and citation networks for statisticians
- Community Recovery in Hypergraphs
- Community detection and stochastic block models: recent developments
- Community detection in degree-corrected block models
- Concentration and regularization of random graphs
- Consistency of spectral clustering in stochastic block models
- Consistency of spectral hypergraph partitioning under planted partition model
- Critical exponents of graphs
- Discussion of ``Coauthorship and citation networks for statisticians
- Dynamic network models and graphon estimation
- Edge exchangeable models for interaction networks
- Entrywise eigenvector analysis of random matrices with low expected rank
- Estimating network edge probabilities by neighbourhood smoothing
- Exchangeable trait allocations
- Generalized random dot product graph
- Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
- Hypergraph limits: A regularity approach
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Large networks and graph limits
- Latent Space Approaches to Social Network Analysis
- Matrix estimation by universal singular value thresholding
- Multivariate sampling and the estimation problem for exchangeable arrays
- Networks beyond pairwise interactions: structure and dynamics
- Optimal graphon estimation in cut distance
- Oracle inequalities for network models and sparse graphon estimation
- Random graphs with a given degree sequence
- Rate-optimal graphon estimation
- Representations for partially exchangeable arrays of random variables
- Sampling and estimation for (sparse) exchangeable graphs
- Sampling perspectives on sparse exchangeable graphs
- Sparse graphs using exchangeable random measures
- Spectral clustering and the high-dimensional stochastic blockmodel
- Spectral redemption in clustering sparse networks
- Statistical analysis of network data. Methods and models
- Stochastic blockmodels with a growing number of classes
- Uniform hypergraph partitioning: provable tensor methods and sampling techniques
- \(\beta\) models for random hypergraphs with a given degree sequence
Cited in
(7)- Random Simplicial Complexes: Models and Phenomena
- scientific article; zbMATH DE number 4130439 (Why is no real title available?)
- Latent Space Modeling of Hypergraph Data
- Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition
- Model-based clustering in simple hypergraphs through a stochastic blockmodel
- Nonparametric Modeling of Higher-Order Interactions via Hypergraphons
- Statistical and Computational Efficiency for Smooth Tensor Estimation with Unknown Permutations
This page was built for publication: Nonparametric modeling of higher-order interactions via hypergraphons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5159418)
