Transport Networks Revisited: Why Dual Graphs?

Simple item page
dc.creatorVolchenkov, D.
dc.creatorBlanchard, Ph.
dc.date2007-10-29
dc.date.accessioned2026-07-07T08:39:15Z
dc.date.available2026-07-07T08:39:15Z
dc.descriptionDeterministic equilibrium flows in transport networks can be investigated by means of Markov's processes defined on the dual graph representations of the network. Sustained movement patterns are generated by a subset of automorphisms of the graph spanning the spatial network of a city naturally interpreted as random walks. Random walks assign absolute scores to all nodes of a graph and embed space syntax into Euclidean space.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/0710.5494
dc.identifierhttp://arxiv.org/abs/0710.5494
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141011
dc.subjectPhysics and Society
dc.subjectData Analysis, Statistics and Probability
dc.titleTransport Networks Revisited: Why Dual Graphs?
dc.typetext

Files

Collections

arXiv