Pith. sign in

REVIEW 3 major objections 5 minor 180 references

Dynamic Networks with Node Heterogeneity and Homophily

T0 review · 3 major / 5 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 One loss yields uniformly consistent estimates for dynamic networks

desk verdict A genuinely new dynamic network model with a clever normalized loss, but the main consistency theorems assume an oracle lambda that the practical algorithm does not use. read the letter →

arxiv 2608.07175 v1 pith:367ARAWR submitted 2026-08-07 math.ST stat.MEstat.TH

Binyan Jiang , Qiwei Yao , Xinyang Yu This is my paper · ORCID
classification math.STstat.MEstat.TH MSC 62F1262M0562M1091D30
keywords dynamicnetworksnodeheterogeneityhomophilynormalizedsquaredlosslatenttraitsuniformconsistencyhigh-dimensionalestimationnetworkformationanddissolution
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

This paper proposes a dynamic-network model in which the probability that a link appears (0→1) and the probability that it disappears (1→0) each multiply two node-specific propensity parameters by an observed-covariate term and a latent quadratic form $U^\top\Lambda U$. Because the likelihood is nonconvex and high-dimensional, the authors introduce a normalized squared loss; after the reparameterization $f_i=(1/2)\log\theta_i$, the loss becomes convex in the node and covariate parameters for a fixed latent matrix, and its latent-matrix update is a closed-form singular-value soft-thresholding step. They prove that a two-step algorithm based on this loss gives uniformly consistent estimates as $np\to\infty$: the $\ell_\infty$ errors of $\hat f$ and $\hat\beta$ and the normalized Frobenius error of $\hat H$ are all $O(D_n)+O(1/p)$ with high probability under conditions (C1)-(C6). If correct, this is the first estimator for dynamic networks that jointly handles node heterogeneity and both observed and latent homophily with theoretical support, and it separates link formation from link dissolution.

What carries the argument

The engine is the normalized squared loss (3.7), written with the transformation $f_i=\tfrac12\log\theta_i$ and $D_f=\operatorname{diag}(e^{f_i})$ as $\frac{1}{2p}\|D_f^{-1}\hat A D_f^{-1}-D_f Z_\beta D_f-D_f H D_f\|_F^2$. For a fixed latent matrix $H$, the loss is convex in $(f,\beta)$ (Proposition 2), so the first step is a gradient descent on a convex problem; for fixed $(f,\beta)$, the minimizer over $H$ with a nuclear-norm penalty is the singular-value soft-thresholding operator (3.9), a closed-form spectral shrinkage. Alternating these two steps yields estimates of the node propensities $\theta,\eta$, the covariate effects $\beta,\nu$, and the latent homophily matrices $H_1,H_2$ without MCMC. The theory builds on uniform deviation bounds previously derived for autoregressive dynamic networks to control the $\ell_\infty$ error of the high-dimensional node parameters.

What would settle it

Simulate the Section 5.1 designs with known ground truth, compute the oracle $\lambda=\|\tilde M-M\|_2/p$ for a regime where $D_n\to 0$ slowly, and compare it with the heuristic $\lambda=\sqrt{\log(np)/(np)}$; if the two differ by more than a constant factor and the two-step algorithm run with the heuristic $\lambda$ fails to shrink $\max\{\|\hat f-f\|_\infty,\|\hat\beta-\beta\|_\infty,\|\hat H-H_1\|_F/p\}$ at the claimed $O(D_n)$ rate, the practical version of the claim is refuted.

Watch

Extended reading notes

Core claim

The central claim is that, under model (2.1), the two-step estimator obtained from the normalized squared loss satisfies, with probability at least $1-(np)^{-c}$, $\max\{\|\hat f-f\|_\infty,\|\hat\beta-\beta\|_\infty,\|H_1-\hat H\|_F/p\}\lesssim D_n+O(1/p)$, where $D_n=\log(np)e_n/p+\sqrt{\log(np)/p}\,\sigma_n+\|\Delta_n\|_1/p\to 0$, provided conditions (C1)-(C6) hold and the tuning parameter $\lambda$ is set at an oracle level. The theorem covers the two-step estimator and, under suitable initialization, further local iterations; the edge-dependent corollaries relax the independence assumption, requiring only $\|\hat A-A\|_F=o(p)$ and $\|\hat A-A\|_1=o(p)$. As Remark 3 notes, consistency can hold even when the first-stage estimates $\hat A$ are not individually consistent, provided their average bias $\|\Delta_n\|_1/p$ vanishes.

Load-bearing premise

The consistency theorems require the penalty $\lambda$ to be chosen at an oracle value that depends on the unknown true transition probabilities, whereas the simulations use the heuristic $\lambda=\sqrt{\log(np)/(np)}$, and no proof shows that this practical choice satisfies the oracle condition.

Editorial extensions

If this is right

  • Link formation and dissolution become separately estimable, so the model can attribute network change to edge birth versus edge death and produces mechanism-specific latent embeddings ($\hat H_1$ for formation, $\hat H_2$ for dissolution).
  • The algorithm's cost is essentially a few convex problems plus one spectral soft-thresholding step per iteration; the loss stabilizes after one or two local updates, so the method scales to graphs with thousands of nodes.
  • Because the fitted probabilities fall in $[0,1]$ with high probability (Theorem 3), the model can be used for forecasting future adjacency matrices with a controlled error bound.
  • The edge-dependent corollaries show that uniform consistency survives without independence of the initial estimators, as long as the overall approximation errors $\|\hat A-A\|_F/p$ and $\|\hat A-A\|_1/p$ vanish.
  • On the high-school contact data, spectral clustering of the estimated latent homophily matrices recovers the nine true classes exactly even after observed covariates are included, indicating that observed homophily does not absorb all class structure in the temporal dynamics.

Reading between the lines

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

  • The practical tuning choice $\lambda=\sqrt{\log(np)/(np)}$ is not covered by the oracle-level theory; a data-driven calibration of $\lambda$ (for instance by eigenvalue-gap or predictive cross-validation) would be needed to close the gap between the implemented and the proven procedure.
  • The same normalized squared loss should transfer to weighted, directed, and multiplex dynamic networks, because the loss is a sum of per-dyad squared residuals; testing the convergence rates on such data would be a direct extension.
  • The rate $D_n$ is dominated by the first-stage transition-probability estimator, so improving $\hat A$ and $\hat B$ (e.g., by smoothing across time or borrowing strength across dyads) should improve the final estimators without changing the second-stage loss.
  • The conditional-community reading of $\hat H$ suggests a simulation-based test: generate networks with known latent traits and varying observed-homophily strength, then check whether spectral clustering of $\hat H$ matches the planted latent labels better than clustering on the observed covariates alone.
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.

