Intelligibility and First Passage Times In Complex Urban Networks

Details Intelligibility and First Passage Times In Complex Urban Networks Intelligibility and First Passage Times In Complex Urban Networks

2007-10-04

arxiv.org/abs/0710.0996v2

Proc. R. Soc. A (2008)

Physics

Physics and Society

19 pages, 4 figures, English UK, the Harvard style references

Scientific paper

10.1098/rspa.2007.0329

Topology of urban environments can be represented by means of graphs. We explore the graph representations of several compact urban patterns by random walks. The expected time of recurrence and the expected first passage time to a node scales apparently linearly in all urban patterns we have studied In space syntax theory, a positive relation between the local property of a node (qualified by connectivity or by the recurrence time) and the global property of the node (estimated in our approach by the first passage time to it) is known as intelligibility. Our approach based on random walks allows to extend the notion of intelligibility onto the entire domain of complex networks and graph theory.

Affiliated with

Also associated with

No associations

Rating

Intelligibility and First Passage Times In Complex Urban Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Intelligibility and First Passage Times In Complex Urban Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Intelligibility and First Passage Times In Complex Urban Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-563298