Brain network analysis in Alzheimer's disease and mild cognitive impairment using high-density diffuse optical tomography.
The 13 matches · 6 of them tie a paragraph to a whole file, not to given lines: weak matches, whose lines are not tinted
- [1] § Results › Functional connectivity › Local dynamics ↔ matlab/FindHighNodes.m, the whole file · a weak match · score 0.81 · hub occurrence, core hubs, occurring hubs, high clustering, eigenvector centrality, properties
- [2] § Materials and Methods › Graph theory analysis ↔ matlab/Calc3NodeMotif.m, the whole file · a weak match · score 0.74 · node motifs, open triad, chain, clique, star, square
- [3] § Materials and Methods › Graph theory analysis ↔ matlab/CalcPartCoeff.m, the whole file · a weak match · score 0.68 · dorsal attention, Participation coefficients, somatomotor, temporoparietal, partitioning, modules
- [4] § Materials and Methods › Graph theory analysis ↔ matlab/CalcGraphProperties.m, lines 138–187 · score 0.66 · Brain Connectivity Toolbox, Eigenvector centrality, weights, efficiency, strength, metrics
- [5] § Results › Functional connectivity › Global dynamics ↔ src/hddot/graphTheory/gt03_plotting.py, lines 12–89 · score 0.61 · global efficiency, degree density, eigenvector centrality, graph theory, strength, HC
- [6] § Materials and Methods › Graph theory analysis ↔ src/hddot/graphTheory/gt09_motif.py, lines 37–111 · score 0.61 · open triad, chain, clique, star, motifs, square
- [7] § Results › Functional connectivity › Global dynamics ↔ src/hddot/graphTheory/gt11_correlations.py, lines 23–106 · score 0.60 · graph theory metrics, global efficiency, degree density, strength, HC, clustering
- [8] § Materials and Methods › Head modelling and registration ↔ mp2rage_run_remove_background.m, lines 56–118 · score 0.59 · bias field correcting, SPM, masks, positions
- [9] § Materials and Methods › Graph theory analysis ↔ matlab/Calc3NodeMotif.m, the whole file · a weak match · score 0.56 · adjacency matrix, undirected, quantified, Edge, thresholded, graph
- [10] § Appendix › Details of MRI acquisition ↔ mp2rage_run_remove_background.m, lines 56–118 · score 0.55 · bias field corrected, SPM, noised
- [11] § Materials and Methods › Graph theory analysis ↔ matlab/CalcModularity.m, the whole file · a weak match · score 0.55 · Louvain algorithm, Modularity, partitioning, coefficient, connectivity, Graph
- [12] § Materials and Methods › Statistical analysis ↔ src/hddot/graphTheory/gt11_correlations.py, lines 23–106 · score 0.55 · graph theory metrics, Spearman, Pearson, MMSE, FDR, Correlations
- [13] § Results › Functional connectivity › Local dynamics ↔ matlab/CalcPartCoeff.m, the whole file · a weak match · score 0.55 · dorsal attention, control network, salience, clustering, connectivity
Paper
Loaded from Europe PMC by your browser, not stored by OSCR: doi.org · Europe PMC
The paper is loaded when this pane is shown.
The authors' code
MATLAB · 83 lines · 2.9 KB · no license · 2 matches
- function motif_counts = Calc3NodeMotif(w_mtx)
- %A 3-node motif analysis involves identifying and quantifying all possible
- % triadic patterns (motifs) in a network. In an undirected network, there
- % are 2 unique 3-node motifs: triangles (fully connected 3-node subgraphs),
- % and open triads (2 nodes connected with a shared neighbor).
- %
- % Triangle motifs often indicate strong interconnectivity (e.g., cliques or
- % densely connected groups). Open triads reflect less cohesive structures.
- %
- % The adjacency matrix must be undirected and have no subgraphs (NaNs).
- % Initialize total motif counts
- norm_triangle_count = NaN(size(w_mtx,3),1);
- norm_open_triad_count = NaN(size(w_mtx,3),1);
- counts4nodes = table();
- for subj = 1:size(w_mtx, 3)
- A = w_mtx(:,:,subj);
- % Preprocessing similarity matrix
- A(isnan(A)) = 0; % replace NaNs with 0
- A_binary = A > 0; % binarize the matrix (threshold > 0)
- A_binary = max(A_binary, A_binary'); % ensure symmetry (if undirected)
- % Remove isolated nodes
- degrees = sum(A_binary, 2); % Degree of each node
- non_isolated = degrees > 0; % Logical index for non-isolated nodes
- A_filtered = A_binary(non_isolated, non_isolated);
- %A_filtered = A_binary;
- n = size(A_filtered, 1); % Number of nodes in the filtered matrix
- % total_triads = n * (n-1) * (n-2) / 6; % Total number of 3-node subgraphs
- % edge_density = sum(A_filtered(:)) / (n * (n-1)); % Density of the network
- % expected_triangles = edge_density^3 * total_triads; % Approximation for triangles
- % Initialize motif counts for subj
- triangle_count = 0;
- open_triad_count = 0;
- % Enumerate all possible triads
- for i = 1:n-2
- for j = i+1:n-1
- for k = j+1:n
- % Subgraph of 3 nodes
- subgraph = A_filtered([i j k], [i j k]);
- % Count edges in the subgraph
- edges = sum(subgraph(:)) / 2; % Divide by 2 for undirected graphs
- % Classify the subgraph
- if edges == 3
- triangle_count = triangle_count + 1;
- elseif edges == 2
- open_triad_count = open_triad_count + 1;
- end
- end
- end
- end
- % Normalization by Total Motif Count: divide the count of each motif type
- % by the total number of 3-node subgraphs in the network to get a
- % proportion.
- % The total number of 3-node subgraphs is given the Newton binomial:
- % (n choose 3) = n * (n-1) * (n-2) / 6
- counts.triangle(subj,1) = triangle_count/nchoosek(n, 3);
- counts.open_triad(subj,1) = open_triad_count/nchoosek(n, 3);
- motif_4nodes = count_4node_motifs(A_filtered);
- counts4nodes{end+1, :} = motif_4nodes{:,:} ./ nchoosek(n, 4);
- end
- counts4nodes.Properties.VariableNames = {'chain', ' star', ' triangle_extra', 'square', 'clique'};
- motif_counts = struct2table(counts);
- motif_counts = horzcat(motif_counts, counts4nodes);
- return
Calc3NodeMotif.m at commit 2205cb0, no license · at the source
Overview
- Department of Engineering, University of Cambridge, Cambridge, United Kingdom
- Department of Psychiatry, University of Cambridge School of Clinical Medicine, Cambridge, United Kingdom
- Milner Therapeutics Institute, University of Cambridge, Cambridge, United Kingdom
- School of Computer Science, University of Birmingham, Birmingham, United Kingdom
- Department of Radiology, Mayo Clinic, Rochester, MN, United States
- Sheffield Institute for Translational Neuroscience, University of Sheffield, Sheffield, United Kingdom
- Department of Physics, University of Cambridge, Cambridge, United Kingdom
Abstract
Dementia is associated with altered resting-state connectivity, measures of which could aid in its early detection and monitoring. High-density diffuse optical tomography (HD-DOT) is well suited to detect these alterations at scale due to its numerous practical advantages, but it has not yet been applied to dementia. In this study, we investigated resting-state functional connectivity across the prefrontal cortex in individuals with mild cognitive impairment (MCI, n = 22), Alzheimer’s disease (AD, n = 21), and in healthy controls (n = 22). A graph theoretical approach was taken to characterise both global and local patterns of prefrontal connectivity over a 5-minute resting period. We found that individuals with MCI exhibited denser and stronger networks with shorter path lengths, which normalised in AD, accompanied by a redistribution of network hubs that were less stable. These results perhaps reflect the recruitment of additional connections in the early stages of pathology to maintain short-term network stability, which is ultimately associated with less efficient and more fragmented network organisation in later stages. Following the demonstration of HD-DOT’s capacity to detect differences between healthy ageing and AD-type cognitive impairment, this work opens up new possibilities for the use of optical imaging in the study of this clinical population and HD-DOT’s potential for scalable clinical use.
Reproduced under the paper's license (CC BY), from the paper cited above.
Repositories
Its files are read in the Code ↔ Paper reader above, with 13 matches between paragraphs and lines of code.
emiliavioletb/ImagingNeuroscience
2205cb0f59170078fc926d37d45a6c6a4065203c, 25 April 2025Availability: 1 check, the latest on 30 September 2026: the link answers
- 30 September 2026: the link answers
33 files
- Conferences/
h01_cleaning.py , Python, 55 lines - common/
__init__.py , Python, 1 line - common/
functions.py , Python, 80 lines - main.py, Python, 16 lines
- matlab/
AnalyzeHubs.m , MATLAB, 58 lines - matlab/
Calc3NodeMotif.m , MATLAB, 83 lines, 2 matches - matlab/
CalcGraphProperties.m , MATLAB, 237 lines, 1 match - matlab/
CalcModularity.m , MATLAB, 28 lines, 1 match - matlab/
CalcPartCoeff.m , MATLAB, 79 lines, 2 matches - matlab/
CreateClustersFromParcel , MATLAB, 28 liness.m - matlab/
FindHighNodes.m , MATLAB, 82 lines, 1 match - matlab/
ProcessLocalProperties.m , MATLAB, 26 lines - matlab/
main.m , MATLAB, 110 lines - old/
gt04_linearRegression.py , Python, 48 lines - old/
gt05_radialPlots.py , Python, 64 lines - src/
clinical/ , Python, 114 linesc01_data_cleaning.py - src/
clinical/ , Python, 25 linesc02_normality_testing.py - src/
clinical/ , Python, 74 linesc03_matching.py - src/
clinical/ , Python, 41 linesc04_group_level.py - src/
clinical/ , Python, 39 linesc05_post_hoc.py - src/
clinical/ , Python, 19 linesc06_plotting.py - src/
clinical/ , Python, 21 linesc07_correlations.py - src/
hddot/ , Python, 64 linesgraphTheory/ gt01_graphTheoryCleaning .py - src/
hddot/ , Python, 89 lines, 1 matchgraphTheory/ gt03_plotting.py - src/
hddot/ , Python, 192 linesgraphTheory/ gt07_networkPlot.py - src/
hddot/ , Python, 77 linesgraphTheory/ gt08_participationcoeffi cients.py - src/
hddot/ , Python, 114 lines, 1 matchgraphTheory/ gt09_motif.py - src/
hddot/ , Python, 28 linesgraphTheory/ gt10_motif_ratio.py - src/
hddot/ , Python, 112 lines, 2 matchesgraphTheory/ gt11_correlations.py - src/
hddot/ , Python, 32 linesgraphTheory/ gt12_sig_correlations.py - src/
hddot/ , Python, 27 linesprepro/ numParcels.py - src/
hddot/ , Python, 98 linesprepro/ qualityCheck.py - README.md, Text, 1 line
benoitberanger/mp2rage
73e481a3c51001295f05c4d413f312ecc5dc733d, 18 February 2026Availability: 1 check, the latest on 30 September 2026: the link answers
- 30 September 2026: the link answers
16 files
- mp2rage_cfg_matlabbatch.
m , MATLAB, 623 lines - mp2rage_defaults.m, MATLAB, 36 lines
- mp2rage_display_volume.m
, MATLAB, 48 lines - mp2rage_generate_output_
fname.m , MATLAB, 40 lines - mp2rage_get_defaults.m, MATLAB, 24 lines
- mp2rage_lookuptable.m, MATLAB, 25 lines
- mp2rage_matlabbatch_job_
output.m , MATLAB, 115 lines - mp2rage_run_correct_T1.m
, MATLAB, 253 lines - mp2rage_run_estimate_T1.
m , MATLAB, 100 lines - mp2rage_run_interactive_
synthetic.m , MATLAB, 143 lines - mp2rage_run_remove_backg
round.m , MATLAB, 196 lines, 2 matches - mp2rage_scale_UNI.m, MATLAB, 12 lines
- mp2rage_solve_bloch.m, MATLAB, 169 lines
- mp2rage_unscale_UNI.m, MATLAB, 10 lines
- LICENSE.md, License, 27 lines
- README.md, Text, 95 lines
The paper's code and data availability statement is in the Data section.
Tracing map
Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.
What the map holds:
- 2 repositories of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
- 46 scripts, each with its path and the digest of its content;
- 13 matches between paragraphs of the paper and lines of the code (method lexical-v1);
- neither the text of the paper nor the code itself.
Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.
Data
No dataset and no data link were found in the paper.
Data and Code Availability
The code is available at www.github.com/
Reproduced under the paper's license (CC BY), from the paper cited above.
Versions
The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.
Version 1, 30 September 2026: the first record
Recorded: type, language, journal, volume, pages, dates, 11 authors, 5 keywords, 1 funder, 126 references.
Cite
This paper
Butters, E., Collins-Jones, L., Mesquita, R. C., Acharya, D., McKiernan, E., Laurell, A. A., Low, A., Srinivasan, S., O’Brien, J. T., Su, L., & Bale, G. (2026). Brain network analysis in Alzheimer's disease and mild cognitive impairment using high-density diffuse optical tomography. Imaging neuroscience (Cambridge, Mass.), 4, IMAG.a.1208. https://
BibTeX
@article{butters2026brai
author = {Butters, Emilia and Collins-Jones, Liam and Mesquita, Rickson C and Acharya, Deepshikha and McKiernan, Elizabeth and Laurell, Axel AS and Low, Audrey and Srinivasan, Sruthi and O’Brien, John T and Su, Li and Bale, Gemma},
title = {{Brain network analysis in Alzheimer's disease and mild cognitive impairment using high-density diffuse optical tomography}},
journal = {Imaging neuroscience (Cambridge, Mass.)},
year = {2026},
month = apr,
volume = {4},
pages = {IMAG.a.1208},
publisher = {MIT Press},
issn = {2837-6056},
doi = {10.1162/
url = {https://
pmid = {42052506},
pmcid = {PMC13112212}
}
RIS
TY - JOUR
AU - Butters, Emilia
AU - Collins-Jones, Liam
AU - Mesquita, Rickson C
AU - Acharya, Deepshikha
AU - McKiernan, Elizabeth
AU - Laurell, Axel AS
AU - Low, Audrey
AU - Srinivasan, Sruthi
AU - O’Brien, John T
AU - Su, Li
AU - Bale, Gemma
TI - Brain network analysis in Alzheimer's disease and mild cognitive impairment using high-density diffuse optical tomography
T2 - Imaging neuroscience (Cambridge, Mass.)
J2 - Imaging Neurosci (Camb)
PY - 2026
DA - 2026/
VL - 4
SP - IMAG.a.1208
SN - 2837-6056
PB - MIT Press
DO - 10.1162/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1162/
"type": "article-journal",
"title": "Brain network analysis in Alzheimer's disease and mild cognitive impairment using high-density diffuse optical tomography",
"container-title": "Imaging neuroscience (Cambridge, Mass.)",
"author": [
{
"family": "Butters",
"given": "Emilia"
},
{
"family": "Collins-Jones",
"given": "Liam"
},
{
"family": "Mesquita",
"given": "Rickson C"
},
{
"family": "Acharya",
"given": "Deepshikha"
},
{
"family": "McKiernan",
"given": "Elizabeth"
},
{
"family": "Laurell",
"given": "Axel AS"
},
{
"family": "Low",
"given": "Audrey"
},
{
"family": "Srinivasan",
"given": "Sruthi"
},
{
"family": "O’Brien",
"given": "John T"
},
{
"family": "Su",
"given": "Li"
},
{
"family": "Bale",
"given": "Gemma"
}
],
"container-title-short":
"volume": "4",
"page": "IMAG.a.1208",
"DOI": "10.1162/
"PMID": "42052506",
"PMCID": "PMC13112212",
"ISSN": "2837-6056",
"publisher": "MIT Press",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
4,
24
]
]
}
}
The tracing map gets a citation of its own once an author has validated it and it has a DOI.
Similar papers
The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.
- [1] doi:10.1038/s43856-026-01707-2 [code]
- Decreased amyloid-related structure-function coupling in preclinical Alzheimer's disease.Journal: Communications medicineIn common: SPM, Statistics and Machine Learning Toolbox, seaborn, 4 other tools, Alzheimer's / dementia, 7 references
- [2] doi:10.1117/1.nph.13.3.035006 [code]
- Characterizing developmental changes in infant habituation using functional change point detection.Journal: NeurophotonicsIn common: NetworkX, statsmodels, seaborn, 4 other tools, fNIRS, 5 references
- [3] doi:10.1016/j.nicl.2026.104012 [code]
- Structural-functional multilayer brain network properties and outcome of combined repetitive transcranial magnetic stimulation and psychotherapy for obsessive-compulsive disorder.Journal: NeuroImage. ClinicalIn common: Brain Connectivity Toolbox, NetworkX, SPM, 8 other tools, 3 references
- [4] doi:10.1117/1.nph.12.2.025011 [code]
- NIRSTORM: a Brainstorm extension dedicated to functional near-infrared spectroscopy data analysis, advanced 3D reconstructions, and optimal probe designJournal: n/aIn common: SPM, Statistics and Machine Learning Toolbox, Matplotlib, 1 other tool, fNIRS, 7 references
- [5] doi:10.1162/netn.a.547 [code]
- An evaluation of the efficacy of single-echo and multi-echo fMRI denoising strategies.Journal: Network neuroscience (Cambridge, Mass.)In common: statsmodels, seaborn, scikit-learn, 4 other tools, 6 references
- [6] doi:10.1117/1.nph.13.3.035002
- Disrupted functional connectivity during stroke recovery revealed via bedside optical neuroimaging.Journal: NeurophotonicsIn common: fNIRS, 8 references
- [7] doi:10.1038/s41467-026-74215-5 [code]
- Multi-metric evaluations of acute psychedelic effects on fMRI brain entropy.Journal: Nature communicationsIn common: Brain Connectivity Toolbox, NetworkX, Statistics and Machine Learning Toolbox, 4 other tools, 5 references
- [8] doi:10.1038/s41467-026-74466-2 [code]
- Neuromorphic hierarchical modular reservoirs.Journal: Nature communicationsIn common: Brain Connectivity Toolbox, NetworkX, statsmodels, 6 other tools, 3 references
- [9] doi:10.1162/imag.a.1278 [code]
- Young and old adult brains experience opposite effects of acute sleep restriction on the functional connectivity network.Journal: Imaging neuroscience (Cambridge, Mass.)In common: Brain Connectivity Toolbox, NetworkX, statsmodels, 6 other tools, 3 references
- [10] doi:10.1038/s41467-026-71831-z [code]
- Dysfunction of the episodic memory network in the Alzheimer's disease cascade.Journal: Nature communicationsIn common: SPM, Statistics and Machine Learning Toolbox, seaborn, 4 other tools, Alzheimer's / dementia, 4 references
Contribute
The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.
Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.
Claim this paper
Correct its record
Say what each link of this record is, remove the ones that are not the paper's, add the ones that are missing. The correction becomes a new version of the record, in its Versions section.
Validate its tracing map
You validate the map as this page shows it: 2 repositories of the authors' code, each at its verified commit and with its license, 46 scripts, and 13 matches between paragraphs and code (see the Code and Map sections). It then receives a DOI on Zenodo, with you (your ORCID iD) and OSCR as its creators; the code itself is not deposited.
The map's fingerprint: sha256:659923b4dd7d2746…
Add the badge to its README
The badge links the code to this page. Copy one of these into the README of the paper's code: only you decide where it goes, and nothing is changed for you.
Markdown
[, paste the snippet at the top, then “Commit changes…” and, to review it first, “Create a new branch and start a pull request”. You open the pull request; OSCR asks for no permission.
Request its removal
To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).
Discussion, reproductions, activity
Discussion: questions and error reports about this paper and its code, from signed-in readers and its authors. It opens with sign-in.
Reproductions: reports from readers who ran the authors' code: what they reproduced, with which environment, commit and data. It opens with sign-in.
Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.
