Tuned communicability metrics in networks. The case of alternative routes for urban traffic

DOI10.1016/J.CHAOS.2018.09.044MaRDI QIDQ2201378zbMATH OpenOpenAlexWikidataFDO

Authors Grant Silver, Meisam Akbarzadeh, Ernesto Estrada

Publication date 29 September 2020

Published in Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.chaos.2018.09.044

zbMATH Keywords

networksEuclidean distancesmatrix functionsrandom geometric graphsurban traffic

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20)

Recommendations

• CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS
• Communication in complex networks
• Updating and downdating techniques for optimizing network communicability
• GENERALIZED SHORTEST PATH AND TRAFFIC EQUILIBRIUM IN COMPLEX TRANSPORTATION NETWORKS
• Communicability angle and the spatial efficiency of networks

Cites work

• scientific article; zbMATH DE number 5977361 (Why is no real title available?)
• scientific article; zbMATH DE number 3163289 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• scientific article; zbMATH DE number 2230269 (Why is no real title available?)
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• A mixed ODE–PDE model for vehicular traffic
• Accounting for the role of long walks on networks via a new matrix function
• Application of averaging techniques to traffic flow theory
• Communicability angle and the spatial efficiency of networks
• Complex networks: principles, methods and applications
• Complex networks: structure and dynamics
• Generalized walks-based centrality measures for complex biological networks
• Hyperspherical embedding of graphs and networks in communicability spaces
• Metric and ultrametric spaces of resistances
• Modelling traffic flow with a time‐dependent fundamental diagram
• Network bipartivity and the transportation efficiency of European passenger airlines
• Network properties revealed through matrix functions
• On the multiscale modeling of vehicular traffic: from kinetic to hydrodynamics
• Random walks on graphs
• Some general models of traffic flow in an isolated network
• The Structure and Function of Complex Networks
• The communicability distance in graphs
• The relative neighbourhood graph of a finite planar set
• The structure and dynamics of cities. Urban data analysis and theoretical modeling

Cited in

(3)

• Matrix functions in network analysis
• GENERALIZED SHORTEST PATH AND TRAFFIC EQUILIBRIUM IN COMPLEX TRANSPORTATION NETWORKS
• Communicability angle and the spatial efficiency of networks

This page was built for publication: Tuned communicability metrics in networks. The case of alternative routes for urban traffic

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