Signed Diverse Multiplex Networks: Clustering and Inference
Abstract: The paper introduces a Signed Generalized Random Dot Product Graph (SGRDPG) model, which is a variant of the Generalized Random Dot Product Graph (GRDPG), where, in addition, edges can be positive or negative. The setting is extended to a multiplex version, where all layers have the same collection of nodes and follow the SGRDPG. The only common feature of the layers of the network is that they can be partitioned into groups with common subspace structures, while otherwise matrices of connection probabilities can be all different. The setting above is extremely flexible and includes a variety of existing multiplex network models as its particular cases. The paper fulfills two objectives. First, it shows that keeping signs of the edges in the process of network construction leads to a better precision of estimation and clustering and, hence, is beneficial for tackling real world problems such as, for example, analysis of brain networks. Second, by employing novel algorithms, our paper ensures strongly consistent clustering of layers and high accuracy of subspace estimation. In addition to theoretical guarantees, both of those features are demonstrated using numerical simulations and a real data example.
- J. Agterberg and A. Zhang. Estimating higher-order mixed memberships via the ℓ2,∞subscriptℓ2\ell_{2,\infty}roman_ℓ start_POSTSUBSCRIPT 2 , ∞ end_POSTSUBSCRIPT tensor perturbation bound. ArXiv: 2212.08642, 2022.
- Joint spectral clustering in multilayer degree-corrected stochastic blockmodels. ArXiv: 2212.05053, 2022.
- Mixed membership stochastic blockmodels. J. Mach. Learn. Res., 9:1981–2014, June 2008. ISSN 1532-4435.
- Inference for multiple heterogeneous networks with a common invariant subspace. Journal of Machine Learning Research, 22(142):1–49, 2021. URL http://jmlr.org/papers/v22/19-558.html.
- Statistical inference on random dot product graphs: a survey. Journal of Machine Learning Research, 18(226):1–92, 2018. URL http://jmlr.org/papers/v18/17-448.html.
- Discovering underlying dynamics in time series of networks. ArXiv: 2205.06877, 2022. 10.48550/ARXIV.2205.06877.
- S. Babul and R. Lambiotte. Sheep: Signed hamiltonian eigenvector embedding for proximity. ArXiv:2302.07129, 2023.
- Spectral radii of sparse random matrices. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, 56(3):2141 – 2161, 2020. 10.1214/19-AIHP1033. URL https://doi.org/10.1214/19-AIHP1033.
- T. T. Cai and A. Zhang. Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics. The Annals of Statistics, 46(1):60 – 89, 2018a. 10.1214/17-AOS1541. URL https://doi.org/10.1214/17-AOS1541.
- T. T. Cai and A. Zhang. Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics. Ann. Statist., 46(1):60–89, 02 2018b. 10.1214/17-AOS1541. URL https://doi.org/10.1214/17-AOS1541.
- High-dimensional mixed graphical models. Journal of Computational and Graphical Statistics, 26(2):367–378, 2017.
- Provable convex co-clustering of tensors. Journal of Machine Learning Research, 21(214):1–58, 2020. URL http://jmlr.org/papers/v21/18-155.html.
- SPONGE: A generalized eigenproblem for clustering signed networks. AISTATS, 2019.
- J. A. Davis. Clustering and structural balance in graphs. Human relations, 20(2):181–187, 1967.
- Structural reducibility of multilayer networks. Nature Communications, 6(6864), 2015. doi:10.1038/ncomms7864.
- ScreeNOT: Exact MSE-optimal singular value thresholding in correlated noise. The Annals of Statistics, 51(1):122 – 148, 2023. 10.1214/22-AOS2232. URL https://doi.org/10.1214/22-AOS2232.
- E. Estrada and M. Benzi. A walk-based measure of balance in signed networks. detecting lack of balance in social networks. Physical Review E, 90:#042802, 2014.
- Alma: Alternating minimization algorithm for clustering mixture multilayer network. Journal of Machine Learning Research, 23(330):1–46, 2022. URL http://jmlr.org/papers/v23/21-0182.html.
- Testing for Balance in Social Networks. Journal of the American Statistical Association, 117(537):156–174, January 2022. 10.1080/01621459.2020.176. URL https://ideas.repec.org/a/taf/jnlasa/v117y2022i537p156-174.html.
- Spectral embedding of weighted graphs. Journal of the American Statistical Association, 0(0):1–10, 2023+. 10.1080/01621459.2023.2225239. URL https://doi.org/10.1080/01621459.2023.2225239.
- Strong, weak or no balance? testing structural hypotheses in real heterogeneous networks. ArXiv:2303.07023, 2023.
- Achieving optimal misclassification proportion in stochastic block models. J. Mach. Learn. Res., 18(1):1980–2024, Jan. 2017. ISSN 1532-4435.
- Community detection in degree-corrected block models. Ann. Statist., 46(5):2153–2185, 10 2018. 10.1214/17-AOS1615.
- B. Gartner and J. Matousek. Approximation Algorithms and Semidefinite Programming. Springer Publishing Company, 2012. ISBN 038788145X, 9780387881454. DOI10.1007/978-3-642-22015-9.
- Exact clustering in tensor block model: Statistical optimality and computational limit. Journal of the Royal Statistical Society Series B, 84(5):1666–1698, November 2022. 10.1111/rssb.12547.
- F. Harary. On the notion of balance of a signed graph. Michigan Mathematical Journal, 2(2):143 – 146, 1953. 10.1307/mmj/1028989917. URL https://doi.org/10.1307/mmj/1028989917.
- Community detection on mixture multilayer networks via regularized tensor decomposition. The Annals of Statistics, 49(6):3181 – 3205, 2021. 10.1214/21-AOS2079. URL https://doi.org/10.1214/21-AOS2079.
- A. Jones and P. Rubin-Delanchy. The multilayer random dot product graph. ArXiv: 2007.10455, 2020. 10.48550/ARXIV.2007.10455.
- Z. T. Ke and J. Wang. Optimal network membership estimation under severe degree heterogeneity. ArXiv:2204.12087, 2022.
- Balance in signed networks. Physical Review E, 99:#012320, 2019. 10.1103/PhysRevE.99.012320. URL https://link.aps.org/doi/10.1103/PhysRevE.99.012320.
- Multilayer networks. Journal of Complex Networks, 2(3):203–271, 07 2014. ISSN 2051-1329. 10.1093/comnet/cnu016. URL https://doi.org/10.1093/comnet/cnu016.
- Popularity adjusted block models are generalized random dot product graphs. Journal of Computational and Graphical Statistics, 0(0):1–14, 2022. 10.1080/10618600.2022.2081576. URL https://doi.org/10.1080/10618600.2022.2081576.
- C. M. Le and E. Levina. Estimating the number of communities in networks by spectral methods. ArXiv:1507.00827, 2015.
- Concentration of random graphs and application to community detection, pages 2925–2943. ICM, 2018. 10.1142/9789813272880_0166.
- Recovering shared structure from multiple networks with unknown edge distributions. J. Mach. Learn. Res., 23(1), 2022. ISSN 1532-4435.
- A sharp blockwise tensor perturbation bound for orthogonal iteration. Journal of Machine Learning Research, 22(179):1–48, 2021. URL http://jmlr.org/papers/v22/20-919.html.
- Latent space models for multiplex networks with shared structure. ArXiv: 2012.14409, 2021.
- M. Noroozi and M. Pensky. Sparse subspace clustering in diverse multiplex network model. arXiv preprint arXiv:2206.07602, 2022.
- Estimation and clustering in popularity adjusted block model. Journal of The Royal Statistical Society Series B-statistical Methodology, 83:293–317, 2021.
- M. Pensky and Y. Wang. Clustering of diverse multiplex networks. arXiv preprint arXiv:2110.05308, 2021.
- A Statistical Interpretation of Spectral Embedding: The Generalised Random Dot Product Graph. Journal of the Royal Statistical Society Series B: Statistical Methodology, 84(4):1446–1473, 06 2022. ISSN 1369-7412. 10.1111/rssb.12509. URL https://doi.org/10.1111/rssb.12509.
- R. Singh and B. Adhikari. Measuring the balance of signed networks and its application to sign prediction. Journal of Statistical Mechanics: Theory and Experiment, 2017(6):063302, jun 2017. 10.1088/1742-5468/aa73ef. URL https://dx.doi.org/10.1088/1742-5468/aa73ef.
- O. Sporns. Graph theory methods: applications in brain networks. Dialogues in Clinical Neuroscience, 20(2):111–121, 2018.
- Mining brain region connectivity for alzheimer’s disease study via sparse inverse covariance estimation. In Knowledge Discovery and Data Mining, 2009. URL https://api.semanticscholar.org/CorpusID:7857678.
- J. A. Tropp. User-friendly tail bounds for sums of random matrices. Foundations of Computational Mathematics, 12(4):389–434, 2011.
- Largely typical patterns of resting-state functional connectivity in high-functioning adults with autism. Cerebral Cortex, 24(7):1894–1905, Jul 2014. ISSN 1047-3211.
- M. J. Wainwright. High-Dimensional Statistics: A Non-Asymptotic Viewpoint. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, 2019. 10.1017/9781108627771.
- A useful variant of the davis-kahan theorem for statisticians. Biometrika, 102(2):315–323, 04 2014. ISSN 0006-3444. 10.1093/biomet/asv008. URL https://doi.org/10.1093/biomet/asv008.
- A. Zhang and D. Xia. Tensor svd: Statistical and computational limits. IEEE Transactions on Information Theory, 64(11):7311–7338, 2018. 10.1109/TIT.2018.2841377.
- Hybrid linear modeling via local best-fit flats. International Journal of Computer Vision, 100(3):217–240, Dec 2012. ISSN 1573-1405. 10.1007/s11263-012-0535-6. URL https://doi.org/10.1007/s11263-012-0535-6.
- R. Zheng and M. Tang. Limit results for distributed estimation of invariant subspaces in multiple networks inference and pca. ArXiv: 2206.04306, 2022. 10.48550/ARXIV.2206.04306.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.