![]() |
CiteULike | ![]() |
spool's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Stations, trains and small-world networksPhysica A: Statistical Mechanics and its Applications, Vol. 339, No. 3-4. (15 August 2004), pp. 635-644.
|
Reviews
[Write a review of this article]
Notes for this articleQuite useful for clustering methods and path length stuff, basic optimality
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThe clustering coefficient, path length and average vertex degree of two urban train line networks have been calculated. The results are compared with theoretical predictions for appropriate random bipartite graphs. They have also been compared with one another to investigate the effect of architecture on the small-world properties.
BibTeX record
RIS record