betaFeedback

WorksMathematics

Orthogonal Sparse Subgraph Alignment for Structure-Function Coupling in Brain Networks

Abstract

Characterizing the relationship between brain anatomical wiring and functional coordination remains a fundamental challenge in computational neuroscience. This difficulty primarily arises because structure-function coupling in the human brain is spatially heterogeneous, often localized to subnetworks, and inherently difficult to align across disparate representational modalities. We introduce Orthogonal Sparse Subgraph Alignment (OSSA), a principled and interpretable framework designed to identify compact structural cliques that exhibit maximal concordance with functional connectivity (FC) across subjects. Within each FC-derived community, OSSA optimizes an alignment objective over an orthogonal transformation, which absorbs coordinate mismatch between the two connectivity modalities, and a sparse node-selection vector, which identifies the induced structural connectivity (SC) subgraph. Furthermore, for canonical OSSA within a fixed population community, we establish local statistical guarantees under the required assumptions. With high probability, an empirical local maximizer exists in a specified neighborhood of the population target, and every local maximizer in that neighborhood exactly recovers the active support and satisfies a nonasymptotic error bound for the aligned functional projector. Extensive empirical evaluations on simulated data, alongside analyses of the Adolescent Brain Cognitive Development (ABCD) baseline and longitudinal cohorts, demonstrate that OSSA successfully recovers aligned structural cliques under latent cross-modal rotations. Ultimately, the proposed methodology significantly improves out-of-sample SC-FC alignment over size-matched baselines and identifies compact structural supports with longitudinal consistency in node selection, while multi-support diagnostics suggest a dominant aligned core within the estimated FC communities.

Introduction

Understanding how anatomical wiring governs coordinated functional activity in the brain remains a fundamental problem in computational neuroscience. This objective naturally motivates the study of two complementary representations of the brain connectome. Specifically, structural connectivity (SC), inferred from diffusion imaging, charts the physical pathways along which regions communicate, whereas functional connectivity (FC), derived from correlated activity fluctuations, captures the statistical dependence between regional signals [16, 40]. Characterizing the relationship between SC and FC has emerged as a salient analytical task: it provides a principled framework to investigate

40th Conference on Neural Information Processing Systems (NeurIPS 2026). how anatomy constrains function, how individual variability manifests across modalities, and which subnetworks offer the most robust structural support for observed functional coordination [22, 15].

Meanwhile, the SC-FC relationship is intrinsically indirect and spatially heterogeneous [41, 15]. An extensive body of literature demonstrates that functional connectivity is only partially constrained by direct anatomical pathways, and the cross-modal agreement varies systematically across cortical hierarchies, individuals, and developmental stages [22, 42, 4, 51, 17]. Specifically, while certain functional communities are anchored by a dense set of anatomical connections, others rely on diffuse or polysynaptic interactions [49, 19, 38, 51]. Consequently, the most pronounced cross-modal signals are concentrated within localized subnetworks rather than distributed uniformly across the connectome [42, 51, 17]. Existing analytical approaches often summarize SC–FC coupling using a single connectome-wide correlation or region-wise scalar scores [22, 42, 4]. Global correlations obscure spatial variation, whereas region-wise scores characterize such variation without directly identifying a compact node set whose induced structural subgraph maximizes cross-modal concordance. To move beyond global and region-wise scalar summaries, we therefore seek a framework that identifies structural subnetworks with maximal SC–FC concordance within functional communities.

Extensive prior research has sought to characterize the relationship between structural and functional connectivity (SC-FC). Global correlation approaches [22, 41, 15] reduce the connectome to a single summary statistic, thereby failing to identify localized subnetworks. Predictive SC-to-FC models [22, 1, 41] aim to explain functional connectivity from structural connectivity, while graph-theoretic summaries [5, 36] characterize network topology. These formulations do not directly target the joint estimation of a cross-modal alignment transformation and a sparse node set defining an induced structural subgraph. Subnetwork inference [50], functional parcellation [49, 10], and regional SC–FC analysis [51] provide complementary tools for characterizing localized network organization. Here, SC and FC share anatomical node labels, and alignment relates latent functional geometry to a selected structural subgraph while preserving the anatomical identities of its nodes. In practice, leading functional gradients are often rotated or otherwise transformed relative to the structural connectome [29, 42, 46, 17]. Consequently, a localized search that ignores this mismatch tends to recover the structurally densest subset rather than the subnetwork genuinely aligned with functional organization.

