Subscribe
Issue No.01 - Jan. (2014 vol.36)
pp: 48-57
Daniel L. Sussman , Johns Hopkins Univ., Baltimore, MD, USA
Minh Tang , Johns Hopkins Univ., Baltimore, MD, USA
Carey E. Priebe , Johns Hopkins Univ., Baltimore, MD, USA
ABSTRACT
In this work, we show that using the eigen-decomposition of the adjacency matrix, we can consistently estimate latent positions for random dot product graphs provided the latent positions are i.i.d. from some distribution. If class labels are observed for a number of vertices tending to infinity, then we show that the remaining vertices can be classified with error converging to Bayes optimal using the $(k)$-nearest-neighbors classification rule. We evaluate the proposed methods on simulated data and a graph derived from .
INDEX TERMS
Vectors, Stochastic processes, Estimation, Internet, Random variables, Pattern recognition, Encyclopedias,universal consistency, Random graph, $(k)$-nearest-neighbor, latent space model
CITATION
Daniel L. Sussman, Minh Tang, Carey E. Priebe, "Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.36, no. 1, pp. 48-57, Jan. 2014, doi:10.1109/TPAMI.2013.135
REFERENCES
 [1] E.M. Airoldi, D.M. Blei, S.E. Fienberg, and E.P. Xing, "Mixed Membership Stochastic Blockmodels," J. Machine Learning Research, vol. 9, pp. 1981-2014, 2008. [2] D.J. Aldous, "Representations for Partially Exchangeable Arrays of Random Variables," J. Multivariate Analysis, vol. 11, no. 4, pp. 581-598, 1981. [3] P.J. Bickel and A. Chen, "A Nonparametric View of Network Models and Newman-Girvan and Other Modularities," Proc. Nat'l Academy of Sciences USA, vol. 106, no. 50, pp. 21068-21073, 2009. [4] P.J. Bickel, A. Chen, and E. Levina, "The Method of Moments and Degree Distributions for Network Models," Annals of Statistics, vol. 39, no. 5, pp. 38-59, 2011. [5] D.S. Choi, P.J. Wolfe, and E.M. Airoldi, "Stochastic Blockmodels with a Growing Number of Classes," Biometrika, vol. 99, no. 2, pp. 273-284, 2012. [6] F. Chung, L. Lu, and V. Vu, "The Spectra of Random Graphs with Given Expected Degrees," Internet Math., vol. 1, no. 3, pp. 257-275, 2004. [7] F. RK Chung, Spectral Graph Theory. Am. Math. Soc., 1997. [8] C. Davis and W. Kahan, "The Rotation of Eigenvectors by a Pertubation. III," SIAM J. Numerical Analysis, vol. 7, pp. 1-46, 1970. [9] L. Devroye, L. Györfi, and G. Lugosi, A Probabilistic Theory of Pattern Recognition. Springer Verlag, 1996. [10] M. Fiedler, "Algebraic Connectivity of Graphs," Czechoslovak Math. J., vol. 23, no. 2, pp. 298-305, 1973. [11] D.E. Fishkind, D.L. Sussman, M. Tang, J.T. Vogelstein, and C.E. Priebe, "Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown," rapid post, 2012. [12] M.S. Handcock, A.E. Raftery, and J.M. Tantrum, "Model-Based Clustering for Social Networks," J. Royal Statistical Soc.: Series A (Statistics in Soc.), vol. 170, no. 2, pp. 301-354, 2007. [13] P.D. Hoff, A.E. Raftery, and M.S. Handcock, "Latent Space Approaches to Social Network Analysis," J. Am. Statistical Assoc., vol. 97, no. 460, pp. 1090-1098, 2002. [14] P.W. Holland, K. Laskey, and S. Leinhardt, "Stochastic Blockmodels: First Steps," Social Networks, vol. 5, no. 2, pp. 109-137, 1983. [15] D.N. Hoover, "Relations on Probability Spaces and Arrays of Random Variables," Inst. for Advanced Study, Princeton, rapid post, 1979. [16] R. Horn and C. Johnson, Matrix Analysis. Cambridge Univ. Press, 1985. [17] O. Kallenberg, Probabilistic Symmetries and Invariance Principles. Springer Verlag, 2005. [18] Z. Ma, D.J. Marchette, and C.E. Priebe, "Fusion and Inference from Multiple Data Sources in a Commensurate Space," Statistical Analysis and Data Mining, vol. 5, no. 3, pp. 187-193, 2012. [19] D. Marchette, C.E. Priebe, and G. Coppersmith, "Vertex Nomination via Attributed Random Dot Product Graphs," Proc. 57th ISI World Statistics Congress, 2011. [20] F. McSherry, "Spectral Partitioning of Random Graphs," Proc. IEEE CS Int'l Conf. Cluster Computing, pp. 529-537, 2001. [21] C.L.M. Nickel, "Random Dot Product Graphs: A Model for Social Networks," PhD thesis, Johns Hopkins Univ., 2006. [22] R.I. Oliveira, "Concentration of the Adjacency Matrix and of the Laplacian in Random Graphs with Independent Edges," rapid post, 2009. [23] K. Rohe, S. Chatterjee, and B. Yu, "Spectral Clustering and the High-Dimensional Stochastic Blockmodel," Annals of Statistics, vol. 39, no. 4, pp. 1878-1915, 2011. [24] T.A.B. Snijders and K. Nowicki, "Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure," J. Classification, vol. 14, no. 1, pp. 75-100, 1997. [25] C.J. Stone, "Consistent Nonparametric Regression," Annals of Statistics, vol. 5, no. 4, pp. 595-620, 1977. [26] D.L. Sussman, M. Tang, D.E. Fishkind, and C.E. Priebe, "A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs," J. Am. Statistical Assoc., vol. 107, no. 499, pp. 1119-1128, 2012. [27] S. Young and E. Scheinerman, "Random Dot Product Graph Models for Social Networks," Proc. Fifth Int'l Conf. Algorithms and Models for the Web-Graph, pp. 138-149, 2007.