Pith. sign in

REVIEW 1 major objections 4 minor 41 references

Estimation and Statistical Inference for Generalized Multilayer Latent Space Model

T0 review · 1 major / 4 minor · reviewed 2026-08-02 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper establishes consistency and asymptotic normality for estimated latent positions and connection matrices in a broad class of multilayer directed network models with nonlinear link functions, enabling confidence regions for node po

desk verdict Solid first inference theory for nonlinear directed multilayer latent space models, but the load-bearing exact orthogonality assumption is under-tested and the real-data analysis has some ad hoc choices. read the letter →

arxiv 2602.19129 v2 pith:JGWD7YYY submitted 2026-02-22 stat.ME

Zhaozhe Liu , Gongjun Xu , Haoran Zhang This is my paper · ORCID
classification stat.ME
keywords multilayernetworklatentspacemodelTuckertensordecompositionasymptoticnormalityconfidenceregionsstructuralchangedetectiondegreeheterogeneity
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper claims that for multilayer directed networks with binary, count, or continuous edges — where edge probabilities or means are linked to latent structure through nonlinear link functions — the node-level sending and receiving latent positions and the layer-specific connection matrices can be estimated with known convergence rates and asymptotically normal distributions. This turns the multilayer latent space model from a tool for point estimation into one that supports confidence intervals for latent positions and hypothesis tests for structural equality between layers. The authors build their estimator by unfolding the network tensor along two modes, fitting two low-rank matrices by constrained maximum likelihood, then fusing the singular vectors to recover the connection matrices. Simulations and a trade-network application suggest the Gaussian approximations are reasonable in practice, and the method detects structural breaks such as the early-1990s collapse of the Soviet bloc.

What carries the argument

The load-bearing device is the 'unfolding and fusion' estimator. The network tensor is unfolded along its two node modes into matrices that, after centering with J_n, have column spaces spanned by the latent positions Θ and Φ. Two constrained maximum-likelihood problems estimate these low-rank matrices; a two-sided centering operator removes the degree-heterogeneity terms; projecting and selecting the largest columns recovers the latent positions; and the connection matrices (the Tucker core) are obtained by a fusion step, M_1(Λ̂) = (V̂_1^c)ᵀ (I_T ⊗ Φ̂)/n. The centering operator is what makes the estimate of Θ and Φ immune to the intercept factors, and the fusion structure is what makes the

What would settle it

Simulate a multilayer network from the model with degree factors U*_β, U*_α correlated with Θ*, Φ* (violating Assumption 1.1), fit the proposed estimator, and check whether the empirical coverage of the nominal 95% confidence regions for [Θ*]_i, [Φ*]_i, and [Λ*_t]_ij stays near 95% as n and T grow; systematic undercoverage would demonstrate that the orthogonality condition is necessary for the inference claims.

Watch

Extended reading notes

Core claim

The paper proposes a generalized multilayer latent space model in which each directed edge y_ijt is drawn from an exponential-family distribution with a signal x_ijt = θ_iᵀ Λ_t φ_j + β_it + α_jt, where θ_i and φ_j are sending and receiving latent positions and Λ_t is a layer-specific connection matrix. The signal, arranged as a tensor, admits a Tucker-type decomposition with the latent positions as loading matrices and the connection matrices as the core, plus degree-heterogeneity terms. The central claim is that both the latent positions and the connection matrices can be estimated by an 'unfolding and fusion' procedure — replacing one hard tensor optimization with two low-rank matrix likel

Load-bearing premise

The load-bearing premise is that the true sending and receiving latent positions are exactly orthogonal to the column spaces of the layer-wise out-degree and in-degree heterogeneity factors; if that orthogonality only holds approximately, the estimated latent positions can mix in the degree directions and the derived normality may fail.

Editorial extensions