Our primary objective in this paper is to address this fundamental challenge: given paired SC and FC matrices across subjects, we aim to identify a sparse, interpretable set of brain regions whose induced structural subgraph is maximally concordant with the dominant functional organization. Specifically, the proposed methodology is designed to overcome the two primary limitations of existing SC-FC analyses. First, the relevant signal manifests at the subnetwork level. Concordance is an intrinsic property of a node set rather than of individual nodes. Consequently, a valid estimation procedure must jointly model the connection patterns of node sets instead of evaluating individual regions sequentially. Second, as FC and SC are typically embedded in disparate coordinate systems, the two modalities may differ by a nontrivial transformation that a purely localized search cannot adequately capture. Therefore, a rigorous methodological solution must explicitly account for this cross-modal mismatch to localize the target subnetwork, while simultaneously ensuring the statistical interpretability of the identified brain regions.

To address this methodological gap, we introduce Orthogonal Sparse Subgraph Alignment (OSSA), a novel framework that integrates these dual requirements into a unified variational problem. Specifically, Ossa couples an orthogonal transformation component with a sparse subgraph selection component (Figure 1). The method jointly estimates an orthogonal transformation of the functional connectivity and a sparse node-selection vector, thereby inducing a structural subgraph that maximizes cross-modal concordance. The transformation component serves as a structure-aware alignment mechanism, absorbing the global coordinate mismatch between modalities while preserving the intrinsic geometry of the functional data. Concurrently, the sparse selection component directly encodes the combinatorial subgraph structure within the continuous optimization space. Together, these components extend the classical orthogonal Procrustes problem [37] to a setting where the alignment target is itself an unknown, induced subgraph of the structural connectome. More generally, OSSA addresses the joint alignment and localization of paired similarity representations on a common index set when both the transformation and the informative subset are unknown. Related settings include comparing learned representations with localized shared information and aligning embedding spaces with only a subset of reliable anchors.

Overview of the OSSA

Figure 1. Overview of the OSSA. (a) SC and FC are restricted to functional communities obtained from a spectral clustering of population-averaged FC. (b) Within a community, OSSA jointly learns an orthogonal FC alignment WW and KK sparse node-support masks. (c) Rounding each mask gives an induced SC subgraph. An overlap penalty controls whether the KK supports collapse or separate.

To the best of our knowledge, OSSA represents the first principled statistical formulation for the cross-modal subnetwork identification problem in SC-FC analysis. The problem can be solved by a computationally efficient algorithm that seamlessly integrates the orthogonal alignment and sparse selection components. Furthermore, we establish theoretical guarantees for canonical OSSA within a fixed population community. Under the required conditions, a local maximizer exists near the population target, and every local maximizer in the specified neighborhood achieves exact support recovery and the finite-sample aligned functional projector error bound with high probability. The empirical utility of the proposed methodology is evaluated through extensive simulation experiments, which highlight its superior accuracy and robustness compared to conventional baseline methods. Finally, we apply OSSA to analyze multi-modal brain connectome data from the Adolescent Brain Cognitive Development (ABCD) study. Our analysis successfully extracts highly interpretable structural modules that tightly couple with functional organization, yielding novel scientific insights into the anatomical constraints of the developing human brain. The identified supports also remain highly consistent across the baseline and Year-2 follow-up releases, indicating that the dominant aligned cores are stable under longitudinal neurodevelopmental variation.

Orthogonal sparse subgraph alignment

Consider a study comprising nn subjects, indexed by i∈{1,…,n}i \in\{1,\ldots,n\}. For each subject ii, we observe a paired set of P×PP \times P symmetric matrices, AiA_i and BiB_i, representing the functional connectivity (FC) and structural connectivity (SC) networks, respectively, defined on a common atlas of PP brain regions. We assume that AiA_i and BiB_i have been preprocessed according to standard pipelines in brain connectome studies.

