A Semiparametric Two-Sample Hypothesis Testing Problem for Random Graphs

References

• Arias-Castro, E., and Verzelen, N. (2014), “Community Detection in Dense Random Networks,” Annals of Statistics, 42, 940–969.
   Web of Science ®Google Scholar
• Athreya, A., Lyzinski, V., Marchette, D. J., Priebe, C. E., Sussman, D. L., and Tang, M. (2016), “A Limit Theorem for Scaled Eigenvectors of Random Dot Product Graphs,” Sankhya A, 78, 1–18
   Google Scholar
• Bhattacharyya, S., and Bickel, P. J. (2015), “Subsampling of Bootstrap of Count Features on Networks,” Annals of Statistics, 43, 2384–2411.
   Web of Science ®Google Scholar
• Bullmore, E., and Sporns, O. (2009), “Complex Brain Networks: Graph Theoretical Analysis of Structural and Functional Systems,” Nature Reviews Neuroscience, 10, 186–198.
   PubMed Web of Science ®Google Scholar
• Chaudhuri, K., Chung, F., and Tsiatas, A. (2012), “Spectral Partitioning of Graphs With General Degrees and the Extended Planted Partition Model,” in Proceedings of the 25th Conference on Learning Theory, Edinburgh, Scotland.
   Google Scholar
• Conte, D., Foggia, P., Sansone, C., and Vento, M. (2004), “Thirty Years of Graph Matching in Pattern Recognition,” International Journal of Pattern Recognition and Artificial Intelligence, 18, 265–298.
   Web of Science ®Google Scholar
• 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.
   Web of Science ®Google Scholar
• Holland, P. W., Laskey, K., and Leinhardt, S. (1983), “Stochastic Blockmodels: First Steps,” Social Networks, 5, 109–137.
   Web of Science ®Google Scholar
• Karrer, B., and Newman, M. E. J. (2011), “Stochastic Blockmodels and Community Structure in Networks,” Physical Review E, 83, 016107.
   PubMed Web of Science ®Google Scholar
• Kolaczyk, E. D. (2009), Statistical Analysis of Network Data, New York: Springer-Verlag.
   Google Scholar
• Landman, B. A., Huang, A. J., Gifford, A., Vikram, D. S., Lim, I. A., and Farrell, J.A., et al. (2011), “Multi-Parametric Neuroimaging Reproducibility: A 3t Resource Study,” Neuroimage, 54, 2854–2866.
   PubMed Web of Science ®Google Scholar
• Lyzinski, V., Sussman, D. L., Tang, M., Athreya, A., and Priebe, C. E. (2014), “Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding,” Electronic Journal of Statistics, 8, 2905–2922.
   Web of Science ®Google Scholar
• Mosteller, F., and Fisher, R. A. (1948), “Questions and Answer,” The American Statistician, 2, 30–31.
   Google Scholar
• Oliveira, R. I. (2009), “Concentration of the Adjacency Matrix and of the Laplacian in Random Graphs With Independent Edges,” available at http://arxiv.org/abs/0911.0600.
   Google Scholar
• Richiardi, J., Achard, S., Bunke, H., and Ville, D. V.D. (2013), “Machine Learning With Brain Graphs: Predictive Modeling Approaches for Functional Imaging in Systems Neuroscience,” IEEE Signal Processing, 66, 58–70.
   Web of Science ®Google Scholar
• Rohe, K., Chatterjee, S., and Yu, B. (2011), “Spectral Clustering and the High-Dimensional Stochastic Blockmodel,” Annals of Statistics, 39, 1878–1915.
   Web of Science ®Google Scholar
• Roncal, W. G., Bogovic, J. A., Vogelstein, J. T., Landman, B. A., Prince, J. L., and Vogelstein, R. J. (2012), “Magnetic Resonance Connectome Automated Pipeline: An Overview,” IEEE Pulse, 3, 42–48.
   Web of Science ®Google Scholar
• Roncal, W. G., Koterba, Z. H., Mhembere, D., Kleissas, D. M., Vogelstein, J. T., and Burns, R., et al. (2013), “Migraine: MRI Graph Reliability Analysis and Inference for Connectomics,” available at http://arxiv.org/abs/1312.4875.
   Google Scholar
• Rukhin, A., and Priebe, C. E. (2011), “A Comparative Power Analysis of the Maximum Degree and Size Invariants for Random Graph Inference,” Journal of Statistical Planning and Inference, 141, 1041–1046.
   Web of Science ®Google Scholar
• Sarkar, P., and Bickel, P. J. (2015), “Hypothesis Testing for Automated Community Detection in Networks,” Journal of the Royal Statistical Association, Series B, 78, 253–273.
   Google Scholar
• Schonemann, P. H. (1966), “A Generalized Solution of the Orthogonal Procrustes Problem,” Psychometrika, 31, 1–10.
   Web of Science ®Google Scholar
• Sussman, D. L., Tang, M., Fishkind, D. E., and Priebe, C. E. (2012), “A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs,” Journal of the American Statistical Association, 107, 1119–1128.
   Web of Science ®Google Scholar
• Sussman, D. L., Tang, M., and Priebe, C. E. (2014), “Consistent Latent Position Estimation and Vertex Classification for Random dot Product Graphs,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 36, 48–57.
   PubMed Web of Science ®Google Scholar
• Tang, M., Athreya, A., Sussman, D. L., Lyzinski, V., and Priebe, C. E. (in press), “A Nonparametric Two-Sample Hypothesis Testing Problem for Random dot Product Graphs,” Bernoulli. Available at http://arxiv.org/abs/1409.2344.
   Google Scholar
• Tang, M., Sussman, D. L., and Priebe, C. E. (2013), “Universally Consistent Vertex Classification for Latent Position Graphs,” Annals of Statistics, 41, 1406–1430.
   Web of Science ®Google Scholar
• Varshney, L. R., Chen, B. L., Paniagua, E., Hall, D. H., and Chklovskii, D. B. (2011), “Structural Properties of the Caenorhabditis Elegans Neuronal Network,” PLOS Computational Biology, 7, article e1001066.
   Google Scholar
• White, J. G., Southgate, E., Thomson, J. N., and Brenner, S. (1986), “The Structure of the Nervous System of the Nematode Caenorhabdhitis Elegans,” Philosophical Transactions of the Royal Society, B, 314, 1–340.
   PubMed Web of Science ®Google Scholar
• Young, S., and Scheinerman, E. (2007), “Random dot Product Graph Models for Social Networks,” in Proceedings of the 5th International Conference on Algorithms and Models for the Web-Graph, pp. 138–149.
   Google Scholar
• Zalesky, A., Fornito, A., Harding, I., Cocchi, L., Yücel, M., Pantalis, C., and Bullmore, E. (2010), “Whole-Brain Anatomical Networks: Does the Choice of Node Matter?” NeuroImage, 50, 970–983.
   PubMed Web of Science ®Google Scholar
• Zhu, M., and Ghodsi, A. (2006), “Automatic Dimensionality Selection From the Scree Plot via the Use of Profile Likelihood,” Computational Statistics and Data Analysis, 51, 918–930.
   Web of Science ®Google Scholar