Nonparametric Modeling of Higher-Order Interactions via Hypergraphons

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

page 1

page 2

page 3

page 4

research
05/30/2018

Bayesian Nonparametric Higher Order Hidden Markov Models

We consider the problem of flexible modeling of higher order hidden Mark...
research
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...
research
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...
research
09/21/2022

Exact and Sampling Methods for Mining Higher-Order Motifs in Large Hypergraphs

Network motifs are patterns of interactions occurring among a small set ...
research
11/28/2018

Higher-Order Clustering in Heterogeneous Information Networks

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

Network Shrinkage Estimation

Networks are a natural representation of complex systems across the scie...
research
06/12/2020

Explaining Local, Global, And Higher-Order Interactions In Deep Learning

We present a simple yet highly generalizable method for explaining inter...

Please sign up or login with your details

Forgot password? Click here to reset