2000 character limit reached
Detection of Model-based Planted Pseudo-cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embedding (2312.11054v1)
Published 18 Dec 2023 in stat.ME and stat.ML
Abstract: In this paper, we explore the capability of both the Adjacency Spectral Embedding (ASE) and the Graph Encoder Embedding (GEE) for capturing an embedded pseudo-clique structure in the random dot product graph setting. In both theory and experiments, we demonstrate that this pairing of model and methods can yield worse results than the best existing spectral clique detection methods, demonstrating at once the methods' potential inability to capture even modestly sized pseudo-cliques and the methods' robustness to the model contamination giving rise to the pseudo-clique structure. To further enrich our analysis, we also consider the Variational Graph Auto-Encoder (VGAE) model in our simulation and real data experiments.
- Finding a large hidden clique in a random graph. Random Structures & Algorithms, 13(3-4):457–466, 1998.
- E. Arias-Castro and N. Verzelen. Community detection in random networks. arXiv preprint arXiv:1302.7099, 2013.
- Computational complexity: a modern approach. Cambridge University Press, 2009.
- Statistical inference on random dot product graphs: a survey. Journal of Machine Learning Research, 18, 2018.
- A limit theorem for scaled eigenvectors of random dot product graphs. Sankhya A, 78:1–18, 2016.
- Statistical inference on random dot product graphs: a survey. The Journal of Machine Learning Research, 18(1):8393–8484, 2017.
- The maximum clique problem. Handbook of Combinatorial Optimization: Supplement Volume A, pages 1–74, 1999.
- The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics. Annals of Statistics, 2018. Arxiv preprint at http://arxiv.org/abs/1705.10735.
- S. Chatterjee. Matrix estimation by universal singular value thresholding. The Annals of Statistics, 43:177–214, 2014.
- Concentration inequalities for correlated network-valued processes with applications to community estimation and changepoint analysis. arXiv preprint arXiv:2208.01365, 2022.
- Multiple network embedding for anomaly detection in time series of graphs. arXiv preprint arXiv:2008.10055, 2020.
- Hypothesis testing for equality of latent positions in random graphs. Bernoulli, 29(4):3221–3254, 2023.
- Statistical algorithms and a lower bound for detecting planted cliques. Journal of the ACM (JACM), 64(2):1–37, 2017.
- Community structure in social and biological networks. Proceedings of the national academy of sciences, 99(12):7821–7826, 2002.
- Computational lower bounds for community detection on random graphs. In Conference on Learning Theory, pages 899–928. PMLR, 2015.
- Dacbt: deep learning approach for classification of brain tumors using mri data in iot healthcare environment. Scientific Reports, 12(1):15331, 2022.
- Latent space approaches to social network analysis. Journal of the American Statistical Association, 97:1090–1098, 2002.
- Stochastic blockmodels: first steps. Social Networks, 5:109–137, 1983.
- R. Horn and C. Johnson. Matrix Analysis. Cambridge University Press, 1985.
- The bethe hessian and information theoretic approaches for online change-point detection in network data. Sankhya A, 84(1):283–320, 2022.
- B. Karrer and M. E. J. Newman. Stochastic blockmodels and community structure in networks. Physical Review E, 83, 2011.
- Variational graph auto-encoders. arXiv preprint arXiv:1611.07308, 2016.
- Social network community-discovery algorithm based on a balance factor. Discrete Dynamics in Nature and Society, 2022, 2022.
- L. Lu and X. Peng. Spectra of edge-independent random graphs. Electronic Journal of Combinatorics, 20, 2013.
- Spectral clustering for divide-and-conquer graph matching. Parallel Computing, 47:70–87, 2015.
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding. Electronic Journal of Statistics, 8:2905–2922, 2014.
- Community detection and classification in hierarchical stochastic blockmodels. IEEE Transactions in Network Science and Engineering, 4:13–26, 2017.
- The strongish planted clique hypothesis and its consequences. arXiv preprint arXiv:2011.05555, 2020.
- Citation network analysis. International Review of Sport and Exercise Psychology, 15(1):179–198, 2022.
- A spectral framework for anomalous subgraph detection. IEEE Transactions on Signal Processing, 63(16):4191–4206, 2015.
- On the limitation of spectral methods: From the gaussian hidden clique problem to rank-one perturbations of gaussian tensors. Advances in Neural Information Processing Systems, 28, 2015.
- P. M. Pardalos and J. Xue. The maximum clique problem. Journal of global Optimization, 4:301–328, 1994.
- Seeded graph matching via joint optimization of fidelity and commensurability. arXiv preprint arXiv:1401.3813, 2014.
- A simple spectral failure mode for graph convolutional networks. IEEE Transactions on Pattern Analysis and Machine Intelligence, 44(11):8689–8693, 2021.
- Spectral clustering and the high-dimensional stochastic blockmodel. Annals of Statistics, 39:1878–1915, 2011.
- The blessing of transitivity in sparse and stochastic networks. arXiv preprint arXiv:1307.2302, 2013.
- The generalised random dot product graph. Arxiv preprint available at http://arxiv.org/abs/1709.05506, 2017.
- Graph encoder ensemble for simultaneous vertex embedding and community detection. arXiv preprint arXiv:2301.11290, 2023.
- One-hot graph encoder embedding. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2022.
- A consistent adjacency spectral embedding for stochastic blockmodel graphs. Journal of the American Statistical Association, 107:1119–1128, 2012.
- A semiparametric two-sample hypothesis testing problem for random dot product graphs. Journal of Computational and Graphical Statistics, 26:344–354, 2017.
- A nonparametric two-sample hypothesis testing problem for random dot product graphs. Bernoulli, 23:1599–1630, 2017.
- M. Tang and C. E. Priebe. Limit theorems for eigenvectors of the normalized laplacian for random graphs. Annals of Statistics, 2018. In press.
- M. Tang and Carey E. Priebe. Limit theorems for eigenvectors of the normalized Laplacian for random graphs. Arxiv preprint., 2016.
- Universally consistent vertex classification for latent position graphs. Annals of Statistics, 31:1406–1430, 2013.
- Connectome smoothing via low-rank approximations. IEEE transactions on medical imaging, 38(6):1446–1456, 2018.
- From louvain to leiden: guaranteeing well-connected communities. Scientific reports, 9(1):5233, 2019.
- Local higher-order graph clustering. In Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pages 555–564, 2017.
- S. Young and E. Scheinerman. Random dot product graph models for social networks. In Proceedings of the 5th international conference on algorithms and models for the web-graph, pages 138–149, 2007.
- A useful variant of the Davis-Kahan theorem for statisticians. Biometrika, 102:315–323, 2015.
- Y. Zhang. Unseeded low-rank graph matching by transform-based unsupervised point registration. arXiv preprint arXiv:1807.04680, 2018.
- Vertex nomination between graphs via spectral embedding and quadratic programming. Journal of Computational and Graphical Statistics, 31(4):1254–1268, 2022.
- M. Zhu and A. Ghodsi. Automatic dimensionality selection from the scree plot via the use of profile likelihood. Computational Statistics and Data Analysis, 51:918–930, 2006.
Collections
Sign up for free to add this paper to one or more collections.
