Degree-biased advection–diffusion on undirected graphs/networks
DOI10.1051/MMNP/2022034zbMATH Open1511.05148MaRDI QIDQ6043832FDOQ6043832
Authors: Manuel Miranda, Ernesto Estrada 
Publication date: 25 May 2023
Published in: Mathematical Modelling of Natural Phenomena (Search for Journal in Brave)
Recommendations
- Diffusion in Random Networks: Impact of Degree Distribution
- On a generalized diffusion problem: a complex network approach
- scientific article; zbMATH DE number 3351627
- Nonlinear diffusion through large complex networks containing regular subgraphs
- Relating Network Structure to Diffusion Properties through Stochastic Dominance
- Homogenization of diffusion processes on scale-free metric networks
- `Hubs-repelling' Laplacian and related diffusion on graphs/networks
- Random walks and diffusion on networks
- Interacting diffusions on random graphs with diverging average degrees: hydrodynamics and large deviations
- Diffusion and consensus on weakly connected directed graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Eigenvalues, singular values, and eigenvectors (15A18) Flows in graphs (05C21) Mathematical biology in general (92B99) Applications of operator theory in chemistry and life sciences (47N60)
Cites Work
- Assortativity measures for weighted and directed networks
- Title not available (Why is that?)
- Advection-mediated coexistence of competing species
- Movement toward better environments and the evolution of rapid diffusion
- Laplacian matrices of graphs: A survey
- Title not available (Why is that?)
- Reaction-diffusion-advection models for the effects and evolution of dispersal
- Advection-diffusion equations for generalized tactic searching behaviors
- Multiscale modelling of fluid and drug transport in vascular tumours
- Beyond diffusion: modelling local and long-distance dispersal for organisms exhibiting intensive and extensive search modes
- `Hubs-repelling' Laplacian and related diffusion on graphs/networks
- Hubs-biased resistance distances on graphs and networks
- Hubs-attracting Laplacian and related synchronization on networks
- Discrete advection-diffusion equations on graphs: maximum principle and finite volumes
Cited In (1)
This page was built for publication: Degree-biased advection–diffusion on undirected graphs/networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043832)
