SANVI: A Fast Spectral-Assisted Network Variational Inference Method with an Extended Surrogate Likelihood Function

Dingbo Wu; Fangzheng Xie

REVIEW 3 major objections 5 minor 16 references

SANVI: A Fast Spectral-Assisted Network Variational Inference Method with an Extended Surrogate Likelihood Function

T0 review · 3 major / 5 minor · reviewed 2026-08-05 · deepseek-v4-flash

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

Pith's one-line read SANVI's variational posterior mean is asymptotically normal and efficient for generalized random dot product graphs, matching the oracle maximum likelihood estimator.

desk verdict Solid extension of surrogate-likelihood VI to GRDPG; main caveat is an unproved imported one-step theorem that carries the efficiency claims. read the letter →

arxiv 2509.00562 v1 pith:XVB3QA3A submitted 2025-08-30 stat.CO math.STstat.MEstat.TH

Dingbo Wu , Fangzheng Xie This is my paper · ORCID

classification stat.COmath.STstat.MEstat.TH MSC 62F1262F1505C80

keywords generalizedrandomdotproductgraphsextendedsurrogatelikelihoodvariationalBayesstochasticgradientdescentnetworkinferenceBernstein-vonMisesadjacencyspectralembeddingasymptoticefficiency

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

Bayesian inference for generalized random dot product graphs—network models where each vertex carries a low-dimensional latent position and edge probabilities are generalized inner products—is usually done with MCMC and is slow. This paper proposes SANVI, which replaces the exact likelihood with an extended surrogate likelihood: unknown latent positions are swapped for signature-adjusted adjacency spectral embeddings, and the logarithms are smoothed and extended from the constrained interval to all of R^d. The result is a separable, log-concave objective, so each vertex's posterior can be approximated by a Gaussian via stochastic gradient descent. The paper proves the variational posterior mean is asymptotically as accurate as the oracle maximum likelihood estimator—sqrt(n)-consistent, normal, and efficient—and that the variational posterior approaches the oracle-centered normal posterior in total variation. If correct, this gives network analysts a fast, parallelizable, optimization-based route to near-MCMC-quality posterior estimates.

What carries the argument

The extended surrogate likelihood (ESL): for each vertex i, b_l_in(x_i) = Σ_j [A_ij ψ_n(x_i^T x_tilde_j) + (1−A_ij)ψ_n(1−x_i^T x_tilde_j)], where x_tilde_j is the signature-adjusted adjacency spectral embedding of vertex j and ψ_n(t) equals log(t) on [τ_n, 1] and continues as a bounded quadratic outside. It decouples the generalized inner product between latent positions, relaxes the domain from the constraint set to all of R^d, and keeps the objective separable, smooth, and strongly concave. The Fisher information G_{0in} of the oracle likelihood appears as the asymptotic covariance; the signature-adjusted spectral embedding supplies the plug-in that converts the oracle likelihood into a co

What would settle it

Simulate a GRDPG with a deliberately small spectral gap in the Gram matrix (two nearly identical latent positions) and run SANVI against the oracle MLE that uses the true other-vertex positions; Theorem 3.5 predicts the aligned errors differ by o_P(n^{−1/2}). If the entrywise embedding convergence used in Theorem A.1 degrades, the difference will grow with the inverse gap, and nominal 95% credible intervals from the variational covariance will undercover. A second check: set ρ_n = C log n/n with C large enough that (log n)/(nρ_n)→0 but (log n)^4/(nρ_n)→∞, and test whether the global error cons

Watch

Extended reading notes

Core claim

The paper's central claim is that the extended surrogate likelihood makes Gaussian variational inference for generalized random dot product graphs simultaneously fast and asymptotically efficient. The maximum extended surrogate likelihood estimator is consistent at rate sqrt(log n/n), uniquely defined with high probability, and satisfies sqrt(n)G_{0in}^{1/2}(W^T x_hat_i − rho_n^{1/2} x_{0i}) → N(0_d, I_d). The variational posterior mean inherits that limit, so the VI estimator matches the oracle likelihood's precision. In total variation, both the full posterior and the Gaussian variational posterior converge to the same normal distribution centered at the estimator, the variational one at r

