摘要
讨论了当n趋向无穷大时,n个顶点的随机映射图的k-局部图收敛于随机生长过程时刻k的二叉图,这儿,k-局部图是随机映射图前k个顶点{1,2,…,k}所生成的最小图.在这种意义下,称随机映射图为渐近二叉的.
The authors prove that in a random mapping graph with n vertices,when the size n goes to infinity,the k-local image,namely,the smallest graph generated by the first k vertices {1,2,…,k},converges to a random birth process of binary graphs indexed by k. In this sense,the random mapping graph is asymptotically locally binary.
出处
《数学年刊(A辑)》
CSCD
北大核心
2010年第4期443-450,共8页
Chinese Annals of Mathematics
基金
国家自然科学基金(No.10671036)资助的项目.
关键词
随机映射图
二叉树
局部图
图的随机生长过程
遍历
Random mapping graph
Binary tree
Local image
Random birth process of graph
Traversal