Pith. sign in

REVIEW 3 major objections 4 minor 138 references

Latent space models for networks with nodal multiplicative effects

T0 review · 3 major / 4 minor · reviewed 2026-08-10 · deepseek-v4-flash

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

Pith's one-line read Giving each node its own distance scale makes latent-space network models reproduce real structure more closely.

desk verdict A small, genuinely new extension of latent space models with node-level multiplicative distance factors; the plug-in estimation means the evaluated object is a two-stage approximation, but the gains are credible and the limitations are disclosed. read the letter →

arxiv 2608.06676 v1 pith:DJCH47JP submitted 2026-08-07 stat.ME stat.OT

Carlos Nosa , Juan Sosa This is my paper · ORCID
classification stat.MEstat.OT MSC 62H1262F1553B2191D30
keywords latentspacemodelsconformalmetricdeformationnodalmultiplicativeeffectsnetworktopologyRiemannianmanifoldoptimizationLaplacianspectrumhyperbolicgeometryidentifiability
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

Latent space models for networks assume that one fixed geometry—Euclidean, spherical, or hyperbolic—governs the connection probability between any two nodes; real networks, however, contain nodes whose local connectivity differs even when their latent positions are similar. The paper proposes a generalization in which each node carries a multiplicative effect $\xi_i$ that rescales the latent distances, yielding the predictor $s_{ij} = \alpha_0 - \frac{\xi_i + \xi_j}{2} d_\kappa(z_i,z_j)$. This is presented as a discrete approximation to a conformal deformation—a point-by-point rescaling—of the metric tensor, preserving the geometric interpretability of the classical model while letting individual nodes expand or contract their effective neighborhoods. The paper builds a hierarchical Bayesian objective, estimates parameters with a two-stage manifold optimization scheme, and reports on eight real networks that the weighted model improves predictive performance and reproduces global topological properties such as degree variance and the normalized Laplacian spectrum (a standard spectral fingerprint of network structure) more accurately than the classical model. If the claim is right, unexplained node-level heterogeneity in networks can be captured as local geometry rather than as additive noise or popularity adjustments.

What carries the argument

The load-bearing object is the deformed predictor $s_{ij} = \alpha_0 - \frac{\xi_i + \xi_j}{2} d_\kappa(z_i,z_j)$, interpreted as a discrete approximation of the conformally deformed metric $g_\xi = \xi^2 g_\kappa$. The derivation fixes the minimizing geodesic of the ambient geometry, approximates the integral of the conformal factor along that geodesic by the trapezoidal rule, and thereby turns a smooth metric deformation into a per-node multiplicative rescaling of distances. The estimation machinery is a two-stage optimization: Riemannian gradient ascent on the latent manifold (with tangent projections and exponential maps) first obtains the classical embedding, and a simplex-constrained ascent then estimates the nodal effects conditional on that embedding, so that $\xi$ captures only the heterogeneity left unexplained by the geometry.

What would settle it

Fit the weighted model to networks generated from the classical model with all $\xi_i=1$: if the weighted model consistently beats the classical model on out-of-sample AUC or Laplacian spectral distance on these null data, the reported advantages reflect overfitting rather than genuine generative flexibility.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that replacing the homogeneous geodesic distance with the node-weighted distance $\tilde d_\xi(x,y) = \frac{\xi(x)+\xi(y)}{2} d_\kappa(x,y)$—derived by fixing the ambient geodesic, linearizing the conformal factor along it, and applying a trapezoidal quadrature—gives latent space models noticeably more generative flexibility without changing the underlying Euclidean, spherical, or hyperbolic structure. The model keeps the Bernoulli logistic likelihood, interprets $\xi_i$ as a local metric expansion ($\xi_i>1$) or contraction ($0<\xi_i<1$), and achieves identifiability through the constraint $\frac{1}{n}\sum_i \xi_i=1$ together with a fixed maximum diameter $D$ of the latent space. Inference is sequential: the classical latent space model is optimized first with Riemannian gradient ascent to produce the latent positions and intercept, and the nodal effects are then estimated by maximizing the conditional log-posterior on the scaled simplex. Because of this plug-in design, the estimated latent positions are identical for the classical and weighted models; the gain comes entirely from the per-node rescaling. In the reported applications, the weighted model consistently improves internal and cross-validated AUC and lowers the normalized Laplacian spectral distance relative to the classical model across all three geometries and both latent dimensions tested.

Load-bearing premise

The load-bearing premise is that the latent positions and intercept obtained from the classical model (Algorithm 1) are an adequate description of the geometry, so the nodal effects estimated afterward only need to absorb the residual heterogeneity; if that classical embedding is far from the true deformed geometry, the plug-in estimator can be substantially suboptimal.

Editorial extensions

If this is right

  • Across the fitted networks, the weighted model improves edge prediction: internal and cross-validated AUC values are consistently higher than for the classical model in every geometry and dimension considered.
  • The weighted model reproduces global topology better, as measured by the normalized Laplacian spectral distance between simulated and observed networks, which is smaller than the classical model's across all geometries and dimensions.
  • The estimated nodal effects carry substantive meaning: in the karate club network they correlate negatively with degree, betweenness, and closeness, so a small $\xi_i$ marks a structurally influential node.
  • The added flexibility does not automatically improve community recovery: spectral clustering on the fitted probability matrices is not consistently better under the weighted model, and it slightly worsens for the two-dimensional Euclidean and hyperbolic embeddings.
  • The improvement comes with a complexity cost: the information criterion favors the simpler classical models in most configurations, so the weighted model's advantage is a trade-off between parsimony and structural fidelity.

