. so c - ph ] 2 9 O ct 2 00 7 Transport Networks Revisited : Why Dual Graphs ?
نویسنده
چکیده
Deterministic 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. 1 Motivation In most of researches devoted to the improving of transport routes, the optimization of power grids, and the pedestrian movement surveys the relationships between certain components of the urban texture are often measured along streets and routes considered as edges of a planar graph, while the traffic end points and street junctions are treated as nodes. Such a primary graph representation of urban networks is grounded on relations between junctions through the segments of streets. A usual city map based on Euclidean geometry can be considered as an example of primary city graphs. On the contrary, in another graph representation of urban networks known as dual, relations between streets are encoded through their junctions. Streets within that are treated as nodes while their intersections are considered as edges.
منابع مشابه
ar X iv : 0 71 0 . 15 26 v 2 [ he p - ph ] 9 O ct 2 00 7 Third Spectroscopy with a hint of superstrings
Some new regularities found in the pseudoscalar meson octet are reported. They invite to reconsider models where elementary fermions and composite QCD open strings can be grouped in common supermultiplets.
متن کامل. so c - ph ] 3 1 O ct 2 00 6 Vertex labeling and routing in expanded Apollonian networks
We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered. We introduce a labeling of their vertices that allows to determine a shortest path routing between any two vertices of the network based only on the labels.
متن کاملRTES-03 Interfaces.indd
[ B ur ns 20 07 ] B u rn s, A & W el lin gs , A C o n cu rr en t a n d R ea l-T im e Pr o gr am m in g in A d a, e d it io n C am b ri d ge U n iv er si ty P re ss 2 00 7 [ M o to ro la 19 96 ] M o to ro la Ti m e Pr o ce ss in g U n it R ef er en ce M an u al 1 99 6 p p . 1 -1 42 [ M o to ro la 20 00 ] M o to ro la M PC 56 5 & M PC 56 6 2 00 0 p p . 1 -1 31 2 [ P ea co ck 19 97 ] Pe ac o ck , ...
متن کاملMicrosoft PowerPoint - DIGDAT2002_6.ppt
• S je tt e fo re le sn in g : K ap .9 In st ru ct io n S et A rc h it ec tu re 9. 1 C o m p u te r ar ch it ec tu re co n ce p ts 9. 2 O p er an d ad d re ss in g 9. 3 A d d re ss in g m o d es 9. 4 In st ru ct io n S et A rc h it ec tu re s 9. 5 D at a tr an sf er in st ru ct io n s 9. 6 D at a m an ip u la ti o n in st ru ct io n s 9. 7 F lo at in g -p o in t co m p u ta ti o n s N T N U ,S ...
متن کامل