arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0710.0996physics.soc-phphysics.gen-ph
收藏

复杂城市网络的可懂度和首次通过时间

Intelligibility and First Passage Times In Complex Urban Networks

Ph. Blanchard, D. Volchenkov

摘要:

城市环境的拓扑结构可以用图形来表示。我们探讨了图表示的几个紧凑的城市模式的随机游动。在空间句法理论中,节点的局部属性(由连通性或递归时间限定)和节点的全局属性(在我们的方法中由第一次通过时间估计)之间的正关系被称为可理解性。我们的方法基于随机游走允许扩展到复杂网络和图论的整个域的概念的可理解性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