Degree-biased advection–diffusion on undirected graphs/networks
From MaRDI portal
Publication:6043832
DOI10.1051/mmnp/2022034zbMath1511.05148MaRDI QIDQ6043832
Manuel J. Miranda, Ernesto Estrada
Publication date: 25 May 2023
Published in: Mathematical Modelling of Natural Phenomena (Search for Journal in Brave)
Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Applications of operator theory in chemistry and life sciences (47N60) Mathematical biology in general (92B99) Flows in graphs (05C21)
Cites Work
- Unnamed Item
- Unnamed Item
- Reaction-diffusion-advection models for the effects and evolution of dispersal
- Multiscale modelling of fluid and drug transport in vascular tumours
- Movement toward better environments and the evolution of rapid diffusion
- Advection-diffusion equations for generalized tactic searching behaviors
- Laplacian matrices of graphs: A survey
- Hubs-biased resistance distances on graphs and networks
- Discrete advection-diffusion equations on graphs: maximum principle and finite volumes
- `Hubs-repelling' Laplacian and related diffusion on graphs/networks
- Assortativity measures for weighted and directed networks
- Hubs-attracting Laplacian and Related Synchronization on Networks
- Advection-mediated coexistence of competing species
- Beyond diffusion: modelling local and long-distance dispersal for organisms exhibiting intensive and extensive search modes
This page was built for publication: Degree-biased advection–diffusion on undirected graphs/networks
