当前位置: X-MOL 学术Random Struct. Algorithms › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A scaling limit for the length of the longest cycle in a sparse random digraph
Random Structures and Algorithms ( IF 0.9 ) Pub Date : 2021-06-14 , DOI: 10.1002/rsa.21030
Michael Anastos 1 , Alan Frieze 2
Affiliation  

We discuss the length urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0001 of the longest directed cycle in the sparse random digraph urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0002, urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0003 constant. We show that for large urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0004 there exists a function urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0005 such that urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0006 a.s. The function urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0007 where urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0008 is a polynomial in urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0009. We are only able to explicitly give the values urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0010, although we could in principle compute any urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0011.

中文翻译:

稀疏随机有向图中最长循环长度的缩放限制

我们讨论urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0001稀疏随机有向图中最长有向环的长度urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0002urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0003常数。我们证明,对于 largeurn:x-wiley:rsa:media:rsa21030:rsa21030-math-0004来说,存在一个函数urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0005urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0006如 函数urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0007whereurn:x-wiley:rsa:media:rsa21030:rsa21030-math-0008是 中的多项式urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0009。我们只能明确地给出值urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0010,尽管我们原则上可以计算 any urn:x-wiley:rsa:media:rsa21030:rsa21030-math-0011
更新日期:2021-06-14
down
wechat
bug