pith. sign in

arxiv: 2502.11868 · v2 · submitted 2025-02-17 · 📊 stat.ME

Phylogenetic latent space models for network data

Federico Pavone , Daniele Durante , Robin J. Ryder This is my paper

Pith reviewed 2026-05-23 02:55 UTC · model grok-4.3

classification 📊 stat.ME
keywords latent space modelsnetwork dataphylogenetic treebranching Brownian motionmodular hierarchiesBayesian inferenceidentifiabilityposterior consistency
0
0 comments X

The pith

Node latent features in network models are generated by a tree-parametrized branching Brownian motion, allowing Bayesian recovery of nested modular hierarchies.

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

The paper develops a latent space model for networks in which each node's feature vector is produced by a branching Brownian motion whose branching structure follows a phylogenetic tree. This tree becomes the central inferential target and is estimated from data using Bayesian methods and priors drawn from phylogenetic literature. The resulting tree-based representation is intended to capture multiscale modular hierarchies that standard latent space models, which treat embeddings as independent, cannot recover directly. Identifiability of the model parameters and posterior consistency for the tree are established as theoretical support. The approach is applied to criminology and neuroscience networks to illustrate recovery of core hierarchical structures.

Core claim

We pursue this direction by bridging latent variable representations of network data with concepts from phylogenetic inference to design a novel latent space model that explicitly characterizes the generative process of the node feature vectors through a branching Brownian motion, with branching structure parametrized by a tree. This tree constitutes the main object of interest and is learned under a Bayesian perspective leveraging priors inherited from phylogenetic literature to infer tree-based modular hierarchies across nodes, which explain heterogeneous multiscale patterns in the network. Identifiability results are derived along with posterior consistency theory.

What carries the argument

The phylogenetic tree that parametrizes the branching structure of the Brownian motion generating the node feature vectors.

If this is right

  • The inferred tree supplies an explicit generative hierarchy that accounts for heterogeneous multiscale patterns across the network.
  • Borrowing of information occurs across node features according to their positions on the shared tree, improving estimation when nodes share deep branches.
  • The model yields identifiable parameters and posterior consistency guarantees for the tree under the stated generative assumptions.
  • Applications recover core modular structures in criminology and neuroscience networks that remain hidden to standard latent space alternatives.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same tree representation could be used to predict missing links by propagating similarity along shared branches rather than through independent embeddings.
  • Extensions to other branching processes on trees might capture different patterns of dependence without changing the overall hierarchical inference strategy.
  • The approach offers a route to hierarchical community detection that is generative rather than post-hoc clustering of embeddings.

Load-bearing premise

Node feature vectors are generated through a branching Brownian motion whose branching structure is parametrized by a tree.

What would settle it

Simulations in which the true generative process is a branching Brownian motion on a known tree but the posterior on the tree fails to concentrate around the true structure as sample size grows, or real-data fits in which the inferred tree yields no improvement in held-out edge prediction over a standard latent space model without tree structure.

Figures

Figures reproduced from arXiv: 2502.11868 by Daniele Durante, Federico Pavone, Robin J. Ryder.

