CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Stations, trains and small-world networks Export

Physica A: Statistical Mechanics and its Applications, Vol. 339, No. 3-4. (15 August 2004), pp. 635-644.

Citation Format

[Posts]

View FullText article


spool's tags for this article

clustering networks optimality path_length

X Reviews [Write a review of this article]

X Notes for this article

spool has 0 private notes and 1 public note for this article.

Quite useful for clustering methods and path length stuff, basic optimality

spool (public note) - 2008-08-30 14:20:59

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X Abstract

The 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.


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.