betaFeedback

WorksMathematics

Identifiability and Spectral Estimation of Mixed Memberships in Heterogeneous Multilayer Networks

Abstract

Multilayer network data, arising from multiple sources, repeated measurements, or multi-view interactions, are increasingly common, highlighting the need for statistical methods that jointly leverage information across layers while allowing for layer heterogeneity and computational scalability. Here, we study a multilayer degree-corrected mixed membership model (ML-DCMM), in which nodes share a common mixed membership across layers while degree effects and block connectivity patterns vary by layer. This model encompasses several existing models for multilayer data while preserving identifiability and interpretation. We develop a spectral estimation procedure that integrates layer-wise embeddings with corner estimation for membership recovery. A further refinement that connects the resulting representation to a ParaTuck-2 tensor decomposition is also introduced. We establish theoretical guarantees for the proposed spectral method, showing that the probability of near-corner recovery increases with the number of layers, and we provide the convergence rate for the resulting membership estimator. We establish a minimax lower bound for membership estimation, which does not improve with increasing number of layers. Simulation studies show that ML-DCMM can outperform other approaches under strong layer heterogeneity. In an analysis of London bike-sharing networks, the methodology recovers interpretable memberships and achieves lower held-out edge prediction error under edge-sampling cross-validation than competing models.

Introduction

Network data provide a natural framework for representing pairwise relationships among a collection of entities. A single network is commonly encoded by an adjacency matrix, whose entries record whether, or to what extent, pairs of nodes are connected. Examples include social networks, where nodes represent individuals and edges represent friendship or communication ties [8], and structural brain networks, where nodes represent brain regions and edges represent anatomical connections estimated from diffusion MRI tractography [19]. Multilayer network data, represented as collections of adjacency matrices on a common set of nodes, have become increasingly common in modern applications [32, 11]. Such layers may arise from repeated measurements over time [42], different experimental or cognitive conditions [38], or distinct types of relations among the same entities [50]. They may also arise from multimodal measurements. For example, in neuroimaging, a common anatomical parcellation can be used to define a shared set of nodes, while different layers may encode distinct forms of structural or functional connectivity derived from different imaging modalities [14].

A central task in network data analysis is to uncover latent community or membership structure from the observed pattern of edges [17]. The stochastic block model (SBM) provides a canonical probabilistic framework for this task [23]. Its extensions include the mixed-membership stochastic block model (MMSBM), which allows nodes to participate in multiple communities simultaneously [3], the degree-corrected stochastic block model (DCBM), which accounts for node-specific degree heterogeneity [29], and the degree-corrected mixed-membership model (DCMM), which combines these two features [56, 26]. Because the DCMM jointly encodes degree effects, mixed memberships, and block connectivity in the same probability matrix, identifiability is a nontrivial issue. A wide range of methods have been developed for community detection, including likelihood-based and Bayesian procedures, modularity maximization, matrix factorization approaches, and spectral methods. The latter are especially relevant to the present work, as they provide computationally efficient estimators based on low-rank structure in the population adjacency matrix. The random dot product graph (RDPG) [54, 7] framework provides a latent-position interpretation of such embeddings by representing edge probabilities through inner products of latent node positions.

For multilayer network data, block models are often extended by assuming that the layers share a latent membership structure [45]. For example, the multilayer degree-corrected stochastic block model (ML-DCBM) extends the DCBM by assuming common non-overlapping community assignments across layers, together with layer-specific degree-correction parameters and block connectivity matrices. The multilayer degree-corrected mixed-membership model (ML-DCMM), a multilayer extension of the single-layer DCMM, assumes the layers share a common mixed-membership matrix while the degree-correction parameters and block connectivity matrices are allowed to vary across layers. From the perspective of membership estimation, it is important to use information across layers without collapsing the multilayer structure into a single averaged adjacency matrix. While averaging can improve signal strength, it may also discard layer-specific connectivity patterns and degree heterogeneity when the layers are heterogeneous. This has motivated joint multilayer approaches that retain the layer index, including tensor-based methods that stack adjacency matrices into a third-order array and use tensor-decomposition techniques to extract shared node-level structure across layers [27, 2].

