Nonparametric Modeling of Higher-Order Interactions via Hypergraphons

05/18/2021
by   Krishnakumar Balasubramanian, et al.
0

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.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

05/30/2018

Bayesian Nonparametric Higher Order Hidden Markov Models

We consider the problem of flexible modeling of higher order hidden Mark...
02/06/2021

Understanding Higher-order Structures in Evolving Graphs: A Simplicial Complex based Kernel Estimation Approach

Dynamic graphs are rife with higher-order interactions, such as co-autho...
06/28/2019

Bias-Variance Trade-Off in Hierarchical Probabilistic Models Using Higher-Order Feature Interactions

Hierarchical probabilistic models are able to use a large number of para...
11/28/2018

Higher-Order Clustering in Heterogeneous Information Networks

As one type of complex networks widely-seen in real-world application, h...
08/02/2019

Network Shrinkage Estimation

Networks are a natural representation of complex systems across the scie...
04/12/2022

Principled inference of hyperedges and overlapping communities in hypergraphs

Hypergraphs, encoding structured interactions among any number of system...
02/06/2021

Opinion Dynamics Incorporating Higher-Order Interactions

The issue of opinion sharing and formation has received considerable att...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.