arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1001.5196cond-mat.stat-mechcs.NIphysics.soc-ph
收藏

地理嵌入图的贪婪连通性

Greedy Connectivity of Geographically Embedded Graphs

Jie Sun, Daniel ben-Avraham

摘要:

我们引入了一个衡量的{ \em贪婪连接}的地理网络(图形嵌入在空间中)和搜索连接路径只依赖于本地信息,如节点的位置和它的邻居。这种类型的约束在日常生活应用中很常见。贪婪连接性也会导致已建立链路上的不完美传输,并且贪婪连接性越大,从其他节点以高概率到达的节点比例越高。贪婪连通性可以作为优化网络设计的一个标准。

英文摘要:

We introduce a measure of {\em greedy connectivity} for geographical networks (graphs embedded in space) and where the search for connecting paths relies only on local information, such as a node's location and that of its neighbors. Constraints of this type are common in everyday life applications. Greedy connectivity accounts also for imperfect transmission across established links and is larger the higher the proportion of nodes that can be reached from other nodes with a high probability. Greedy connectivity can be used as a criterion for optimal network design.

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

↑