A multiscale theory for network advection- reaction-diffusion.
Overview
- Max Planck Institute for Plant Breeding Research, Cologne, 50829 Germany
- Dipartimento di Matematica, Università di Roma Tor Vergata, Rome, 00133 Italy
- Mathematical Institute, University of Oxford, Oxford, OX2 6GG UK
Abstract
Mathematical network models are extremely useful to capture complex propagation processes between different regions (nodes), e.g. the spread of an infectious agent between different countries, or the transport and replication of toxic proteins across different brain regions in neurodegenerative diseases. In these models, transport is modelled at the macroscale through an operator, the so-called graph Laplacian, based on the edge properties and topology, capturing the fluxes between different nodes of the network. However, this phenomenological approach fails to take into account the physical processes taking place, at the microscale, within the edge. A fundamental problem is then to obtain a transport operator from mechanistic principles based on the underlying transport process. Using advection-reaction-diffu
Reproduced under the paper's license (CC BY), from the paper cited above.
Code
The paper says that its authors' code is available on request: it was not published with the paper, so there is nothing to verify.
The paper's code and data availability statement is in the Data section.
Tracing map
A tracing map links a paper to the code its authors published: this paper has none (its code is available on request), so it has no map.
Data
No dataset and no data link were found in the paper.
Data Availability Statement
Wolfram Mathematica notebooks are available upon request.
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, 29 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 3 authors, 3 keywords, 8 MeSH terms, 1 funder, 22 references.
Cite
This paper
Oliveri, H., Cozzolino, E., & Goriely, A. (2026). A multiscale theory for network advection- reaction-diffusion. Journal of mathematical biology, 92(5), 65. https://
BibTeX
@article{oliveri2026mult
author = {Oliveri, Hadrien and Cozzolino, Emilia and Goriely, Alain},
title = {{A multiscale theory for network advection- reaction-diffusion}},
journal = {Journal of mathematical biology},
year = {2026},
month = apr,
volume = {92},
number = {5},
pages = {65},
publisher = {Springer Science+Business Media},
issn = {0303-6812},
doi = {10.1007/
url = {https://
pmid = {41954762},
pmcid = {PMC13065590}
}
RIS
TY - JOUR
AU - Oliveri, Hadrien
AU - Cozzolino, Emilia
AU - Goriely, Alain
TI - A multiscale theory for network advection- reaction-diffusion
T2 - Journal of mathematical biology
J2 - J Math Biol
PY - 2026
DA - 2026/
VL - 92
IS - 5
SP - 65
SN - 0303-6812
PB - Springer Science+Business Media
DO - 10.1007/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1007/
"type": "article-journal",
"title": "A multiscale theory for network advection- reaction-diffusion",
"container-title": "Journal of mathematical biology",
"author": [
{
"family": "Oliveri",
"given": "Hadrien"
},
{
"family": "Cozzolino",
"given": "Emilia"
},
{
"family": "Goriely",
"given": "Alain"
}
],
"container-title-short":
"volume": "92",
"issue": "5",
"page": "65",
"DOI": "10.1007/
"PMID": "41954762",
"PMCID": "PMC13065590",
"ISSN": "0303-6812",
"publisher": "Springer Science+Business Media",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
4,
9
]
]
}
}
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.1007/s00366-026-02313-5 [code]
- A computational framework to predict the spreading of Alzheimer's disease.Journal: Engineering with computersIn common: computational, 3 references
- [2] doi:10.1093/brain/awaf432
- Global network and local vulnerabilities underlie brain atrophy across Parkinson's disease stages.Journal: Brain : a journal of neurologyIn common: 3 references
- [3] doi:10.34133/research.1392 [code]
- Neuroimaging Epicenters as Vulnerable Nodes in Plasma p-tau217/
Aβ42-Positive Alzheimer's Disease. Journal: Research (Washington, D.C.)In common: 2 references - [4] doi:10.3389/fncom.2026.1810942 [code]
- The structural grammar of integration and competition in the human connectome.Journal: Frontiers in computational neuroscienceIn common: 2 references
- [5] doi:10.1038/s41467-026-72161-w [code]
- Temporal heterogeneity shapes diffusion dynamics in complex networks.Journal: Nature communicationsIn common: 2 references
- [6] doi:10.1038/s41467-026-74215-5 [code]
- Multi-metric evaluations of acute psychedelic effects on fMRI brain entropy.Journal: Nature communicationsIn common: computational, 1 reference
- [7] doi:10.1038/s41467-026-71961-4 [code]
- Spatiotemporal asymmetries on brain energy landscape uncover system entrapment related to depression severity.Journal: Nature communicationsIn common: computational, 1 reference
- [8] doi:10.1371/journal.pcbi.1014673 [code]
- Modeling the influences of non-local connectomic projections on geometrically constrained cortical dynamics.Journal: PLoS computational biologyIn common: computational, 1 reference
- [9] doi:10.1038/s41598-026-57930-3
- Accurately modeling resting-brain functional connectivity using hypergraph neural field-Fourier deep neural network.Journal: Scientific reportsIn common: computational, 1 reference
- [10] doi:10.1371/journal.pcbi.1014701 [code]
- Computer models predict differential dendritic vulnerability with ischemia and spreading depression.Journal: PLoS computational biologyIn common: computational, computational modeling (no new data)
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.
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.