If this is right

  • For multilayer networks with binary, count, or continuous edge types, one can construct confidence regions for each node's latent position (up to sign) using the plug-in asymptotic covariance.
  • One can test whether two network layers share the same connection matrix — element-wise or globally with multiplicity control — enabling structural-change detection in dynamic networks.
  • The estimator avoids solving a non-convex tensor problem; it uses only two low-rank matrix optimizations, so it scales to larger networks than direct tensor methods.
  • The convergence rates match or improve on existing results in special cases: for a single layer, the uniform rate is O_p(n^{-1/2} log n), slightly better than previous latent-space results.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The orthogonality assumption (Assumption 1.1) that the latent positions are exactly orthogonal to the degree-heterogeneity column spaces is likely to be violated in real data; the paper does not quantify the resulting bias, and a sensitivity analysis with softly violated orthogonality would be a natural next test.
  • Because the estimator is based on two unfoldings rather than a joint tensor fit, it could be extended to missing layers or partially observed edges without changing the machinery.
  • The asymptotic normality of connection matrices opens the door to simultaneous confidence bands for the entire sequence Λ_t, which could be used for online change-point detection in streaming network settings.
  • The fusion step is a simple multiplication, so the approach could be adapted to weighted networks with arbitrary exponential-family noise; the theory only needs the log-likelihood's smoothness conditions.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 4 minor

Summary. The paper proposes a generalized multilayer latent space model for directed multilayer networks. Each node has two latent positions (sending and receiving), each layer has a connection matrix, and node/degree heterogeneity is modeled with low-rank factor structures. Estimation is performed by unfolding the adjacency tensor along two modes, solving constrained maximum likelihood low-rank matrix problems, selecting the latent-position columns via a two-sided centering projection, and then fusing the two unfoldings to estimate the connection matrices. The main theoretical contributions are consistency and asymptotic normality for the estimated latent positions and connection matrices, with confidence-region construction and layer-equality tests as applications. The method is validated in simulations and applied to international trade data.

Significance. If the theoretical results are correct, this is a valuable contribution to the multilayer network literature: it is one of the first inferential theories for nonlinear multilayer latent space models, it covers directed networks and multiple edge types, and the unfolding-and-fusion procedure is computationally more feasible than direct tensor optimization. The rates in Theorem 1 align with existing results in the COSIE and related literature. The paper also provides a clear path to confidence regions and structural-break tests. However, the central identification strategy rests on an exact orthogonality condition that is strong and not stress-tested; the practical scope of the claimed inference therefore remains conditional.

