arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0804.0577math.PRcs.DS
收藏

具有随机代价的分散搜索

Decentralized Search with Random Costs

Oskar Sandberg

摘要:

分散式搜索算法是一种在随机图上路由的方法,它只使用关于图的实现的有限的局部信息。在一些随机图模型中,可以定义这样的算法,当从任何顶点路由到任何其他顶点时,这些算法产生短路径,而对于其他模型则不是这样。我们考虑随机图的随机成本分配给边缘。在这种情况下,我们使用的随机动态规划的方法来创建一个分散的搜索法,试图最大限度地减少总成本,而不是步骤的数量,每个路径。我们的算法依赖于知道从每个顶点到任何其他的路由的预期成本,但我们表明,这可能是迭代计算,在实践中可以很容易地估计从以前的路由成本和压缩成一个小的路由表。这里应用的方法也可以直接应用于其他情况,例如在具有不同顶点度的图中进行有效搜索。

英文摘要:

A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph models it is possible to define such algorithms which produce short paths when routing from any vertex to any other, while for others it is not. We consider random graphs with random costs assigned to the edges. In this situation, we use the methods of stochastic dynamic programming to create a decentralized search method which attempts to minimize the total cost, rather than the number of steps, of each path. We show that it succeeds in doing so among all decentralized search algorithms which monotonically approach the destination. Our algorithm depends on knowing the expected cost of routing from every vertex to any other, but we show that this may be calculated iteratively, and in practice can be easily estimated from the cost of previous routes and compressed into a small routing table. The methods applied here can also be applied directly in other situations, such as efficient searching in graphs with varying vertex degrees.

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

↑