Abstract

Complex transportation networks abstracted as graphs can be effectively analyzed by random walk algorithm. This paper proposes a brief introduction to the principles and benefits of the related accessibility measures and develops an alternative and computational agent model that can help us to simulate random walk process in transportation networks for the measure of accessibility. We have unified many concepts into one framework and studied in details the structural properties of spatial graphs. By modeling and analyzing movement features, this paper investigates the moving objects behavior and calculates the SpaceRank of each open place.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.