A Google-like model of road network dynamics and its application to regulation and control
From MaRDI portal
Publication:3015166
DOI10.1080/00207179.2011.568005zbMATH Open1222.93212OpenAlexW2036995503WikidataQ56777298 ScholiaQ56777298MaRDI QIDQ3015166FDOQ3015166
Authors: Emanuele Crisostomi, S. J. Kirkland, Robert N. Shorten 
Publication date: 8 July 2011
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207179.2011.568005
Recommendations
- Markov modeling of traffic flow in smart cities
- A big-data model for multi-modal public transportation with application to macroscopic control and optimisation
- A probabilistic algorithm for aggregating vastly undersampled large Markov chains
- scientific article; zbMATH DE number 3967628
- A Markov chain model for traffic equilibrium problems
Cites Work
- A note on two problems in connexion with graphs
- Über ein Paradoxon aus der Verkehrsplanung
- The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
- On the Approximation of Complicated Dynamical Behavior
- Phase transitions and metastability in Markovian and molecular systems
- Extracting macroscopic stochastic dynamics: Model problems
- Google's PageRank and beyond. The science of search engine rankings
- The Condition of a Finite Markov Chain and Perturbation Bounds for the Limiting Probabilities
- Kemeny's Constant and the Random Surfer
- Fastest expected time to mixing for a Markov chain on a directed graph
- Comparison of perturbation bounds for the stationary distribution of a Markov chain
Cited In (26)
- Analysis of Markov Influence Graphs
- Non-backtracking PageRank
- Kemeny's constant and Wiener index on trees
- Complete multipartite graphs and Braess edges
- The minimum coefficient of ergodicity for a Markov chain with a given directed graph
- A comparison of centrality measures and their role in controlling the spread in epidemic networks
- Road network monitoring: algorithms and a case study
- Perturbation and Inverse Problems of Stochastic Matrices
- Clusters in Markov chains via singular vectors of Laplacian matrices
- Families of graphs with twin pendent paths and the Braess edge
- Load balancing for Markov chains with a specified directed graph
- A Structured Condition Number for Kemeny's Constant
- On the relationship between PageRank and automorphisms of a graph
- Kemeny's Constant And An Analogue Of Braess' Paradox For Trees
- Alleviating road network congestion: traffic pattern optimization using Markov chain traffic assignment
- Clustering behaviour in Markov chains with eigenvalues close to one
- On Kemeny's constant and stochastic complement
- Assigning stationary distributions to sparse stochastic matrices
- An Edge Centrality Measure Based on the Kemeny Constant
- Two accelerated non-backtracking PageRank algorithms for large-scale networks
- A big-data model for multi-modal public transportation with application to macroscopic control and optimisation
- Flux through a Markov chain
- Traffic modelling framework for electric vehicles
- Kemeny's constant for a graph with bridges
- Minimising the largest mean first passage time of a Markov chain: the influence of directed graphs
- Heuristic approximation method for a random flow of events by an MC-flow with arbitrary number of states
This page was built for publication: A Google-like model of road network dynamics and its application to regulation and control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3015166)