In this paper, we study the ML-DCMM, provide identifiability conditions and propose algorithms for community detection under this model. The main contributions of this paper are as follows.

  • We establish identifiability conditions for the ML-DCMM, clarifying how the shared mixed-membership matrix can be separated from layer-specific degree corrections and block connectivity matrices. We also show that other latent space models for multilayer network data can be described as a special case of this model, showing that this model provides a general framework with interpretable latent structure.

  • We propose an efficient spectral algorithm for estimation of the common node memberships via a corner estimation procedure. This method consists of the concatenation of normalized adjacency spectral embeddings (CNASE) followed by vertex hunting. We also establish a con-

nection of these embeddings with the ParaTuck-2 tensor factorization and propose a refinement of the estimator based on this decomposition.

  • We establish error bounds for spectral estimation of node memberships in terms of the two-to-infinity norm of the mixed membership matrix, providing row-wise control of the community-detection error. We also establish a minimax lower bound for membership estimation that does not improve with increasing number of layers. This lower bound match the error bounds of the proposed method up to logarithmic factors under homogeneous degree-correction parameters, showing that our method is nearly minimax optimal.

  • We demonstrate the practical usefulness of the proposed method through simulations and real data. In a multilayer bike-sharing network analysis, the ML-DCMM is shown to provide better generalization error than other models as well as interpretable latent memberships.

Related work