Communities. Let {Cq}q=1Q\{C_q\}_{q=1}^{Q} denote a partition of the atlas nodes derived from the training FC data. Each set CqC_q represents a module of brain regions, hereafter referred to as a functional community, which is assumed to be shared across all subjects. Such community structures are commonly studied in the context of functional connectivity patterns [18, 7]. Let pq=∣Cq∣p_q = \lvert C_q \rvert denote the size of community qq. Under the assumption of a multiple degree-corrected block structure, the algorithm proposed by [3] exactly identifies the communities CqC_q with high probability. Consequently, we condition our subsequent analysis on the successful recovery of these communities, and we formulate the OSSA objective within each FC-derived community. In practice, the community detection algorithm of [3] is applied prior to OSSA. Define Ai,qA_{i,q} and Bi,qB_{i,q} as the principal submatrices of AiA_i and BiB_i, respectively, induced by the node set CqC_q. For notational conciseness, when the context restricts focus to a single community, we suppress the subscript qq and overload the notation, denoting the submatrices as AiA_i and BiB_i, and the community size as pp.

Algorithm 1 Canonical OSSA

Require: Symmetric matrices {Ai,Bi}i=1n\{A_i, B_i\}_{i=1}^{n} in one community; budget κ\kappa; initial steps ηW\eta_W, ηs\eta_s; backtracking factor β∈(0,1)\beta\in(0,1)

Ensure: Alignment WW, relaxed support ss, and hard support V^\widehat{\mathcal{V}}

  1. Initialize W←IpW \leftarrow I_p or a random orthogonal matrix; initialize s∈Sκs \in\mathcal{S}_{\kappa}

  2. repeat

  3. S←diag⁡(s)S \leftarrow\operatorname{diag}(s) and Mi←SBiSM_i \leftarrow SB_iS for i=1,…,ni=1,\ldots,n

  4. GW←2∑i=1nAiWMiG_W \leftarrow2\sum_{i=1}^{n} A_iWM_i and W+(η)←ΠO(p)(W+ηGW)W^{+}(\eta) \leftarrow\Pi_{O(p)}(W+\eta G_W)

  5. Choose the largest η∈{ηWβm:m≥0}\eta\in\{\eta_W\beta^m:m\geq0\} satisfying J(W+(η),s)≥J(W,s)J(W^{+}(\eta),s)\geq J(W,s), and set W←W+(η)W \leftarrow W^{+}(\eta)

  6. D←sym⁡{∑i=1n(WTAiW)∘Bi}D \leftarrow\operatorname{sym}\{\sum_{i=1}^{n}(W^{\mathsf{T}}A_iW)\circ B_i\}

  7. gs←2Dsg_s \leftarrow2Ds and s+(η)←ΠSκ(s+ηgs)s^{+}(\eta)\leftarrow\Pi_{\mathcal{S}_{\kappa}}(s+\eta g_s)

  8. Choose the largest η∈{ηsβm:m≥0}\eta\in\{\eta_s\beta^m:m\geq0\} satisfying J(W,s+(η))≥J(W,s)J(W,s^{+}(\eta))\geq J(W,s), and set s←s+(η)s\leftarrow s^{+}(\eta)

  9. until the objective and iterate changes satisfy the stopping tolerances

  10. V^←Top⁡κ(s)\widehat{\mathcal{V}}\leftarrow\operatorname{Top}_{\kappa}(s)

  11. return WW, ss, V^\widehat{\mathcal{V}}

Fixing each community, our target is to recover a shared subset of brain regions V⊆{1,…,p}\mathcal{V}\subseteq\{1,\ldots,p\}, where ∣V∣≤κ|\mathcal{V}|\leq\kappa, such that the V\mathcal{V}-induced SC subgraph has maximal agreement with the FC geometry across subjects. This V\mathcal{V}-induced SC subgraph thus serves as a structural backbone for the FC patterns.

The canonical Ossa

Let O(p)O(p) be the set of all p×pp\times p orthogonal matrices, and write S=diag⁡(s)S=\operatorname{diag}(s). Fixing one community, the OSSA problem is defined as the following optimization problem