major comments (1)
  1. [§2.2, Assumption 1.1; §2.3, Algorithm 1] The exact orthogonality assumptions Θ*⊥span{1_n,U*_β} and Φ*⊥span{1_n,U*_α} are load-bearing. Equation (10) and Lemma 1 hold only under these conditions, and Algorithm 1 (step 4) selects columns of bU_m by projection onto the column space of J_n bZ_m J^⊤_{n,T}. If the true Θ* has an O(δ) component along span{1_n,U*_β} (and similarly for Φ*), the selected columns inherit that component and the centering does not remove it. The asymptotic covariances in Theorems 2 and 4 are derived at δ=0; the bias in the 'estimated latent positions' need not vanish as n,T grow. No local sensitivity analysis or misspecification simulation is provided, and the real-data preprocessing (zero imports replaced by a large negative value) is far from the exact condition. Please add a formal perturbation analysis (e.g., characterize the bias under a vanishing orthogonality violation and give conditions under which
minor comments (4)
  1. [§3.1, Corollary 1] The plug-in quantities bπ_{m,i,j} are defined via [M_m(bX)]_{i,j}, but the tensor bX is not explicitly defined in the main text. Please define it, e.g., as the tensor with entries bΘ_i^⊤ bΛ_t bΦ_j + bβ_{it}+bα_{jt}.
  2. [§4.2, real data] The treatment of zero import values ('set as a large negative value') is arbitrary. Since the theory assumes a correctly specified Gaussian link, the real-data analysis should report sensitivity to this preprocessing choice or justify the value used.
  3. [§2.2, Equations (16)–(17)] The notation in the derivatives, e.g., ∂²ℓ_{m,s,j}(π^*_{m,s,j})/∂π²_{m,s,j}, is confusing because the argument is also indexed. Use a dummy variable, e.g., ∂²ℓ_{m,s,j}(π)/∂π²|π=π^*_{m,s,j}.
  4. [General] The main text defers all proofs to the supplementary material. Given the complexity of the first-order expansions (especially for Theorem 4 and Corollary 2), the supplement should be carefully checked by the editor/reviewers for the joint asymptotic covariance claims.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the asymptotic results describe the estimator's behavior and are not used to fit the parameters; real-data change points are data-driven findings.

full rationale

The paper's derivation chain is a standard estimation-and-inference pipeline: model parameters Θ*, Φ*, and {Λ_t*} are defined independently of the estimators, estimated from the observed adjacency tensor via the unfolding-and-fusion MLE, and then their asymptotic distributions are derived. No fitted quantity is renamed as a prediction, and no load-bearing step reduces to a self-citation. The exact orthogonality condition in Assumption 1.1 (Θ* ⊥ span{1_n, U_β*}, Φ* ⊥ span{1_n, U_α*}) is an identifiability restriction that defines the target of estimation; Algorithm 1's column selection is designed to recover those identifiable columns, and the CLTs are proven for that target. The absence of a local-sensitivity analysis for violations of this assumption is a robustness concern, not circularity. The real-data change points are obtained by applying the proposed layer-equality tests to the estimated connection matrices, which is a legitimate inferential procedure rather than a fit being fed back into the claim. Mentions of prior work by coauthors (e.g., Li et al., 2023) are ancillary comparisons or technical references, not the basis for the central consistency/normality results, which are established in the paper's own proofs. Therefore no circular step is present, and the score is 0.

Assumptions & free parameters 2 free parameters · 7 assumptions · 1 invented entities

The central claim rests on seven axioms and two data-driven choices. The most fragile is the exact orthogonality in Assumption 1.1, which is ad hoc to the identification scheme. The other axioms are standard regularity conditions. No new physical entities are introduced; the sender/receiver latent positions are the paper's modeling invention but are standard latent space constructs.

free parameters (2)
  • latent dimensions k1, k2, kα, kβ = k1=k2=3, kα=kβ=1 (COW application)
    Selected via scree plots of centered unfolding singular values in Section 4.2. The theory in Section 3 assumes these dimensions known; their estimation uncertainty is not propagated into confidence intervals or tests.
  • zero-trade substitution value = unspecified large negative number
    In Section 4.2, zero import values are replaced by a hand-chosen 'large negative value' before log-transformation. This constant affects the Gaussian likelihood and the estimated change points, but its value and sensitivity are not reported.
assumptions (7)
  • ad hoc to paper Θ* and Φ* are exactly orthogonal to span{1_n, U*_β} and span{1_n, U*_α}, respectively (Assumption 1.1).
    Load-bearing for the two-sided centering (10) to isolate latent positions from degree heterogeneity; only an approximation is plausible in real networks and no sensitivity analysis is given.
  • domain assumption M_m(S*)M_m(S*)^T/T are diagonal with strictly decreasing positive diagonals (Assumption 1.2).
    Used to fix rotational ambiguity; standard in tensor PCA (Xia et al. 2022).
  • standard math Distinct singular values of U*_m V*_m^T with positive eigengaps (Assumption 1.3).
    Required for the matrix perturbation bounds used in the proofs (Yu et al. 2015).
  • standard math Rows of U_svd^m and V_svd^m are bounded (Assumption 1.4).
    Incoherence-type condition for entrywise eigenvector error bounds.
  • domain assumption Degree heterogeneity terms follow exact low-rank factor models: α=U_α V_α^T, β=U_β V_β^T (Eq. 5).
    Makes the unfolded matrices low-rank; if the factor model does not hold, the rank-d_m specification is misspecified.
  • standard math Link functions g_ijt are known, smooth, with bounded third derivative and sub-exponential scores (Assumption 2).
    Regularity conditions for M-estimation (Bai 2003; Wang 2022), satisfied by Gaussian, logistic, Probit, and Poisson models.
  • standard math y_ijt are conditionally independent given latent parameters.
    Model assumption stated in Section 2.1; all proofs rely on this.
invented entities (1)
  • Separate sending (θ_i) and receiving (φ_j) latent positions per node
    purpose: Model directed multilayer interactions: x_ijt = θ_i^T Λ_t φ_j + degree terms.
    They are latent variables identified only up to column sign through the model (Proposition 1). They are estimable from the network data but have no independently falsifiable handle outside the model.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Estimation and Statistical Inference for Generalized Multilayer Latent Space Model." pith.science (2026). https://pith.science/paper/JGWD7YYY

@misc{pith2026260219129,
  author       = {Pith},
  title        = {Pith review of: Estimation and Statistical Inference for Generalized Multilayer Latent Space Model},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JGWD7YYY}},
  note         = {Machine review of arXiv:2602.19129}
}
read the original abstract