Reading between the lines

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

  • Editorial extension: if the classical embedding is a poor approximation of the geometry under the deformed metric, the two-stage plug-in estimator may understate the weighted model's full capacity; a joint optimization over positions, intercept, and nodal effects could yield larger gains or reveal that some reported improvement is an artifact of the fixed embedding.
  • Editorial extension: the same conformal-factor mechanism could be transferred to weighted, directed, or temporal networks, giving a principled way to let local connectivity scales evolve across layers or time.
  • Editorial extension: the estimated $\xi_i$ values could serve as a learned node-level covariate for downstream tasks such as link prediction for unseen nodes or node classification, since the paper reports they track centrality and link propensity.
  • Editorial extension: the trapezoidal quadrature is a modeling choice; replacing it with a midpoint or higher-order rule would change the effective predictor and provide a sensitivity check on the geometric motivation.
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

3 major / 4 minor

Summary. The paper proposes a latent space model for binary undirected networks in which the logistic predictor is s_ij = alpha0 - ((xi_i + xi_j)/2) d_kappa(z_i, z_j), with node-specific multiplicative effects xi_i motivated by a conformal deformation of the base Euclidean, spherical, or hyperbolic metric. The authors specify a hierarchical Bayesian model with uniform latent positions on a diameter-bounded manifold, a Dirichlet prior on xi/n, and a normal prior on alpha0; they derive log-likelihood gradients and a Riemannian optimization scheme with projections onto the relevant constraints. Estimation is carried out by first fitting the classical model (xi = 1_n) with Riemannian gradient ascent (Algorithm 1) and then estimating xi conditionally on the resulting (Z_hat, alpha0_hat) (Algorithm 2). The empirical section fits twelve model variants (three geometries, two dimensions, classical/weighted) to the Florentine families and Zachary karate networks, reporting information criteria, in-sample and five-fold cross-validated AUC, normalized Laplacian spectral distances, degree-variance predictive checks, centrality correlations, and spectral clustering metrics. The central claim is that the weighted model increases generative flexibility and reproduces global topological properties better than the classical model, at the cost of a larger information criterion.

Significance. Should the empirical conclusions survive scrutiny, the paper offers a simple and interpretable extension of latent space models that can capture node-level heterogeneity without replacing geometry with additive random effects. The modeling and optimization are transparent: the likelihood, gradients, manifold projections, and exponential maps are given explicitly; multi-start optimization and five-fold cross-validation are used; the Laplacian spectral distance is a sensible structural check; and code is promised in Section 5. The main threats to significance are the two-stage plug-in estimator, which means the fitted object is not the joint mode of the stated posterior, and the uncontrolled approximation of the conformal distance. If the authors close these gaps, or clearly re-scope the claims to the plug-in model, the contribution would be a useful methodological increment, although not a major conceptual advance.

major comments (3)
  1. [Section 4.1, Algorithms 1 and 2] The estimator used in all empirical comparisons is not a maximizer of the Section 3 posterior. Algorithm 1 maximizes the classical-model posterior (implicitly xi = 1_n), and Algorithm 2 maximizes the conditional posterior with (Z, alpha0) fixed; the gradient for Z in Algorithm 1 therefore omits the node-specific weighting (xi_i + xi_m)/2 that appears in the Section 3.1 derivative with respect to z_m. Because the paper itself notes strong dependence and flat regions between Z and xi in Section 4.1, there is no reason to expect one pass of this block scheme to be near the joint optimum. Consequently, Tables 1 and 2, the Laplacian spectral distances, degree-variance checks, and centrality correlations describe the plug-in approximation rather than the proposed model, and the abstract claim that the proposed approach 'increases the generative flexibility' is not directly supported. The authors should either iterate block updates to convergence, or explicitly reframe the paper's claims as applying to the two-stage estimator and provide evidence (for example, sensitivity analyses or a comparison on simulated data with known xi) that the discrepancy is small.
  2. [Section 2, derivation of d_xi] The approximation d_xi(x,y) approximately equals ((xi(x)+xi(y))/2) d_kappa(x,y) has two uncontrolled steps: restricting the variational problem to the ambient geodesic and applying the trapezoidal rule. The error depends on the size of the gradient of xi along the geodesic and on how far the ambient geodesic is from the true deformed-metric geodesic; no bound or numerical assessment is given. Since the paper motivates the model as approximating a conformal deformation, the geometric interpretation requires at least a statement of the approximation regime. The authors should report, for the xi fields used in their simulations, the maximum relative error between the true conformal geodesic distance and the trapezoidal approximation, computed numerically; without such evidence the connection between the model and conformal geometry remains heuristic.
  3. [Section 3.2, Identifiability] Identifiability is discussed only informally. The mean constraint (1/n) sum_i xi_i = 1 resolves the global scale ambiguity, but the paper does not prove that the remaining parametrization is identifiable modulo isometries; the likelihood depends on the pairwise products (xi_i + xi_j) d_kappa(z_i, z_j), and it is not shown that no other transformations of (Z, xi) preserve all such products. Given that the paper lists the establishment of conditions for model identifiability as a contribution, a formal statement or a counterexample is needed. This is a theoretical gap rather than necessarily an empirical error, but it affects the interpretation of the estimated xi_i as deformation factors.
