Fetching the paper…
Reading the bibliography…
We review the class of continuous latent space (statistical) models for network data, paying particular attention to the role of the geometry of the latent space.
[author] Spearman, CharlesC. (1904). “General Intelligence,” objectively determined and measured. The American Journal of Psychology 15 201–292. \endbibitem
1904
Earlier work this paper cites.
[author] Weyl, HermannH. (1911). Sur la distribution asymptotique des valeurs propres. Nouvelles de la Société des Sciences sur Göttingen, Mathematical-Physical Class 110-117. \endbibitem
1911
Earlier work this paper cites.
[author] Simmel, GeorgG. (1950 [1917]). The sociology of Georg Simmel Individual and society, 3 - 84. New York: Free Press. \endbibitem
1917
Earlier work this paper cites.
[author] Rapoport, AnatolA. (1953). Spread of information through a population with socio-structural bias: I. Assumption of transitivity. The Bulletin of Mathematical Biophysics 15 523–533. \endbibitem
1953
Earlier work this paper cites.
[author] Lichnerowicz, AndréA. (1958). Geometrie des groupes de transformations, Dunod, Paris, 1958. Zentralblatt MATH 96. \endbibitem
1958
Earlier work this paper cites.
[author] Gilbert, Edgar NE. N. (1959). Random graphs. The Annals of Mathematical Statistics 1141–1144. \endbibitem
1959
Earlier work this paper cites.
[author] Erdös, PaulP. and Rényi, AlfrédA. (1960). On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences 5 17 – 61. \endbibitem
1960
Earlier work this paper cites.
[author] Coleman, James SamuelJ. S. (1964). Introduction to mathematical sociology. Free Press, New York. \endbibitem
1964
Earlier work this paper cites.
[author] Lazarsfeld, Paul FelixP. F., Henry, Neil WN. W. and Anderson, Theodore WilburT. W. (1968). Latent structure analysis 109. Houghton Mifflin Boston. \endbibitem
1968
Earlier work this paper cites.
[author] Davis, James AJ. A. (1970). Clustering and hierarchy in interpersonal relations: Testing two graph theoretical models on 742 sociomatrices. American Sociological Review 843–851. \endbibitem
1970
Earlier work this paper cites.
[author] Holland, Paul WP. W. and Leinhardt, SamuelS. (1970). A method for detecting structure in sociometric data. American Journal of Sociology 492–513. \endbibitem
1970
Earlier work this paper cites.
1977
Earlier work this paper cites.
[author] Eash, RR., Chon, KK., Lee, YY. and Boyce, DD. (1979). Equilibrium traffic assignment on an aggregated highway network for sketch planning. Transportation Research 13 243–257. \endbibitem
1979
Earlier work this paper cites.
[author] Ivrii, V YaV. Y. (1980). Second term of the spectral asymptotic expansion of the Laplace-Beltrami operator on manifolds with boundary. Functional Analysis and Its Applications 14 98–106. \endbibitem
1980
Earlier work this paper cites.
[author] Fienberg, Stephen ES. E. and Wasserman, Stanley SS. S. (1981). Categorical data analysis of single sociometric relations. Sociological Methodology 12 156–192. \endbibitem
1981
Earlier work this paper cites.
[author] Holland, Paul WP. W. and Leinhardt, SamuelS. (1981). An exponential family of probability distributions for directed graphs. Journal of the American Statistical Association 76 33–50. \endbibitem
1981
Earlier work this paper cites.
[author] Frank, OveO. and Strauss, DavidD. (1986). Markov graphs. Journal of the American Statistical Association 81 832-842. 10.1080/01621459.1986.10478342 \endbibitem
1986
Earlier work this paper cites.
[author] James, ColemanC. (1990). Foundations of social theory. Cambridge, MA: Belknap. \endbibitem
1990
Earlier work this paper cites.
[author] Padgett, John F.J. F. (1994). Marriage and elite structure in Renaissance Florence, 1282-1500. Social Science History Association. \endbibitem
1994
Earlier work this paper cites.
{binproceedings}
1995
Earlier work this paper cites.
[author] Wasserman, StanleyS. and Pattison, PhilippaP. (1996). Logit models and logistic regressions for social networks: I. An introduction to Markov graphs and p ∗ p^{*} . Psychometrika 61 401–425. \endbibitem
1996
Earlier work this paper cites.
{binproceedings}
1997
Earlier work this paper cites.
[author] Snijders, Tom ABT. A. and Nowicki, KrzysztofK. (1997). Estimation and prediction for stochastic blockmodels for graphs with latent block structure. Journal of Classification 14 75–100. \endbibitem
1997
Earlier work this paper cites.
[author] Watts, Duncan JD. J. and Strogatz, Steven HS. H. (1998). Collective dynamics of ’small-world’ networks. Nature 393 440–442. \endbibitem
1998
Earlier work this paper cites.
[author] Barabási, Albert-LászlóA.-L. and Albert, RékaR. (1999). Emergence of scaling in random networks. Science 286 509–512. \endbibitem
1999
Earlier work this paper cites.
[author] Watts, Duncan JD. J. (1999). Networks, dynamics, and the small-world phenomenon. American Journal of Sociology 105 493–527. \endbibitem
1999
Earlier work this paper cites.
[author] Aitchison, JJ., Barceló-Vidal, CC., Martín-Fernández, JAJ. and Pawlowsky-Glahn, VV. (2000). Logratio analysis and compositional distance. Mathematical Geology 32 271–275. \endbibitem
2000
Earlier work this paper cites.
[author] Holly, Jan EJ. E. (2001). Pictures of ultrametric spaces, the p-adic numbers, and valued fields. The American Mathematical Monthly 108 721–728. \endbibitem
2001
Earlier work this paper cites.
[author] Hoff, Peter DP. D., Raftery, Adrian EA. E. and Handcock, Mark SM. S. (2002). Latent space approaches to social network analysis. Journal of the American Statistical Association 97 1090–1098. \endbibitem
2002
Cited alongside, same era.
[author] Pattison, PhilippaP. and Robins, GarryG. (2002). Neighborhood–based models for social networks. Sociological Methodology 32 301–337. \endbibitem
2002
Cited alongside, same era.
[author] Snijders, Tom ABT. A. (2002). Markov chain Monte Carlo estimation of exponential random graph models. Journal of Social Structure 3 1–40. \endbibitem
2002
Cited alongside, same era.
[author] Schweinberger, MichaelM. and Snijders, Tom ABT. A. (2003). Settings in social networks: A measurement model. Sociological Methodology 33 307–341. \endbibitem
2003
Cited alongside, same era.
[author] Krioukov, DmitriD., Papadopoulos, FragkiskosF., Kitsak, MaksimM., Vahdat, AminA. and Boguná, MariánM. (2010). Hyperbolic geometry of complex networks. Physical Review E 82 036106. \endbibitem
2010
Later among the works it cites.
[author] Pao, HenryH., Coppersmith, Glen A.G. A. and Priebe, Carey E.C. E. (2011). Statistical inference on random graphs: Comparative power analyses via Monte Carlo. Journal of Computational and Graphical Statistics 20 395-416. 10.1198/jcgs.2010.09004 \endbibitem
2010
Later among the works it cites.
[author] Bartholomew, David JD. J., Knott, MartinM. and Moustaki, IriniI. (2011). Latent variable models and factor analysis: A unified approach 904. John Wiley & Sons. \endbibitem
2011
Later among the works it cites.
[author] Rogue, ZenoZ. and Rogue, TehoraT. (2011). HyperRogue. http://www.roguetemple.com/z/hyper/. \endbibitem
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2004
Cited alongside, same era.
[author] Newman, Mark EJM. E. and Girvan, MichelleM. (2004). Finding and evaluating community structure in networks. Physical Review E 69 026113. \endbibitem
2004
Cited alongside, same era.
[author] Solé, Ricard VR. V. and Valverde, SergiS. (2004). Information theory of complex networks: on evolution and architectural constraints. In Complex Networks 189–207. Springer. \endbibitem
2004
Cited alongside, same era.
[author] Van Duijn, Marijtje AJM. A., Snijders, Tom ABT. A. and Zijlstra, Bonne JHB. J. (2004). p2: a random effects model with covariates for directed graphs. Statistica Neerlandica 58 234–254. \endbibitem
2004
Cited alongside, same era.
{binproceedings}
2005
Cited alongside, same era.
[author] Hoff, Peter DP. D. (2005). Bilinear mixed-effects models for dyadic data. Journal of the American Statistical Association 100 286–295. \endbibitem
2005
Cited alongside, same era.
[author] Airoldi, Edoardo ME. M., Blei, David MD. M., Fienberg, Stephen ES. E., Goldenberg, AnnaA., Xing, Eric PE. P. and Zheng, Alice XA. X. (2008a). Statistical Network Analysis: Models, Issues, and New Directions: ICML 2006 Workshop on Statistical Network Analysis, Pittsburgh, PA, USA, June 29, 2006, Revised Selected Papers 4503. Springer. \endbibitem
2006
Cited alongside, same era.
[author] Csardi, GaborG. and Nepusz, TamasT. (2006). The igraph software package for complex network research. InterJournal Complex Systems 1695. \endbibitem
2006
Cited alongside, same era.
2011
Later among the works it cites.
[author] Lovász, LászlóL. (2012). Large networks and graph limits 60. American Mathematical Society Providence. \endbibitem
2012
Later among the works it cites.
[author] Kunegis, JérômeJ. (2013). KONECT – The Koblenz Network Collection. \endbibitem
2013
Later among the works it cites.
[author] van der Linden, Wim JW. J. and Hambleton, Ronald KR. K. (2013). Handbook of Modern Item Response Theory. Springer Science & Business Media. \endbibitem
2013
Later among the works it cites.
2013
Later among the works it cites.
[author] Airoldi, Edoardo ME. M., Blei, David MD. M., Fienberg, Stephen ES. E. and Xing, Eric PE. P. (2008b). Mixed membership stochastic blockmodels. Journal of Machine Learning Research 9 1981–2014. \endbibitem
2014
Later among the works it cites.
[author] Asta, DenaD. and Shalizi, Cosma RohillaC. R. (2014). Geometric network comparison. Under review, arXiv preprint 1411.1350. \endbibitem
2014
Later among the works it cites.
[author] Ibragimov, ZairZ. (2014). A hyperbolic filling for ultrametric spaces. Computational Methods and Function Theory 14 315–329. \endbibitem
2014
Later among the works it cites.
[author] Kolaczyk, Eric DE. D. and Csárdi, GáborG. (2014). Statistical analysis of network data with R 65. Springer. \endbibitem
2014
Later among the works it cites.
[author] Aldecoa, RodrigoR., Orsini, ChiaraC. and Krioukov, DmitriD. (2015). Hyperbolic graph generator. Computer Physics Communications 196 492–496. \endbibitem
2015
Later among the works it cites.
[author] Gao, ChaoC., Lu, YuY., Zhou, Harrison HH. H. et al. (2015). Rate-optimal graphon estimation. The Annals of Statistics 43 2624–2652. \endbibitem
2015
Later among the works it cites.
[author] McCormick, Tyler HT. H. and Zheng, TianT. (2015). Latent surface models for networks using aggregated relational data. Journal of the American Statistical Association 110 1684–1695. \endbibitem
2015
Later among the works it cites.
[author] Saldana, Diego FrancoD. F., Yu, YiY. and Feng, YangY. (2015). How many communities are there? Journal of Computational and Graphical Statistics. \endbibitem
2015
Later among the works it cites.
[author] Sewell, Daniel KD. K. and Chen, YuguoY. (2015). Latent space models for dynamic networks. Journal of the American Statistical Association 110 1646–1657. \endbibitem
2015
Later among the works it cites.
[author] Abbe, EmmanuelE., Bandeira, Afonso SA. S. and Hall, GeorginaG. (2016). Exact recovery in the stochastic block model. IEEE Transactions on Information Theory 62 471–487. \endbibitem
2016
Later among the works it cites.
[author] Abu-Ata, MuadM. and Dragan, Feodor FF. F. (2016). Metric tree-like structures in real-world networks: an empirical study. Networks 67 49–68. \endbibitem
2016
Later among the works it cites.
{bmanual}
2016
Later among the works it cites.
[author] Chen, KehuiK. and Lei, JingJ. (2016). Network cross-validation for determining the number of communities in network data. Journal of the American Statistical Association. \endbibitem
2016
Later among the works it cites.
2016
Later among the works it cites.
{bmanual}
2016
Later among the works it cites.
{binproceedings}
2017
Closest in time.
[author] Smith, Anna L.A. L. (2017). Statistical methodology for multiple networks, PhD thesis, The Ohio State University. \endbibitem
2017
Closest in time.
[author] Amini, Arash AA. A., Chen, AiyouA., Bickel, Peter JP. J., Levina, ElizavetaE. et al. (2013). Pseudo-likelihood methods for community detection in large sparse networks. The Annals of Statistics 41 2097–2122. \endbibitem
2097
Closest in time.