Referee Report

3 major / 5 minor

Summary. The paper proposes a dynamic network model, Eq. (2.1), in which the probabilities of edge formation and dissolution depend on node-specific heterogeneity parameters (θ, η), observed dyadic covariates with coefficients (β, ν), and latent homophily components (U, Λ). Estimation is based on a newly introduced normalized squared loss with a nuclear-norm penalty, which yields a biconvex optimization problem solved by alternating updates. The main theoretical results (Theorems 1-3) claim uniform consistency, at rate D_n, for two-step estimators of f, β, and the latent homophily matrix H1 under Conditions (C1)-(C6). The paper also reports simulation studies and applications to citation, co-authorship, and high-school contact networks.

Significance. If the theoretical results hold, this appears to be the first dynamic network model that jointly accommodates node heterogeneity, observed homophily, and latent homophily with uniform consistency guarantees for high-dimensional node-specific parameters. The normalized squared loss and the resulting biconvex formulation are methodologically interesting and computationally attractive, and the paper provides detailed proofs and a reasonably extensive numerical study. The main caveat is that the proven guarantees apply to an oracle-tuned version of the estimator, not to the procedure actually implemented with a heuristic tuning parameter.

major comments (3)
  1. [Section 4.1 (Theorems 2 and 3); Section 5.1] The consistency theorems rely on an oracle choice of the tuning parameter λ. Theorem 2 sets λ = ||M̃−M||_2/p, where M̃ and M are defined using the true transition matrix A and the true f, β; Theorem 3 requires λ ≍ D_n, with D_n = log(np)e_n/p + sqrt(log(np)/p)σ_n + ||Δ_n||_1/p, all of which are unknown in practice. In contrast, the simulations in Section 5.1 use λ = sqrt(log(np)/(np)), and no proof or numerical verification is provided that this heuristic is of the same order as D_n. Consequently, the uniform consistency results do not directly apply to the estimator actually computed. The authors should either propose a fully data-dependent λ with a proven rate matching D_n, or prove that the heuristic λ satisfies λ ≍ D_n under Conditions (C1)-(C6).
  2. [Section 3.2 Algorithm; Section 4.1] The theoretical analysis covers only the two-step estimator obtained from one execution of Step 1 followed by one execution of Step 2, whereas the algorithm in Section 3.2 iterates Steps 1-2 until the successive values of f̃ and β̃ are highly correlated. The Introduction states that the paper derives 'sufficient conditions for the consistency of the estimator obtained with further local iterations', but no theorem in Section 4 or the Appendix establishes consistency for the output of this iterative loop. Since the numerical studies in Section 5.1 report results from the actual algorithm (terminated after at most two updates), the gap between the proven guarantees and the described method should be closed, or the claims should be narrowed to the two-step version.
  3. [Section 3.2 Step 4; Theorem 3] The final estimators in Step 4 are obtained by rescaling: β̂ = β̃/||β̃||_2, f̂ = f̃ + log(||β̃||_2)/4, and Ĥ = H̃/||β̃||_2. Theorem 3 asserts bounds for these normalized estimators, but the proof in Appendix A.5 does not explain how the rescaling affects the error rates. Since ||β̃−β||_2 = O(D_n) and ||β||_2 = 1, a short argument should suffice, but it is not given, so the stated conclusion does not formally follow from the existing proofs for the unnormalized quantities.
minor comments (5)
  1. [Remark 3] There is a duplicated phrase: 'how this rate how this rate is refined' should read 'how this rate is refined'.
  2. [Equation (2.1)] In the second line of (2.1), 'U^τ_{i,2}' should presumably be 'U^T_{i,2}'.
  3. [Section 5.2.1] The sentence 'we divide authors into high and low groups separately based on θ̂i and θ̂i' should read 'based on θ̂i and η̂i'.
  4. [Theorem 2] The matrices M̃ and M are defined inline in a dense way; a separate display with explicit entries would make the oracle nature of λ much clearer.
  5. [Appendix A.2] There is a typo in 'a big enoiugh positive constant' — 'enoiugh' should be 'enough'.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the estimation guarantees do not reduce to the model inputs or to a fitted prediction.

full rationale

The paper's derivation chain is not circular. The model (2.1) is a parametric specification; the normalized squared loss (3.5)/(3.7) is a new objective function whose Hessian properties are proved in Propositions 1-2; the estimators (f-hat, beta-hat, H-hat) are defined by minimizing that loss, not by inverting the target quantities. The consistency bounds in Theorems 1-3 are derived in the appendix from conditions (C1)-(C6), with errors measured against the initial transition-probability estimator A-hat (3.3). No parameter is fitted to a subset of data and then relabeled as a prediction: A-hat is an initial input, and the final error bounds are stated in terms of its deviation D_n from the true A. The proof of Theorem 1 does import a uniform deviation bound from Jiang et al. (2025, Theorem 4.1), a published external theorem by overlapping authors; under the hard rules this is real evidence (externally falsifiable, not a restatement of the present result), so it does not constitute circularity. The oracle specification of lambda in Theorem 2 (lambda = ||M-tilde - M||_2/p) and Theorem 3 (lambda asymptotically D_n) is a practical limitation because the implemented lambda = sqrt(log(np)/(np)) is not proved to satisfy the oracle condition; however this is a gap between theory and algorithm, not a circular reduction, since the oracle choice is not defined in terms of the estimator whose consistency is claimed.

Assumptions & free parameters 3 free parameters · 8 assumptions · 1 invented entities

The model itself contributes a new combination of node-specific parameters, observed covariate homophily, and latent low-rank structure. The theory leans on prior published technical results from the same research group, but those are external theorems rather than restatements of the target claim. The main practical free parameters are the regularization lambda, the stopping threshold pi, and the latent dimensions, none of which has a fully data-driven, theory-backed selection procedure.