Figure 1
Figure 1. Figure 1: Graphical representation of the generative process underlying the proposed phylogenetic latent space model. [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Example of samples from prior (10) with V = 10, K = 2 and M = 3. Left: phylogenetic tree structure Υ. Right: For the M = 3 networks, embedding of the V = 10 nodes in the latent space according to the as￾sociated two-dimensional latent features sampled from (10). 13 [PITH_FULL_IMAGE:figures/full_fig_p013_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Radius of the 90% credible sets centered at Υ0. This radius is computed under different tree distances and for varying settings of M = 1, 5, 10, 15, 40, 80 and V = 20, 40, 80. 15 [PITH_FULL_IMAGE:figures/full_fig_p015_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: First simulation scenario: community-type structure. From left to right: matrix of edge probabilities; three [PITH_FULL_IMAGE:figures/full_fig_p021_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Second simulation scenario: tree-type multiscale structure. From left to right: True tree [PITH_FULL_IMAGE:figures/full_fig_p022_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Example of one network in the criminology application. Left: graphical representation of the network, where [PITH_FULL_IMAGE:figures/full_fig_p025_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: DensiTree and consensus tree summarizing the posterior distribution of the tree structure in the criminal net￾works application. In the consensus tree, branch colors represent the posterior support of the split rooted at the parent node, ranging from the threshold level 0.6 (white) to 1.0 (black); when no split has posterior support greater than 0.6, the tree is multifurcating. studies in Section 4. Intere… view at source ↗
Figure 8
Figure 8. Figure 8: Examples of one network in the neuroscience application. Left: graphical representation of a network, where [PITH_FULL_IMAGE:figures/full_fig_p027_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: DensiTree and consensus tree summarizing the posterior distribution of the tree structure in the brain networks application. In the consensus tree, branch colors represent the posterior support of the split rooted at the parent node, ranging from the threshold level 0.6 (white) to 1.0 (black); when no split has posterior support greater than 0.6, the tree is multifurcating. Motivated by the above discussio… view at source ↗
read the original abstract

Latent space models for network data characterize each node through a vector of latent features whose pairwise similarities define the edge probabilities among the pairs of nodes. Although this formulation has led to successful implementations, the overarching focus has been on directly inferring node embeddings through the latent features, rather than learning the generative process underlying these embeddings. This focus prevents borrowing information across the node features and limits the ability to infer higher-level architectures governing network formation. For example, routinely-studied networks often exhibit multiscale structures informing on nested modular hierarchies among nodes, which could be learned via tree-based representations of dependencies among the latent features. We pursue this direction by bridging latent variable representations of network data with concepts from phylogenetic inference to design a novel latent space model that explicitly characterizes the generative process of the node feature vectors through a branching Brownian motion, with branching structure parametrized by a tree. This tree constitutes the main object of interest and is learned under a Bayesian perspective leveraging priors inherited from phylogenetic literature to infer tree-based modular hierarchies across nodes, which explain heterogeneous multiscale patterns in the network. Identifiability results are derived along with posterior consistency theory. The inference potentials of our model are illustrated in simulations and two real-data applications from criminology and neuroscience, where our formulation learns core structures hidden to state-of-the-art alternatives.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper introduces a latent space model for networks in which node feature vectors are generated by a branching Brownian motion whose branching structure is parametrized by a tree. The tree is the central inferential target and is learned in a Bayesian framework that imports priors from the phylogenetic literature in order to recover multiscale modular hierarchies. The manuscript asserts that identifiability results and posterior consistency theory have been derived for this model and illustrates the approach on simulations together with criminology and neuroscience data sets.

Significance. If the claimed identifiability and consistency results hold under the stated generative model, the work would supply a principled route to inferring hierarchical structure in networks that standard latent-space formulations do not target. The explicit use of phylogenetic priors and the focus on the tree as the primary object of inference constitute a distinctive methodological bridge between network analysis and phylogenetic statistics, with potential applicability in domains that exhibit nested modular organization.

major comments (1)
  1. [Abstract] Abstract: the manuscript asserts that identifiability results and posterior consistency theory have been derived, yet the specific assumptions, the derivation steps, any lemmas or theorems, and the precise conditions under which these results hold are not visible in the provided text. Because these theoretical claims are load-bearing for the central contribution, their absence prevents verification of the soundness of the model.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for highlighting the need for greater visibility of the theoretical results. We address this point directly below and will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the manuscript asserts that identifiability results and posterior consistency theory have been derived, yet the specific assumptions, the derivation steps, any lemmas or theorems, and the precise conditions under which these results hold are not visible in the provided text. Because these theoretical claims are load-bearing for the central contribution, their absence prevents verification of the soundness of the model.

    Authors: We agree that the abstract states the existence of these results at a high level without enumerating assumptions or theorem statements. The full manuscript contains a dedicated theoretical development: Section 3 states the model assumptions (including the branching Brownian motion covariance structure, fixed embedding dimension, and the tree prior), Lemma 1 establishes identifiability of the tree topology and branch lengths from the observed network, and Theorem 2 proves posterior consistency under the stated prior and likelihood. The proofs appear in the supplement. To make these results immediately verifiable from the main text, we will (i) expand the abstract to reference the key conditions, (ii) insert a concise statement of the main theorem in the introduction, and (iii) move the lemma and theorem statements from the supplement into the main body where space permits. These changes will be implemented in the revision. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper proposes a new generative model in which node features arise from a branching Brownian motion whose tree structure is the primary inferential target, with identifiability and posterior consistency derived directly from that model and standard Bayesian phylogenetic priors. No equation or claim reduces by construction to a fitted parameter from the same data, no uniqueness result is imported solely via self-citation, and the central derivation chain remains independent of the target quantities. The analysis is therefore self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Only the abstract is available, so the ledger is limited to the core modeling choice stated there; no specific numerical free parameters, additional axioms, or invented entities beyond the tree itself can be enumerated.

axioms (1)
  • domain assumption Node feature vectors arise from a branching Brownian motion whose branching structure is a tree
    This generative assumption is the central premise of the model as described in the abstract.

pith-pipeline@v0.9.0 · 5756 in / 1207 out tokens · 29283 ms · 2026-05-23T02:55:10.758838+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

85 extracted references · 85 canonical work pages

  1. [1]

    , " * write output.state after.block = add.period write newline

    ENTRY address author booktitle chapter edition editor howpublished institution journal key month note number organization pages publisher school series title type volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.consts #0 'before.all := #1 'mid.sentence := #2 '...

    work page

  2. [2]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in " " * FUNCTION format....

    work page

  3. [3]

    @esa ( ) , n @biblabelnum##1 ##1

    \@ifclassloaded aguplus natbib The aguplus class already includes natbib coding, so you should not add it explicitly Type <Return> for now, but then later remove the command natbib from the document \@ifclassloaded nlinproc natbib The nlinproc class already includes natbib coding, so you should not add it explicitly Type <Return> for now, but then later r...

    work page

  4. [4]

    @stdbsttrue NAT@ctr \@lbibitem[ NAT@ctr ] \@lbibitem[#1]#2 \@ifundefined b@#2\@extra@b@citeb @num @parse #2 [ @natanchorstart #2 \@biblabel @num @natanchorend] @ifcmd#1()()\@nil #2 @lbibitem\@undefined @lbibitem\@lbibitem \@lbibitem[#1]#2 @lbibitem[#1] #2 @ @@label #2 @stdbst @stdbstfalse @stdbst @filesw \@auxout @numberstrue [2] \@ifundefined b@#1\@extra...

    work page

  5. [5]

    @open @close @open @close and [1] URL: #1 \@ifundefined chapter * \@mkboth \@ifundefined NAT@sectionbib * \@mkboth * \@mkboth\@gobbletwo \@ifclassloaded amsart * \@ifclassloaded amsbook * \@ifundefined bib@heading @heading NAT@ctr thebibliography [1] @ \@biblabel NAT@ctr \@bibsetup #1 NAT@ctr 0 @openbib .11em \@plus.33em \@minus.07em 4000 4000 `\.=1000 \@...

    work page

  6. [6]

    M., Blei, D., Fienberg, S., and Xing, E

    Airoldi, E. M., Blei, D., Fienberg, S., and Xing, E. (2008), Mixed membership stochastic blockmodels, Journal of Machine Learning Research, 9, 1981--2014

    work page 2008

  7. [7]

    Aldous, D. J. (2001), Stochastic models and descriptive statistics for phylogenetic trees, from Yule to today , Statistical Science, 16, 23--34

    work page 2001

  8. [8]

    (2008), A tutorial on adaptive MCMC , Statistics and Computing, 18, 343--373

    Andrieu, C., and Thoms, J. (2008), A tutorial on adaptive MCMC , Statistics and Computing, 18, 343--373

    work page 2008

  9. [9]

    E., and Vogelstein, J

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

    work page 2021

  10. [10]

    E., Tang, M., Priebe, C

    Athreya, A., Fishkind, D. E., Tang, M., Priebe, C. E., Park, Y., Vogelstein, J. T., Levin, K., Lyzinski, V., Qin, Y., and Sussman, D. L. (2018), Statistical inference on random dot product graphs: a survey, Journal of Machine Learning Research, 18, 1--92

    work page 2018

  11. [11]

    F., and Bassett, D

    Betzel, R. F., and Bassett, D. S. (2017), Multi-scale brain networks, Neuroimage, 160, 73--83

    work page 2017

  12. [12]

    (2010), The human parahippocampal region: I

    Blaizot, X., Mansilla, F., Insausti, A., Constans, J., Salinas-Alaman, A., Pro-Sistiaga, P., Mohedano-Moriano, A., and Insausti, R. (2010), The human parahippocampal region: I. Temporal pole cytoarchitectonic and MRI correlation, Cerebral Cortex, 20, 2198--2212

    work page 2010

  13. [13]

    B \"o cker, S., Canzar, S., and Klau, G. W. (2013), The generalized Robinson-Foulds metric , in Algorithms in Bioinformatics: 13th International Workshop, WABI 2013, Sophia Antipolis, France, September 2-4, 2013. Proceedings 13, Springer, pp. 156--169

    work page 2013

  14. [14]

    P., Everett, M

    Borgatti, S. P., Everett, M. G., and Shirey, P. R. (1990), LS sets, lambda sets and other cohesive subsets, Social Networks, 12, 337--357

    work page 1990

  15. [15]

    T., Cohn, H., and Holden, N

    Borgs, C., Chayes, J. T., Cohn, H., and Holden, N. (2018), Sparse exchangeable graphs and their limits via graphon processes, Journal of Machine Learning Research, 18, 1--71

    work page 2018

  16. [16]

    Bouckaert, R. R. (2010), DensiTree: Making sense of sets of phylogenetic trees , Bioinformatics, 26, 1372--1373

    work page 2010

  17. [17]

    (2022), Using social network analysis to study crime: Navigating the challenges of criminal justice records, Social Networks, 69, 235--250

    Bright, D., Brewer, R., and Morselli, C. (2022), Using social network analysis to study crime: Navigating the challenges of criminal justice records, Social Networks, 69, 235--250

    work page 2022

  18. [18]

    D., Kopp, E., Pellard, T., Ryder, R

    Buckley, C. D., Kopp, E., Pellard, T., Ryder, R. J., and Jacques, G. (2025), Contrasting modes of cultural evolution: Kra-Dai languages and weaving technologies, https://osf.io/preprints/osf/8pz67\_v1

    work page 2025

  19. [19]

    (2009), Complex brain networks: Graph theoretical analysis of structural and functional systems , Nature Reviews Neuroscience, 10, 186--198

    Bullmore, E., and Sporns, O. (2009), Complex brain networks: Graph theoretical analysis of structural and functional systems , Nature Reviews Neuroscience, 10, 186--198

    work page 2009

  20. [20]

    Bullmore, E.--- (2012), The economy of brain network organization, Nature Reviews Neuroscience, 13, 336--349

    work page 2012

  21. [21]

    (2017), Communities in criminal networks: A case study, Social Networks, 48, 116--125

    Calderoni, F., Brunetto, D., and Piccardi, C. (2017), Communities in criminal networks: A case study, Social Networks, 48, 116--125

    work page 2017

  22. [22]

    (2022), Studying organized crime networks: Data sources, boundaries and the limits of structural measures, Social Networks, 69, 149--159

    Campana, P., and Varese, F. (2022), Studying organized crime networks: Data sources, boundaries and the limits of structural measures, Social Networks, 69, 149--159

    work page 2022

  23. [23]

    Caron, F., and Fox, E. B. (2017), Sparse graphs using exchangeable random measures, Journal of the Royal Statistical Society Series B: Statistical Methodology, 79, 1295--1366

    work page 2017

  24. [24]

    (2014), How Do Mafias Organize?: Conflict and Violence in Three Mafia Organizations, European Journal of Sociology/Archives Europ \'e ennes de Sociologie , 55, 177--220

    Catino, M. (2014), How Do Mafias Organize?: Conflict and Violence in Three Mafia Organizations, European Journal of Sociology/Archives Europ \'e ennes de Sociologie , 55, 177--220

    work page 2014

  25. [25]

    Chen, M.-H., Kuo, L., and Lewis, P. O. (2014), Bayesian Phylogenetics: Methods, Algorithms, and Applications , CRC Press

    work page 2014

  26. [26]

    Clauset, A., Moore, C., and Newman, M. E. (2008), Hierarchical structure and the prediction of missing links in networks, Nature, 453, 98--101

    work page 2008

  27. [27]

    A., Divi \'a k, T., Bright, D., and Koskinen, J

    Coutinho, J. A., Divi \'a k, T., Bright, D., and Koskinen, J. (2020), Multilevel determinants of collaboration between organised criminal groups, Social Networks, 63, 56--69

    work page 2020

  28. [28]

    C., Jbabdi, S., Yan, C.-G., Vogelstein, J

    Craddock, R. C., Jbabdi, S., Yan, C.-G., Vogelstein, J. T., Castellanos, F. X., Di Martino, A., Kelly, C., Heberlein, K., Colcombe, S., and Milham, M. P. (2013), Imaging human connectomes at the macroscale, Nature Methods, 10, 524--539

    work page 2013

  29. [29]

    S., S \'e gonne, F., Fischl, B., Quinn, B

    Desikan, R. S., S \'e gonne, F., Fischl, B., Quinn, B. T., Dickerson, B. C., Blacker, D., Buckner, R. L., Dale, A. M., Maguire, R. P., Hyman, B. T. et al. (2006), An automated labeling system for subdividing the human cerebral cortex on MRI scans into gyral based regions of interest , NeuroImage, 31, 968--980

    work page 2006

  30. [30]

    (2022), Key aspects of covert networks data collection: Problems, challenges, and opportunities, Social Networks, 69, 160--169

    Divi \'a k, T. (2022), Key aspects of covert networks data collection: Problems, challenges, and opportunities, Social Networks, 69, 160--169

    work page 2022

  31. [31]

    Doob, J. L. (1949), Application of the theory of martingales, Le Calcul Des Probabilit\'es et Ses Applications , 23--27

    work page 1949

  32. [32]

    Durante, D., and Dunson, D. B. (2014), Nonparametric Bayes dynamic modelling of relational data , Biometrika, 101, 883--898

    work page 2014

  33. [33]

    B., and Vogelstein, J

    Durante, D., Dunson, D. B., and Vogelstein, J. T. (2017), Nonparametric Bayes modeling of populations of networks , Journal of the American Statistical Association, 112, 1516--1530

    work page 2017

  34. [34]

    M., Alfaro, M

    Eastman, J. M., Alfaro, M. E., Joyce, P., Hipp, A. L., and Harmon, L. J. (2011), A novel comparative method for identifying shifts in the rate of character evolution on trees, Evolution, 65, 3578--3589

    work page 2011

  35. [35]

    Z., Jo, Y., Puxeddu, M

    Esfahlani, F. Z., Jo, Y., Puxeddu, M. G., Merritt, H., Tanner, J. C., Greenwell, S., Patel, R., Faskowitz, J., and Betzel, R. F. (2021), Modularity maximization as a flexible and generic framework for brain network exploratory analysis, Neuroimage, 244, 118607

    work page 2021

  36. [36]

    L., Greenhill, S

    Evans, C. L., Greenhill, S. J., Watts, J., List, J.-M., Botero, C. A., Gray, R. D., and Kirby, K. R. (2021), The uses and abuses of tree thinking in cultural evolution, Philosophical Transactions of the Royal Society B, 376, 20200056

    work page 2021

  37. [37]

    (1981), Evolutionary trees from DNA sequences: A maximum likelihood approach , Journal of Molecular Evolution, 17, 368--376

    Felsenstein, J. (1981), Evolutionary trees from DNA sequences: A maximum likelihood approach , Journal of Molecular Evolution, 17, 368--376

    work page 1981

  38. [38]

    --- (1985), Phylogenies and the comparative method, The American Naturalist, 125, 1--15

    work page 1985

  39. [39]

    2, Sinauer Associates Sunderland, MA

    --- (2004), Inferring Phylogenies , vol. 2, Sinauer Associates Sunderland, MA

    work page 2004

  40. [40]

    K., McCormick, T

    Fosdick, B. K., McCormick, T. H., Murphy, T. B., Ng, T. L. J., and Westling, T. (2019), Multiresolution network models, Journal of Computational and Graphical Statistics, 28, 185--196

    work page 2019

  41. [41]

    Freeman, L. C. (1992), The sociological concept of "group": An empirical test of two models, American Journal of Sociology, 98, 152--166

    work page 1992

  42. [42]

    M., and Reingold, E

    Fruchterman, T. M., and Reingold, E. M. (1991), Graph drawing by force-directed placement, Software: Practice and Experience, 21, 1129--1164

    work page 1991

  43. [43]

    (2017), Fundamentals of Nonparametric Bayesian Inference, vol

    Ghosal, S., and Van der Vaart, A. (2017), Fundamentals of Nonparametric Bayesian Inference, vol. 44, Cambridge University Press

    work page 2017

  44. [44]

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

    work page 2016

  45. [45]

    (2021), Unfolding the multiscale structure of networks with dynamical Ollivier-Ricci curvature, Nature Communications, 12, 4561

    Gosztolai, A., and Arnaudon, A. (2021), Unfolding the multiscale structure of networks with dynamical Ollivier-Ricci curvature, Nature Communications, 12, 4561

    work page 2021

  46. [46]

    S., Raftery, A

    Handcock, M. S., Raftery, A. E., and Tantrum, J. M. (2007), Model-based clustering for social networks, Journal of the Royal Statistical Society: Series A (Statistics in Society), 170, 301--354

    work page 2007

  47. [47]

    Harris, T. E. (1963), The Theory of Branching Processes, vol. 6, Springer Berlin

    work page 1963

  48. [48]

    L., Wells, J., Liu, W.-M., and Tarazaga, P

    Hayden, T. L., Wells, J., Liu, W.-M., and Tarazaga, P. (1991), The cone of distance matrices, Linear Algebra and its Applications, 144, 153--169

    work page 1991

  49. [49]

    N., and Hansen, L

    Herlau, T., M rup, M., Schmidt, M. N., and Hansen, L. K. (2012), Detecting hierarchical structure in networks, in Proceedings of Cognitive Information Processing (CIP), pp. 1--6

    work page 2012

  50. [50]

    M., Huelsenbeck, J

    Hillis, D. M., Huelsenbeck, J. P., and Swofford, D. L. (1994), Hobgoblin of phylogenetics? Nature, 369, 363--364

    work page 1994

  51. [51]

    D., Raftery, A

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

    work page 2002

  52. [52]

    J., and K \"u hnert, D

    Hoffmann, K., Bouckaert, R., Greenhill, S. J., and K \"u hnert, D. (2021), Bayesian phylogenetic analysis of linguistic data using BEAST, Journal of Language Evolution, 6, 119--135

    work page 2021

  53. [53]

    Kaur, H., Rastelli, R., Friel, N., and Raftery, A. E. (2023), Latent Position Network Models, arXiv preprint arXiv:2304.02979

    work page arXiv 2023

  54. [54]

    J., Ryder, R

    Kelly, L. J., Ryder, R. J., and Clart \'e , G. (2023), Lagged couplings diagnose Markov chain Monte Carlo phylogenetic inference , The Annals of Applied Statistics, 17, 1419--1443

    work page 2023

  55. [55]

    W., Roncai, W

    Kiar, G., Bridgeford, E. W., Roncai, W. R. G., for Reliability, C., (CoRR), R., Chandrashekhar, V., Mhembere, D., Ryman, S., Zuo, X.-N., Margulies, D. S., Craddock, R. C. et al. (2017), A high-throughput pipeline identifies robust connectomes but troublesome variability, Biorxiv, 188706

    work page 2017

  56. [56]

    (2010), Hyperbolic geometry of complex networks, Physical Review E, 82, 036106

    Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., and Bogu\ n \'a , M. (2010), Hyperbolic geometry of complex networks, Physical Review E, 82, 036106

    work page 2010

  57. [57]

    N., and Handcock, M

    Krivitsky, P. N., and Handcock, M. S. (2008), Fitting position latent cluster models for social networks with latentnet, Journal of Statistical Software, 24

    work page 2008

  58. [58]

    N., Handcock, M

    Krivitsky, P. N., Handcock, M. S., Raftery, A. E., and Hoff, P. D. (2009), Representing degree distributions, clustering, and homophily in social networks with latent cluster random effects models, Social Networks, 31, 204--213

    work page 2009

  59. [59]

    K., and Felsenstein, J

    Kuhner, M. K., and Felsenstein, J. (1994), A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates. Molecular Biology and Evolution, 11, 459--468

    work page 1994

  60. [60]

    Legramanti, S., Rigon, T., Durante, D., and Dunson, D. B. (2022), Extended stochastic block models with application to criminal networks, The Annals of Applied Statistics, 16, 2369--2395

    work page 2022

  61. [61]

    Lu, C., Durante, D., and Friel, N. (2025), Zero-inflated stochastic block modeling of efficiency-security tradeoffs in weighted criminal networks, Journal of the Royal Statistical Society Series A: Statistics in Society, In Press

    work page 2025

  62. [62]

    G., and McCormick, T

    Lubold, S., Chandrasekhar, A. G., and McCormick, T. H. (2023), Identifying the latent space geometry of network models through analysis of curvature, Journal of the Royal Statistical Society Series B: Statistical Methodology, 85, 240--292

    work page 2023

  63. [63]

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

    MacDonald, P. W., Levina, E., and Zhu, J. (2022), Latent space models for multiplex networks with shared structure, Biometrika, 109, 683--706

    work page 2022

  64. [64]

    (2013), Euclidean embeddings of finite metric spaces, Discrete Mathematics, 313, 2848--2856

    Maehara, H. (2013), Euclidean embeddings of finite metric spaces, Discrete Mathematics, 313, 2848--2856

    work page 2013

  65. [65]

    R., and Moore, B

    May, M. R., and Moore, B. R. (2020), A Bayesian approach for inferring the impact of a discrete character on rates of continuous-character evolution in the presence of background-rate variation, Systematic Biology, 69, 530--544

    work page 2020

  66. [66]

    Meunier, D., Lambiotte, R., and Bullmore, E. T. (2010), Modular and hierarchically modular organization of brain networks, Frontiers in Neuroscience, 4, 200

    work page 2010

  67. [67]

    Nowicki, K., and Snijders, T. A. B. (2001), Estimation and prediction for stochastic blockstructures, Journal of the American Statistical Association, 96, 1077--1087

    work page 2001

  68. [68]

    (2007), Mafia and organised crime in Italy: the unacknowledged successes of law enforcement, West European Politics, 30, 854--880

    Paoli, L. (2007), Mafia and organised crime in Italy: the unacknowledged successes of law enforcement, West European Politics, 30, 854--880

    work page 2007

  69. [69]

    (2003), Hierarchical organization in complex networks, Physical Review E, 67, 026112

    Ravasz, E., and Barab \'a si, A.-L. (2003), Hierarchical organization in complex networks, Physical Review E, 67, 026112

    work page 2003

  70. [70]

    Ross, S. M. (2014), Introduction to Probability Models, Academic Press

    work page 2014

  71. [71]

    M., Kemp, C., Mansinghka, V., and Tenenbaum, J

    Roy, D. M., Kemp, C., Mansinghka, V., and Tenenbaum, J. (2006), Learning annotated hierarchies from relational data, Advances in Neural Information Processing Systems (NeurIPS), 19

    work page 2006

  72. [72]

    M., and Teh, Y

    Roy, D. M., and Teh, Y. (2008), The Mondrian process , Advances in Neural Information Processing Systems (NeurIPS), 21

    work page 2008

  73. [73]

    (2010), Complex network measures of brain connectivity: uses and interpretations, Neuroimage, 52, 1059--1069

    Rubinov, M., and Sporns, O. (2010), Complex network measures of brain connectivity: uses and interpretations, Neuroimage, 52, 1059--1069

    work page 2010

  74. [74]

    Ryder, R. J. (2025), Bayesian Methods in Historical Linguistics: a Workflow, Proceedings of the COMPAS 2024 conference

    work page 2025

  75. [75]

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

    work page 2017

  76. [76]

    Sarkar, P., and Moore, A. W. (2006), Dynamic social network analysis using latent space models, Advances in Neural Information Processing Systems (NeurIPS), 18, 1145

    work page 2006

  77. [77]

    Schoenberg, I. J. (1935), Remarks to Maurice Fr\'eechet's article ``Sur la d\'efinition axiomatique d'une classe d'espace distances vectoriellement applicable sur l'espace de Hilbert'' , Annals of Mathematics, 724--732

    work page 1935

  78. [78]

    --- (1937), On certain metric spaces arising from Euclidean spaces by a change of metric and their imbedding in Hilbert space , Annals of Mathematics, 38, 787--793

    work page 1937

  79. [79]

    Schweinberger, M., and Snijders, T. A. (2003), Settings in social networks: A measurement model , Sociological Methodology, 33, 307--341

    work page 2003

  80. [80]

    K., and Chen, Y

    Sewell, D. K., and Chen, Y. (2015), Latent space models for dynamic networks, Journal of the American Statistical Association, 110, 1646--1657

    work page 2015

Showing first 80 references.