Correlation between graphs with an application to brain network analysis
From MaRDI portal
Publication:126082
DOI10.1016/j.csda.2016.11.016zbMath1466.62072arXiv1512.06830OpenAlexW2237154730MaRDI QIDQ126082
Daniel Yasumasa Takahashi, João Ricardo Sato, Joana Bisol Balardin, Maciel Calebe Vidal, Daniel Y. Takahashi, Maciel Calebe Vidal, Joana Bisol Balardin, João Ricardo Sato, André Fujita
Publication date: May 2017
Published in: Computational Statistics & Data Analysis, Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.06830
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Measuring and testing dependence by correlation of distances
- A class of multivariate distribution-free tests of independence based on graphs
- Spectral distributions of adjacency and Laplacian matrices of random graphs
- Clustering rules: A comparison of partitioning and hierarchical clustering algorithms
- Eigenvalues and expanders
- The eigenvalues of random symmetric matrices
- Computing the nonnull asymptotic variance and the asymptotic relative efficiency of Spearman's rank correlation
- A non-parametric method to estimate the number of clusters
- Metric structure of random networks
- Emergence of Scaling in Random Networks
- Copulas: A Review and Recent Developments
- Eigenvalues of Euclidean random matrices
- Fast generation of regular graphs and construction of cages
- Random Geometric Graphs
- Collective dynamics of ‘small-world’ networks
- A Non-Parametric Test of Independence
