$U$-statistics on bipartite exchangeable networks
T\^am Le Minh

TL;DR
This paper develops asymptotic theory for quadruplet U-statistics on bipartite exchangeable networks, enabling statistical inference such as parameter estimation and motif counting in network models.
Contribution
It introduces new asymptotic results for quadruplet U-statistics on bipartite exchangeable matrices and applies them to network inference in BEDD models.
Findings
Established weak convergence for quadruplet U-statistics.
Proved a central limit theorem for dissociated matrices.
Demonstrated applications in network parameter estimation and motif counting.
Abstract
Bipartite networks with exchangeable nodes can be represented by row-column exchangeable matrices. A quadruplet is a submatrix of size . A quadruplet -statistic is the average of a function on a quadruplet over all the quadruplets of a matrix. We prove several asymptotic results for quadruplet -statistics on row-column exchangeable matrices, including a weak convergence result in the general case and a central limit theorem when the matrix is also dissociated. These results are applied to statistical inference in network analysis. We suggest a method to perform parameter estimation, network comparison and motifs count for a particular family of row-column exchangeable network models: the bipartite expected degree distribution (BEDD) models. These applications are illustrated by simulations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Complex Network Analysis Techniques · Graph theory and applications