max⁡W,sJ(W,s)=∑i=1nTr⁡[(WTAiW)(SBiS)](1)\max_{W,s}\quad J(W,s)=\sum_{i=1}^{n}\operatorname{Tr}\left[(W^{\mathsf{T}}A_iW)(SB_iS)\right] \tag*{(1)}
s.t.WTW=Ip,s∈{0,1}p,1Ts=κ.\text{s.t.}\quad W^{\mathsf{T}}W=I_p,\qquad s\in\{0,1\}^{p},\qquad\mathbf{1}^{\mathsf{T}}s=\kappa.

where Tr is the trace operator. Two parameters are introduced in the OSSA problem. The selection vector ss identifies a subset of nodes from the SC, such that SBiSSB_iS represents the induced structural subgraph of BiB_i. Concurrently, the rotation matrix WW captures a shared cross-modal transformation mapping. The objective function J(W,s)J(W,s) explicitly evaluates the alignment between the transformed FC matrix and the corresponding induced SC subgraph. Because the induced matrix SBiSSB_iS is generally expected to form a locally dense structural module within the selected node set, it can be conceptualized as a structural clique of the SC network, a topological connectivity pattern widely documented in empirical connectome studies [34, 39, 33]. Both components are indispensable to this formulation: without the orthogonal transformation WW, the model would impose an exact coordinate-level comparability between FC and SC, a restrictive assumption rarely supported by empirical connectome data. Conversely, without the sparse selection vector ss, the objective degenerates into a global alignment metric, failing to achieve precise anatomical localization. As OSSA is formulated within individual functional communities, its integration with functional community detection establishes a hierarchical refinement of the cross-modal SC-FC relationship.

Directly optimizing the objective in (1) is NP-hard due to the combinatorial nature of the binary constraints. To circumvent these difficulties, we employ a continuous relaxation of the domain for ss, formulating the following surrogate optimization problem.

max⁡W∈O(p), s∈SκJ(W,s),Sκ={s∈[0,1]p:1Ts≤κ}.(2)\max_{W\in O(p),\,s\in\mathcal{S}_{\kappa}} J(W,s),\qquad\mathcal{S}_{\kappa}=\{s\in[0,1]^{p}:\mathbf{1}^{\mathsf{T}}s\leq\kappa\}. \tag*{(2)}

Upon solving the relaxed formulation in (2), the final induced subnetwork is recovered via a hard thresholding procedure, V^=Top⁡κ(s^)\widehat{\mathcal{V}}=\operatorname{Top}_{\kappa}(\widehat{s}), where Top⁡κ\operatorname{Top}_{\kappa} extracts the indices corresponding to the κ\kappa largest entries. This continuous relaxation preserves the natural interpretation of ss as a soft subgraph-membership indicator while simultaneously rendering the optimization computationally tractable. We solve (2) by a projected block-coordinate ascent procedure, outlined in Algorithm 1.

Theoretical properties. We study (2) within a fixed population community. The matrices restricted to that community satisfy the sampling conditions in Assumptions A1–A2. Define

Jˉn(W,s)=J(W,s)n,J(W,s)=EJˉn(W,s).(3)\bar{J}_n(W,s)=\frac{J(W,s)}{n},\qquad\mathcal{J}(W,s)=\mathbb{E}\bar{J}_n(W,s). \tag*{(3)}

For V⊆{1,…,p}V\subseteq\{1,\ldots,p\}, let 1V\mathbf{1}_V be its indicator vector and PV=diag⁡(1V)P_V=\operatorname{diag}(\mathbf{1}_V). Fix V⋆V^\star with ∣V⋆∣=κ\lvert V^\star\rvert=\kappa and write u⋆=1V⋆u^\star=\mathbf{1}_{V^\star}. Assumption A3 specifies a compact smooth embedded submanifold W⋆⊂O(p)\mathcal{W}^\star\subset O(p) and a rank-κ\kappa orthogonal projector Π⋆\Pi^\star such that J(U,u⋆)=J⋆\mathcal{J}(U,u^\star)=J^\star, grad⁡WJ(U,u⋆)=0\operatorname{grad}_{\mathcal{W}}\mathcal{J}(U,u^\star)=0, and UPV⋆UT=Π⋆UP_{V^\star}U^\mathsf{T}=\Pi^\star for every U∈W⋆U\in\mathcal{W}^\star, where grad⁡W\operatorname{grad}_{\mathcal{W}} denotes the gradient for the Frobenius metric on O(p)O(p). We let J⋆J^\star denote the common value of the population alignment objective J(U,u⋆)\mathcal{J}(U,u^\star) for U∈W⋆U\in\mathcal{W}^\star. Under the curvature condition in Assumption A4, each such alignment is a local maximizer of J(⋅,u⋆)\mathcal{J}(\cdot,u^\star). The matrices in W⋆\mathcal{W}^\star are therefore stationary alignments whose columns indexed by V⋆V^\star span the same subspace.

