1,740
Views
112
CrossRef citations to date
0
Altmetric
Theory and Methods

A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs

, , &
Pages 1119-1128 | Received 01 Sep 2011, Published online: 08 Oct 2012

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (9)

Avanti Athreya, Zachary Lubberts, Carey E. Priebe, Youngser Park, Minh Tang, Vince Lyzinski, Michael Kane & Bryan W. Lewis. (2023) Numerical Tolerance for Spectral Decompositions of Random Matrices and Applications to Network Inference. Journal of Computational and Graphical Statistics 32:1, pages 145-156.
Read now
John Koo, Minh Tang & Michael W. Trosset. (2023) Popularity Adjusted Block Models are Generalized Random Dot Product Graphs. Journal of Computational and Graphical Statistics 32:1, pages 131-144.
Read now
Fangzheng Xie & Yanxun Xu. (2023) Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure. Journal of the American Statistical Association 118:541, pages 651-664.
Read now
Congyuan Yang, Carey E. Priebe, Youngser Park & David J. Marchette. (2021) Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering. Journal of Computational and Graphical Statistics 30:2, pages 422-441.
Read now
P.-A. G. Maugis, S. C. Olhede, C. E. Priebe & P. J. Wolfe. (2020) Testing for Equivalence of Network Distribution Using Subgraph Counts. Journal of Computational and Graphical Statistics 29:3, pages 455-465.
Read now
Kehui Chen & Jing Lei. (2018) Network Cross-Validation for Determining the Number of Communities in Network Data. Journal of the American Statistical Association 113:521, pages 241-251.
Read now
Minh Tang, Avanti Athreya, Daniel L. Sussman, Vince Lyzinski, Youngser Park & Carey E. Priebe. (2017) A Semiparametric Two-Sample Hypothesis Testing Problem for Random Graphs. Journal of Computational and Graphical Statistics 26:2, pages 344-354.
Read now
Li Chen, Joshua T. Vogelstein, Vince Lyzinski & Carey E. Priebe. (2016) A joint graph inference case study: the C. elegans chemical and electrical connectomes. Worm 5:2.
Read now
Carey E. Priebe, Daniel L. Sussman, Minh Tang & Joshua T. Vogelstein. (2015) Statistical Inference on Errorfully Observed Graphs. Journal of Computational and Graphical Statistics 24:4, pages 930-953.
Read now

Articles from other publishers (103)

