Dopamine-related alterations in functional brain network dynamic reconfiguration in Parkinson's disease.
The 2 matches · all tie a paragraph to a whole file, not to given lines: weak matches, whose lines are not tinted
- [1] § Methods › Dynamic network reconfiguration measures ↔ HelperFunctions/multiord.m, the whole file · a weak match · score 0.58 · multilayer community detection, resolution parameters, Intralayer, correlation, temporal, GenLouvain
- [2] § Methods › Dynamic network reconfiguration measures ↔ HelperFunctions/multiord_f.m, the whole file · a weak match · score 0.58 · multilayer community detection, resolution parameters, Intralayer, correlation, temporal, GenLouvain
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 · 133 lines · 5.5 KB · BSD-2-Clause · 1 match
- function [B,twom] = multiord(A,gamma,omega)
- %MULTIORD returns multilayer Newman-Girvan modularity matrix for ordered layers, matrix version
- % Works for directed or undirected networks
- %
- % Version: 2.2.0
- % Date: Thu 11 Jul 2019 12:25:42 CEST
- %
- % Input: A: Cell array of NxN adjacency matrices for each layer of an
- % ordered multilayer (directed or undirected) network
- % gamma: intralayer resolution parameter
- % omega: interlayer coupling strength
- %
- % Output: B: [NxT]x[NxT] flattened modularity tensor for the
- % multilayer network with uniform ordinal coupling (T is
- % the number of layers of the network)
- % mm: normalisation constant
- %
- % Example of usage: [B,mm]=multiord(A,gamma,omega);
- % [S,Q]= genlouvain(B); % see iterated_genlouvain.m and
- % postprocess_temporal_multilayer.m for how to improve output
- % multilayer partition
- % Q=Q/mm;
- % S=reshape(S,N,T);
- %
- % [B,mm] = MULTIORD(A,GAMMA, OMEGA) with A a cell array of square
- % (symmetric or assymetric) matrices of equal size each representing a
- % directed or undirected network "layer" computes the Newman Girvan multilayer
- % modularity matrix using the quality function described in Mucha et al.
- % 2010, with intralayer resolution parameter GAMMA, and with interlayer
- % coupling OMEGA connecting nearest-neighbor ordered layers. The null
- % model used for the quality function is the Newman-Girvan null model
- % (see e.g. Bazzi et al. for other possible null models). Once the
- % mulilayer modularity matrix is computed, optimization can be performed
- % by the generalized Louvain code GENLOUVAIN or ITERATED_GENLOUVAIN. The
- % sparse output matrix B can be used with other heuristics, provided the
- % same mapping is used to go from the multilayer tensor to the multilayer
- % flattened matrix. That is, the node-layer tuple (i,s) is mapped to
- % i + (s-1)*N. [Note that we can define a mapping between a multilayer
- % partition S_m stored as an N by T matrix and the corresponding flattened
- % partition S stored as an NT by 1 vector. In particular S_m = reshape(S,N,T)
- % and S = S_m(:).]
- %
- % See also
- % genlouvain heuristics: GENLOUVAIN, ITERATED_GENLOUVAIN
- % multilayer wrappers: MULTICAT, MULTICATF, MULTIORDF
- % other heuristics: SPECTRAL23
- % Kernighan-Lin improvement: KLNB
- %
- % Notes:
- % The matrices in the cell array A are assumed to be square,
- % and of equal size. These assumptions are not checked here.
- %
- % This code assumes that the sparse quality/modularity matrix B will
- % fit in memory and proceeds to build that matrix. For larger systems,
- % try MULTIORD_F for undirected layer networks and MULTIORDDIR_F
- % for directed layer networks.
- %
- % This code serves as a template and can be modified for situations
- % with other wrinkles (e.g., different intralayer null models [see eg
- % Bazzi et al. 2016 for examples], different numbers of nodes from
- % layer-to-layer, or systems which are both multiplex and longitudinal).
- % That is, this code is only a starting point; it is by no means
- % exhaustive.
- %
- % By using this code, the user implicitly acknowledges that the authors
- % accept no liability associated with that use. (What are you doing
- % with it anyway that might cause there to be a potential liability?!?)
- %
- % References:
- % Blondel, Vincent D., Jean-Loup Guillaume, Renaud Lambiotte, and
- % Etienne Lefebvre, "Fast unfolding of communities in large networks,"
- % Journal of Statistical Mechanics: Theory and Experiment, P10008
- % (2008).
- %
- % Fortunato, Santo, "Community detection in graphs," Physics Reports
- % 486, 75-174 (2010).
- %
- % Good, Benjamin H., Yves-Alexandre de Montjoye, and Aaron Clauset,
- % "Performance of modularity maximization in practical contexts,"
- % Physical Review E 81, 046106 (2010).
- %
- % Newman, Mark E. J. and Michelle Girvan. "Finding and Evaluating
- % Community Structure in Networks", Physical Review E 69, 026113 (2004).
- %
- % Elizabeth A. Leicht and Mark E. J. Newman. "Community structure in
- % Directed Networks", Physical Review Letters 100, 118703 (2008).
- %
- % Mucha, Peter J., Thomas Richardson, Kevin Macon, Mason A. Porter, and
- % Jukka-Pekka Onnela. "Community Structure in Time-Dependent,
- % Multiscale, and Multiplex Networks," Science 328, 876-878 (2010).
- %
- % Bazzi, Marya, Mason A. Porter, Stacy Williams, Mark McDonald, Daniel
- % J. Fenn, and Sam D. Howison. "Community Detection in Temporal
- % Multilayer Networks, with an Application to Correlation Networks",
- % MMS: A SIAM Interdisciplinary Journal 14, 1-41 (2016).
- %
- % Porter, M. A., J. P. Onnela, and P. J. Mucha, "Communities in
- % networks," Notices of the American Mathematical Society 56, 1082-1097
- % & 1164-1166 (2009).
- %
- % Acknowledgments:
- % Thank you to Dani Bassett, Jesse Blocher, Bruce Rogers, and Simi Wang
- % for their collaborative help which led to significant cleaning up
- % of earlier versions of our multilayer community detection codes.
- if nargin<2
- gamma=1;
- end
- if nargin<3
- omega=1;
- end
- N=length(A{1});
- T=length(A);
- if length(gamma)==1
- gamma=repmat(gamma,T,1);
- end
- B=spalloc(N*T,N*T,N*N*T+2*N*T);
- twom=0;
- for s=1:T
- kout=sum(A{s},1);
- kin=sum(A{s},2);
- mm=sum(kout);
- twom=twom+mm;
- indx=[1:N]+(s-1)*N;
- B(indx,indx)=(A{s}+A{s}')/2-gamma(s)/2.*((kin*kout+kout'*kin')/mm);
- end
- B = B + omega*spdiags(ones(N*T,2),[-N,N],N*T,N*T);
- twom=twom+2*N*(T-1)*omega;
multiord.m at commit 0fb0aa8, under BSD-2-Clause · at the source
Overview
- Biological Psychology Lab, Department of Psychology, School of Medicine and Health Sciences, Carl von Ossietzky Universität Oldenburg, Oldenburg, Germany
- Psychological Methods and Statistics, Department of Psychology, School of Medicine and Health Sciences, Carl von Ossietzky Universität Oldenburg, Oldenburg, Germany
- Mathematical Psychology, Department of Psychology, School of Medicine and Health Sciences, Carl von Ossietzky Universität Oldenburg, Oldenburg, Germany
- Research Center Neurosensory Science, Carl von Ossietzky Universität Oldenburg, Oldenburg, Germany
- Department of Neurology, School of Medicine and Health Sciences, Carl von Ossietzky Universität Oldenburg, Oldenburg, Germany
Abstract
Dopaminergic degeneration in Parkinson’s disease disrupts large-scale brain networks, yet how dopamine loss and its treatment shape the brain’s dynamic reconfiguration over time remains unknown. We combined resting-state fMRI with dopamine transporter scan in 136 drug-naive patients and 20 healthy controls from the PPMI cohort to determine how dopamine transporter availability relates to dynamic network reconfiguration, indexed by how brain regions switch communities over time. Patients showed reduced modular reconfiguration in the default-mode network. Dopamine transporter availability was differentially associated with reconfiguration, showing negative associations in visual and positive associations in limbic networks. Cognitive performance correlated with attention network reconfiguration, whereas motor impairment tracked dopamine loss. Longitudinal analyses in a subset with one year follow-up (n = 29) showed that network reconfiguration increased with dopaminergic decline, and medication modulated these dynamics toward the pattern seen in healthy controls. Our findings demonstrate that network reconfiguration captures dopamine-sensitive and cognition-relevant alterations in early Parkinson’s disease.
Reproduced under the paper's license (CC BY), from the paper cited above.
Repository
Its files are read in the Code ↔ Paper reader above, with 2 matches between paragraphs and lines of code.
GenLouvain/GenLouvain
0fb0aa8bccae4ffb5a840c8f68f8dd48f1293de2, 14 January 2024Availability: 1 check, the latest on 27 September 2026: the link answers
- 27 September 2026: the link answers
46 files
- Assignment/
assignment.h , C/C++, 16 lines - Assignment/
assignmentallpossible.m , MATLAB, 131 lines - Assignment/
assignmentoptimal.c , C, 445 lines - Assignment/
assignmentoptimal.m , MATLAB, 245 lines - Assignment/
assignmentsuboptimal1.c , C, 266 lines - Assignment/
assignmentsuboptimal1.m , MATLAB, 146 lines - Assignment/
assignmentsuboptimal2.c , C, 92 lines - Assignment/
assignmentsuboptimal2.m , MATLAB, 54 lines - Assignment/
munkres_wrap.m , MATLAB, 26 lines - Assignment/
testassignment.m , MATLAB, 207 lines - HelperFunctions/
Contents.m , MATLAB, 48 lines - HelperFunctions/
bipartite.m , MATLAB, 54 lines - HelperFunctions/
bipartite_f.m , MATLAB, 69 lines - HelperFunctions/
categorical_persistence. , MATLAB, 44 linesm - HelperFunctions/
modularity.m , MATLAB, 50 lines - HelperFunctions/
modularity_f.m , MATLAB, 50 lines - HelperFunctions/
modularitydir_f.m , MATLAB, 50 lines - HelperFunctions/
multiaspect.m , MATLAB, 114 lines - HelperFunctions/
multicat.m , MATLAB, 120 lines - HelperFunctions/
multicat_f.m , MATLAB, 131 lines - HelperFunctions/
multicatbipartite.m , MATLAB, 107 lines - HelperFunctions/
multicatbipartite_f.m , MATLAB, 132 lines - HelperFunctions/
multicatdir_f.m , MATLAB, 126 lines - HelperFunctions/
multiord.m , MATLAB, 133 lines, 1 match - HelperFunctions/
multiord_f.m , MATLAB, 140 lines, 1 match - HelperFunctions/
multiordbipartite.m , MATLAB, 110 lines - HelperFunctions/
multiordbipartite_f.m , MATLAB, 131 lines - HelperFunctions/
multiorddir_f.m , MATLAB, 123 lines - HelperFunctions/
ordinal_persistence.m , MATLAB, 41 lines - HelperFunctions/
postprocess_categorical_ , MATLAB, 126 linesmultilayer.m - HelperFunctions/
postprocess_ordinal_mult , MATLAB, 115 linesilayer.m - HelperFunctions/
sort_categorical.m , MATLAB, 39 lines - HelperFunctions/
sort_ordinal.m , MATLAB, 33 lines - MEX_SRC/
compile_mex.m , MATLAB, 27 lines - MEX_SRC/
group_handler.cpp , C++, 252 lines - MEX_SRC/
group_handler.h , C/C++, 155 lines - MEX_SRC/
group_index.cpp , C++, 130 lines - MEX_SRC/
group_index.h , C/C++, 71 lines - MEX_SRC/
matlab_matrix/ , C++, 394 linesfull.cpp - MEX_SRC/
matlab_matrix/ , C/C++, 159 linesmatlab_matrix.h - MEX_SRC/
matlab_matrix/ , C++, 514 linessparse.cpp - MEX_SRC/
metanetwork_reduce.cpp , C++, 159 lines - genlouvain.m, MATLAB, 378 lines
- iterated_genlouvain.m, MATLAB, 233 lines
- License.txt, License, 27 lines
- README.md, Text, 150 lines
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:
- 1 repository of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
- 44 scripts, each with its path and the digest of its content;
- 2 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 availability
Data used in this project were downloaded from the Parkinson’s Progression Markers Initiative (PPMI) database (https://
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, 27 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 6 authors, 3 keywords, 1 funder, 82 references, 4 RRIDs.
Cite
This paper
Abdolalizadeh, A., Burkhardt, M., Jahansa, P., Gießing, C., Witt, K., & Thiel, C. M. (2026). Dopamine-related alterations in functional brain network dynamic reconfiguration in Parkinson's disease. NPJ Parkinson's disease, 12(1), 175. https://
BibTeX
@article{abdolalizadeh20
author = {Abdolalizadeh, AmirHussein and Burkhardt, Micha and Jahansa, Paria and Gießing, Carsten and Witt, Karsten and Thiel, Christiane M},
title = {{Dopamine-related alterations in functional brain network dynamic reconfiguration in Parkinson's disease}},
journal = {NPJ Parkinson's disease},
year = {2026},
month = jul,
volume = {12},
number = {1},
pages = {175},
publisher = {Nature Publishing Group},
issn = {2373-8057},
doi = {10.1038/
url = {https://
pmid = {42481479},
pmcid = {PMC13388714}
}
RIS
TY - JOUR
AU - Abdolalizadeh, AmirHussein
AU - Burkhardt, Micha
AU - Jahansa, Paria
AU - Gießing, Carsten
AU - Witt, Karsten
AU - Thiel, Christiane M
TI - Dopamine-related alterations in functional brain network dynamic reconfiguration in Parkinson's disease
T2 - NPJ Parkinson's disease
J2 - NPJ Parkinsons Dis
PY - 2026
DA - 2026/
VL - 12
IS - 1
SP - 175
SN - 2373-8057
PB - Nature Publishing Group
DO - 10.1038/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1038/
"type": "article-journal",
"title": "Dopamine-related alterations in functional brain network dynamic reconfiguration in Parkinson's disease",
"container-title": "NPJ Parkinson's disease",
"author": [
{
"family": "Abdolalizadeh",
"given": "AmirHussein"
},
{
"family": "Burkhardt",
"given": "Micha"
},
{
"family": "Jahansa",
"given": "Paria"
},
{
"family": "Gießing",
"given": "Carsten"
},
{
"family": "Witt",
"given": "Karsten"
},
{
"family": "Thiel",
"given": "Christiane M"
}
],
"container-title-short":
"volume": "12",
"issue": "1",
"page": "175",
"DOI": "10.1038/
"PMID": "42481479",
"PMCID": "PMC13388714",
"ISSN": "2373-8057",
"publisher": "Nature Publishing Group",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
7,
21
]
]
}
}
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.1016/j.ibneur.2026.06.002
- Altered static and dynamic functional network connectivity in Parkinson's disease: A multisite functional magnetic resonance imaging study.Journal: IBRO neuroscience reportsIn common: Parkinson's, 6 references
- [2] doi:10.1038/s41467-026-75959-w [code]
- Charting higher-order models of brain function beyond pairwise interactions.Journal: Nature communicationsIn common: Statistics and Machine Learning Toolbox, 7 references
- [3] doi:10.1038/s41531-026-01354-3 [code]
- Neuromodulation-induced normalization of cortical metastable dynamics signatures in Parkinson's disease.Journal: NPJ Parkinson's diseaseIn common: Statistics and Machine Learning Toolbox, Parkinson's, 5 references
- [4] doi:10.1371/journal.pbio.3003684 [code]
- The retrieval of previously learned motor memories is facilitated by the reinstatement of default mode network manifold structures.Journal: PLoS biologyIn common: 7 references
- [5] doi:10.1038/s41467-026-75585-6 [code]
- Brain network dynamics reflect psychiatric illness status and transdiagnostic symptom profiles across health and disease.Journal: Nature communicationsIn common: 6 references
- [6] doi:10.1016/j.isci.2026.115949 [code]
- The dual interpretation of edge time series: Time-varying connectivity versus statistical interaction.Journal: iScienceIn common: Statistics and Machine Learning Toolbox, 5 references
- [7] doi:10.1002/hbm.70480 [code]
- Time-Varying Brain Functional Reconfiguration Patterns Associated With Fatigue in Multiple Sclerosis.Journal: Human brain mappingIn common: 4 references
- [8] doi:10.1002/hbm.70627 [code]
- Investigating the Contribution of Molecular-Enriched Functional Connectivity to Brain-Age Analysis.Journal: Human brain mappingIn common: 6 references
- [9] doi:10.7554/elife.103097 [code]
- Canonical neurodevelopmental trajectories of structural and functional manifolds.Journal: eLifeIn common: Statistics and Machine Learning Toolbox, 5 references
- [10] 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: 6 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: 1 repository of the authors' code, each at its verified commit and with its license, 44 scripts, and 2 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:50057e44671d007d…
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.