minor comments (4)
  1. [Throughout Sections 1-2] There are numerous spacing and character artifacts (for example, 'Rd withda', 'conformalfactor', 'infinitesimallengthelement') that should be corrected; the manuscript would benefit from a careful proofreading pass.
  2. [Sections 2, 3.2, 3.4, and 5] The text repeatedly refers to supplementary material for derivations and additional experiments, but the supplement is not included with the posted arXiv version; the authors should ensure it is available or move the key content into the main text.
  3. [Section 5.1, information criterion] The penalty k = n + dn for the weighted model does not account for the simplex constraint (which removes one degree of freedom) nor for the diameter constraints on the latent positions; because the IC comparisons are used qualitatively, this is not fatal, but the degrees-of-freedom count should be stated as approximate.
  4. [Section 5.1, after Figure 7] The statement that the estimated latent positions under the classical and proposed models are 'the same' is enforced by Algorithm 2 rather than discovered empirically; the text should make this explicit to avoid overstating the comparison.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the multiplicative-distance model is obtained from explicit approximations, and the empirical claims are supported by out-of-sample cross-validation; self-citations are background only.

full rationale

The paper's central derivation, replacing the conformal distance d_xi(x,y) with ((xi(x)+xi(y))/2) d_kappa(x,y), is obtained from two stated approximations: fixing the ambient-geometry geodesic and then applying the trapezoidal rule to the conformal factor integral. This is a transparent approximation rather than an importation of the target predictor; the predictor is the output of the derivation, not an input. Identifiability is handled by standard constraints (mean-xi equals 1 and diameter D), with no uniqueness claim resting on the authors' prior work. The only self-citations (Nosa and Sosa 2026; Sosa and Buitrago 2021) support background statements about constant-curvature geometries and are not load-bearing for the model's derivation or its empirical claims. The estimation procedure is a clearly disclosed plug-in/block-coordinate scheme: Algorithm 1 obtains (Z, alpha0) under the classical model and Algorithm 2 maximizes the conditional posterior for xi. While this means the real-data comparisons do not evaluate the joint MAP of the Section 3 posterior, the evaluated parameter values are legitimate points in the proposed model's parameter space, and the paper explicitly calls the procedure a plug-in approximation. The five-fold out-of-sample AUC, in which the model is re-estimated in every fold, provides independent evidence not reducible to the fitted xi. The in-sample checks (degree variance and Laplacian spectral distance) are fit diagnostics and should be interpreted cautiously, but they are not predictions forced by construction. No equation in the paper reduces to its own input, and no load-bearing argument reduces to a self-citation. Accordingly, no significant circularity is present.

Assumptions & free parameters 6 free parameters · 6 assumptions · 1 invented entities

The weighted model rests on the standard LSM assumptions plus the new approximations and constraints listed above. The largest conceptual cost is the trapezoidal approximation of the conformal factor, which is not error-controlled, and the plug-in inference assumption, which decouples geometry estimation from nodal-effect estimation.

free parameters (6)
  • Nodal multiplicative effects ξ_i = Estimated per node on each network, constrained so Σ_i ξ_i = n
    The core new parameters of the model; estimated by maximizing the conditional log-posterior in Algorithm 2.
  • Global intercept α_0 = Estimated per network
    Standard density parameter in latent space models; prior Normal(0,1).
  • Latent positions z_i = Estimated via Algorithm 1 under the classical model, then held fixed
    The latent coordinates; estimated only under the classical model in the sequential plug-in scheme.
  • Diameter constraint D = 10.0
    Set a priori across all experiments to make geometries comparable; not estimated from data.
  • Curvature magnitude C = π²/D² = π²/100 ≈ 0.0987
    Chosen parameterization so κ ∈ {-C, 0, C}; a deliberate modeling choice, not estimated.
  • Dirichlet concentration a = 1
    Default prior for the scaled nodal effects; not estimated.
assumptions (6)
  • standard math The manifold (M^d_κ, g_κ) is a complete connected constant-curvature space with geodesic distance d_κ; the three model spaces are Euclidean, spherical, and hyperbolic.
    Invoked throughout Section 2 to define the predictor; standard Riemannian geometry, cited to Lee (2018).
  • domain assumption Conditional independence of edges given latent variables and nodal effects.
    Standard LSM assumption, stated in Section 3.3 and used for the likelihood factorization.
  • ad hoc to paper The effective distance under conformal deformation is approximated by ((ξ(x)+ξ(y))/2) d_κ(x,y) by fixing the ambient geodesic and using trapezoidal quadrature.
    This is the defining approximation of the model (Section 2). It is exact only if the conformal factor is linear along each geodesic; no error bound is provided.
  • ad hoc to paper The constraint (1/n)Σ_i ξ_i = 1 resolves the scale indeterminacy and allows ξ_i to be interpreted as deformation factors relative to the average.
    Section 3.2 imposes this constraint; it is a modeling choice, not derived from data.
  • ad hoc to paper The diameter restriction D is set a priori and the curvature is fixed to C = π²/D² so that κ ∈ {-C, 0, C}.
    Section 3.2 and 3.3 set D and C by hand to make geometries comparable; the values are not estimated.
  • ad hoc to paper The plug-in MAP estimator from the classical model is a faithful substitute for the weighted model's latent geometry.
    Section 4.1 defines the sequential estimation; this is the load-bearing assumption for all empirical results.
invented entities (1)
  • Node-specific conformal factor ξ_i
    purpose: Local expansion or contraction of the latent metric at each node
    Latent variables estimated from the network itself; no external measurement or independent prediction is provided. The only evidence offered is their in-sample correlation with observed centrality measures.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Latent space models for networks with nodal multiplicative effects." pith.science (2026). https://pith.science/paper/DJCH47JP

