Nonparametric Modeling of Higher-Order Interactions via Hypergraphons

Abstract

We study statistical and algorithmic aspects of using hypergraphons, that are limits of large hypergraphs, for modeling higher-order interactions. Although hypergraphons are extremely powerful from a modeling perspective, we consider a restricted class of Simple Lipschitz Hypergraphons (SLH), that are amenable to practically efficient estimation. We also provide rates of convergence for our estimator that are optimal for the class of SLH. Simulation results are provided to corroborate the theory.

To appear in Journal of Machine Learning Research

References in corpus (6)

• Random hypergraphs and their applications
• Alignment and integration of complex networks by hypergraph-based spectral clustering
• Statistical and Computational Guarantees of Lloyd's Algorithm and its Variants
• $\beta$ models for random hypergraphs with a given degree sequence
• Model-free consistency of graph partitioning
• Hierarchical network models for structured exchangeable interaction processes