Multilayer networks have become increasingly ubiquitous across diverse scientific fields, ranging from social sciences and biology to economics and international relations. Despite their broad applications, the inferential theory for multilayer networks remains underdeveloped. In this paper, we propose a flexible latent space model for multilayer directed networks with various edge types, where each node is assigned with two latent positions capturing sending and receiving behaviors, and each layer has a connection matrix governing the layer-specific structure. Through nonlinear link functions, the proposed model represents the structure of a multilayer network as a tensor, which admits a Tucker low-rank decomposition. This formulation poses significant challenges on the estimation and statistical inference for the latent positions and connection matrices, where existing techniques are inapplicable. To tackle this issue, a novel unfolding and fusion method is developed to facilitate estimation. We establish both consistency and asymptotic normality for the estimated latent positions and connection matrices, which paves the way for statistical inference tasks in multilayer network applications, such as constructing confidence regions for the latent positions and testing whether two network layers share the same structure. We validate the proposed method through extensive simulation studies and demonstrate its practical utility on real-world data.

Figures

Figures reproduced from arXiv: 2602.19129 by the authors.

Figure 1
Figure 1. Boxplots for the estimation errors, ∆Θ, ∆Φ, ∆Λ, over 200 independent experiments under different settings. Columns correspond to Θ, Φ, and {Λt} T t=1, while rows correspond to Gaussian, Poisson, and Binary settings. 24 [PITH_FULL_IMAGE:figures/full_fig_p024_1.png] view at source ↗
Figure 2
Figure 2. Empirical distributions of [Θb − Θ∗R1]1,1, [Φb − Φ∗R2]1,1 and [Λb1 − R1Λ1R2]1,1 after standardization (n = 1600, T = 100). Gray curves represent the standard normal distribution. 25 [PITH_FULL_IMAGE:figures/full_fig_p025_2.png] view at source ↗
Figure 3
Figure 3. Visualizations of the {θbi} n i=1. Panel (a) shows the first two dimensions and panel (b) shows the first and third dimension. Countries are colored according to region. 28 [PITH_FULL_IMAGE:figures/full_fig_p028_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Panels (a)–(b) show the sequence and first-order difference for [ [PITH_FULL_IMAGE:figures/full_fig_p030_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

41 extracted references · 2 linked inside Pith

  1. [1]

    Alves, L

    A. Alves, L. G., Mangioni, G., Rodrigues, F. A., Panzarasa, P., and Moreno, Y. (2018). Unfolding the complexity of the global value chain: Strength and entropy in the single- layer, multiplex, and multi-layer international trade networks.Entropy. An International and Interdisciplinary Journal of Entropy and Information Studies, 20(909)

    2018

  2. [2]

    and Zhang, A

    Agterberg, J. and Zhang, A. (2024). Statistical inference for low-rank tensors: Heteroskedas- ticity, subgaussianity, and applications.arXiv preprint arXiv:2410.06381

    arXiv 2024

  3. [3]

    E., and Vogelstein, J

    Arroyo, J., Athreya, A., Cape, J., Chen, G., Priebe, C. E., and Vogelstein, J. T. (2021). Inference for multiple heterogeneous networks with a common invariant subspace.Journal of Machine Learning Research, 22(142):1–49

    2021

  4. [4]

    A., BurnSilver, S

    Baggio, J. A., BurnSilver, S. B., Arenas, A., Magdanz, J. S., Kofinas, G. P., and Domenico, M. D. (2016). Multiplex social ecological network analysis reveals how social changes affect community robustness more than resource depletion.Proceedings of the National Academy of Sciences, 113(48):13708–13713

    2016

  5. [5]

    Bai, J. (2003). Inferential theory for factor models of large dimensions.Econometrica, 71:135–171

    2003

  6. [6]

    and Li, K

    Bai, J. and Li, K. (2012). Statistical analysis of factor models of high dimension.The Annals of Statistics, 40:436–465

    2012

  7. [7]

    and Keshk, O

    Barbieri, K. and Keshk, O. M. G. (2016). Correlates of war project trade data set codebook, version 4.0.https://correlatesofwar.org. Data set covering bilateral and national trade flows between states, 1870–2014. 31

    2016

  8. [8]

    Barbillon, P., Donnet, S., Lazega, E., and Bar-Hen, A. (2017). Stochastic block models for multiplex networks: an application to a multilevel network of researchers.Journal of the Royal Statistical Society Series A: Statistics in Society, 180(1):295–314

    2017

Show all 41 references
  1. [9]

    and Chatterjee, S

    Bhattacharyya, S. and Chatterjee, S. (2017). Spectral clustering for multiple sparse networks. Biometrika, 103(1):1–28

    2017

  2. [10]

    and Recht, B

    Candes, E. and Recht, B. (2012). Exact matrix completion via convex optimization.Com- munications of the ACM, 55(6):111–119

    2012

  3. [11]

    Chen, R., Xiao, H., and Yang, D. (2021). Autoregressive models for matrix-valued time series.Journal of Econometrics, 222(1):539–560

    2021

  4. [12]

    and Li, X

    Chen, Y. and Li, X. (2022). Determining the number of factors in high-dimensional gener- alized latent factor models.Biometrika, 109(3):769–782

    2022

  5. [13]

    Chen, Y., Li, X., and Zhang, S. (2020). Structured latent factor analysis for large-scale data: Identifiability, estimability, and their implications.Journal of the American Statistical Association, 115:1756–1770. D’Angelo, S., Murphy, T. B., and Alf` o, M. (2019). Latent spac...

    2020

  6. [14]

    E., Magnani, M., and Rossi, L

    Dickison, M. E., Magnani, M., and Rossi, L. (2016).Multilayer social networks. Cambridge University Press

    2016

  7. [15]

    Fan, J., Liao, Y., and Wang, W. (2016). Projected principal component analysis in factor models.The Annals of Statistics, 44(1):219

    2016

  8. [16]

    and Murphy, T

    Gollini, I. and Murphy, T. B. (2016). Joint modeling of multiple network views.Journal of Computational and Graphical Statistics, 25(1):246–265. 32

    2016

  9. [17]

    Han, Q., Xu, K., and Airoldi, E. (2015). Consistent estimation of dynamic and multi-layer block models. InInternational Conference on Machine Learning, pages 1511–1520. PMLR

    2015

  10. [18]

    Han, R., Willett, R., and Zhang, A. R. (2022). An optimal statistical and computational framework for generalized tensor estimation.The Annals of Statistics, 50:1–29

    2022

  11. [19]

    He, Y., Sun, J., Tian, Y., Ying, Z., and Feng, Y. (2025). Semiparametric modeling and analysis for longitudinal network data.The Annals of Statistics, 53(4):1406–1430

    2025

  12. [20]

    Hoff, P., Raftery, A., and Handcock, M. (2002). Latent space approaches to social network analysis.Journal of the American Statistical Association, 97:1090–1098

    2002

  13. [21]

    Jing, B.-Y., Li, T., Lyu, Z., and Xia, D. (2021). Community detection on mixture multilayer networks via regularized tensor decomposition.The Annals of Statistics, 49(6):3181–3205

    2021

  14. [22]

    Ke, Z. T. and Wang, J. (2025). Optimal network membership estimation under severe degree heterogeneity.Journal of the American Statistical Association, 120(550):948–962

    2025

  15. [23]

    Lei, J., Chen, K., and Lynch, B. (2020). Consistent community detection in multi-layer network data.Biometrika, 107(1):61–73

    2020

  16. [24]

    Li, J., Xu, G., and Zhu, J. (2023). Statistical inference on latent space models for network data.arXiv preprint arXiv:2312.06605

    2023 arXiv

  17. [25]

    B., Loscalzo, J., Gao, J., and Sharma, A

    Liu, X., Maiorino, E., Halu, A., Glass, K., Prasad, R. B., Loscalzo, J., Gao, J., and Sharma, A. (2020). Robustness and lethality in multilayer biological molecular networks.Nature Communications, 11(1):6043

    2020

  18. [26]

    W., Levina, E., and Zhu, J

    MacDonald, P. W., Levina, E., and Zhu, J. (2022). Latent space models for multiplex networks with shared structure.Biometrika, 109(3):683–706. 33 N´ u˜ nez-Carpintero, I., Rigau, M., Bosio, M., O’Connor, E., Spendiff, S., Azuma, Y., Topf, A., Thompson, R., ’t Hoen, P. A. C., C...

    2022

  19. [27]

    Laurie, S., Beltran, S., Capella-Guti´ errez, S., Cirillo, D., Lochm¨ uller, H., and Valencia, A. (2024). Rare disease research workflow using multilayer networks elucidates the molecular determinants of severity in Congenital Myasthenic Syndromes.Nature Communications, 15(1):1227

    2024

  20. [28]

    and Chen, Y

    Paul, S. and Chen, Y. (2016). Consistent community detection in multi-relational data through restricted multi-layer stochastic blockmodel.Electronic Journal of Statistics, 10:3807–3870

    2016

  21. [29]

    and Skrondal, A

    Rabe-Hesketh, S. and Skrondal, A. (2004).Generalized latent variable modeling: Multilevel, longitudinal, and structural equation models. Chapman and Hall/CRC, New York, NY

    2004

  22. [30]

    Ren, Z.-M., Zeng, A., and Zhang, Y.-C. (2020). Bridging nestedness and economic complexity in multilayer world trade networks.Humanities and Social Sciences Communications, 7(1):156

    2020

  23. [31]

    and McCormick, T

    Salter-Townshend, M. and McCormick, T. H. (2017). Latent space models for multiview network data.The Annals of Applied Statistics, 11(3):1217

    2017

  24. [32]

    Su, W., Guo, X., and Yang, Y. (2026). Limit results for estimation of connectivity matrix in multi-layer stochastic block models.Journal of Statistical Planning and Inference, 241:106313

    2026

  25. [33]

    Wang, F. (2022). Maximum likelihood estimation and inference for high dimensional gener- alized factor models with application to factor-augmented regressions.Journal of Econo- metrics, 229(1):180–200

    2022

  26. [34]

    D., Palowitch, J., Bhamidi, S., and Nobel, A

    Wilson, J. D., Palowitch, J., Bhamidi, S., and Nobel, A. B. (2017). Community extraction 34 in multilayer networks with heterogeneous community structure.Journal of Machine Learning Research, 18(149):1–49

    2017

  27. [35]

    R., and Zhou, Y

    Xia, D., Zhang, A. R., and Zhou, Y. (2022). Inference for low-rank tensors—no need to debias.The Annals of Statistics, 50(2):1220–1245

    2022

  28. [36]

    Xie, F. (2024). Bias-corrected joint spectral embedding for multilayer networks with invariant subspace: Entrywise eigenvector perturbation and inference.IEEE Trans. Inf. Theor., 70(12):9036–9083

    2024

  29. [37]

    Xu, S., Zhen, Y., and Wang, J. (2023). Covariate-assisted community detection in multi-layer networks.Journal of Business & Economic Statistics, 41(3):915–926

    2023

  30. [38]

    Yu, Y., Wang, T., and Samworth, R. J. (2015). A useful variant of the davis–kahan theorem for statisticians.Biometrika, 102:315–323

    2015

  31. [39]

    and Qu, A

    Yuan, Y. and Qu, A. (2021). Community detection with dependent connectivity.The Annals of Statistics, 49(4):2378–2428

    2021

  32. [40]

    and Wang, J

    Zhang, H. and Wang, J. (2025). Efficient estimation for longitudinal networks via adaptive merging.Journal of the American Statistical Association, 120(551):1683–1694

    2025

  33. [41]

    Zhang, X., Xu, G., and Zhu, J. (2022). Joint latent space models for network data with high-dimensional node variables.Biometrika, 109(3):707–720

    2022

Pith tools

Reviewed August 2, 2026 · model on record in the stance chip above.