free parameters (3)
  • lambda (regularization), practical value = sqrt(log(np)/(np)) in simulations
    Controls rank of latent homophily estimator; theory requires oracle lambda depending on unknown true matrices; practical choice is heuristic.
  • pi (stopping threshold) = not specified numerically
    Algorithm Step 3 stops when successive f and beta sample correlations exceed 1-pi; value is user-chosen and not addressed by theory.
  • Latent dimensions d1, d2 = chosen via eigen-ratio in high school analysis; fixed in simulations
    The rank of H1 and H2 is assumed known in Theorems 1-3; in practice it is selected by eigen-ratio or clustering criteria.
assumptions (8)
  • domain assumption Edges at time t are independent conditional on the previous network, and the process is first-order Markov.
    The transition probabilities define a Bernoulli process per dyad; the plug-in estimators (3.3) and the theory rely on this. Corollary 1 relaxes independence for the error analysis of f and beta.
  • domain assumption Condition (C3): the initial transition-probability estimates A_hat_ij are independent and D_n = log(np) e_n/p + sqrt(log(np)/p) sigma_n + ||Delta_n||_1/p goes to 0.
    Quantifies the quality of the first-stage estimator and enters the rate in Theorem 1; the paper cites Jiang et al. (2023) to argue the estimators in (3.3) satisfy it.
  • domain assumption Condition (C5): H1 is mu-incoherent, with ||U_H1||_{2,infinity} <= sqrt(mu d1/p).
    Required for uniform consistency of node-specific parameters; rules out spiky latent homophily matrices.
  • domain assumption Condition (C6): projected row-noise bounds for Z_beta and Delta_n onto the singular vectors of H1.
    Ensures covariate effects and bias delocalize over nodes; needed for Proposition 3 and the initial-point selection.
  • standard math Uniform deviation bound Theorem 4.1 of Jiang et al. (2025).
    Used in the proof of Theorem 1 to bound the empirical process term L1; is a published external result, though authored in part by the present authors.
  • standard math Davis-Kahan theorem and Lemma 6 of Mei et al. (2012).
    Used in Lemma 1 and Theorem 2 for eigenvector perturbation and nuclear norm thresholding bounds.
  • ad hoc to paper The model parameters reside in a feasible set so A_ij and B_ij are in (0,1), but estimation uses unconstrained optimization.
    The paper justifies this via Theorem 3, stating estimated probabilities fall in [0,1] with high probability; this is a modeling convenience rather than an established assumption.
  • domain assumption The latent homophily matrix H1 has rank d1 = O(1) and an eigen-gap that dominates the error terms.
    Theorem 2's bounds scale with 1/lambda_{d1}(H1); if the latent signal is weak, the recovery bound blows up.
invented entities (1)
  • Low-rank latent homophily factor (U_i1, U_i2, Lambda1, Lambda2; equivalently H1, H2)
    purpose: Captures homophily from unobserved traits in edge formation and dissolution probabilities, as a quadratic form in latent trait vectors (eq. 2.1).
    The components are not observable; identification is up to orthogonal rotation, and the paper's real-data validation (class recovery in the high school network) is in-sample.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Dynamic Networks with Node Heterogeneity and Homophily." pith.science (2026). https://pith.science/paper/367ARAWR

@misc{pith2026260807175,
  author       = {Pith},
  title        = {Pith review of: Dynamic Networks with Node Heterogeneity and Homophily},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/367ARAWR}},
  note         = {Machine review of arXiv:2608.07175}
}
read the original abstract

The goal of this paper is to model node heterogeneity and link homophily for dynamic networks. The proposed framework brings new insights on how networks evolve over time. It also provides more sophisticated tools for the prediction of future networks with statistical guarantees. The new model accounts for the link homophily associated with both observed traits and latent traits. The joint modeling of node heterogeneity and both observed and latent homophily effects also poses the significant challenge in statistical inference, resulted from the large number of confounding parameters in the model. To overcome this, we propose a novel normalized squared loss, paving the way for efficient and stable estimation of parameters in a high-dimensional setting. We provide a rigorous theoretical analysis of the estimation method, and demonstrate its effectiveness through extensive simulations and the illustration with some real-world network data.

Figures

Figures reproduced from arXiv: 2608.07175 by the authors.

