随机网络的最小平均权圈
The min mean-weight cycle in a random network
摘要:
边加权图中的圈的平均权重是圈的边权重之和除以圈的长度。研究了n阶完全图上具有随机同分布的最小平均权圈。从平均值为1的指数分布中提取的边权重。我们证明了最小平均权至多为c/n的概率趋向于c的极限函数,当c<=1/e时,该函数是解析的,当c=1/e时,该函数是不连续的,当c>1/e时,该函数等于1。我们进一步证明,如果最小平均权重<=1/(en),则相关循环的长度为Theta_p(1)(即,它有一个极限概率分布,它不随n成比例),但是如果最小平均权重>1/(en),那么相关的循环几乎总是具有平均权重(1+o(1))/(en),长度至少为(2/pi^2-o(1))log^2 n log log n。
英文摘要:
The mean weight of a cycle in an edge-weighted graph is the sum of the cycle's edge weights divided by the cycle's length. We study the minimum mean-weight cycle on the complete graph on n vertices, with random i.i.d. edge weights drawn from an exponential distribution with mean 1. We show that the probability of the min mean weight being at most c/n tends to a limiting function of c which is analytic for c<=1/e, discontinuous at c=1/e, and equal to 1 for c>1/e. We further show that if the min mean weight is <=1/(en), then the length of the relevant cycle is Theta_p(1) (i.e., it has a limiting probability distribution which does not scale with n), but that if the min mean weight is >1/(en), then the relevant cycle almost always has mean weight (1+o(1))/(en) and length at least (2/pi^2-o(1)) log^2 n log log n.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。