Network representation using graph root distributions
From MaRDI portal
Publication:2039784
Abstract: Exchangeable random graphs serve as an important probabilistic framework for the statistical analysis of network data. In this work we develop an alternative parameterization for a large class of exchangeable random graphs, where the nodes are independent random vectors in a linear space equipped with an indefinite inner product, and the edge probability between two nodes equals the inner product of the corresponding node vectors. Therefore, the distribution of exchangeable random graphs in this subclass can be represented by a node sampling distribution on this linear space, which we call the graph root distribution. We study existence and identifiability of such representations, the topological relationship between the graph root distribution and the exchangeable random graph sampling distribution, and estimation of graph root distributions.
The author introduces a new parameterization of exchangeable random graphs (i.e., random graphs which are probabilistically invariant under a permutation of the vertices) satisfying some mild conditions on a related spectral decomposition. This parameterization is in terms of a family of probability distributions (called \textit{graph root distributions}) on a separable Kreĭn space. Issues of identifiability are discussed. It is shown that closeness of two graph root distributions in a certain Wasserstein distance implies closeness of the corresponding graphons in cut distance. Statistical questions of estimation using graph root distributions are considered for both dense and sparse random graphs. The paper concludes with numerical examples to illustrate its results.
Recommendations
Cites work
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- A goodness-of-fit test for stochastic block models
- A nonparametric two-sample hypothesis testing problem for random graphs
- A nonparametric view of network models and Newman–Girvan and other modularities
- A survey of statistical network models
- Adaptive global testing for functional linear models
- Asymptotic equivalence of functional linear regression and a white noise inverse problem
- Community detection in degree-corrected block models
- Consistency of community detection in networks under degree-corrected stochastic block models
- Convergence and concentration of empirical measures under Wasserstein distance in unbounded functional spaces
- Edge exchangeable models for interaction networks
- Estimating network edge probabilities by neighbourhood smoothing
- Fast community detection by SCORE
- Graph partitioning via adaptive spectral techniques
- scientific article; zbMATH DE number 3780300 (Why is no real title available?)
- scientific article; zbMATH DE number 1745905 (Why is no real title available?)
- Large networks and graph limits
- Latent space models for dynamic networks
- Matrix estimation by universal singular value thresholding
- Methodology and convergence rates for functional linear regression
- Mixed membership stochastic blockmodels
- Network cross-validation for determining the number of communities in network data
- Networks. An introduction.
- On the representation theorem for exchangeable arrays
- Optimal graphon estimation in cut distance
- Oracle inequalities for network models and sparse graphon estimation
- Random Geometric Graphs
- Rate-optimal graphon estimation
- Representations for partially exchangeable arrays of random variables
- Sparse graphs using exchangeable random measures
- Spectral clustering and the high-dimensional stochastic blockmodel
- Statistical analysis of network data. Methods and models
- Statistical inference on random dot product graphs: a survey
- The method of moments and degree distributions for network models
- The phase transition in inhomogeneous random graphs
Cited in
(21)- On edge exchangeable random graphs
- Exchangeable trait allocations
- Truncated simulation and inference in edge-exchangeable networks
- Bootstrapping exchangeable random graphs
- Ordinal network representation: Representing proximities by graphs
- Sampling and estimation for (sparse) exchangeable graphs
- Edge exchangeable models for interaction networks
- Sparse graphs using exchangeable random measures
- Random networks, graphical models and exchangeability
- Priors on exchangeable directed graphs
- On exchangeability in network models
- Exchangeable random networks
- A Zero-imputation Approach in Recommendation Systems with Data Missing Heterogeneously
- Hypothesis testing for equality of latent positions in random graphs
- Conformal Prediction for Network-Assisted Regression
- Minimax optimal probability matrix estimation for graphon with spectral decay
- Semiparametric modeling and analysis for longitudinal network data
- Bootstrapping networks with latent space structure
- An overview of asymptotic normality in stochastic blockmodels: cluster analysis and inference
- Higher-order graphon theory: fluctuations, degeneracies and inference
- Nonparametric inference for balance in signed networks
This page was built for publication: Network representation using graph root distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2039784)