The stochastic block model (SBM) assumes that nodes of a graph are divided into KK communities, and edges are independently generated according to a block-structured probability matrix. In matrix form, this probability matrix can be written as P=ZBZT\mathbf{P} = \mathbf{Z}\mathbf{B}\mathbf{Z}^{\mathsf{T}}, where Z\mathbf{Z} is an n×Kn \times K binary membership matrix whose iith row is the canonical basis vector corresponding to the community label of node ii, and B∈[0,1]K×K\mathbf{B} \in[0,1]^{K \times K} specifies the connection probabilities between communities [23]. A large body of work has studied estimation and theory under the SBM, including likelihood-and modularity-based approaches [10] and spectral methods based on graph Laplacians [47], adjacency spectral embeddings [49], and adjacency spectral clustering [35]. While this parsimonious model can approximate a wide range of random networks, it has notable limitations. First, nodes assigned to the same community are stochastically equivalent so the model cannot capture node-level degree heterogeneity. Karrer and Newman [ [29] proposed the DCBM to overcome this limitation by introducing node-specific degree-correction parameters. Several spectral methods have been proposed including regularized graph Laplacian [46], SCORE [24] as well as theoretical works including consistency [57] and minimax optimality [18]. Second, each node is assigned to a single community, which can be restrictive when communities overlap or when nodes participate in multiple communities simultaneously. The MMSBM relaxes this restriction by allowing overlapping communities for each node [3]. Anandkumar et al. [ [4] proposed a tensor spectral method and Mao et al. [ [39] connected MMSBM estimation to symmetric nonnegative matrix factorization. Mao et al. [ [41] exploited the row-wise simplex geometry of the leading population eigenspace under the MMSBM, where pure nodes correspond to simplex vertices and mixed nodes are represented as convex combinations of these vertices.

The degree-corrected mixed-membership model (DCMM) allows both node-specific degree correction and mixed memberships. Existing simplex-based spectral methods for DCMM-type models exploit a normalized spectral embedding in which degree effects are factored out and membership information is encoded by a simplex geometry. Estimating the corners of this simplex provides the anchor points needed for membership reconstruction. Examples of these methods include sketched vertex search or successive projection on the ratios of eigenvectors [24], and kk-medians clustering or one-class SVM on row-wise ℓ2\ell_2 normalized spectral embeddings [56, 40].

For multilayer networks, most existing work on community detection focuses on extensions that typically assume a shared community structure across layers, with the intention of capturing joint structure. In the multilayer SBM, estimators of shared community structure includes likelihood-based approaches [20, 44], least-squares [36], and spectral methods [9, 6, 34], and nonparametric Bayesian methods [45]. Extensions to other multilayer models are often non-trivial due to the specific identifiability and estimation constraints that arise. For instance, identifiability the multilayer degree-corrected mixed-membership model (ML-DCMM) is more challenging than in the single-layer DCMM because the model introduces additional layer-specific parameters. Xie and Huang [ [53] developed a spectral-assisted Gaussian variational inference method for the ML-DCMM under a direct layer-wise extension of the single-layer DCMM identifiability condition.

Spectral methods are a particularly appealing approach in modern data science due to their computational scalability and theoretical guarantees [13]. In multilayer community detection, these methods require constructing a joint spectral embedding matrix that captures community information across the layers. While several of these approaches have been developed for the ML-SBM, these ideas do not generalize to other models due to the more complex geometry of the embedding spaces. For instance, Agterberg et al. [ [1] proposed a spectral clustering method for the ML-DCBM based on a joint spectral embedding obtained from the singular value decomposition of concatenated spectral embeddings. In this paper, we employ a similar concatenation idea, but in the ML-DCMM model with mixed memberships, this approach does not yield consistent estimators of the node memberships due to heterogeneity across the layer, motivating the use of a different embedding matrix to estimate the corners of the simplex that identify the communities of the model.

Tensor-based approaches have also been proposed for multilayer community detection, applying Tucker-type or nonnegative Tucker decompositions [27, 2]. These tensor decompositions are natural in the SBM and some of its extensions as the parameters of these models can be expressed as low-rank tensors. However, the ML-DCMM structure does not allow us to apply these decompositions to recover the model parameters. Instead, we establish a connection between the parameters of the ML-DCMM and the ParaTuck-2 decomposition [22]. Specifically, for a third-order tensor U∈RI×J×LU \in\mathbb{R}^{I \times J \times L}, let U⋅,⋅,l∈RI×JU_{\cdot,\cdot,l} \in\mathbb{R}^{I \times J} be its ll-th frontal slice. The ParaTuck-2 decomposition represents the ll-th slice as

U⋅,⋅,l=ADA(l)HDB(l)BT,(1)U_{\cdot,\cdot,l} = A D_A^{(l)} H D_B^{(l)} B^\mathsf{T}, \tag*{(1)}

where A∈RI×R1A \in\mathbb{R}^{I \times R_1} and B∈RJ×R2B \in\mathbb{R}^{J \times R_2} are shared loading matrices independent of ll, DA(l)∈RR1×R1D_A^{(l)} \in\mathbb{R}^{R_1 \times R_1} and DB(l)∈RR2×R2D_B^{(l)} \in\mathbb{R}^{R_2 \times R_2} are diagonal slice-specific scaling matrices, and H∈RR1×R2H \in\mathbb{R}^{R_1 \times R_2} captures the interactions between the two factor spaces. In particular, when AA and BB are the identity matrix, the entry (i,j,l)(i,j,l) of this tensor is Uijl=CilHijDjlU_{ijl}=C_{il}H_{ij}D_{jl} for some matrices C∈RI×LC \in\mathbb{R}^{I \times L}, D∈RJ×LD \in\mathbb{R}^{J \times L}, which is known as the no three-way interaction model [Daconis and Sturmfels, 1998], and we show that it correspond to a factorization of the parameters of the ML-DCMM. Several algorithms to fit this decomposition have been proposed, including alternating least squares (ALS) [12], with additional stochastic ALS step [Znyied and de Almeida, 2025] and a lifting-based algebraic solver [51].

Notation

Let aa, a\mathbf{a}, and A\mathbf{A} denote a scalar, column vector, and matrix, respectively. For any matrix A∈Rm×n\mathbf{A} \in\mathbb{R}^{m \times n}, Ai,⋅\mathbf{A}_{i,\cdot}, A⋅,j\mathbf{A}_{\cdot,j}, and AijA_{ij} denote the ii-th row, jj-th column of A\mathbf{A} and (i,j)(i,j)-th entry of A\mathbf{A}, respectively. For a positive integer mm, let [m]:={1,…,m}[m] := \{1,\ldots,m\}. Let 1K\mathbf{1}_K and IK\mathbf{I}_K denote the vector of ones in RK\mathbb{R}^K and identity matrix in RK×K\mathbb{R}^{K \times K}, respectively. Let Ip\mathbf{I}_p denote the diagonal matrix whose diagonal entries consist of pp ones followed by qq negative ones. Let QK\mathcal{Q}_K denote the set of K×KK \times K permutation matrices. Let λmax⁡(A)\lambda_{\max}(\mathbf{A}), λmin⁡(A)\lambda_{\min}(\mathbf{A}), σmax⁡(A)\sigma_{\max}(\mathbf{A}), σmin⁡(A)\sigma_{\min}(\mathbf{A}) denote the maximum/minimum eigenvalues/singular values of A\mathbf{A}, respectively. Define O(K)\mathcal{O}(K) be the set of K×KK \times K orthogonal matrices and O(p,q)={A∈RK×K:AIp,qAT=Ip,q,p+q=K}\mathcal{O}(p,q) = \{\mathbf{A} \in\mathbb{R}^{K \times K}: \mathbf{A}\mathbf{I}_{p,q}\mathbf{A}^{\mathsf T} = \mathbf{I}_{p,q}, p+q=K\} be the indefinite orthogonal group. For any symmetric positive definite matrix A\mathbf{A}, let A=VΛVT\mathbf{A} = \mathbf{V}\mathbf{\Lambda}\mathbf{V}^{\mathsf T} be a spectral decomposition and define A±1/2:=VΛ±1/2VT\mathbf{A}^{\pm1/2} := \mathbf{V}\mathbf{\Lambda}^{\pm1/2}\mathbf{V}^{\mathsf T}, where, for Λ:=diag⁡(λ1,…,λd)\mathbf{\Lambda} := \operatorname{diag}(\lambda_1,\ldots,\lambda_d), Λ±1/2:=diag⁡(λ1±1/2,…,λd±1/2)\mathbf{\Lambda}^{\pm1/2} := \operatorname{diag}(\lambda_1^{\pm1/2},\ldots,\lambda_d^{\pm1/2}). Let ΔK−1:={x∈RK:∑i=1Kxi=1,xi≥0}\Delta^{K-1} := \{\mathbf{x} \in\mathbb{R}^K : \sum_{i=1}^{K} x_i = 1, x_i \ge0\} denote the standard simplex in RK\mathbb{R}^K. Let SK−1:={x∈RK:∥x∥2=1}\mathbb{S}^{K-1} := \{\mathbf{x} \in\mathbb{R}^K : \|\mathbf{x}\|_2 = 1\} denote the unit ℓ2\ell_2-norm ball in RK\mathbb{R}^K. For any matrix A∈Rn×K\mathbf{A} \in\mathbb{R}^{n \times K} and an index set J⊂[n]\mathcal{J} \subset[n] with ∣J∣=K|\mathcal{J}| = K such that AJ,⋅\mathbf{A}_{\mathcal{J},\cdot} is nonsingular, let S(A,J):={∑j∈JajAj,⋅∥∑j∈JajAj,⋅∥2:∑j∈Jaj=1,aj≥0}\mathcal{S}(\mathbf{A},\mathcal{J}) := \left\{ \frac{\sum_{j \in\mathcal{J}} a_j \mathbf{A}_{j,\cdot}}{\left\|\sum_{j \in\mathcal{J}} a_j \mathbf{A}_{j,\cdot}\right\|_2} : \sum_{j \in\mathcal{J}} a_j = 1, a_j \ge0 \right\} denote the spherical simplex generated by the rows of A\mathbf{A} indexed by J\mathcal{J}.

Methodology

The Multilayer Degree-Corrected Mixed Membership model

In this paper, we consider the degree-corrected mixed-membership stochastic block model in the multilayer setting (ML-DCMM). Concretely, consider a collection of LL matrices P(1),…,P(L)∈Rn×n\mathbf{P}^{(1)},\ldots,\mathbf{P}^{(L)} \in\mathbb{R}^{n\times n}. From these matrices, we observe LL adjacency matrices A(1),…,A(L)\mathbf{A}^{(1)},\ldots,\mathbf{A}^{(L)}, where Aij(l)∼indepBernoulli⁡(Pij(l))A_{ij}^{(l)} \mathrel{\overset{\mathrm{indep}}{\sim}} \operatorname{Bernoulli}(P_{ij}^{(l)}). For simplicity of the analysis, we assume undirected, binary graphs allowing self-loops. Thus, each A(l)\mathbf{A}^{(l)} is symmetric, and its diagonal entries are treated in the same way as the off-diagonal entries. This convention is mainly technical, as it avoids a separate treatment of the diagonal elements. The loopless setting can be handled by setting the diagonal entries to zero; this modification does not affect the main methodology, although it would require minor notational changes in the analysis. In the ML-DCMM, we assume P(l)\mathbf{P}^{(l)} of the form

P(l)=Θ(l)ZB(l)ZTΘ(l),1≤l≤L,(2)\mathbf{P}^{(l)} = \boldsymbol{\Theta}^{(l)}\mathbf{Z}\mathbf{B}^{(l)}\mathbf{Z}^{\mathsf{T}}\boldsymbol{\Theta}^{(l)}, \qquad1 \le l \le L, \tag*{(2)}

where Θ(l)=diag⁡(θ(l))∈Rn×n\boldsymbol{\Theta}^{(l)} = \operatorname{diag}(\boldsymbol{\theta}^{(l)}) \in\mathbb{R}^{n\times n} is a diagonal matrix that consists of positive degree-correction parameters θ(l)=(θ1(l),…,θn(l))\boldsymbol{\theta}^{(l)} = (\theta_1^{(l)},\ldots,\theta_n^{(l)}), Z∈Rn×K\mathbf{Z} \in\mathbb{R}^{n\times K} is a membership matrix with ∥Zi,⋅∥1=1\lVert\mathbf{Z}_{i,\cdot}\rVert_1 = 1 and Zij≥0Z_{ij} \ge0, and B(l)∈RK×K\mathbf{B}^{(l)} \in\mathbb{R}^{K\times K} is a full-rank symmetric encoding the connectivity across blocks. Specifically, the element in the ii-th row and jj-th column of P(l)\mathbf{P}^{(l)} is computed as Pij(l)=θi(l)θj(l)Zi,⋅B(l)Zj,⋅TP_{ij}^{(l)} = \theta_i^{(l)}\theta_j^{(l)}\mathbf{Z}_{i,\cdot}\mathbf{B}^{(l)}\mathbf{Z}_{j,\cdot}^{\mathsf{T}}. Note that the membership matrix Z\mathbf{Z} is shared across all layers, indicating that the community structure of a given node is the same across layers, whereas (θ(l),B(l))(\boldsymbol{\theta}^{(l)},\mathbf{B}^{(l)}) are layer-specific. This modeling structure is natural in many real-world multilayer networks, where the latent roles of nodes are relatively stable but the edge formation patterns may vary across layers. For example, in transportation networks, a station or location may have a stable role in the system, while traffic intensity and connectivity patterns may change across time periods, days, or operating conditions. The shared matrix Z\mathbf{Z} represents these stable node-level roles, whereas the layer-specific parameters θ(l)\boldsymbol{\theta}^{(l)} and B(l)\mathbf{B}^{(l)} capture variation in node activity levels and block-level interaction strengths across layers.

The model in Equation (2) extends several existing community detection and low-rank latent space models to multilayer networks by allowing a common mixed-membership matrix and layer-specific degree-correction and block-connectivity parameters. In particular, when L=1L = 1, it reduces to the single-layer DCMM [56, 26]. When each row of Z\mathbf{Z} is a canonical basis vector in RK\mathbb{R}^{K}, it reduces to the ML-DCBM, as in Agterberg et al. [ [1]. When both restrictions hold, it reduces to the DCBM of Karrer and Newman [ [29]. When the matrices B(l)\mathbf{B}^{(l)} have unit diagonal, it reduces to the version of this model studied in Xie and Huang [ [53].

More generally, the ML-DCMM model extends network models with a common invariant subspace shared across the parameters of all the layers [6, 28, 52], which extend the notion of latent spaces to multilayer settings. The next proposition formalizes this result.

References

  1. [1]Joshua Agterberg, Zachary Lubberts, and Jesús Arroyo. Joint spectral clustering in multilayer degree-corrected stochastic blockmodels. Journal of the American Statistical Association, 120 (551):1607–1620, 2025.arxiv.org/abs/2212.05053
  2. [2]Izabel Aguiar, Dane Taylor, and Johan Ugander. A tensor factorization model of multilayer network interdependence. Journal of Machine Learning Research, 25(282):1–54, 2024.
  3. [3]Edoardo M. Airoldi, David M. Blei, Stephen E. Fienberg, and Eric P. Xing. Mixed membership stochastic blockmodels. Journal of Machine Learning Research, 9(65):1981–2014, 2008.
  4. [4]Animashree Anandkumar, Rong Ge, Daniel Hsu, and Sham Kakade. A tensor spectral approach to learning mixed membership community models. In Proceedings of the 26th Annual Conference on Learning Theory, volume 30 of Proceedings of Machine Learning Research, pages 867–881, 2013.
  5. [5]Mário César Ugulino Araújo, Teresa Cristina Bezerra Saldanha, Roberto Kawakami Harrop Galvão, Takashi Yoneyama, Henrique Caldas Chame, and Valeria Visani. The successive projections algorithm for variable selection in spectroscopic multicomponent analysis. Chemometrics and Intelligent Laboratory Systems, 57(2):65–73, 2001.
  6. [6]Jesús Arroyo, Avanti Athreya, Joshua Cape, Guodong Chen, Carey E Priebe, and Joshua T Vogelstein. Inference for multiple heterogeneous networks with a common invariant subspace. Journal of Machine Learning Research, 22(142):1–49, 2021.
  7. [7]Avanti Athreya, Donniell E. Fishkind, Minh Tang, Carey E. Priebe, Youngser Park, Joshua T. Vogelstein, Keith D. Levin, Vince Lyzinski, Yichen Qin, and Daniel L. Sussman. Statistical inference on random dot product graphs: A survey. Journal of Machine Learning Research, 18 (226):1–92, 2018.
  8. [8]Brian Ball and M.E.J. Newman. Friendship networks and social status. Network Science, 1(1):16–30, 2013.DOI
  9. [9]Sharmodeep Bhattacharyya and Shirshendu Chatterjee. Spectral clustering for multiple sparse networks: I, 2018. arXiv preprint arXiv:1805.10594.arxiv.org/abs/1805.10594
  10. [10]Peter J. Bickel and Aiyou Chen. A nonparametric view of network models and Newman–Girvan and other modularities. Proceedings of the National Academy of Sciences, 106(50):21068–21073, 2009.DOI
  11. [11]Stefano Boccaletti, Ginestra Bianconi, Regino Criado, Charo I. del Genio, Jesús Gómez-Gardeñes, Miguel Romance, Irene Sendiña-Nadal, Zheng Wang, and Massimiliano Zanin. The structure and dynamics of multilayer networks. Physics Reports, 544(1):1–122, 2014.DOI
  12. [12]Rasmus Bro. Multi-way Analysis in the Food Industry: Models, Algorithms, and Applications. PhD thesis, University of Amsterdam, Amsterdam, The Netherlands, 1998.
  13. [13]Yuxin Chen, Yuejie Chi, Jianqing Fan, and Cong Ma. Spectral methods for data science: A statistical perspective. Foundations and Trends in Machine Learning, 14(5):566–806, 2021.DOI
  14. [14]Manlio De Domenico. Multilayer modeling and analysis of human brain networks. GigaScience, 6 (5):1–8, 2017.
  15. [16]Jianqing Fan, Yingying Fan, Xiao Han, and Jinchi Lv. Simple: Statistical inference on membership profiles in large networks. Journal of the Royal Statistical Society Series B: Statistical Methodology, 84(2):630–653, 04 2022.arxiv.org/abs/1910.01734
  16. [17]Santo Fortunato. Community detection in graphs. Physics Reports, 486(3–5):75–174, 2010.DOI
  17. [18]Chao Gao, Zongming Ma, Anderson Y. Zhang, and Harrison H. Zhou. Community detection in degree-corrected block models. The Annals of Statistics, 46(5):2153–2185, 2018.arxiv.org/abs/1607.06993
  18. [19]Patric Hagmann, Leila Cammoun, Xavier Gigandet, Reto Meuli, Christopher J. Honey, Van J Wedeen, and Olaf Sporns. Mapping the structural core of human cerebral cortex. PLOS Biology, 6(7):e159, 2008.
  19. [20]Qiuyi Han, Kevin Xu, and Edoardo Airoldi. Consistent estimation of dynamic and multi-layer block models. In Proceedings of the 32nd International Conference on Machine Learning, volume 37 of Proceedings of Machine Learning Research, pages 1511–1520, 2015.arxiv.org/abs/1410.8597
  20. [21]Xiao Han, Qing Yang, and Yingying Fan. Universal rank inference via residual subsampling with application to large networks. The Annals of Statistics, 51(3):1109 – 1133, 2023.
  21. [22]Richard A. Harshman and Margaret E. Lundy. Uniqueness proof for a family of models sharing features of Tucker’s three-mode factor analysis and PARAFAC/Candecomp. Psychometrika, 61 (1):133–154, 1996.
  22. [23]Paul W. Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt. Stochastic blockmodels: First steps. Social Networks, 5(2):109–137, 1983.DOI
  23. [24]Jiashun Jin. Fast community detection by SCORE. The Annals of Statistics, 43(1):57–89, 2015.DOI
  24. [25]Jiashun Jin, Zheng Tracy Ke, Shengming Luo, and Minzhe Wang. Optimal estimation of the number of network communities. Journal of the American Statistical Association, 118(543):2101–2116, 2023.
  25. [26]Jiashun Jin, Zheng Tracy Ke, and Shengming Luo. Mixed membership estimation for social networks. Journal of Econometrics, 239(2):105369, 2024.arxiv.org/abs/1708.07852
  26. [27]Bing-Yi Jing, Ting Li, Zhongyuan Lyu, and Dong Xia. Community detection on mixture multilayer networks via regularized tensor decomposition. The Annals of Statistics, 49(6):3181–3205, 2021.
  27. [28]Andrew Jones and Patrick Rubin-Delanchy. The multilayer random dot product graph. arXiv preprint arXiv:2007.10455, 2020.arxiv.org/abs/2007.10455
  28. [29]Brian Karrer and Mark EJ Newman. Stochastic blockmodels and community structure in networks. Physical Review E, 83(1):016107, 2011.pubmed.ncbi.nlm.nih.gov/21405744
  29. [30]Leonard Kaufman and Peter J. Rousseeuw. Partitioning around medoids (program pam). In Finding Groups in Data: An Introduction to Cluster Analysis, chapter 2, pages 68–125. 1990.DOI
  30. [31]Zheng Tracy Ke and Jingming Wang. Optimal network membership estimation under severe degree heterogeneity. Journal of the American Statistical Association, 120(550):948–962, 2025.arxiv.org/abs/2204.12087
  31. [32]Mikko Kivelä, Alex Arenas, Marc Barthelemy, James P. Gleeson, Yamir Moreno, and Mason A. Porter. Multilayer networks. Journal of Complex Networks, 2(3):203–271, 2014.
  32. [33]Lucien Le Cam. Convergence of estimates under dimensionality restrictions. The Annals of Statistics, 1(1):38–53, 1973.
  33. [34]Jing Lei and Kevin Z. Lin. Bias-adjusted spectral clustering in multi-layer stochastic block models. Journal of the American Statistical Association, 118(544):2433–2445, 2023.DOI
  34. [35]Jing Lei and Alessandro Rinaldo. Consistency of spectral clustering in stochastic block models. The Annals of Statistics, 43(1):215–237, 2015.DOI
  35. [36]Jing Lei, Kehui Chen, and Brian Lynch. Consistent community detection in multi-layer network data. Biometrika, 107(1):61–73, 2020.DOI
  36. [37]Tianxi Li, Elizaveta Levina, and Ji Zhu. Network cross-validation by edge sampling. Biometrika, 107(2):257–276, 2020.arxiv.org/abs/1612.04717
  37. [38]Joshua Lukemire, Suprateek Kundu, Giuseppe Pagnoni, and Ying Guo. Bayesian joint modeling of multiple brain functional networks. Journal of the American Statistical Association, 116(534):518–530, 2021.DOI
  38. [39]Xueyu Mao, Purnamrita Sarkar, and Deepayan Chakrabarti. On mixed memberships and symmetric nonnegative matrix factorizations. In Proceedings of the 34th International Conference on Machine Learning, volume 70 of Proceedings of Machine Learning Research, pages 2324–2333, 2017.arxiv.org/abs/1607.00084
  39. [40]Xueyu Mao, Purnamrita Sarkar, and Deepayan Chakrabarti. Overlapping clustering models, and one (class) SVM to bind them all. Advances in Neural Information Processing Systems, 31, 2018.arxiv.org/abs/1806.06945
  40. [41]Xueyu Mao, Purnamrita Sarkar, and Deepayan Chakrabarti. Estimating mixed memberships with sharp eigenvector deviations. Journal of the American Statistical Association, 116(536):1928–1940, 2021.
  41. [42]Peter J Mucha, Thomas Richardson, Kevin Macon, Mason A Porter, and Jukka-Pekka Onnela. Community structure in time-dependent, multiscale, and multiplex networks. Science, 328(5980):876–878, 2010.DOI
  42. [43]Fernando Munoz-Mendez, Konstantin Klemmer, Ke Han, and Stephen Jarvis. Community Structures, Interactions and Dynamics in London’s Bicycle Sharing Network. In UbiComp/ISWC 2018 Adjunct, pages 1015–1023, 2018.
  43. [44]Saptarshi Paul and Yugou Chen. Consistent community detection in multi-relational data through restricted multi-layer stochastic blockmodel. Electronic Journal of Statistics, 10(2):3807–3870, 2016.
  44. [45]Tiago P. Peixoto. Inferring the mesoscale structure of layered, edge-valued, and time-varying networks. Physical Review E, 92(4):042807, Oct 2015.DOI
  45. [46]Tai Qin and Karl Rohe. Regularized spectral clustering under the degree-corrected stochastic block-model. In Advances in Neural Information Processing Systems, volume 26, pages 3120–3128, 2013.DOI
  46. [47]Karl Rohe, Sourav Chatterjee, and Bin Yu. Spectral clustering and the high-dimensional stochastic blockmodel. The Annals of Statistics, 39(4):1878–1915, 2011.
  47. [48]Patrick Rubin-Delanchy, Joshua Cape, Minh Tang, and Carey E. Priebe. 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, 2022.
  48. [49]Daniel L. Sussman, Minh Tang, Donniell E. Fishkind, and Carey E. Priebe. A consistent adjacency spectral embedding for stochastic blockmodel graphs. Journal of the American Statistical Association, 107(499):1119–1128, 2012.arxiv.org/abs/1108.2228
  49. [50]Michael Szell, Renaud Lambiotte, and Stefan Thurner. Multirelational organization of large-scale social networks in an online world. Proceedings of the National Academy of Sciences, 107(31):13636–13641, 2010.DOI
  50. [51]Konstantin Usevich. A lifting approach to ParaTuck-2 tensor decompositions, 2023. arXiv preprint arXiv:2302.00922.arxiv.org/abs/2302.00922
  51. [52]Fan Wang, Wanshan Li, Oscar Hernan Madrid Padilla, Yi Yu, and Alessandro Rinaldo. Multilayer random dot product graphs: Estimation and online change point detection. Journal of the Royal Statistical Society Series B: Statistical Methodology, 88(1):282–312, 2026.arxiv.org/abs/2306.15286
  52. [53]Fangzheng Xie and Hsin-Hsiung Huang. Uncertainty quantification for mixed membership in multilayer networks with degree heterogeneity using Gaussian variational inference, 2025. arXiv preprint arXiv:2512.08146.arxiv.org/abs/2512.08146
  53. [54]Stephen J. Young and Edward R. Scheinerman. Random dot product graph models for social networks. In Algorithms and Models for the Web-Graph, pages 138–149, 2007.DOI
  54. [56]Yuan Zhang, Elizaveta Levina, and Ji Zhu. Detecting overlapping communities in networks using spectral methods. SIAM Journal on Mathematics of Data Science, 2(2):265–283, 2020.arxiv.org/abs/1412.3432
  55. [57]Yunpeng Zhao, Elizaveta Levina, and Ji Zhu. Consistency of community detection in networks under degree-corrected stochastic block models. The Annals of Statistics, 40(4):2266–2292, 2012.DOI

Paper details

vlnc:W_auyrgcdr
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT 5.6

View statement
Looking for related papers…
Contents