Theorem 1 establishes the existence of local maximizers satisfying (133) and proves s^=u⋆\widehat{s}=u^\star and the bound on ∥W^PV⋆W^T−Π⋆∥F\lVert\widehat{W}P_{V^\star}\widehat{W}^{\mathsf{T}}-\Pi^\star\rVert_F in (4) for every such maximizer.

References

  1. [1]Farras Abdelnour, Henning U. Voss, and Ashish Raj. Network diffusion accurately models the relationship between structural and functional brain connectivity networks. NeuroImage, 90:335–347, 2014. doi: 10.1016/j.neuroimage.2013.12.039.DOI
  2. [2]P-A Absil, Robert Mahony, and Rodolphe Sepulchre. Optimization algorithms on matrix manifolds. Princeton University Press, 2008.DOI
  3. [3]Joshua Agterberg, Zachary Lubberts, and Jesús Arroyo. Joint spectral clustering in multilayer degree-corrected stochastic blockmodels. Journal of the American Statistical Association, 120 (551):1607–1620, 2025. doi: 10.1080/01621459.2025.2516201.DOI
  4. [4]Graham L. Baum, Zaixu Cui, David R. Roalf, Rastko Ciric, Richard F. Betzel, Bart Larsen, Matthew Cieslak, Philip A. Cook, Cedric H. Xia, Tyler M. Moore, Kosha Ruparel, Desmond J. Oathes, Aaron C. F. Alexander-Bloch, Russell T. Shinohara, Armin Raznahan, Raquel E. Gur, Ruben C. Gur, Danielle S. Bassett, and Theodore D. Satterthwaite. Development of structure–function coupling in human brain networks during youth. Proceedings of the National Academy of Sciences of the United States of America, 117(1):771–778, 2020. doi: 10.1073/pnas.1912034117.DOI
  5. [5]Ed Bullmore and Olaf Sporns. Complex brain networks: graph theoretical analysis of structural and functional systems. Nature Reviews Neuroscience, 10(3):186–198, 2009. doi: 10.1038/nrn2575.DOI
  6. [6]B.J. Casey, Tariq Cannonier, May I. Conley, et al. The adolescent brain cognitive development (abcd) study: Imaging acquisition across 21 sites. Developmental Cognitive Neuroscience, 32:43–54, 2018. doi: 10.1016/j.dcn.2018.03.001.DOI
  7. [7]Andrew A. Chen, Dhivya Srinivasan, Raymond Pomponio, Yong Fan, Ilya M. Nasrallah, Susan M. Resnick, Lori L. Beason-Held, Christos Davatzikos, Theodore D. Satterthwaite, Dani S. Bassett, Russell T. Shinohara, and Haochang Shou. Harmonizing functional connectivity reduces scanner effects in community detection. NeuroImage, 256:119198, 2022. ISSN 1053–8119. doi: https://doi.org/10.1016/j.neuroimage.2022.119198.
  8. [8]Kehui Chen and Jing Lei. Network cross-validation for determining the number of communities in network data. Journal of the American Statistical Association, 113(521):241–251, 2018. doi: 10.1080/01621459.2016.1246365.
  9. [9]Hyonho Chun and Sündüz Keleş. Sparse partial least squares regression for simultaneous dimension reduction and variable selection. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 72(1):3–25, 2010. doi: 10.1111/j.1467-9868.2009.00723.x.DOI
  10. [10]R. Cameron Craddock, G. Andrew James, Paul E. Holtzheimer III, Xiaoping P. Hu, and Helen S. Mayberg. A whole brain fMRI atlas generated via spatially constrained spectral clustering. Human Brain Mapping, 33(8):1914–1928, 2012. doi: 10.1002/hbm.21333.DOI
  11. [11]Rahul S. Desikan et al. An automated labeling system for subdividing the human cerebral cortex on mri scans into gyral based regions of interest. NeuroImage, 31(3):968–980, 2006. doi: 10.1016/j.neuroimage.2006.01.021.DOI
  12. [12]John Duchi, Shai Shalev-Shwartz, Yoram Singer, and Tushar Chandra. Efficient projections onto the ℓ₁-ball for learning in high dimensions. In Proceedings of the 25th International Conference on Machine Learning, pages 272–279. ACM, 2008. doi: 10.1145/1390156.1390191.DOI
  13. [13]Alan Edelman, Tomás A Arias, and Steven T Smith. The geometry of algorithms with orthogonality constraints. SIAM journal on Matrix Analysis and Applications, 20(2):303–353, 1998.arxiv.org/abs/physics/9806030
  14. [14]Ernesto Estrada and Naomichi Hatano. Communicability in complex networks. Physical Review E, 77(3):036111, 2008. doi: 10.1103/PhysRevE.77.036111.DOI
  15. [15]Panagiotis Fotiadis, Linden Parkes, Kathryn A. Davis, Theodore D. Satterthwaite, Russell T. Shinohara, and Dani S. Bassett. Structure-function coupling in macroscale human brain networks. Nature Reviews Neuroscience, 25(10):688–704, 2024. doi: 10.1038/s41583-024-00846-6.DOI
  16. [16]Karl J. Friston. Functional and effective connectivity in neuroimaging: a synthesis. Human Brain Mapping, 2(1-2):56–78, 1994. doi: 10.1002/hbm.460020107.DOI
  17. [17]Simiao Gao, Zhiling Gu, Shengxian Ding, Gefei Wang, Zhengwu Zhang, Hongyu Zhao, and Yize Zhao. Brain functional–structural gradient coupling reflects development, behavior and genetic influences. Nature Communications, 2026. doi: 10.1038/s41467-026-71719-y.DOI
  18. [18]Javier O. Garcia, Arian Ashourvan, Sarah Muldoon, Jean M. Vetterl, and Danielle S. Bassett. Applications of community detection techniques to brain graphs: Algorithmic considerations and implications for neural function. Proceedings of the IEEE, 106(5):846–867, 2018. doi: 10.1109/JPROC.2017.2786710.DOI
  19. [19]Joaquín Goñi, Martijn P. van den Heuvel, Andrea Avena-Koenigsberger, Nieves Vélez de Mendizábal, Richard F. Betzel, Alessandra Griffa, Patric Hagmann, Bernat Corominas-Murtra, Jean-Philippe Thiran, and Olaf Sporns. Resting-brain functional connectivity predicted by analytic measures of network communication. Proceedings of the National Academy of Sciences of the United States of America, 111(2):833–838, 2014. doi: 10.1073/pnas.1315529111.DOI
  20. [20]Donald J. Hagler, Jr., Sean N. Hatton, M. Daniela Cornejo, Carolina Makowski, Damien A. Fair, Anthony Steven Dick, Matthew T. Sutherland, B. J. Casey, Deanna M. Barch, Michael P. Harms, Richard Watts, James M. Bjork, Hugh P. Garavan, Anders M. Dale, et al. Image processing and analysis methods for the adolescent brain cognitive development study. NeuroImage, 202: 116091, 2019. doi: 10.1016/j.neuroimage.2019.116091.DOI
  21. [21]Nicholas J. Higham. Computing the polar decomposition—with applications. SIAM Journal on Scientific and Statistical Computing, 7(4):1160–1174, 1986. doi: 10.1137/0907079.DOI
  22. [22]Christopher J. Honey, Olaf Sporns, Leila Cammoun, Xavier Gigandet, Jean-Philippe Thiran, Reto Meuli, and Patric Hagmann. Predicting human resting-state functional connectivity from structural connectivity. Proceedings of the National Academy of Sciences, 106(6):2035–2040, 2009. doi: 10.1073/pnas.081116806.DOI
  23. [23]Jeremy Kawahara, Colin J. Brown, Steven P. Miller, Brian G. Booth, Yann Chau, Ruth E. Grunau, Jill G. Zwicker, and Ghassan Hamarneh. Brainnetcnn: Convolutional neural networks for brain networks; towards predicting neurodevelopment. NeuroImage, 146:1038–1049, 2017. ISSN 1053-8119. doi: https://doi.org/10.1016/j.neuroimage.2016.09.046.
  24. [24]Daniel D. Lee and H. Sebastian Seung. Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755):788–791, 1999. doi: 10.1038/44565.DOI
  25. [25]John M. Lee. Introduction to Smooth Manifolds, volume 218 of Graduate Texts in Mathematics. Springer, New York, 2 edition, 2013. doi: 10.1007/978-1-4419-9982-5.DOI
  26. [27]Tianxi Li, Elizaveta Levina, and Ji Zhu. Network cross-validation by edge sampling. Biometrika, 107(2):257–276, 2020. doi: 10.1093/biomet/asaa006.DOI
  27. [28]Xiaoxiao Li, Yuan Zhou, Nicha Dvornek, Muhan Zhang, Siyuan Gao, Juntang Zhuang, Dustin Scheinost, Lawrence H. Staib, Pamela Ventola, and James S. Duncan. BrainGNN: Interpretable brain graph neural network for fMRI analysis. Medical Image Analysis, 74:102233, 2021. doi: 10.1016/j.media.2021.102233.DOI
  28. [29]Daniel S. Margulies, Satraljit S. Ghosh, Alexandros Goulas, Marcel Falkiewicz, Julia M. Huntenburg, Georg Langs, Gleb Bezgin, Simon B. Eickhoff, F. Xavier Castellanos, Michael Petrides, Elizabeth Jefferies, and Jonathan Smallwood. Situating the default-mode network along a principal gradient of macroscale cortical organization. Proceedings of the National Academy of Sciences of the United States of America, 113(44):12574–12579, 2016. doi: 10.1073/pnas.1608282113.DOI
  29. [30]M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 69:026113, Feb 2004. doi: 10.1103/PhysRevE.69.026113.DOI
  30. [31]Yang Ning and Han Liu. High-dimensional semiparametric bigraphical models. Biometrika, 100(3):655–670, 2013.DOI
  31. [32]Maria Giulia Preti and Dimitri Van De Ville. Decoupling of brain function from structure reveals regional behavioral specialization in humans. Nature Communications, 10(1):4747, 2019. doi: 10.1038/s41467-019-12765-7.DOI
  32. [33]Reddy Rani Vangimalla and Jaya Sreevalsan-Nair. Communities and cliques in functional brain network using multiscale consensus approach. IEEE Transactions on Neural Systems and Rehabilitation Engineering, 30:1951–1960, 2022.DOI
  33. [34]Michael W. Reimann, Max Nolte, Martina Scolamiero, Katharine Turner, Rodrigo Perin, Giuseppe Chindemi, Paweł Dłotko, Ran Levi, Kathryn Hess, and Henry Markram. Cliques of neurons bound into cavities provide a missing link between structure and function. Frontiers in Computational Neuroscience, Volume 11 - 2017, 2017. ISSN 1662-5188. doi: 10.3389/fncom.2017.00048.DOI
  34. [35]Peter J. Rousseeuw. Silhouettes: A graphical aid to the interpretation and validation of cluster analysis. Journal of Computational and Applied Mathematics, 20:53–65, 1987. doi: 10.1016/0377-0427(87)90125-7.DOI
  35. [36]Mikail Rubinov and Olaf Sporns. Complex network measures of brain connectivity: uses and interpretations. NeuroImage, 52(3):1059–1069, 2010. doi: 10.1016/j.neuroimage.2009.10.003.DOI
  36. [37]Peter H. Schönemann. A generalized solution of the orthogonal Procrustes problem. Psychometrika, 31(1):1–10, 1966. doi: 10.1007/BF02289451.DOI
  37. [38]Caio Seguin, Ye Tian, and Andrew Zalesky. Network communication models improve the behavioral and functional predictive utility of the human structural connectome. Network Neuroscience, 4(4):980–1006, 2020. doi: 10.1162/netn_a_00161.DOI
  38. [39]Ann E. Sizemore, Chad Giusti, Ari Kahn, Jean M. Vettel, Richard F. Betzel, and Danielle S. Bassett. Cliques and cavities in the human connectome. J. Comput. Neurosci., 44(1):115–145, February 2018. ISSN 0929-5313. doi: 10.1007/s10827-017-0672-6.DOI
  39. [40]O. Sporns. Structure and function of complex brain networks. Dialogues in Clinical Neuroscience, 15(3):247–262, 2013. doi: 10.31887/DCNS.2013.15.3/osporns.DOI
  40. [41]Laura E. Suárez, Ross D. Markello, Richard F. Betzel, and Bratislav Mišić. Linking structure and function in macroscale brain networks. Trends in Cognitive Sciences, 24(4):302–315, 2020. doi: 10.1016/j.tics.2020.01.008.DOI
  41. [42]Bertha Vázquez-Rodríguez, Laura E. Suárez, Ross D. Markello, Golia Shafiei, Casey Paquola, Patric Hagmann, Martijn P. van den Heuvel, Boris C. Bernhardt, R. Nathan Spreng, and Bratislav Mišić. Gradients of structure–function tethering across neocortex. Proceedings of the National Academy of Sciences of the United States of America, 116(42):21219–21227, 2019. doi: 10.1073/pnas.1903403116.
  42. [43]Roman Vershynin. High-Dimensional Probability: An Introduction with Applications in Data Science. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge, 2018. ISBN 9781108415194. doi: 10.1017/9781108231596.DOI
  43. [44]Joshua T. Vogelstein, John M. Conroy, Vince Lyzinski, Louis J. Podrazik, Steven G. Kratzer, Eric T. Harley, Donniell E. Fishkind, R. Jacob Vogelstein, and Carey E. Priebe. Fast approximate quadratic programming for graph matching. PLOS ONE, 10(4):e0121002, 2015. doi: 10.1371/journal.pone.0121002.DOI
  44. [45]Ulrike von Luxburg. A tutorial on spectral clustering. Statistics and Computing, 17(4):395–416, 2007. doi: 10.1007/s11222-007-9033-z.
  45. [46]Reinder Vos de Wael, Oualid Benkarim, Casey Paquola, Sara Larivière, Jessica Royer, Shahin Tavakol, Ting Xu, Seok-Jun Hong, Georg Langs, Sofie Valk, Bratislav Misic, Michael Milham, Daniel Margulies, Jonathan Smallwood, and Boris C. Bernhardt. Brainspace: A toolbox for the analysis of macroscale gradients in neuroimaging and connectomics datasets. Communications Biology, 3(1):103, 2020. doi: 10.1038/s42003-020-0794-7.DOI
  46. [47]Martin J Wainwright. High-dimensional statistics: A non-asymptotic viewpoint, volume 48. Cambridge university press, 2019.
  47. [48]Weiran Wang and Canyi Lu. Projection onto the capped simplex. arXiv preprint arXiv:1503.01002, 2015. doi: 10.48550/arXiv.1503.01002.DOI
  48. [49]B. T. Thomas Yeo, Fenna M. Krienen, Jorge Sepulcre, Mert R. Sabuncu, Danial Lashkari, Marisa Hollinshead, Joshua L. Roffman, Jordan W. Smoller, Lilla Zöllei, Jonathan R. Polimeni, Bruce Fischl, Hesheng Liu, and Randy L. Buckner. The organization of the human cerebral cortex estimated by intrinsic functional connectivity. Journal of Neurophysiology, 106(3):1125–1165, 2011. doi: 10.1152/jn.00338.2011.DOI
  49. [50]Andrew Zalesky, Alex Fornito, and Edward T. Bullmore. Network-based statistic: identifying differences in brain networks. NeuroImage, 53(4):1197–1207, 2010. doi: 10.1016/j.neuroimage.2010.06.041.DOI
  50. [51]Farnaz Zamani Esfahlani, Joshua Faskowitz, Jonah Slack, Bratislav Mišić, and Richard F. Betzel. Local structure–function relationships in human brain networks across the lifespan. Nature Communications, 13(1):2053, 2022. doi: 10.1038/s41467-022-29770-y.DOI

Paper details

vlnc:W_53zf34tm
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 6

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents