重新审视传输网络:为什么是对偶图?
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。