Random line graphs and edge-attributed network inference

DOI10.3150/24-BEJ1786MaRDI QIDQ7022617zbMATH OpenFDO

Authors Zachary Lubberts, Avanti Athreya, Youngser Park, Carey E. Priebe

Publication date 25 February 2025

Published in Bernoulli (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/journals/bernoulli/volume-31/issue-2/Random-line-graphs-and-edge-attributed-network-inference/10.3150/24-BEJ1786.full

zbMATH Keywords

spectral decompositionnetwork inferenceedge covariatesedge attributesrandom line graphs

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Asymptotic distribution theory in statistics (62E20) Random graphs (graph-theoretic aspects) (05C80)

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 50596 (Why is no real title available?)
• scientific article; zbMATH DE number 7415085 (Why is no real title available?)
• scientific article; zbMATH DE number 2229025 (Why is no real title available?)
• A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
• A limit theorem for scaled eigenvectors of random dot product graphs
• A nonparametric two-sample hypothesis testing problem for random graphs
• A useful variant of the Davis-Kahan theorem for statisticians
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• An introduction to matrix concentration inequalities
• Bayesian inference and testing of group differences in brain networks
• Clustering in random line graphs
• Congruent Graphs and the Connectivity of Graphs
• Covariate-assisted spectral clustering
• Graph limits and exchangeable random graphs
• Latent Space Approaches to Social Network Analysis
• Local linear graphon estimation using covariates
• Matrix Analysis
• On Random Intersection Graphs: The Subgraph Problem
• Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
• Random line graphs and edge-attributed network inference
• Spectral and matrix factorization methods for consistent community detection in multi-layer networks
• Spectral distributions of adjacency and Laplacian matrices of random graphs
• Tensor SVD: Statistical and Computational Limits
• The eigenvalues of random symmetric matrices
• The geometry of continuous latent space models for network data

Cited in

(1)

• Random line graphs and edge-attributed network inference

This page was built for publication: Random line graphs and edge-attributed network inference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022617)