Community detection and percolation of information in a geometric setting
From MaRDI portal
Publication:5886352
Cites work
- scientific article; zbMATH DE number 994345 (Why is no real title available?)
- scientific article; zbMATH DE number 2151257 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- scientific article; zbMATH DE number 7650120 (Why is no real title available?)
- A useful variant of the Davis-Kahan theorem for statisticians
- Accurate error bounds for the eigenvalues of the kernel matrix
- Adaptive estimation of nonparametric geometric graphs
- CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION
- Community detection and stochastic block models
- Concentration and regularization of random graphs
- Information flow on trees
- On the time for Brownian motion to visit every point on a circle
- Reconstruction on trees: Beating the second eigenvalue
- Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters
- Testing for high-dimensional geometry in random graphs
- Universally consistent vertex classification for latent positions graphs
- User-friendly tail bounds for sums of random matrices
Cited in
(2)
This page was built for publication: Community detection and percolation of information in a geometric setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886352)