Eric Yanchenko & Srijan Sengupta. (2024) A generalized hypothesis test for community structure in networks. Network Science, pages 1-17.
Crossref
Hayden Helm, Ashwin de Silva, Joshua T. Vogelstein, Carey E. Priebe & Weiwei Yang. (2024) Approximately Optimal Domain Adaptation with Fisher’s Linear Discriminant. Mathematics 12:5, pages 746.
Crossref
Cencheng Shen, Jonathan Larson, Ha Trinh, Xihan Qin, Youngser Park & Carey E. Priebe. (2024) Discovering Communication Pattern Shifts in Large-Scale Labeled Networks Using Encoder Embedding and Vertex Dynamics. IEEE Transactions on Network Science and Engineering 11:2, pages 2100-2109.
Crossref
Fangzheng Xie. (2024) Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals. Bernoulli 30:1.
Crossref
Yichi Zhang & Minh Tang. (2024) A Theoretical Analysis of DeepWalk and Node2vec for Exact Recovery of Community Structures in Stochastic Blockmodels. IEEE Transactions on Pattern Analysis and Machine Intelligence 46:2, pages 1065-1078.
Crossref
Hui-Jia Li, Yuhao Feng, Chengyi Xia & Jie Cao. (2023) Overlapping Graph Clustering in Attributed Networks via Generalized Cluster Potential Game. ACM Transactions on Knowledge Discovery from Data 18:1, pages 1-26.
Crossref
Anton A. Alyakin, Joshua Agterberg, Hayden S. Helm & Carey E. Priebe. (2024) Correcting a nonparametric two-sample graph hypothesis test for graphs with different numbers of vertices with applications to connectomics. Applied Network Science 9:1.
Crossref
P A Maugis. (2023) Central limit theorems for local network statistics. Biometrika.
Crossref
Xinjie Du & Minh Tang. (2023) Hypothesis testing for equality of latent positions in random graphs. Bernoulli 29:4.
Crossref
Joshua Cape. (2023) Joshua Cape's contribution to the Discussion of ‘Vintage Factor Analysis with Varimax Performs Statistical Inference’ by Rohe & Zeng. Journal of the Royal Statistical Society Series B: Statistical Methodology 85:4, pages 1066-1067.
Crossref
Fangzheng Xie & Dingbo Wu. (2023) An eigenvector-assisted estimation framework for signal-plus-noise matrix models. Biometrika.
Crossref
Cencheng Shen, Youngser Park & Carey E. Priebe. (2023) Graph Encoder Ensemble for Simultaneous Vertex Embedding and Community Detection. Graph Encoder Ensemble for Simultaneous Vertex Embedding and Community Detection.
Rosemary He & Daniel Tward. (2023) Applying Joint Graph Embedding to Study Alzheimer’s Neurodegeneration Patterns in Volumetric Data. Neuroinformatics 21:3, pages 601-614.
Crossref
Fangzheng Xie. (2023) Euclidean Representation of Low-Rank Matrices and Its Geometric Properties. SIAM Journal on Matrix Analysis and Applications 44:2, pages 822-866.
Crossref
Cencheng Shen, Qizhe Wang & Carey E. Priebe. (2023) One-Hot Graph Encoder Embedding. IEEE Transactions on Pattern Analysis and Machine Intelligence 45:6, pages 7933-7938.
Crossref
Michael Winding, Benjamin D. Pedigo, Christopher L. Barnes, Heather G. Patsolic, Youngser ParkTom Kazimiers, Akira Fushiki, Ingrid V. AndradeAvinash Khandelwal, Javier Valdes-Aleman, Feng LiNadine Randel, Elizabeth Barsotti, Ana Correia, Richard D. Fetter, Volker Hartenstein, Carey E. PriebeJoshua T. Vogelstein, Albert Cardona & Marta Zlatic. (2023) The connectome of an insect brain. Science 379:6636.
Crossref
Hayden S. Helm, Amitabh Basu, Avanti Athreya, Youngser Park, Joshua T. Vogelstein, Carey E. Priebe, Michael Winding, Marta Zlatic, Albert Cardona, Patrick Bourke, Jonathan Larson, Marah Abdin, Piali Choudhury, Weiwei Yang & Christopher W. White. (2023) Distance-based positive and unlabeled learning for ranking. Pattern Recognition 134, pages 109085.
Crossref
Cong Mu, Youngser Park & Carey E. Priebe. (2023) Dynamic network sampling for community detection. Applied Network Science 8:1.
Crossref
Prateek R. Srivastava, Purnamrita Sarkar & Grani A. Hanasusanto. (2023) A Robust Spectral Clustering Algorithm for Sub-Gaussian Mixture Models with Outliers. Operations Research 71:1, pages 224-244.
Crossref
Christy Lin, Daniel L. Sussman & Prakash Ishwar. (2023) Ergodic Limits, Relaxations, and Geometric Properties of Random Walk Node Embeddings. IEEE Transactions on Network Science and Engineering 10:1, pages 346-359.
Crossref
Koby Hayashi, Sinan G. Aksoy & Haesun Park. (2022) Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs. Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs.
Sirio Legramanti, Tommaso Rigon, Daniele Durante & David B. Dunson. (2022) Extended stochastic block models with application to criminal networks. The Annals of Applied Statistics 16:4.
Crossref
Kuang Zhou, Mei Guo & Arnaud Martin. (2022) Evidential prototype-based clustering based on transfer learning. International Journal of Approximate Reasoning 151, pages 322-343.
Crossref
Stefanos Bennett, Mihai Cucuringu & Gesine Reinert. (2022) Lead–lag detection and network clustering for multivariate time series with an application to the US equity market. Machine Learning 111:12, pages 4497-4538.
Crossref
Jaewon Chung, Bijan Varjavand, Jesús Arroyo‐Relión, Anton Alyakin, Joshua Agterberg, Minh Tang, Carey E. Priebe & Joshua T. Vogelstein. (2022) Valid two‐sample graph testing via optimal transport Procrustes and multiscale graph correlation with applications in connectomics. Stat 11:1.
Crossref
Giovanni Barbarino, Vanni Noferini & Paul Van Dooren. (2022) Role extraction for digraphs via neighborhood pattern similarity. Physical Review E 106:5.
Crossref
Daniela Leite, Diego Baptista, Abdullahi A. Ibrahim, Enrico Facca & Caterina De Bacco. (2022) Community detection in networks by dynamical optimal transport formulation. Scientific Reports 12:1.
Crossref
Cong Mu, Angelo Mele, Lingxin Hao, Joshua Cape, Avanti Athreya & Carey E. Priebe. (2022) On Spectral Algorithms for Community Detection in Stochastic Blockmodel Graphs With Vertex Covariates. IEEE Transactions on Network Science and Engineering 9:5, pages 3373-3384.
Crossref
Jingsong Xiao, Fei Ye, Weidong Ma & Ying Yang. (2022) Estimating the number of communities in the stochastic block model with outliers. Journal of Complex Networks 10:5.
Crossref
Huan Qing. (2022) A Useful Criterion on Studying Consistent Estimation in Community Detection. Entropy 24:8, pages 1098.
Crossref
Minh Tang, Joshua Cape & Carey E. Priebe. (2022) Asymptotically efficient estimators for stochastic blockmodels: The naive MLE, the rank-constrained MLE, and the spectral estimator. Bernoulli 28:2.
Crossref
Francesco Sanna Passino & Nicholas A. Heard. (2022) Latent structure blockmodels for Bayesian spectral graph clustering. Statistics and Computing 32:2.
Crossref
Isuru Udayangani Hewapathirana & Dominic Lee. (2021) Combining Information from Multiple Views for Vertex-Based Change Detection in Dynamic Networks: A Comparative Study. SN Computer Science 3:2.
Crossref
Zachary M. Pisano, Joshua S. Agterberg, Carey E. Priebe & Daniel Q. Naiman. (2022) Spectral graph clustering via the expectation-solution algorithm. Electronic Journal of Statistics 16:1.
Crossref
Qiqi Zhao, Huifang Ma, Xiaohong Li & Zhixin Li. (2021) Is the simple assignment enough? Exploring the interpretability for community detection. International Journal of Machine Learning and Cybernetics 12:12, pages 3463-3474.
Crossref
Changxiao Cai, Gen Li, Yuejie Chi, H. Vincent Poor & Yuxin Chen. (2021) Subspace estimation from unbalanced and incomplete data matrices: ℓ2,∞ statistical guarantees. The Annals of Statistics 49:2.
Crossref
Jing Lei. (2021) Network representation using graph root distributions. The Annals of Statistics 49:2.
Crossref
Shangsi Wang, Jesús Arroyo, Joshua T. Vogelstein & Carey E. Priebe. (2021) Joint Embedding of Graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 43:4, pages 1324-1336.
Crossref
Jaewon ChungEric Bridgeford, Jesús Arroyo, Benjamin D. PedigoAli Saad-EldinVivek GopalakrishnanLiang XiangCarey E. Priebe & Joshua T. Vogelstein. (2021) Statistical Connectomics. Annual Review of Statistics and Its Application 8:1, pages 463-492.
Crossref
Aurel A Lazar, Tingkai Liu, Mehmet Kerem Turkcan & Yiyin Zhou. (2021) Accelerating with FlyBrainLab the discovery of the functional logic of the Drosophila brain in the connectomic and synaptomic era. eLife 10.
Crossref
Avanti Athreya, Minh Tang, Youngser Park & Carey E. Priebe. (2021) On Estimation and Inference in Latent Structure Random Graphs. Statistical Science 36:1.
Crossref
Michael Brusco, Patrick Doreian & Douglas Steinley. (2019) Deterministic blockmodelling of signed and two‐mode networks: A tutorial with software and psychological examples. British Journal of Mathematical and Statistical Psychology 74:1, pages 34-63.
Crossref
Ery Arias-Castro, Antoine Channarond, Bruno Pelletier & Nicolas Verzelen. (2021) On the estimation of latent distances using graph distances. Electronic Journal of Statistics 15:1.
Crossref
Carey E. Priebe, Cencheng Shen, Ningyuan Huang & Tianyi Chen. (2021) A Simple Spectral Failure Mode for Graph Convolutional Networks. IEEE Transactions on Pattern Analysis and Machine Intelligence, pages 1-1.
Crossref
Kuang Zhou, Mei Guo & Arnaud Martin. 2021. Belief Functions: Theory and Applications. Belief Functions: Theory and Applications 56 65 .
Fangzheng Xie & Yanxun Xu. (2020) Optimal Bayesian estimation for random dot product graphs. Biometrika 107:4, pages 875-889.
Crossref
Qiqi Zhao, Huifang Ma, Xiaohong Li & Zhixin Li. (2020) NotMle: Community Detection in an Inference Way. NotMle: Community Detection in an Inference Way.
Meghana Madhyastha, Gongkai Li, Veronika Strnadová-Neeley, James Browne, Joshua T. Vogelstein, Randal Burns & Carey E. Priebe. (2020) Geodesic Forests. Geodesic Forests.
Cencheng Shen, Li Chen, Yuexiao Dong & Carey E. Priebe. (2020) Sparse Representation Classification Beyond ℓ1 Minimization and the Subspace Assumption. IEEE Transactions on Information Theory 66:8, pages 5061-5071.
Crossref
Adam S. Charles, Benjamin FalkNicholas Turner, Talmo D. Pereira, Daniel TwardBenjamin D. PedigoJaewon ChungRandal BurnsSatrajit S. Ghosh, Justus M. Kebschull, William Silversmith & Joshua T. Vogelstein. (2020) Toward Community-Driven Big Open Brain Science: Open Big Data and Tools for Structure, Function, and Genetics. Annual Review of Neuroscience 43:1, pages 441-464.
Crossref
Soheil Feizi, Gerald Quon, Mariana Recamonde-Mendoza, Muriel Medard, Manolis Kellis & Ali Jadbabaie. (2020) Spectral Alignment of Graphs. IEEE Transactions on Network Science and Engineering 7:3, pages 1182-1197.
Crossref
Emmanuel Abbe, Jianqing Fan, Kaizheng Wang & Yiqiao Zhong. (2020) Entrywise eigenvector analysis of random matrices with low expected rank. The Annals of Statistics 48:3.
Crossref
Heather G. Patsolic, Youngser Park, Vince Lyzinski & Carey E. Priebe. (2020) Vertex nomination via seeded graph matching. Statistical Analysis and Data Mining: The ASA Data Science Journal 13:3, pages 229-244.
Crossref
Jordan Yoder, Li Chen, Henry Pao, Eric Bridgeford, Keith Levin, Donniell E. Fishkind, Carey Priebe & Vince Lyzinski. (2020) Vertex nomination: The canonical sampling and the extended spectral nomination schemes. Computational Statistics & Data Analysis 145, pages 106916.
Crossref
Liangjun Su, Wuyi Wang & Yichong Zhang. (2020) Strong Consistency of Spectral Clustering for Stochastic Block Models. IEEE Transactions on Information Theory 66:1, pages 324-338.
Crossref
Sharmodeep Bhattacharyya & Shirshendu Chatterjee. 2020. Complex Networks XI. Complex Networks XI 92 103 .
Silvia Metelli & Nicholas Heard. (2019) On Bayesian new edge prediction and anomaly detection in computer networks. The Annals of Applied Statistics 13:4.
Crossref
Youjin Lee, Cencheng Shen, Carey E Priebe & Joshua T Vogelstein. (2019) Network dependence testing via diffusion maps and distance-based correlations. Biometrika 106:4, pages 857-873.
Crossref
Joshua Cape, Minh Tang & Carey E. Priebe. (2019) The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics. The Annals of Statistics 47:5.
Crossref
Joshua Cape, Minh Tang & Carey E. Priebe. (2019) On spectral embedding performance and elucidating network structure in stochastic blockmodel graphs. Network Science 7:3, pages 269-291.
Crossref
Isuru U. Hewapathirana. (2018) Change detection in dynamic attributed networks. WIREs Data Mining and Knowledge Discovery 9:3.
Crossref
Joshua T Vogelstein, Eric W Bridgeford, Benjamin D Pedigo, Jaewon Chung, Keith Levin, Brett Mensh & Carey E Priebe. (2019) Connectal coding: discovering the structures linking cognitive phenotypes to individual histories. Current Opinion in Neurobiology 55, pages 199-212.
Crossref
Lu Wang, Zhengwu Zhang & David Dunson. (2019) Common and individual structure of brain networks. The Annals of Applied Statistics 13:1.
Crossref
Hadrien Van Lierde, Tommy W S Chow & Jean-Charles Delvenne. (2019) Spectral clustering algorithms for the detection of clusters in block-cyclic and block-acyclic graphs. Journal of Complex Networks 7:1, pages 1-53.
Crossref
Joshua T Vogelstein, Eric W Bridgeford, Qing Wang, Carey E Priebe, Mauro Maggioni & Cencheng Shen. (2019) Discovering and deciphering relationships across disparate data modalities. eLife 8.
Crossref
Ruthwik Junuthula, Maysam Haghdan, Kevin S. Xu & Vijay Devabhaktuni. (2019) The Block Point Process Model for Continuous-time Event-based Dynamic Networks. The Block Point Process Model for Continuous-time Event-based Dynamic Networks.
Minh Tang & Carey E. Priebe. (2018) Limit theorems for eigenvectors of the normalized Laplacian for random graphs. The Annals of Statistics 46:5.
Crossref
Daniel C. Ellwanger, Mirko Scheibinger, Rachel A. Dumont, Peter G. Barr-Gillespie & Stefan Heller. (2018) Transcriptional Dynamics of Hair-Bundle Morphogenesis Revealed with CellTrails. Cell Reports 23:10, pages 2901-2914.e13.
Crossref
Vince Lyzinski. (2018) Information Recovery in Shuffled Graphs via Graph Matching. IEEE Transactions on Information Theory 64:5, pages 3254-3273.
Crossref
Fuchen LiuDavid ChoiLu XieKathryn Roeder. (2018) Global spectral clustering in dynamic networks. Proceedings of the National Academy of Sciences 115:5, pages 927-932.
Crossref
Junyu Zhang, Haoyang Liu, Zaiwen Wen & Shuzhong Zhang. (2018) A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection. SIAM Journal on Scientific Computing 40:5, pages A3091-A3120.
Crossref
Keith Levin, Avanti Athreya, Minh Tang, Vince Lyzinski & Carey E. Priebe. (2017) A Central Limit Theorem for an Omnibus Embedding of Multiple Random Dot Product Graphs. A Central Limit Theorem for an Omnibus Embedding of Multiple Random Dot Product Graphs.
Giuliana Pallotta, Goran Konjevod, Jose Cadena & Phan Nguyen. (2017) Context‐aided analysis of community evolution in networks. Statistical Analysis and Data Mining: The ASA Data Science Journal 10:5, pages 290-311.
Crossref
Minh Tang, Avanti Athreya, Daniel L. Sussman, Vince Lyzinski & Carey E. Priebe. (2017) A nonparametric two-sample hypothesis testing problem for random graphs. Bernoulli 23:3.
Crossref
David Choi. (2017) Co-clustering of nonsmooth graphons. The Annals of Statistics 45:4.
Crossref
Eric D. Kolaczyk. 2017. Topics at the Frontier of Statistics and Network Analysis. Topics at the Frontier of Statistics and Network Analysis.
YUNKYU SOHN & JONG HEE PARK. (2017) Bayesian approach to multilayer stochastic blockmodel and network changepoint detection. Network Science 5:2, pages 164-186.
Crossref
Cencheng Shen, Joshua T. Vogelstein & Carey E. Priebe. (2017) Manifold matching using shortest-path distance and joint neighborhood selection. Pattern Recognition Letters 92, pages 41-48.
Crossref
Da Zheng, Disa Mhembere, Vince Lyzinski, Joshua T. Vogelstein, Carey E. Priebe & Randal Burns. (2017) Semi-External Memory Sparse Matrix Multiplication for Billion-Node Graphs. IEEE Transactions on Parallel and Distributed Systems 28:5, pages 1470-1483.
Crossref
Vince Lyzinski, Minh Tang, Avanti Athreya, Youngser Park & Carey E. Priebe. (2017) Community Detection and Classification in Hierarchical Stochastic Blockmodels. IEEE Transactions on Network Science and Engineering 4:1, pages 13-26.
Crossref
Yahui Tian & Yulia R. Gel. 2017. Big and Complex Data Analysis. Big and Complex Data Analysis 139 157 .
Arun Kadavankandy, Laura Cottatellucci & Konstantin Avrachenkov. (2016) Characterization of L 1 -norm statistic for anomaly detection in Erdős Rényi graphs . Characterization of L 1 -norm statistic for anomaly detection in Erdős Rényi graphs .
Antony Joseph & Bin Yu. (2016) Impact of regularization on spectral clustering. The Annals of Statistics 44:4.
Crossref
Li Chen, Cencheng Shen, Joshua T. Vogelstein & Carey E. Priebe. (2016) Robust Vertex Classification. IEEE Transactions on Pattern Analysis and Machine Intelligence 38:3, pages 578-590.
Crossref
A. Athreya, C. E. Priebe, M. Tang, V. Lyzinski, D. J. Marchette & D. L. Sussman. (2015) A Limit Theorem for Scaled Eigenvectors of Random Dot Product Graphs. Sankhya A 78:1, pages 1-18.
Crossref
Shakira Suwan, Dominic S. Lee, Runze Tang, Daniel L. Sussman, Minh Tang & Carey E. Priebe. (2016) Empirical Bayes estimation for the stochastic blockmodel. Electronic Journal of Statistics 10:1.
Crossref
Sharmodeep Bhattacharyya & Peter J. Bickel. 2016. Statistical Analysis for High-Dimensional Data. Statistical Analysis for High-Dimensional Data 67 90 .
D. E. Fishkind, V. Lyzinski, H. Pao, L. Chen & C. E. Priebe. (2015) Vertex nomination schemes for membership prediction. The Annals of Applied Statistics 9:3.
Crossref
Vince Lyzinski, Daniel L. Sussman, Donniell E. Fishkind, Henry Pao, Li Chen, Joshua T. Vogelstein, Youngser Park & Carey E. Priebe. (2015) Spectral clustering for divide-and-conquer graph matching. Parallel Computing 47, pages 70-87.
Crossref
T. Tony Cai & Xiaodong Li. (2015) Robust and computationally feasible community detection in the presence of arbitrary outlier nodes. The Annals of Statistics 43:3.
Crossref
Purnamrita Sarkar & Peter J. Bickel. (2015) Role of normalization in spectral clustering for stochastic blockmodels. The Annals of Statistics 43:3.
Crossref
Jing Lei & Alessandro Rinaldo. (2015) Consistency of spectral clustering in stochastic block models. The Annals of Statistics 43:1.
Crossref
Michael A Rosen, Aaron S Dietz, Ting Yang, Carey E Priebe & Peter J Pronovost. (2015) An integrative framework for sensor-based measurement of teamwork in healthcare. Journal of the American Medical Informatics Association 22:1, pages 11-18.
Crossref
Kevin S. Xu & Alfred O. Hero. (2014) Dynamic Stochastic Blockmodels for Time-Evolving Social Networks. IEEE Journal of Selected Topics in Signal Processing 8:4, pages 552-562.
Crossref
Renaud Lambiotte, Jean-Charles Delvenne & Mauricio Barahona. (2014) Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks. IEEE Transactions on Network Science and Engineering 1:2, pages 76-90.
Crossref
Vince Lyzinski, Daniel L. Sussman, Minh Tang, Avanti Athreya & Carey E. Priebe. (2014) Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding. Electronic Journal of Statistics 8:2.
Crossref
Daniel L. Sussman, Minh Tang & Carey E. Priebe. (2014) Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 36:1, pages 48-57.
Crossref
Disa Mhembere, William Gray Roncal, Daniel Sussman, Carey E. Priebe, Rex Jung, Sephira Ryman, R. Jacob Vogelstein, Joshua T. Vogelstein & Randal Burns. (2013) Computing scalable multivariate glocal invariants of large (brain-) graphs. Computing scalable multivariate glocal invariants of large (brain-) graphs.
Evandro Jose Da Rocha E Silva, Teresa Bernarda Ludermir & Leandro Maciel Almeida. (2013) Clustering and Selection Using Grouping Genetic Algorithms for Blockmodeling to Construct Neural Network Ensembles. Clustering and Selection Using Grouping Genetic Algorithms for Blockmodeling to Construct Neural Network Ensembles.
Minh Tang, Daniel L. Sussman & Carey E. Priebe. (2013) Universally consistent vertex classification for latent positions graphs. The Annals of Statistics 41:3.
Crossref
Minh Tang, Youngser Park, Nam H. Lee & Carey E. Priebe. (2013) Attribute Fusion in a Latent Process Model for Time Series of Graphs. IEEE Transactions on Signal Processing 61:7, pages 1721-1732.
Crossref
Kevin S. Xu & Alfred O. HeroIIIIII. 2013. Social Computing, Behavioral-Cultural Modeling and Prediction. Social Computing, Behavioral-Cultural Modeling and Prediction 201 210 .
Aarti Singh, Akshay Krishnamurthy, Sivaraman Balakrishnan & Min Xu. (2012) Completion of high-rank ultrametric matrices using selective entries. Completion of high-rank ultrametric matrices using selective entries.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.