Weighted random dot product graphs
From MaRDI portal
Cites work
- A statistical interpretation of spectral embedding: the generalised random dot product graph
- A useful variant of the Davis-Kahan theorem for statisticians
- Automatic dimensionality selection from the scree plot via the use of profile likelihood
- Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
- Bootstrapping networks with latent space structure
- Fast unfolding of communities in large networks
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3108056 (Why is no real title available?)
- Latent Space Approaches to Social Network Analysis
- Modeling graphs using dot product representations
- Network Models for Data Science
- Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials
- Statistical analysis of network data. Methods and models
- Statistical inference on random dot product graphs: a survey
- The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics
- Topics at the Frontier of Statistics and Network Analysis
- Type I and type II codes over the ring \(\mathbb{F}_2+s \mathbb{F}_2+s^2\mathbb{F}_2\)
- User-friendly tail bounds for sums of random matrices
This page was built for publication: Weighted random dot product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7308623)
