Network efficiency under nonconservative diffusion

DOI10.1137/24M167038XMaRDI QIDQ6985151zbMATH OpenFDO

Authors Aitor Azemar, Ernesto Estrada

Publication date 13 May 2025

Published in SIAM Journal on Applied Dynamical Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M167038X

zbMATH Keywords

coimmunicabilityefficiency indexEuclidean distance matrixinformation-like dynamicsMarkov processesmatrix functions

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of graph theory (05C90) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Social networks; opinion dynamics (91D30)

Cites work

• A first course in network theory
• Complex networks: principles, methods and applications
• Complex networks: structure and dynamics
• Coupled map lattice approximations for spatially explicit individual-based models of ecology
• scientific article; zbMATH DE number 5977361 (Why is no real title available?)
• scientific article; zbMATH DE number 6256254 (Why is no real title available?)
• Hyperspherical embedding of graphs and networks in communicability spaces
• Learning influence from heterogeneous social networks
• Random walks and diffusion on networks
• Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
• Some bounds for total communicability of graphs
• The communicability distance in graphs
• The Estrada index
• The many facets of the Estrada indices of graphs and networks

Cited in

(1)

• The geometry of the Hückel/tight-binding method for modeling molecular systems

This page was built for publication: Network efficiency under nonconservative diffusion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985151)