@misc{pith2026260806676,
  author       = {Pith},
  title        = {Pith review of: Latent space models for networks with nodal multiplicative effects},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DJCH47JP}},
  note         = {Machine review of arXiv:2608.06676}
}
read the original abstract

Latent space models represent network nodes as points in a geometric space, with connection probabilities determined by distances between latent positions under a fixed metric, typically Euclidean, spherical, or hyperbolic. We generalize the classical formulation by introducing nodal multiplicative effects motivated by a local deformation of the latent metric. This modification approximates a conformal deformation of the metric tensor while preserving the logistic predictor and the geometric interpretability of the model, thereby capturing additional structural heterogeneity without altering the global reference geometry. We study the generative behavior of the proposed model through simulation experiments and develop an optimization-based inference scheme derived from a hierarchical Bayesian formulation with parameter regularization. Applications to eight real networks show that the proposed approach increases the generative flexibility of classical latent space models and more accurately reproduces several topological properties observed in real networks.

Figures

Figures reproduced from arXiv: 2608.06676 by the authors.

Figure 1
Figure 1. Geometric representation of constant-curvature manifolds embedded in Euclidean [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Networks generated by the model for different configurations of the nodal effects. The [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗
Figure 3
Figure 3. Directed acyclic graph (DAG) for the proposed model. Variables with a double circle [PITH_FULL_IMAGE:figures/full_fig_p017_3.png] view at source ↗
Figures from the paper (11 more)
Figure 4
Figure 4. Figure 4: The top row shows the three latent space geometries (R [PITH_FULL_IMAGE:figures/full_fig_p019_4.png]
Figure 5
Figure 5. Figure 5: Visualization of the impact of multiplicative effects on distance for the connection [PITH_FULL_IMAGE:figures/full_fig_p020_5.png]
Figure 6
Figure 6. Figure 6: Visualization of the network of Florentine families. [PITH_FULL_IMAGE:figures/full_fig_p026_6.png]
Figure 7
Figure 7. Figure 7: Visualization of latent spaces for the Florentine families network. [PITH_FULL_IMAGE:figures/full_fig_p027_7.png]
Figure 8
Figure 8. Figure 8: Observed and fitted adjacency matrices for the Florentine families network. [PITH_FULL_IMAGE:figures/full_fig_p028_8.png]
Figure 9
Figure 9. Figure 9: Comparison of degree variance for the fitted latent space models on the Florentine [PITH_FULL_IMAGE:figures/full_fig_p029_9.png]
Figure 10
Figure 10. Figure 10: Evaluation of the Laplacian spectrum in the Florentine families network. [PITH_FULL_IMAGE:figures/full_fig_p030_10.png]
Figure 11
Figure 11. Figure 11: Visualization of the Zachary karate club network. [PITH_FULL_IMAGE:figures/full_fig_p032_11.png]
Figure 12
Figure 12. Figure 12: Visualization of latent spaces for the Karate network. [PITH_FULL_IMAGE:figures/full_fig_p033_12.png]
Figure 13
Figure 13. Figure 13: Comparison between observed node centrality measures and node multiplicative effects [PITH_FULL_IMAGE:figures/full_fig_p034_13.png]
Figure 14
Figure 14. Figure 14: Evaluation of the Laplacian spectrum in the Karate network. [PITH_FULL_IMAGE:figures/full_fig_p035_14.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

138 extracted references · 59 canonical work pages

  1. [1]

    Spherical latent space models for social network analysis

    Spherical latent space models for social network analysis , author=. arXiv preprint arXiv:2508.16556 , year=

    work page Pith review arXiv

  2. [2]

    Statistica Neerlandica , volume=

    p2: a random effects model with covariates for directed graphs , author=. Statistica Neerlandica , volume=. 2004 , publisher=

    2004

  3. [3]

    Statistical Science , volume=

    Additive and multiplicative effects network models , author=. Statistical Science , volume=. 2021 , publisher=

    2021

  4. [4]

    Statistical science: a review journal of the Institute of Mathematical Statistics , volume=

    The geometry of continuous latent space models for network data , author=. Statistical science: a review journal of the Institute of Mathematical Statistics , volume=

  5. [5]

    Journal of the American Statistical Association , volume=

    Latent surface models for networks using aggregated relational data , author=. Journal of the American Statistical Association , volume=. 2015 , publisher=

    2015

  6. [6]

    arXiv preprint arXiv:2109.03343 , year=

    Latent Space Network Modelling with Hyperbolic and Spherical Geometries , author=. arXiv preprint arXiv:2109.03343 , year=

    arXiv

  7. [7]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Identifying the latent space geometry of network models through analysis of curvature , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 2023 , publisher=

    2023

  8. [8]

    The annals of statistics , pages=

    A Bayesian analysis of some nonparametric problems , author=. The annals of statistics , pages=. 1973 , publisher=

    1973

Show all 138 references
  1. [9]

    Statistica sinica , pages=

    A constructive definition of Dirichlet priors , author=. Statistica sinica , pages=. 1994 , publisher=

    1994

  2. [10]

    arXiv preprint arXiv:1804.00891 , year=

    Hyperspherical variational auto-encoders , author=. arXiv preprint arXiv:1804.00891 , year=

    arXiv

  3. [11]

    the Journal of machine Learning research , volume=

    Stochastic variational inference , author=. the Journal of machine Learning research , volume=. 2013 , publisher=

    2013

  4. [12]

    Journal of the American statistical Association , volume=

    Variational inference: A review for statisticians , author=. Journal of the American statistical Association , volume=. 2017 , publisher=

    2017

  5. [13]

    2014 , publisher=

    Geometric measure theory , author=. 2014 , publisher=

    2014

  6. [14]

    2018 , publisher=

    Numerical hamiltonian problems , author=. 2018 , publisher=

    2018

  7. [15]

    2009 , publisher=

    Bayesian computation with R , author=. 2009 , publisher=

    2009

  8. [16]

    2004 , publisher=

    Convex optimization , author=. 2004 , publisher=

    2004

  9. [17]

    2006 , edition =

    Numerical Optimization , author =. 2006 , edition =

    2006

  10. [18]

    2024 , publisher=

    Statistical inference , author=. 2024 , publisher=

    2024

  11. [19]

    2005 , publisher=

    Modern multidimensional scaling: Theory and applications , author=. 2005 , publisher=

    2005

  12. [20]

    2006 , publisher=

    Markov chain Monte Carlo: stochastic simulation for Bayesian inference , author=. 2006 , publisher=

    2006

  13. [21]

    2020 , school=

    Spherical Latent Factor Model for Binary and Ordinal Data , author=. 2020 , school=

    2020

  14. [22]

    Statistics surveys , volume=

    A review of dynamic network models with latent variables , author=. Statistics surveys , volume=

  15. [23]

    and Chen, Yuguo , title =

    Sewell, Daniel K. and Chen, Yuguo , title =. Bayesian Analysis , year =

  16. [24]

    Social Networks , volume=

    Latent space models for dynamic networks with weighted edges , author=. Social Networks , volume=. 2016 , publisher=

    2016

  17. [25]

    The annals of applied statistics , volume=

    Multilinear tensor regression for longitudinal relational data , author=. The annals of applied statistics , volume=

  18. [26]

    Biometrika , volume=

    Nonparametric Bayes dynamic modelling of relational data , author=. Biometrika , volume=. 2014 , publisher=

    2014

  19. [27]

    Journal of Computational and Graphical Statistics , volume=

    Joint modeling of multiple network views , author=. Journal of Computational and Graphical Statistics , volume=. 2016 , publisher=

    2016

  20. [28]

    The annals of applied statistics , volume=

    Latent space models for multiview network data , author=. The annals of applied statistics , volume=

  21. [29]

    The Annals of Applied Statistics , year =

    D’Angelo, Silvia and Murphy, Thomas Brendan and Alfò, Marco , title =. The Annals of Applied Statistics , year =

  22. [30]

    Computational Statistics & Data Analysis , volume=

    Hierarchical multilinear models for multiway data , author=. Computational Statistics & Data Analysis , volume=. 2011 , publisher=

    2011

  23. [31]

    International conference on machine learning , pages=

    A flexible latent space model for multilayer networks , author=. International conference on machine learning , pages=. 2020 , organization=

    2020

  24. [32]

    Journal of the Royal Statistical Society Series A: Statistics in Society , volume=

    Model-based clustering for multidimensional social networks , author=. Journal of the Royal Statistical Society Series A: Statistics in Society , volume=. 2023 , publisher=

    2023

  25. [33]

    psychometrika , volume=

    Joint latent space model for social networks with multivariate attributes , author=. psychometrika , volume=. 2023 , publisher=

    2023

  26. [34]

    Network Science , volume=

    Faster MCMC for Gaussian latent position network models , author=. Network Science , volume=. 2022 , publisher=

    2022

  27. [35]

    Journal of Machine Learning Research , volume=

    Universal latent space model fitting for large networks with edge covariates , author=. Journal of Machine Learning Research , volume=

  28. [36]

    Bayesian Analysis , year =

    Guhaniyogi, Rajarshi and Rodriguez, Abel , title =. Bayesian Analysis , year =

  29. [37]

    Journal of Computational and Graphical Statistics , volume=

    Stratified stochastic variational inference for high-dimensional network factor model , author=. Journal of Computational and Graphical Statistics , volume=. 2022 , publisher=

    2022

  30. [38]

    Electronic Journal of Statistics , volume=

    Computationally efficient inference for latent position network models , author=. Electronic Journal of Statistics , volume=. 2024 , publisher=

    2024

  31. [39]

    ACM computing surveys (CSUR) , volume=

    Random graph modeling: A survey of the concepts , author=. ACM computing surveys (CSUR) , volume=. 2019 , publisher=

    2019

  32. [40]

    Social Networks , volume=

    Alternative estimation methods for identifying contagion effects in dynamic social networks: A latent-space adjusted approach , author=. Social Networks , volume=. 2018 , publisher=

    2018

  33. [41]

    Statistics and Computing , volume=

    Optimal Bayesian estimators for latent variable cluster models , author=. Statistics and Computing , volume=. 2018 , publisher=

    2018

  34. [42]

    Political Analysis , volume=

    Inferential approaches for network analysis: AMEN for latent factor models , author=. Political Analysis , volume=. 2019 , publisher=

    2019

  35. [43]

    Advances in Data Analysis and Classification , volume=

    Model-based clustering for random hypergraphs , author=. Advances in Data Analysis and Classification , volume=. 2022 , publisher=

    2022

  36. [44]

    Journal of the Royal Statistical Society Series A: Statistics in Society , volume=

    Model-based clustering for social networks , author=. Journal of the Royal Statistical Society Series A: Statistics in Society , volume=. 2007 , publisher=

    2007

  37. [45]

    ACM Computing Surveys (CSUR) , volume=

    Network structure inference, a survey: Motivations, methods, and applications , author=. ACM Computing Surveys (CSUR) , volume=. 2018 , publisher=

    2018

  38. [46]

    Social Networks , volume=

    Multiplicative coevolution regression models for longitudinal networks and nodal attributes , author=. Social Networks , volume=. 2019 , publisher=

    2019

  39. [47]

    Proceedings of the national academy of sciences , volume=

    Interlocking directorates in Irish companies using a latent space model for bipartite networks , author=. Proceedings of the national academy of sciences , volume=. 2016 , publisher=

    2016

  40. [48]

    Computational Network Analysis with R: Applications in Biology, Medicine, and Chemistry , volume=

    Bayesian computational algorithms for social network analysis , author=. Computational Network Analysis with R: Applications in Biology, Medicine, and Chemistry , volume=. 2016 , publisher=

    2016

  41. [49]

    ESAIM: Proceedings and Surveys , volume=

    Modeling heterogeneity in random graphs through latent space models: a selective review , author=. ESAIM: Proceedings and Surveys , volume=. 2014 , publisher=

    2014

  42. [50]

    Computational Statistics & Data Analysis , volume=

    Variational Bayesian inference for the latent position cluster model for network data , author=. Computational Statistics & Data Analysis , volume=. 2013 , publisher=

    2013

  43. [51]

    Network Science , volume=

    Bayesian model selection for the latent position cluster model for social networks , author=. Network Science , volume=. 2017 , publisher=

    2017

  44. [52]

    Journal of the American Statistical Association , volume=

    Testing and modeling dependencies between a network and nodal attributes , author=. Journal of the American Statistical Association , volume=. 2015 , publisher=

    2015

  45. [53]

    Social networks , volume=

    Covariate-defined latent space random effects model , author=. Social networks , volume=. 2013 , publisher=

    2013

  46. [54]

    Statistical Analysis and Data Mining , volume =

    Salter-Townshend, Michael and White, Arthur and Gollini, Isabella and Murphy, Thomas Brendan , title =. Statistical Analysis and Data Mining , volume =. 2012 , doi =

    2012

  47. [55]

    Journal of computational and graphical statistics , volume=

    Fast inference for the latent space network model using a case-control approximate likelihood , author=. Journal of computational and graphical statistics , volume=. 2012 , publisher=

    2012

  48. [56]

    Journal of Computational and Graphical Statistics , volume=

    Computational statistical methods for social network models , author=. Journal of Computational and Graphical Statistics , volume=. 2012 , publisher=

    2012

  49. [57]

    Annual Review of Political Science , volume=

    Network analysis and political science , author=. Annual Review of Political Science , volume=. 2011 , publisher=

    2011

  50. [58]

    Sage Handbook of Social Network Analysis , pages=

    Latent position network models , author=. Sage Handbook of Social Network Analysis , pages=

  51. [59]

    Foundations and Trends

    A survey of statistical network models , author=. Foundations and Trends. 2010 , publisher=

    2010

  52. [60]

    Social networks , volume=

    Representing degree distributions, clustering, and homophily in social networks with latent cluster random effects models , author=. Social networks , volume=. 2009 , publisher=

    2009

  53. [61]

    Applied Stochastic Models in Business and Industry , volume=

    A Bayesian record linkage model incorporating relational data , author=. Applied Stochastic Models in Business and Industry , volume=. 2023 , publisher=

    2023

  54. [62]

    Social Networks , volume=

    A latent space model for cognitive social structures data , author=. Social Networks , volume=. 2021 , publisher=

    2021

  55. [63]

    Computational and mathematical organization theory , volume=

    Multiplicative latent factor models for description and prediction of social networks , author=. Computational and mathematical organization theory , volume=. 2009 , publisher=

    2009

  56. [64]

    2020 , publisher=

    A first course in network science , author=. 2020 , publisher=

    2020

  57. [65]

    2018 , publisher=

    Networks , author=. 2018 , publisher=

    2018

  58. [66]

    2016 , publisher=

    Network science , author=. 2016 , publisher=

    2016

  59. [67]

    2017 , publisher=

    Python for graph and network analysis , author=. 2017 , publisher=

    2017

  60. [68]

    Journal of the American Statistical Association , author =

    Latent space approaches to social network analysis , volume =. Journal of the American Statistical Association , author =. 2002 , pages =. doi:10.1198/016214502388618906 , language =

    2002 doi

  61. [69]

    Revista Colombiana de Estadística , author =

    A review of latent space models for social networks , volume =. Revista Colombiana de Estadística , author =. 2021 , pages =. doi:10.15446/rce.v44n1.89369 , abstract =

    2021 doi

  62. [70]

    and Csárdi, Gábor , year =

    Kolaczyk, Eric D. and Csárdi, Gábor , year =. Statistical analysis of network data with r , copyright =

  63. [71]

    American Journal of Sociology , author =

    Robust action and the rise of the medici, 1400-1434 , volume =. American Journal of Sociology , author =. 1993 , pages =. doi:10.1086/230190 , language =

    1993 doi

  64. [72]

    Social Networks , author =

    An introduction to exponential random graph (. Social Networks , author =. 2007 , pages =. doi:10.1016/j.socnet.2006.08.002 , language =

    2007 doi

  65. [73]

    Community detection in graphs , url =

    Fortunato, Santo , month = jan, year =. Community detection in graphs , url =. doi:10.48550/arXiv.0906.0612 , abstract =

    doi arXiv

  66. [74]

    , month = nov, year =

    Hoff, Peter D. , month = nov, year =. Modeling homophily and stochastic equivalence in symmetric relational data , url =. doi:10.48550/arXiv.0711.1146 , abstract =

    doi arXiv

  67. [75]

    Newman, M. E. J. and Girvan, M. , month = aug, year =. Finding and evaluating community structure in networks , url =. doi:10.48550/arXiv.cond-mat/0308217 , abstract =

    doi arXiv

  68. [76]

    2013 , publisher =

    Bayesian Data Analysis , author =. 2013 , publisher =

    2013

  69. [77]

    Understanding predictive information criteria for

    Gelman, Andrew and Hwang, Jessica and Vehtari, Aki , month = jul, year =. Understanding predictive information criteria for. doi:10.48550/arXiv.1307.5928 , abstract =

    doi arXiv

  70. [78]

    Newman, M. E. J. , month = mar, year =. The structure and function of complex networks , url =. doi:10.48550/arXiv.cond-mat/0303516 , abstract =

    doi arXiv

  71. [79]

    Communications in Statistics - Simulation and Computation , author =

    Simulation of the von mises fisher distribution , volume =. Communications in Statistics - Simulation and Computation , author =. 1994 , pages =. doi:10.1080/03610919408813161 , language =

    1994 doi

  72. [80]

    Handbook of Markov Chain Monte Carlo , editor=

    MCMC using Hamiltonian dynamics , author=. Handbook of Markov Chain Monte Carlo , editor=. 2011 , pages=

    2011

  73. [81]

    Journal of the Royal Statistical Society: Series B , volume=

    Riemann manifold Langevin and Hamiltonian Monte Carlo methods , author=. Journal of the Royal Statistical Society: Series B , volume=. 2011 , publisher=

    2011

  74. [82]

    Scalable inference for structured data , series=

    Geodesic Monte Carlo on embedded manifolds , author=. Scalable inference for structured data , series=

  75. [83]

    \'Ecole d'\'et\'e de probabilit\'es de Saint-Flour, XIII—1983 , volume=

    Exchangeability and related topics , author=. \'Ecole d'\'et\'e de probabilit\'es de Saint-Flour, XIII—1983 , volume=. 1985 , publisher=

    1983

  76. [84]

    Unpublished manuscript, Institute for Advanced Study, Princeton , year=

    Some comments on exchangeability , author=. Unpublished manuscript, Institute for Advanced Study, Princeton , year=

  77. [85]

    Advances in neural information processing systems , volume=

    Modeling homophily and stochastic equivalence in symmetric relational data , author=. Advances in neural information processing systems , volume=

  78. [86]

    Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume =

    Girolami, Mark and Calderhead, Ben , title =. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume =. 2011 , doi =

    2011

  79. [87]

    Journal of the American Statistical Association , volume=

    Bilinear mixed-effects models for dyadic data , author=. Journal of the American Statistical Association , volume=. 2005 , publisher=

    2005

  80. [88]

    Journal of the American Statistical Association , volume=

    A latent space model for random graphs with latent block structure , author=. Journal of the American Statistical Association , volume=. 2001 , publisher=

    2001

  81. [89]

    Journal of Complex Networks , volume=

    Multilayer networks , author=. Journal of Complex Networks , volume=. 2014 , publisher=

    2014

  82. [90]

    Journal of the American Statistical Association , volume=

    Latent space models for dynamic networks , author=. Journal of the American Statistical Association , volume=. 2015 , publisher=

    2015

  83. [91]

    Journal of Applied Statistics , volume =

    Sosa, Juan and Rodríguez, Abel , title =. Journal of Applied Statistics , volume =. 2022 , doi =

    2022

  84. [92]

    Influence networks: Bayesian modeling and diffusion , journal =

    S. Influence networks: Bayesian modeling and diffusion , journal =. 2025 , note =. doi:10.1080/02664763.2025.2519139 , url =

    2025

  85. [93]

    Computational Statistics & Data Analysis , volume =

    Sosa, Juan Camilo and Betancourt, Brenda , title =. Computational Statistics & Data Analysis , volume =. 2022 , doi =

    2022

  86. [94]

    1968 , publisher=

    A Novitiate in a Period of Change: An Experimental and Case Study of Social Relationships , author=. 1968 , publisher=

    1968

  87. [95]

    Journal of Anthropological Research , volume=

    An information flow model for conflict and fission in small groups , author=. Journal of Anthropological Research , volume=. 1977 , publisher=

    1977

  88. [96]

    F. W. Kent , title =. 1978 , address =

    1978

  89. [97]

    2013 , publisher=

    A Widely Applicable Bayesian Information Criterion , author=. 2013 , publisher=

    2013

  90. [98]

    Physical Review E , volume =

    Finding community structure in very large networks , author =. Physical Review E , volume =. 2004 , publisher =

    2004

  91. [99]

    Advances in Neural Information Processing Systems , volume=

    On Spectral Clustering: Analysis and an Algorithm , author=. Advances in Neural Information Processing Systems , volume=

  92. [100]

    2000 , publisher =

    Directional Statistics , author =. 2000 , publisher =

    2000

  93. [101]

    Journal of Machine Learning Research , volume=

    Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance , author=. Journal of Machine Learning Research , volume=

  94. [102]

    Rosenbrock, H. H. , title =. The Computer Journal , volume =. 1960 , doi =

    1960

  95. [103]

    2016 , publisher=

    Network Science , author=. 2016 , publisher=

    2016

  96. [104]

    2009 , publisher=

    Statistical Analysis of Network Data , author=. 2009 , publisher=

    2009

  97. [105]

    Physical Review E , volume=

    Hyperbolic geometry of complex networks , author=. Physical Review E , volume=

  98. [106]

    2018 , publisher=

    Introduction to Riemannian Manifolds , author=. 2018 , publisher=

    2018

  99. [107]

    Journal of the American Statistical Association , volume=

    Latent space models for dynamic networks , author=. Journal of the American Statistical Association , volume=

  100. [108]

    Bernoulli , volume=

    Exponential convergence of Langevin distributions and their discrete approximations , author=. Bernoulli , volume=

  101. [109]

    arXiv preprint arXiv:1407.5965 , year=

    Optimization techniques on Riemannian manifolds , author=. arXiv preprint arXiv:1407.5965 , year=

    arXiv

  102. [110]

    1998 , publisher=

    Vector calculus , author=. 1998 , publisher=

    1998

  103. [111]

    2006 , publisher=

    Foundations of hyperbolic manifolds , author=. 2006 , publisher=

    2006

  104. [112]

    Journal of Quality Technology , volume=

    A tutorial on generalized linear models , author=. Journal of Quality Technology , volume=. 1997 , publisher=

    1997

  105. [113]

    Numerical analysis , pages=

    Numerical differentiation & integration numerical differentiation I , author=. Numerical analysis , pages=

  106. [114]

    1998 , publisher=

    Variational analysis , author=. 1998 , publisher=

    1998

  107. [115]

    2004 , publisher=

    Procrustes problems , author=. 2004 , publisher=

    2004

  108. [116]

    2013 , publisher=

    Matrix computations , author=. 2013 , publisher=

    2013

  109. [117]

    IEEE Signal Processing Letters , volume=

    On procrustes analysis in hyperbolic space , author=. IEEE Signal Processing Letters , volume=. 2021 , publisher=

    2021

  110. [118]

    2000 , publisher=

    Estimating a Dirichlet distribution , author=. 2000 , publisher=

    2000

  111. [119]

    The Annals of Mathematical Statistics , volume=

    A stochastic approximation method , author=. The Annals of Mathematical Statistics , volume=

  112. [120]

    The Annals of Applied Probability , volume=

    Weak convergence and optimal scaling of random walk Metropolis algorithms , author=. The Annals of Applied Probability , volume=

  113. [121]

    Journal of the Royal Statistical Society: Series B , volume=

    Optimal scaling of discrete approximations to Langevin diffusions , author=. Journal of the Royal Statistical Society: Series B , volume=

  114. [122]

    Scandinavian Journal of Statistics , volume=

    Geodesic Monte Carlo on embedded manifolds , author=. Scandinavian Journal of Statistics , volume=. 2013 , publisher=

    2013

  115. [123]

    Network Science , volume=

    Spherical latent space models for social networks: Geometry-aware inference and comparison across latent geometries , author=. Network Science , volume=. 2026 , publisher=

    2026

  116. [124]

    Rubin , title =

    Xiao-Li Meng and Donald B. Rubin , title =. Biometrika , volume =. 1993 , publisher =

    1993

  117. [125]

    2016 , series =

    Kenneth Lange , title =. 2016 , series =

    2016

  118. [126]

    SIAM Journal on Optimization , volume =

    Meisam Razaviyayn and Mingyi Hong and Zhi-Quan Luo , title =. SIAM Journal on Optimization , volume =. 2013 , doi =

    2013

  119. [127]

    Journal of Classification , year =

    Lawrence Hubert and Phipps Arabie , title =. Journal of Classification , year =

  120. [128]

    Journal of Machine Learning Research Workshop and Conference Proceedings , year =

    Alexander Strehl and Joydeep Ghosh , title =. Journal of Machine Learning Research Workshop and Conference Proceedings , year =

  121. [129]

    Fowlkes and Colin L

    Edward B. Fowlkes and Colin L. Mallows , title =. Journal of the American Statistical Association , year =

  122. [130]

    Social Networks , volume=

    In the network of the conclave: Social connections and the making of a pope , author=. Social Networks , volume=. 2025 , publisher=

    2025

  123. [131]

    and Haase, Paul and Slooten, Elisabeth and Dawson, Steve M

    Lusseau, David and Schneider, Karsten and Boisseau, Oliver J. and Haase, Paul and Slooten, Elisabeth and Dawson, Steve M. , title =. Behavioral Ecology and Sociobiology , volume =. 2003 , doi =

    2003

  124. [132]

    Newman, M. E. J. , title =. Physical Review E , volume =. 2006 , doi =

    2006

  125. [133]

    Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining , pages =

    Rozemberczki, Benedek and Davies, Ryan and Sarkar, Rik and Sutton, Charles , title =. Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining , pages =

    2019

  126. [134]

    Rossi and Nesreen K

    Ryan A. Rossi and Nesreen K. Ahmed , title =. AAAI , year =

  127. [135]

    Knuth , title =

    Donald E. Knuth , title =

  128. [136]

    Karrer, Brian and Newman, M. E. J. , title =. Physical Review E , year =

  129. [137]

    and Mahony, Robert and Sepulchre, Rodolphe , title =

    Absil, P.-A. and Mahony, Robert and Sepulchre, Rodolphe , title =. 2008 , isbn =

    2008

  130. [138]

    , title =

    McCullagh, Peter and Nelder, John A. , title =. 1989 , isbn =

    1989

Pith tools

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