DocumentCode
2251167
Title
Hub nodes identification in public transport networks using markov chain model
Author
Lianxiong, Gao ; Hong, Liang ; Ru, Liu
Author_Institution
Sch. of Phys. & Electron., Yunnan Nat. Univ., Kunming, China
fYear
2009
fDate
4-7 Oct. 2009
Firstpage
1
Lastpage
6
Abstract
Identifying hub nodes in public transport networks is essential for transport planning, safety evaluation and location advantage research. Some assumptions are first discussed, and a new method based on Markov chain model is proposed to measure the importance of nodes in public transport network. The transition probability is then deduced and the existence and uniqueness of solutions are presented. Two solution algorithms are described. One real-world public transit network is analyzed using the method proposed and the results are discussed.
Keywords
Markov processes; network theory (graphs); probability; road safety; transportation; Markov chain model; hub node identification; location advantage research; public transport network; real-world public transit network; safety evaluation; transition probability; transport planning; Complex networks; Electronic mail; Geoscience; Intelligent networks; Intelligent transportation systems; Physics; Safety; Telecommunication computing; USA Councils; Web sites;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Transportation Systems, 2009. ITSC '09. 12th International IEEE Conference on
Conference_Location
St. Louis, MO
Print_ISBN
978-1-4244-5519-5
Electronic_ISBN
978-1-4244-5520-1
Type
conf
DOI
10.1109/ITSC.2009.5309865
Filename
5309865
Link To Document