Load-bearing premise

The argument stands or falls on the signature-adjusted adjacency spectral embedding converging to the true latent positions uniformly across vertices (in two-to-infinity norm) at rate about sqrt(log n/n); this entrywise convergence is imported from earlier eigenvector limit theory rather than re-proved in full generality here, and without it the surrogate likelihood does not track the oracle likelihood.

Editorial extensions

If this is right

The variational posterior mean from SANVI is asymptotically efficient: after aligning the orthogonal ambiguity, sqrt(n)G_{0in}^{1/2}(W^T x^*_i − rho_n^{1/2} x_{0i}) converges to a standard normal, so the VI estimator loses no accuracy relative to the oracle MLE.
The variational posterior itself has a Bernstein-von Mises limit: it converges in total variation to the same normal posterior the oracle likelihood would produce, at rate O(1/sqrt(log n)), so the variational covariance can be used for approximate uncertainty quantification.
Because the ESL is separable across vertices, SANVI's computation decomposes into n O(n) subproblems, giving O(n^2) total time; the numerical comparison places it at roughly 20% of MCMC runtime while matching its squared error.
Under the stronger sparsity condition (log n)^4/(nρ_n)→0, the global squared error of the aligned ESL estimator is consistent for (1/n)Σ_i tr(G_{0in}^{-1}), the oracle Cramér-Rao-type lower bound.
The method applies to generalized random dot product graphs, including indefinite-signature cases such as rank-three GRDPG, and to sparse graphs with ρ_n→0 as long as nρ_n/log n→∞.

Reading between the lines

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

Beyond the paper: the same ESL-plus-Gaussian-VI template could be used for edge prediction or vertex classification, where the variational covariance would yield predictive intervals; a natural test is whether such intervals achieve nominal coverage at the rates predicted by Theorems 3.4–3.5.
Beyond the paper: because the BvM rate for the variational posterior is O(1/sqrt(log n)) while the MCMC posterior is O(1/log n), the variational posterior's covariance—not its mean—is likely the quantity that degrades first at moderate n; experiments reporting coverage rather than point error would reveal this.
Beyond the paper: Theorem 3.3 is proven for ρ_n=1, and the paper states that relaxing to ρ_n→0 is possible but does not carry it out; a concrete extension is to verify the variational BvM bound under the same sparsity condition used in Theorem 3.2.
Beyond the paper: the truncation threshold τ_n must sit between δ^2ρ_n and (δ/2)ρ_n, so finite-sample performance may be sensitive to τ_n; sweeping τ_n in the simulation setups would give practitioners a practical calibration rule.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Desk Editor's Note

read the letter

Bottom line: this is a useful extension of the Wu–Xie surrogate-likelihood idea from RDPG to GRDPG with an indefinite signature, and it replaces MCMC with Gaussian VI. The paper does real work: it defines an extended surrogate likelihood on the whole Euclidean space, proves existence/uniqueness and asymptotic normality of the MESLE, and establishes Bernstein–von Mises results that transfer to the variational posterior and its mean. The numerics are honest: SANVI matches the MCMC-based Bayes estimate in error and runs much faster, while OSE is unstable in several of the settings tried. That matches the claims.

The main soft spot, and I agree with the stress-test note here, is Theorem A.7. That one-step estimator expansion is imported from Xie (2024), and the paper explicitly says it is used directly without proof (Remark 3). It is the load-bearing link in Theorem 3.2's proof of asymptotic normality, and everything downstream—Theorems 3.3 through 3.5—inherits it. The generalization to sparse GRDPG with indefinite signature may well be routine, but the remainder bound and the alignment matrix need checking. This should be fixed either by proving the theorem or by stating it as an assumption. As it stands, the chain of proofs has one unverified link right at the critical point.