Figure 2
Figure 2. The first two coordinates of the estimated latent homophily embedding vectors [PITH_FULL_IMAGE:figures/full_fig_p017_2.png] view at source ↗
Figure 3
Figure 3. The first two coordinates of the estimated latent homophily embedding vectors [PITH_FULL_IMAGE:figures/full_fig_p018_3.png] view at source ↗
Figure 4
Figure 4. Densities of the estimated edge-formation propensity parameters [PITH_FULL_IMAGE:figures/full_fig_p018_4.png] view at source ↗
Figures from the paper (1 more)
Figure 5
Figure 5. Figure 5: Spectral embeddings of Ĥ1 and Ĥ2 for the high school hourly contact networks [PITH_FULL_IMAGE:figures/full_fig_p020_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

180 extracted references · 64 canonical work pages

  1. [1]

    PLoS ONE , volume =

    Contact Patterns in a High School: A Comparison between Data Collected Using Wearable Sensors, Contact Diaries and Friendship Surveys , author =. PLoS ONE , volume =. 2015 , doi =

    2015

  2. [2]

    Proceedings of the national academy of sciences , volume=

    The structure of scientific collaboration networks , author=. Proceedings of the national academy of sciences , volume=. 2001 , publisher=

    2001

  3. [3]

    Physica A: Statistical mechanics and its applications , volume=

    Evolution of the social network of scientific collaborations , author=. Physica A: Statistical mechanics and its applications , volume=. 2002 , publisher=

    2002

  4. [4]

    Journal of Machine Learning Research , volume=

    Statistical inference on random dot product graphs: a survey , author=. Journal of Machine Learning Research , volume=

  5. [5]

    Annals of statistics , volume=

    Entrywise eigenvector analysis of random matrices with low expected rank , author=. Annals of statistics , volume=

  6. [6]

    The Annals of Statistics , volume=

    Analysis of singular subspaces under random perturbations , author=. The Annals of Statistics , volume=. 2026 , publisher=

    2026

  7. [7]

    The Annals of Statistics , volume=

    A two-way heterogeneity model for dynamic networks , author=. The Annals of Statistics , volume=. 2025 , publisher=

    2025

  8. [8]

    Proceedings of the international AAAI conference on web and social media , volume=

    Deception detection in group video conversations using dynamic interaction networks , author=. Proceedings of the international AAAI conference on web and social media , volume=

Show all 180 references
  1. [9]

    IJCAI 2019 , year=

    Predicting the Visual Focus of Attention in Multi-Person Discussion Videos , author=. IJCAI 2019 , year=

    2019

  2. [10]

    SIAM Journal on Optimization , volume=

    A unified convergence analysis of block successive minimization methods for nonsmooth optimization , author=. SIAM Journal on Optimization , volume=. 2013 , publisher=

    2013

  3. [11]

    arXiv preprint arXiv:2203.16688 , year=

    Eigenvector-Assisted Statistical Inference for Signal-Plus-Noise Matrix Models , author=. arXiv preprint arXiv:2203.16688 , year=

    arXiv

  4. [12]

    Bernoulli , volume=

    Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals , author=. Bernoulli , volume=. 2024 , publisher=

    2024

  5. [13]

    Biometrika , volume=

    An eigenvector-assisted estimation framework for signal-plus-noise matrix models , author=. Biometrika , volume=. 2024 , publisher=

    2024

  6. [14]

    International Workshop on Algorithms and Models for the Web-Graph , pages=

    Random dot product graph models for social networks , author=. International Workshop on Algorithms and Models for the Web-Graph , pages=. 2007 , organization=

    2007

  7. [15]

    Journal of the American Statistical Association , volume=

    Efficient estimation for random dot product graphs via a one-step procedure , author=. Journal of the American Statistical Association , volume=. 2023 , publisher=

    2023

  8. [16]

    IEEE Transactions on Signal Processing , volume=

    Nonconvex optimization meets low-rank matrix factorization: An overview , author=. IEEE Transactions on Signal Processing , volume=. 2019 , publisher=

    2019

  9. [17]

    IEEE Transactions on Information Theory , volume=

    Incoherence-optimal matrix completion , author=. IEEE Transactions on Information Theory , volume=. 2015 , publisher=

    2015

  10. [18]

    Journal of the ACM (JACM) , volume=

    Robust principal component analysis? , author=. Journal of the ACM (JACM) , volume=. 2011 , publisher=

    2011

  11. [19]

    Communications of the ACM , volume=

    Exact matrix completion via convex optimization , author=. Communications of the ACM , volume=. 2012 , publisher=

    2012

  12. [20]

    Annals of statistics , volume=

    Bridging convex and nonconvex optimization in robust PCA: Noise, outliers, and missing data , author=. Annals of statistics , volume=

  13. [21]

    SIAM journal on optimization , volume=

    Noisy matrix completion: Understanding statistical guarantees for convex relaxation via nonconvex optimization , author=. SIAM journal on optimization , volume=. 2020 , publisher=

    2020

  14. [22]

    The Annals of Statistics , pages=

    MINIMAX RISK OF MATRIX DENOISING BY SINGULAR VALUE THRESHOLDING , author=. The Annals of Statistics , pages=. 2014 , publisher=

    2014

  15. [23]

    Journal of the American Statistical Association , volume=

    Covariate regularized community detection in sparse graphs , author=. Journal of the American Statistical Association , volume=. 2021 , publisher=

    2021

  16. [24]

    Journal of the Royal Statistical Society Series B, in press , year=

    Autoregressive Networks with Dependent Edges , author=. Journal of the Royal Statistical Society Series B, in press , year=

  17. [25]

    Biometrika , pages=

    Network-adjusted covariates for community detection , author=. Biometrika , pages=. 2024 , publisher=

    2024

  18. [26]

    Journal of Business & Economic Statistics , volume=

    Co-citation and Co-authorship Networks of Statisticians , author=. Journal of Business & Economic Statistics , volume=. 2022 , publisher=

    2022

  19. [27]

    arXiv preprint arXiv:2312.06605 , year=

    Statistical Inference on Latent Space Models for Network Data , author=. arXiv preprint arXiv:2312.06605 , year=

    arXiv

  20. [28]

    Biometrika , volume=

    A useful variant of the Davis--Kahan theorem for statisticians , author=. Biometrika , volume=. 2015 , publisher=

    2015

  21. [29]

    Advances in Neural Information Processing Systems (NIPS) , pages=

    Encoding low-rank and sparse structures simultaneously in multi-task learning , author=. Advances in Neural Information Processing Systems (NIPS) , pages=. 2012 , publisher=

    2012

  22. [30]

    Journal of Machine Learning Research , year=

    Two-mode networks: inference with as many parameters as actors and differential privacy , author=. Journal of Machine Learning Research , year=

  23. [31]

    , title =

    Hoff, P. , title =. Advances in Neural Information Processing Systems , year =

  24. [32]

    Latent space approaches to social network analysis , author=. J. Amer. Statist. Assoc. , year=

  25. [33]

    BIRDS OF A FEATHER: Homophily in Social Networks , author=. Annu. Rev. Sociol. , year=

  26. [34]

    , title =

    Graham, B.S. , title =. NBER Working Paper 22186 , year =

  27. [35]

    arXiv preprint arXiv:1104.4513 , year=

    Tail bounds for all eigenvalues of McP sum of random matrices , author=. arXiv preprint arXiv:1104.4513 , year=

    arXiv

  28. [36]

    The Annals of Statistics , volume=

    Pseudo-likelihood methods for community detection in large sparse networks , author=. The Annals of Statistics , volume=. 2013 , publisher=

    2013

  29. [37]

    The Journal of Machine Learning Research , volume=

    Community detection and stochastic block models: recent developments , author=. The Journal of Machine Learning Research , volume=. 2017 , publisher=

    2017

  30. [38]

    Frontiers in genetics , volume=

    Graph neural networks and their current applications in bioinformatics , author=. Frontiers in genetics , volume=. 2021 , publisher=

    2021

  31. [39]

    Weak convergence and empirical processes , pages=

    Weak convergence , author=. Weak convergence and empirical processes , pages=. 1996 , publisher=

    1996

  32. [40]

    Stochastic Models, Statistics and Their Applications , pages=

    Changepoint Inference for Erd\"os-R\'enyi Random Graphs , author=. Stochastic Models, Statistics and Their Applications , pages=. 2015 , publisher=

    2015

  33. [41]

    Journal of the american Statistical association , volume=

    Markov graphs , author=. Journal of the american Statistical association , volume=. 1986 , publisher=

    1986

  34. [42]

    2003 , publisher=

    Fan, Jianqing and Yao, Qiwei , title=. 2003 , publisher=

    2003

  35. [43]

    Journal of Econometrics , year=

    Factor models for matrix-valued high-dimensional time series , author=. Journal of Econometrics , year=

  36. [44]

    Under preparation , year=

    Modelling Matrix Time Series via a Tensor CP-Decomposition , author=. Under preparation , year=

  37. [45]

    IEEE Transactions on Network Science and Engineering , year=

    Change Point Detection in Dynamic Networks based on Community Identification , author=. IEEE Transactions on Network Science and Engineering , year=

  38. [46]

    arXiv preprint arXiv:1603.03221 , year=

    Modelling, detrending and decorrelation of network time series , author=. arXiv preprint arXiv:1603.03221 , year=

    arXiv

  39. [47]

    arXiv preprint arXiv:1908.01823 , year=

    Change-point detection in dynamic networks via graphon estimation , author=. arXiv preprint arXiv:1908.01823 , year=

    1908 arXiv

  40. [48]

    IEEE Journal of Selected Topics in Signal Processing , volume=

    Dynamic stochastic blockmodels for time-evolving social networks , author=. IEEE Journal of Selected Topics in Signal Processing , volume=. 2014 , publisher=

    2014

  41. [49]

    Quality and Reliability Engineering International , volume=

    Modeling and detecting change in temporal networks via the degree corrected stochastic block model , author=. Quality and Reliability Engineering International , volume=. 2019 , publisher=

    2019

  42. [50]

    Proceedings of XLIII Italian Statist

    Statistical methods for network dynamics , author=. Proceedings of XLIII Italian Statist. Soc. Meeting , pages=

  43. [51]

    Journal of the Royal Statistical Society,

    Statistical clustering of temporal networks through a dynamic stochastic block model , author=. Journal of the Royal Statistical Society,

  44. [52]

    Journal of the American Statistical Association , number=

    Modeling network populations via graph distances , author=. Journal of the American Statistical Association , number=. 2020 , publisher=

    2020

  45. [53]

    Journal of the Royal Statistical Society,

    A separable model for dynamic networks , author=. Journal of the Royal Statistical Society,. 2014 , publisher=

    2014

  46. [54]

    arXiv preprint arXiv:1712.08586 , year=

    Dynamic Networks with Multi-scale Temporal Structure , author=. arXiv preprint arXiv:1712.08586 , year=

    arXiv

  47. [55]

    Proceedings of the 26th Annual International Conference on Machine Learning , pages=

    Dynamic mixed membership blockmodel for evolving networks , author=. Proceedings of the 26th Annual International Conference on Machine Learning , pages=

  48. [56]

    The Annals of Applied Statistics , volume=

    Tracking network dynamics: A survey of distances and similarity metrics , author=. The Annals of Applied Statistics , volume=

  49. [57]

    The Annals of Applied Probability , volume=

    Random graphs with a given degree sequence , author=. The Annals of Applied Probability , volume=. 2011 , publisher=

    2011

  50. [58]

    arXiv preprint arXiv:2112.10151 , year=

    Edge differentially private estimation in the beta -model via jittering and method of moments , author=. arXiv preprint arXiv:2112.10151 , year=

    arXiv

  51. [59]

    Journal of the American Statistical Association , number=

    Estimation of subgraph densities in noisy networks , author=. Journal of the American Statistical Association , number=. 2020 , publisher=

    2020

  52. [60]

    Biometrika , volume=

    Discussion of ``Network cross-validation by edge sampling'' , author=. Biometrika , volume=. 2020 , publisher=

    2020

  53. [61]

    Journal of Machine Learning Research , volume=

    Change point estimation in a dynamic stochastic block model , author=. Journal of Machine Learning Research , volume=

  54. [62]

    Proceedings of the National Academy of Sciences , volume=

    A nonparametric view of network models and Newman--Girvan and other modularities , author=. Proceedings of the National Academy of Sciences , volume=. 2009 , publisher=

    2009

  55. [63]

    Nature Reviews Methods Primers , volume=

    Network analysis of multivariate data in psychological science , author=. Nature Reviews Methods Primers , volume=. 2021 , publisher=

    2021

  56. [64]

    ACM Computing Surveys (CSUR) , volume=

    Evolutionary network analysis: A survey , author=. ACM Computing Surveys (CSUR) , volume=. 2014 , publisher=

    2014

  57. [65]

    2011 , publisher=

    Probability inequalities , author=. 2011 , publisher=

    2011

  58. [66]

    Journal of the American Statistical Association , volume=

    Probability inequalities for the sum of independent random variables , author=. Journal of the American Statistical Association , volume=. 1962 , publisher=

    1962

  59. [67]

    The Annals of Statistics , volume=

    Spectral clustering and the high-dimensional stochastic blockmodel , author=. The Annals of Statistics , volume=. 2011 , publisher=

    2011

  60. [68]

    The Annals of Statistics , volume=

    Consistency of spectral clustering in stochastic block models , author=. The Annals of Statistics , volume=. 2015 , publisher=

    2015

  61. [69]

    2019 , publisher=

    Probability: theory and examples , author=. 2019 , publisher=

    2019

  62. [70]

    2007 , publisher=

    Introduction to strong mixing conditions , author=. 2007 , publisher=

    2007

  63. [71]

    High dimensional probability V: the Luminy volume , pages=

    Bernstein inequality and moderate deviations under strong mixing conditions , author=. High dimensional probability V: the Luminy volume , pages=. 2009 , publisher=

    2009

  64. [72]

    Random Structures & Algorithms

    McKay, Brendan D and Wormald, Nicholas C , journal="Random Structures & Algorithms", volume=. The degree sequence of a random graph. I. The models. 1997 , publisher=

    1997

  65. [73]

    The Annals of Statistics , volume=

    Detection thresholds for the beta -model on sparse graphs , author=. The Annals of Statistics , volume=. 2018 , publisher=

    2018

  66. [74]

    The Annals of Statistics , volume=

    Maximum lilkelihood estimation in the beta -model , author=. The Annals of Statistics , volume=. 2013 , publisher=

    2013

  67. [75]

    Statistical Science , volume=

    Exponential-family models of random graphs: inference in finite, super and infinite population scenarios , author=. Statistical Science , volume=. 2020 , publisher=

    2020

  68. [76]

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

    A block model for node popularity in networks with community structure , author=. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=. 2018 , publisher=

    2018

  69. [77]

    Proceedings of the National Academy of Sciences , volume=

    A likelihood approach to analysis of network data , author=. Proceedings of the National Academy of Sciences , volume=. 2006 , publisher=

    2006

  70. [78]

    Proceedings of the National Academy of Sciences , volume=

    Co-clustering directed graphs to discover asymmetries and directional communities , author=. Proceedings of the National Academy of Sciences , volume=. 2016 , publisher=

    2016

  71. [79]

    Handbook of graphs and networks , volume=

    Random graphs as models of networks , author=. Handbook of graphs and networks , volume=. 2003 , publisher=

    2003

  72. [80]

    Probability theory I. 4th ed. , author=. 1977 , publisher=

    1977

  73. [81]

    The Annals of Statistics , pages =

    Asymptotics in directed exponential random graph models with an increasing bi-degree sequence , author =. The Annals of Statistics , pages =. 2016

    2016

  74. [82]

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

    Analysis of networks via the sparse -model , author=. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , year=

  75. [83]

    2015 , journal=

    Yan, Ting and Leng, Chenlei and Zhu, Ji , title =. 2015 , journal=

    2015

  76. [84]

    1993 , publisher=

    Realand Functional Analysis , author=. 1993 , publisher=

    1993

  77. [85]

    Journal of Computational and Graphical Statistics , volume=

    A brief history of statistical models for network analysis and open challenges , author=. Journal of Computational and Graphical Statistics , volume=. 2012 , publisher=

    2012

  78. [86]

    Foundations and Trends

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

    2010

  79. [87]

    Econometrica , volume=

    An econometric model of network formation with degree heterogeneity , author=. Econometrica , volume=. 2017 , publisher=

    2017

  80. [88]

    2020 , publisher=

    The Econometric Analysis of Network Data , author=. 2020 , publisher=

    2020

  81. [89]

    arXiv preprint arXiv:2105.12615 , year=

    Consistent Spectral Clustering of Network Block Models under Local Differential Privacy , author=. arXiv preprint arXiv:2105.12615 , year=

    arXiv

  82. [90]

    The Annals of Statistics , volume=

    Community detection on mixture multilayer networks via regularized tensor decomposition , author=. The Annals of Statistics , volume=. 2021 , publisher=

    2021

  83. [91]

    The Annals of Statistics , volume=

    Inference using noisy degrees: Differentially private beta -model and synthetic graphs , author=. The Annals of Statistics , volume=. 2016 , publisher=

    2016

  84. [92]

    Physica A: Statistical Mechanics and its Applications , volume=

    Link prediction techniques, applications, and performance: A survey , author=. Physica A: Statistical Mechanics and its Applications , volume=. 2020 , publisher=

    2020

  85. [93]

    Biometrika , volume=

    Consistent community detection in multi-layer network data , author=. Biometrika , volume=. 2020 , publisher=

    2020

  86. [94]

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

    Random networks, graphical models and exchangeability , author=. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=. 2018 , publisher=

    2018

  87. [95]

    Journal of the Royal Statistical Society: Series C (Applied Statistics) , volume=

    Sharing social network data: differentially private estimation of exponential family random-graph models , author=. Journal of the Royal Statistical Society: Series C (Applied Statistics) , volume=. 2017 , publisher=

    2017

  88. [96]

    Probability and measure. 3rd ed. , author=. 1995 , publisher=

    1995

  89. [97]

    and R\'enyi, A , journal=

    Erd\"os, P. and R\'enyi, A , journal=. On random graphs. I

  90. [98]

    Introduction to the non-asymptotic analysis of random matrices , DOI=

    Vershynin, Roman , year=. Introduction to the non-asymptotic analysis of random matrices , DOI=. Compressed Sensing: Theory and Applications , publisher=

  91. [99]

    Probability Inequalities for Sums of Bounded Random Variables , volume =

    Wassily Hoeffding , journal =. Probability Inequalities for Sums of Bounded Random Variables , volume =

  92. [100]

    Statistica Sinica , number =

    Asymptotics in undirected random graph models parameterized by the strengths of vertices , author =. Statistica Sinica , number =

  93. [101]

    Journal of the American Society for Information Science and Technology , volume=

    Applying weighted PageRank to author citation networks , author=. Journal of the American Society for Information Science and Technology , volume=. 2011 , publisher=

    2011

  94. [102]

    Biometrika , volume=

    A central limit theorem in the -model for undirected random graphs with a diverging number of vertices , author=. Biometrika , volume=. 2013 , publisher=

    2013

  95. [103]

    Social networks , volume=

    An introduction to exponential random graph p^* models for social networks , author=. Social networks , volume=. 2007 , publisher=

    2007

  96. [104]

    SIAM review , volume=

    The structure and function of complex networks , author=. SIAM review , volume=. 2003 , publisher=

    2003

  97. [105]

    Statistics and Its Interface , volume=

    A simulation study of the p_1 model for directed random graphs , author=. Statistics and Its Interface , volume=. 2015 , publisher=

    2015

  98. [106]

    Foundations and Trends & in Machine Learning , volume=

    Graphical models, exponential families, and variational inference , author=. Foundations and Trends & in Machine Learning , volume=. 2008 , publisher=

    2008

  99. [107]

    Social Networks , volume=

    Closure, connectivity and degree distributions: Exponential random graph p^* models for directed social networks , author=. Social Networks , volume=. 2009 , publisher=

    2009

  100. [108]

    Diachronic changes in the dominance relations of adult female Japanese monkeys of the Arashiyama B group

    Takahata, Yukio , journal=. Diachronic changes in the dominance relations of adult female Japanese monkeys of the Arashiyama B group

  101. [109]

    Journal of the American Statistical Association , volume=

    An exponential family of probability distributions for directed graphs , author=. Journal of the American Statistical Association , volume=. 1981 , publisher=

    1981

  102. [110]

    Statistica Neerlandica

    p_2 : a random effects model with covariates for directed graphs , author=. 2004 , journal="Statistica Neerlandica", pages=

    2004

  103. [111]

    2013 , journal=

    Maximum entropy distributions on graphs , author=. 2013 , journal=

    2013

  104. [112]

    2012 , journal=

    Perry,P O and Wolfe,P J , title=. 2012 , journal=

    2012

  105. [113]

    2017 , publisher=

    Topics at the Frontier of Statistics and Network Analysis , author=. 2017 , publisher=

    2017

  106. [114]

    Journal of Machine Learning Research

    Information Theoretic Measures for Clusterings Comparison: Variants, Properties, Normalization and Correction for Chance , author=. 2010 , journal="Journal of Machine Learning Research", volume=

    2010

  107. [115]

    2013 , journal="

    Estimating potential infection transmission routes in hospital wards using wearable proximity sensors , author=. 2013 , journal="

    2013

  108. [116]

    The Annals of Statistics

    Network vector autoregression , author=. 2017 , journal="The Annals of Statistics", volume=

    2017

  109. [117]

    Journal of Econometrics

    Network quantile autoregression , author=. 2019 , journal="Journal of Econometrics", volume=

    2019

  110. [118]

    Chen and Jianqing Fan and Xuening Zhu , journal=

    Elynn Y. Chen and Jianqing Fan and Xuening Zhu , journal=. Community Network Auto-Regression for High-Dimensional Time Series , year=

  111. [119]

    2020 , journal=

    Multivariate spatial autoregressive model for large scale social networks , author=. 2020 , journal=

    2020

  112. [120]

    2015 , journal=

    Contact Patterns in a High School: A Comparison between Data Collected Using Wearable Sensors, Contact Diaries and Friendship Surveys , author=. 2015 , journal=

    2015

  113. [121]

    , author=

    TRADING DATA: Evaluating our Assumptions and Coding Rules. , author=. 2009 , journal=

    2009

  114. [122]

    , author=

    Correlates of War Project Trade Data Set Codebook, Version 4.0. , author=. 2016 , publisher=

    2016

  115. [123]

    2017 , journal=

    Choosing the number of groups in a latent stochastic block model for dynamic networks , author=. 2017 , journal=

    2017

  116. [124]

    Biometrika , volume=

    A semiparametric extension of the stochastic block model for longitudinal networks , author=. Biometrika , volume=. 2018 , publisher=

    2018

  117. [125]

    Statistics and Computing , volume=

    Multiple change points detection and clustering in dynamic networks , author=. Statistics and Computing , volume=. 2018 , publisher=

    2018

  118. [126]

    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

  119. [127]

    T. A. B. Snijders , title =. Models and Methods in Social Network Analysis , publisher =. 2005 , chapter =

    2005

  120. [128]

    T. A. B. Snijders and M. A. J. van Duijin , title =. Simulating Social Phenomena , publisher =. 1997 , pages =

    1997

  121. [129]

    Journal of Multivariate Analysis , volume=

    Bivariate gamma model , author=. Journal of Multivariate Analysis , volume=. 2020 , publisher=

    2020

  122. [130]

    arXiv preprint arXiv:1203.6812 , year=

    Inverses of symmetric, diagonally dominant positive matrices and applications , author=. arXiv preprint arXiv:1203.6812 , year=

    arXiv

  123. [131]

    Journal of the American Statistical Association , pages=

    Optimal estimation of the number of network communities , author=. Journal of the American Statistical Association , pages=. 2022 , publisher=

    2022

  124. [132]

    arXiv preprint arXiv:2204.11097 , year=

    The SCORE normalization, especially for highly heterogeneous network and text data , author=. arXiv preprint arXiv:2204.11097 , year=

    arXiv

  125. [133]

    The Annals of Statistics , volume=

    Fast community detection by score , author=. The Annals of Statistics , volume=. 2015 , publisher=

    2015

  126. [134]

    Physical review E , volume=

    Stochastic blockmodels and community structure in networks , author=. Physical review E , volume=. 2011 , publisher=

    2011

  127. [135]

    Science , volume=

    Tracking individuals shows spatial fidelity is a key regulator of ant social organization , author=. Science , volume=. 2013 , publisher=

    2013

  128. [136]

    1958 , publisher=

    Toeplitz forms and their applications , author=. 1958 , publisher=

    1958

  129. [137]

    Journal of the Royal Statistical Society

    A separable model for dynamic networks , author=. Journal of the Royal Statistical Society. Series B, Statistical Methodology , volume=. 2014 , publisher=

    2014

  130. [138]

    Statistics and Computing , volume=

    Dynamic stochastic block models: parameter estimation and detection of changes in community structure , author=. Statistics and Computing , volume=. 2018 , publisher=

    2018

  131. [139]

    Models and methods in social network analysis , volume=

    Models for longitudinal network data , author=. Models and methods in social network analysis , volume=

  132. [140]

    Journal of econometrics , volume=

    Network quantile autoregression , author=. Journal of econometrics , volume=. 2019 , publisher=

    2019

  133. [141]

    The Annals of Statistics , volume=

    Network vector autoregression , author=. The Annals of Statistics , volume=. 2017 , publisher=

    2017

  134. [142]

    IEEE Transactions on Network Science and Engineering , volume=

    Change point detection in dynamic networks based on community identification , author=. IEEE Transactions on Network Science and Engineering , volume=. 2020 , publisher=

    2020

  135. [143]

    arXiv preprint arXiv:1812.03090 , year=

    Change point estimation in a dynamic stochastic block model , author=. arXiv preprint arXiv:1812.03090 , year=

    arXiv

  136. [144]

    The Annals of Statistics , volume=

    Optimal change point detection and localization in sparse dynamic networks , author=. The Annals of Statistics , volume=. 2021 , publisher=

    2021

  137. [145]

    Machine learning , volume=

    Detecting communities and their evolutions in dynamic social networks?a Bayesian approach , author=. Machine learning , volume=. 2011 , publisher=

    2011

  138. [146]

    The Annals of Statistics , volume=

    Dynamic network models and graphon estimation , author=. The Annals of Statistics , volume=. 2019 , publisher=

    2019

  139. [147]

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

    Statistical clustering of temporal networks through a dynamic stochastic block model , author=. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=. 2017 , publisher=

    2017

  140. [148]

    The Annals of Applied Probability , volume=

    Dynamic random networks and their graph limits , author=. The Annals of Applied Probability , volume=. 2016 , publisher=

    2016

  141. [149]

    The Annals of Applied Statistics , volume=

    Locally adaptive dynamic networks , author=. The Annals of Applied Statistics , volume=. 2016 , publisher=

    2016

  142. [150]

    Electronic journal of statistics , volume=

    Discrete temporal models of social networks , author=. Electronic journal of statistics , volume=. 2010 , publisher=

    2010

  143. [151]

    Proceedings of the 26th annual international conference on machine learning , pages=

    Dynamic mixed membership blockmodel for evolving networks , author=. Proceedings of the 26th annual international conference on machine learning , pages=

  144. [152]

    Journal of the American Statistical Association , volume=

    Statistical inference in a directed network model with covariates , author=. Journal of the American Statistical Association , volume=. 2019 , publisher=

    2019

  145. [153]

    Journal of Machine Learning Research , volume=

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

  146. [154]

    Theory of cryptography conference , pages=

    Calibrating noise to sensitivity in private data analysis , author=. Theory of cryptography conference , pages=. 2006 , organization=

    2006

  147. [155]

    arXiv preprint arXiv:2008.01375 , year=

    Community detection in sparse latent space models , author=. arXiv preprint arXiv:2008.01375 , year=

    2008 arXiv

  148. [156]

    arXiv preprint arXiv:2010.13604 , year=

    A sparse -model with covariates for networks , author=. arXiv preprint arXiv:2010.13604 , year=

    2010 arXiv

  149. [157]

    Journal of Computational and Graphical Statistics , volume=

    How many communities are there? , author=. Journal of Computational and Graphical Statistics , volume=. 2017 , publisher=

    2017

  150. [158]

    Journal of the American Statistical Association , pages=

    Corrected Bayesian information criterion for stochastic block models , author=. Journal of the American Statistical Association , pages=. 2019 , publisher=

    2019

  151. [159]

    Principles and Methods for Data Science , volume=

    Bayesian model selection for high-dimensional data , author=. Principles and Methods for Data Science , volume=. 2020 , publisher=

    2020

  152. [160]

    , author=

    Link prediction with spatial and temporal consistency in dynamic networks. , author=. IJCAI , pages=

  153. [161]

    Proceedings of the VLDB Endowment , volume=

    Private analysis of graph structure , author=. Proceedings of the VLDB Endowment , volume=. 2011 , publisher=

    2011

  154. [162]

    Social Networks , volume=

    Exponential random graph (p?) models for affiliation networks , author=. Social Networks , volume=. 2009 , publisher=

    2009

  155. [163]

    Manuscript , year=

    Two-mode networks: inference with as many parameters as actors and differential privacy , author=. Manuscript , year=

  156. [164]

    ACM Computing Surveys (CSUR) , volume=

    Community discovery in dynamic networks: a survey , author=. ACM Computing Surveys (CSUR) , volume=. 2018 , publisher=

    2018

  157. [165]

    Journal of Machine Learning Research , year=

    Autoregressive networks , author=. Journal of Machine Learning Research , year=

  158. [166]

    arXiv:2305.12643 , year=

    A two-way heterogeneity model for dynamic networks , author=. arXiv:2305.12643 , year=

    arXiv

  159. [167]

    Stat , pages=

    Fallacy of Data-Selective Inference in Modelling Networks , author=. Stat , pages=. 2022 , publisher=

    2022

  160. [168]

    Annals of Statistics , volume=

    Dynamic network models and graphon estimation , author=. Annals of Statistics , volume=. 2019 , publisher=

    2019

  161. [169]

    Electronic Journal of Statistics , volume=

    Discrete temporal models of social networks , author=. Electronic Journal of Statistics , volume=. 2010 , publisher=

    2010

  162. [170]

    On a modification of Chebyshev's inequality and of the error formula of Laplace , author=. Ann. Sci. Inst. Sav. Ukraine, Sect. Math , volume=

  163. [171]

    2019 , publisher=

    High-dimensional statistics: A non-asymptotic viewpoint , author=. 2019 , publisher=

    2019

  164. [172]

    2013 , publisher=

    Weak convergence and empirical processes: with applications to statistics , author=. 2013 , publisher=

    2013

  165. [173]

    Annals of Statistics , volume=

    Asymptotics in directed exponential random graph models with an increasing bi-degree sequence , author=. Annals of Statistics , volume=. 2016 , publisher=

    2016

  166. [174]

    Neural Networks , volume=

    On the derivatives of the sigmoid , author=. Neural Networks , volume=. 1993 , publisher=

    1993

  167. [175]

    Niels Henrik Abel.?Ueber die Integration der Differential-Formel dx/R, wenn R und ganze Funktionen sind.? Journal f

    Numbers, Transcendental , journal=. Niels Henrik Abel.?Ueber die Integration der Differential-Formel dx/R, wenn R und ganze Funktionen sind.? Journal f

  168. [176]

    The legacy of Alladi Ramakrishnan in the mathematical sciences , pages=

    Eulerian polynomials: from Euler?s time to the present , author=. The legacy of Alladi Ramakrishnan in the mathematical sciences , pages=. 2010 , publisher=

    2010

  169. [177]

    aequationes mathematicae , volume=

    Eulerian numbers with fractional order parameters , author=. aequationes mathematicae , volume=. 1993 , publisher=

    1993

  170. [178]

    arXiv preprint arXiv:1202.1058 , year=

    Approximating the inverse of a balanced symmetric matrix with positive elements , author=. arXiv preprint arXiv:1202.1058 , year=

    arXiv

  171. [179]

    SIAM Journal on Numerical Analysis , volume=

    Optimal error bounds for the Newton--Kantorovich theorem , author=. SIAM Journal on Numerical Analysis , volume=. 1974 , publisher=

    1974

  172. [180]

    arXiv preprint arXiv:2108.09504 , year=

    A Sparse Random Graph Model for Sparse Directed Networks , author=. arXiv preprint arXiv:2108.09504 , year=

    arXiv

Pith tools

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