arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1911.10083math.PRmath.CO
收藏

一种配置模型的深度优先探索

Depth First Exploration of a Configuration Model

Nathanaël Enriquez, Gabriel Faraud, Laurent Ménard, Nathan Noiry

摘要:

我们介绍了一种算法,构造一个随机均匀图与规定的度序列与深度优先探索它,在所谓的超临界政权的图包含一个巨大的组成部分,我们证明了深度优先搜索树的重整化轮廓过程具有确定性的限制配置文件,我们确定。证明通过详细分析未探索顶点的经验度分布的演化。这种演变是由一个无限的微分方程系统,其中有一个独特的和明确的解决方案。作为一个副产品,我们推出了一个宏观的简单路径的存在,并得到了它的长度的下界。

英文摘要:

We introduce an algorithm that constructs a random uniform graph with prescribed degree sequence together with a depth first exploration of it. In the so-called supercritical regime where the graph contains a giant component, we prove that the renormalized contour process of the Depth First Search Tree has a deterministic limiting profile that we identify. The proof goes through a detailed analysis of the evolution of the empirical degree distribution of unexplored vertices. This evolution is driven by an infinite system of differential equations which has a unique and explicit solution. As a byproduct, we deduce the existence of a macroscopic simple path and get a lower bound on its length.

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

↑