A second, more minor issue: the simulation protocol uses tau_n = min(0.001, e^{1.5}/n), which does not satisfy Assumption 1(e) when rho_n = 1 and n grows. That assumption requires tau_n bounded between delta^2 and delta/2, whereas the simulation sends tau_n to zero. This mismatch is not fatal, but it deserves an acknowledgment.

Minor: no code is shipped. The algorithm is described in enough detail to reproduce, but code would help.

Overall, the paper is in good shape. The contribution is new relative to the MCMC-based Bayes method, the theory is detailed where it is actually proved, and the numerical evidence supports the main claims. I'd send this to a serious referee. I'd cite it if I worked on network variational inference.

Referee Report

3 major / 5 minor

Summary. The paper proposes SANVI, a Gaussian variational inference method for generalized random dot product graphs (GRDPGs). The method replaces unknown latent positions and the signature by the signature-adjusted adjacency spectral embedding and uses an extended surrogate likelihood (ESL) that is separable in vertices and defined on the whole Euclidean space. The main theoretical results are: strong convexity of the variational objective (Theorem 3.1), consistency, existence/uniqueness, asymptotic normality and efficiency of the maximum ESL estimator (Theorem 3.2), a Bernstein-von Mises result for the ESL posterior (Theorem 3.3), an analogous BvM result for the Gaussian variational posterior (Theorem 3.4), and asymptotic efficiency of the variational posterior mean (Theorem 3.5). Numerical experiments compare SANVI with ASE, OSE, and MCMC-based Bayes estimation on simulated GRDPGs and a political-blog network, reporting that SANVI is competitive in accuracy and substantially faster than MCMC.

Significance. If the main theorems hold, the paper provides a useful and nontrivial contribution: a computationally scalable likelihood-informed Bayesian procedure for GRDPG latent positions with oracle-type asymptotic efficiency and a BvM guarantee. The ESL construction is clean, the algorithm is parallelizable, and the empirical comparisons support the computational advantage over MCMC. The paper also contains detailed proofs of several new auxiliary lemmas (e.g., Lemmas A.2--A.6, A.9) and an explicit proof of the spectral-embedding approximation Theorem A.1. However, the central efficiency and BvM claims depend heavily on the one-step estimator expansion in Theorem A.7, which is imported from prior work without proof for the sparse indefinite-signature setting. This makes the asymptotic guarantees conditional on an unverified generalization, and the BvM results are proved only for the dense case ρ_n = 1. These issues are load-bearing for the advertised claims.

major comments (3)

[Appendix A, Theorem A.7 and Remark 3] Theorem A.7 is the key first-order expansion used in the proof of Theorem 3.2 (Appendix B.1) to obtain the CLT for the MESLE, and through Theorems 3.3--3.5 it underpins the BvM and efficiency results. Remark 3 states that the theorem is a generalization of Theorem 4.7 of Xie (2024) to sparse GRDPGs with indefinite signature, but 'we omit the proof and use the theorem directly.' The paper does not verify the nontrivial aspects of this generalization: the indefinite signature I_{p,q}, the sparse scaling ρ_n, and the corresponding alignment matrix W. Since the remainder bound in Theorem A.7 is exactly what makes the MESLE asymptotically equivalent to the oracle MLE, this is a load-bearing gap. The manuscript should either provide a full proof of Theorem A.7 in the stated generality, or give a precise verification that the hypotheses of the theorem in Xie (2024) are satisfied in this setting
[Theorems 3.3--3.5 and Section 5] The BvM theorem for the ESL posterior and all VI posterior results are stated only under ρ_n = 1, although the paper motivates the ESL construction with sparse GRDPGs and Theorem 3.2 allows ρ_n → 0 under Assumption 1(d). The abstract and conclusion claim asymptotic efficiency and BvM for the variational posterior without this qualification. As written, the sparse regime has no BvM or VI-efficiency guarantee. The authors should either extend the proofs to ρ_n → 0 or clearly and prominently restrict the efficiency claims to the dense case. This is not merely a presentation issue, because the finite-sample advantages of SANVI are most relevant in sparse networks.
[Appendix B.4, proof of Theorem 3.5] The proof concludes that √n(x*_i − bxi) = o_P(1) from the bound |exp(iu^T√n x*_i) − exp(iu^T√n bxi)| ≲ (log n)^{−1/2} for all ||u||_2 = 1. This does not follow as stated. In dimension d = 1 the sup over unit vectors is only over u = ±1, and a vector of the form 2πm is not detected; in higher dimensions the argument also needs a uniform bound over a continuum of directions with controlled norms, not just the unit sphere, because the Gaussian factor exp(−||u||^2/2 λ_min) degenerates for large u. The step can likely be repaired by using the supremum over all t in a ball or over u with ||u|| ≤ c, together with the growth of the Gaussian characteristic functions, but the proof as written is incomplete.

minor comments (5)

[Equation (2.1)] The displayed full log-likelihood ℓ_A(X) has log(x_i^T I_{p,q} x_j) in both Bernoulli terms; the second term should be log(1 − x_i^T I_{p,q} x_j).
[Algorithm 1, line 13] The sampled z variables are indexed z_1,...,z_s, but the sums use z_s^{(t−1)} in each term; they should use z_k^{(t−1)}.
[Section 4.3] The text refers to 'Table 4.3' when it appears to mean Table 5; please correct the cross-reference.
[Appendix B.2--B.3] The proof of Theorem 3.3 bounds the L1 difference of unnormalized densities, but the passage to normalized densities requires an explicit statement that the normalizing constants are comparable via Z_h ≍ n^{-d/2}. Lemma B.1 says 'Theorem 3.3 implies' the ratio of normalizing constants is close; that implication actually uses the stronger unnormalized bound from the proof of Theorem 3.3. Please make this explicit.
[Section 4 and Assumption 1(e)] The simulations set τ_n = min(0.001, e^{1.5}/n), but the paper does not discuss whether this choice satisfies Assumption 1(e) for the implied values of ρ_n and δ in each example. A brief verification or comment would be helpful.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the derivation chain is self-contained, with Theorem A.1 proved in the paper and the central claims benchmarked against oracle Fisher information and external estimators; the only flagged issue is an omitted proof of an imported self-cited one-step-estimator theorem, which is a completeness risk, not a circular reduction.

full rationale

The central claims do not reduce to their inputs by construction. The ESL in Eq. (2.3) is defined directly from the signature-adjusted ASE, and Theorem A.1 supplies an entrywise expansion of that embedding; although Theorem A.1 generalizes prior work, a proof is provided in Appendix A. Theorem 3.2 derives the MESLE CLT by showing the MESLE is asymptotically close to the one-step estimator and then applying Theorem A.7. Remark 3 explicitly says: 'Theorem A.7 is a generalization of Theorem 4.7 in Xie (2024)... We omit the proof and use the theorem directly.' This is a load-bearing self-citation and I flag it as a completeness/correctness risk, but it is not circularity: Theorem A.7 is a parameter-free statement with stated assumptions (Assumption 1), its conclusion is asymptotic normality of the OSE rather than the paper's target, and the paper's own contributions—ESL concentration, strong convexity, BvM for the ESL posterior, transfer to the VI posterior, and equivalence of the VI mean—do not assume their own conclusions. The efficiency statements are benchmarked against the oracle Fisher information matrix G_{0in}, and the numerical studies compare against external ASE, OSE, and MCMC posterior means, so no fitted parameter is renamed as a prediction. No equation in the paper is equal to its input by construction, and no uniqueness claim is imported to forbid alternatives. The omitted proof is a rigor gap, not a circular step; under the hard rules it does not raise the circularity score.

Assumptions & free parameters 2 free parameters · 6 assumptions · 0 invented entities

The central claim rests on standard GRDPG conditions plus entrywise eigenvector results imported from the authors' prior work. The truncation parameter tau_n is a genuine tuning choice, and the implementation choice diverges from the theoretical condition. No new entities are invented.

free parameters (2)

truncation threshold tau_n = min(0.001, e^{1.5}/n) in simulations; in theory satisfying delta^2 < tau_n/rho_n < delta/2
Tuning parameter of the extended surrogate likelihood; controls the quadratic extension of log. Its value affects approximation accuracy and appears in concentration bounds via 1/tau^2 terms.
SGD hyperparameters (alpha0, beta1, beta2, batch size s) = alpha0=0.01, beta1=0.01, beta2=0.95, s=2, max 1000 iterations
Adam settings used in the numerical study; not statistical parameters, but needed to reproduce the runtime and accuracy claims.

assumptions (6)

domain assumption Assumption 1(b): latent positions and edge probabilities bounded away from 0 and 1 by delta and 1-delta
Requires edge probabilities to stay away from the boundaries so the log-likelihood is well behaved. Introduced in Assumption 1(b).
domain assumption Assumption 1(c): eigenvalue separation of the Gram matrix (1/n) X0^T X0
Needed for the entrywise eigenvector convergence asserted in Theorem A.1. Without it, ASE can mix eigenvectors and the surrogate likelihood fails to approximate the oracle.
domain assumption Assumption 1(d): (log n)/(n rho_n) -> 0
Sparsity condition for ASE concentration; standard in RDPG and GRDPG theory.
domain assumption Assumption 1(e): delta^2 < tau_n/rho_n < delta/2
Ensures true edge probabilities lie inside the log interval [tau_n, 1-tau_n] and keeps the psi_n derivative bounds nondegenerate. The simulation choice tau = min(0.001, e^{1.5}/n) violates this for large n when rho_n = 1.
domain assumption Assumption 2: prior densities bounded, log-concave, with bounded log-density derivatives
Used in Theorem 3.3 and Lemma B.1 to control prior terms in the Bernstein-von Mises expansion.
domain assumption Theorem A.1 / Theorem A.7 from Xie (2024), including entrywise perturbation theory and one-step estimator normality
Imported from prior work by the same author. Theorem A.7's proof is omitted in this paper, so the asymptotic normality of the MESLE depends on an external, self-cited result.

how reviews work

0 comments

Cite this review

Pith. "Pith review of SANVI: A Fast Spectral-Assisted Network Variational Inference Method with an Extended Surrogate Likelihood Function." pith.science (2026). https://pith.science/paper/XVB3QA3A

@misc{pith2026250900562,
  author       = {Pith},
  title        = {Pith review of: SANVI: A Fast Spectral-Assisted Network Variational Inference Method with an Extended Surrogate Likelihood Function},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XVB3QA3A}},
  note         = {Machine review of arXiv:2509.00562}
}

read the original abstract

Bayesian inference has been broadly applied to statistical network analysis, but suffers from the expensive computational costs due to the nature of Markov chain Monte Carlo sampling algorithms. This paper proposes a novel and computationally efficient Spectral-Assisted Network Variational Inference (SANVI) method within the framework of the generalized random dot product graph. The key idea is a cleverly designed extended surrogate likelihood function that enjoys two convenient features. Firstly, it decouples the generalized inner product of latent positions in the random graph model. Secondly, it relaxes the complicated domain of the original likelihood function to the entire Euclidean space. Leveraging these features, we design a computationally efficient Gaussian variational inference algorithm via stochastic gradient descent. Furthermore, we show the asymptotic efficiency of the maximum extended surrogate likelihood estimator and the Bernstein-von Mises limit of the variational posterior distribution. Through extensive numerical studies, we demonstrate the usefulness of the proposed SANVI algorithm compared to the classical Markov chain Monte Carlo algorithm, including comparable estimation accuracy for the latent positions and less computational costs.

Figures

Figures reproduced from arXiv: 2509.00562 by the authors.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

16 extracted references · 16 canonical work pages

[1]

Abadir, K. M. and Magnus, J. R. (2005). Matrix Algebra. Econometric Exercises. Cambridge University Press. Abbe, E. (2018). Community detection and stochastic block models: Recent developments. Journal of Machine Learning Research, 18(177):1–86. Abbe, E., Bandeira, A. S., and Hall, G. (2016). Exact recovery in the stochastic block model. IEEE Transactions...

work page 2005
[8]

Cam- bridge university press. Wu, D. and Xie, F. (2025+). Statistical inference of random graphs with a surrogate likelihood function. Journal of Machine Learning Research, accepted conditioned on minor revision . Xie, F. (2023). Euclidean representation of low-rank matrices and its geometric properties. SIAM Journal on Matrix Analysis and Applications , ...

work page 2025
[60]

Fast Variational Inference of Latent Space Models for Dynamic Networks Using Bayesian P-Splines

American Mathematical Soc. 52 Loyal, J. D. (2024). Fast variational inference of latent space models for dynamic networks using bayesian p-splines. arXiv preprint:2401.09715. Lyzinski, V., Sussman, D. L., Tang, M., Athreya, A., and Priebe, C. E. (2014). Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding. Electronic Journa...

work page Pith review arXiv 2024
[88]

Bhattacharya, A., Pati, D., and Yang, Y. (2025). On the convergence of coordinate ascent variational inference. The Annals of Statistics , 53(3):929–962. Bickel, P. J. and Doksum, K. A. (2015). Mathematical statistics: Basic ideas and selected topics. volume I . CRC Press. Blei, D. M., Kucukelbir, A., and and, J. D. M. (2017). Variational inference: A rev...

work page 2025
[237]

and Levina, E

Levin, K. and Levina, E. (2025). Bootstrapping networks with latent space structure. Electronic Journal of Statistics, 19(1):745 –

work page 2025
[276]

(2012).Large networks and graph limits , volume

Lov´ asz, L. (2012).Large networks and graph limits , volume

work page 2012
[418]

and Wu, D

Xie, F. and Wu, D. (2023). An eigenvector-assisted estimation framework for signal-plus-noise matrix models. Biometrika, 111(2):661–676. Xie, F. and Xu, Y. (2020). Optimal bayesian estimation for random dot product graphs. Biometrika, 107(4):875–889. Xie, F. and Xu, Y. (2023). Efficient estimation for random dot product graphs via a one-step procedure. Jo...

work page 2023
[424]

Lei, J. (2021). Network representation using graph root distributions. The Annals of Statistics , 49(2):745 –

work page 2021

Show all 16 references

[768]

and Rinaldo, A

Lei, J. and Rinaldo, A. (2015). Consistency of spectral clustering in stochastic block models. The Annals of Statistics, 43(1):215 –

2015
[791]

D., Roosta, F., Tang, M., Mahoney, M

Levin, K. D., Roosta, F., Tang, M., Mahoney, M. W., and Priebe, C. E. (2021). Limit theorems for out- of-sample extensions of the adjacency and laplacian spectral embeddings. Journal of Machine Learning Research, 22(194):1–59. Li, T., Levina, E., and Zhu, J. (2020). Network cr...

2021
[816]

Fan, J., Fan, Y., Han, X., and Lv, J. (2022). Simple: Statistical inference on membership profiles in large networks. Journal of the Royal Statistical Society Series B: Statistical Methodology , 84(2):630–653. Girvan, M. and Newman, M. E. J. (2002). Community structure in soci...

2022
[1128]

L., Tang, M., and Priebe, C

Sussman, D. L., Tang, M., and Priebe, C. E. (2014). Consistent latent position estimation and vertex classifi- cation for random dot product graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence , 36(1):48–57. Tang, M., Athreya, A., Sussman, D. L., Lyzinski, V...

2014
[1430]

D., Margulies, D

Tang, R., Ketcha, M., Badea, A., Calabrese, E. D., Margulies, D. S., Vogelstein, J. T., Priebe, C. E., and Sussman, D. L. (2019). Connectome smoothing via low-rank approximations. IEEE Transactions on Medical Imaging, 38(6):1446–1456. van der Vaart, A. and Wellner, J. (2023). ...

2019
[1630]

and Priebe, C

Tang, M. and Priebe, C. E. (2018). Limit theorems for eigenvectors of the normalized Laplacian for random graphs. The Annals of Statistics , 46(5):2360 –

2018
[2415]

L., and Priebe, C

53 Tang, M., Sussman, D. L., and Priebe, C. E. (2013). Universally consistent vertex classification for latent positions graphs. The Annals of Statistics , 41(3):1406 –

2013
[2922]

Lyzinski, V., Tang, M., Athreya, A., Park, Y., and Priebe, C. E. (2017). Community detection and classi- fication in hierarchical stochastic blockmodels. IEEE Transactions on Network Science and Engineering , 4(1):13–26. Neil, J., Uphoff, B., Hash, C., and Storlie, C. (2013). ...

2017

Pith tools

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

[1] [1]

Abadir, K. M. and Magnus, J. R. (2005). Matrix Algebra. Econometric Exercises. Cambridge University Press. Abbe, E. (2018). Community detection and stochastic block models: Recent developments. Journal of Machine Learning Research, 18(177):1–86. Abbe, E., Bandeira, A. S., and Hall, G. (2016). Exact recovery in the stochastic block model. IEEE Transactions...

work page 2005

[2] [8]

Cam- bridge university press. Wu, D. and Xie, F. (2025+). Statistical inference of random graphs with a surrogate likelihood function. Journal of Machine Learning Research, accepted conditioned on minor revision . Xie, F. (2023). Euclidean representation of low-rank matrices and its geometric properties. SIAM Journal on Matrix Analysis and Applications , ...

work page 2025

[3] [60]

Fast Variational Inference of Latent Space Models for Dynamic Networks Using Bayesian P-Splines

American Mathematical Soc. 52 Loyal, J. D. (2024). Fast variational inference of latent space models for dynamic networks using bayesian p-splines. arXiv preprint:2401.09715. Lyzinski, V., Sussman, D. L., Tang, M., Athreya, A., and Priebe, C. E. (2014). Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding. Electronic Journa...

work page Pith review arXiv 2024

[4] [88]

Bhattacharya, A., Pati, D., and Yang, Y. (2025). On the convergence of coordinate ascent variational inference. The Annals of Statistics , 53(3):929–962. Bickel, P. J. and Doksum, K. A. (2015). Mathematical statistics: Basic ideas and selected topics. volume I . CRC Press. Blei, D. M., Kucukelbir, A., and and, J. D. M. (2017). Variational inference: A rev...

work page 2025

[5] [237]

and Levina, E

Levin, K. and Levina, E. (2025). Bootstrapping networks with latent space structure. Electronic Journal of Statistics, 19(1):745 –

work page 2025

[6] [276]

(2012).Large networks and graph limits , volume

Lov´ asz, L. (2012).Large networks and graph limits , volume

work page 2012

[7] [418]

and Wu, D

Xie, F. and Wu, D. (2023). An eigenvector-assisted estimation framework for signal-plus-noise matrix models. Biometrika, 111(2):661–676. Xie, F. and Xu, Y. (2020). Optimal bayesian estimation for random dot product graphs. Biometrika, 107(4):875–889. Xie, F. and Xu, Y. (2023). Efficient estimation for random dot product graphs via a one-step procedure. Jo...

work page 2023

[8] [424]

Lei, J. (2021). Network representation using graph root distributions. The Annals of Statistics , 49(2):745 –

work page 2021