科研之友
微信
新浪微博
Facebook
分享链接
摘要
Consider the random hypercube H-2(n)(p(n)) obtained from the hypercube H-2(n) by deleting any given edge with probabilty 1 - p(n), independently of all the other edges. A diameter path in H-2(n) is a longest geodesic path in H-2(n). Consider the following two ways of tampering with the random graph H-2(n)(p(n)) : (i) choose a diameter path at random and adjoin all of its edges to H-2(n)(p(n)); (ii) choose a diameter path at random from among those that start at 0 = (0, ... , 0), and adjoin all of its edges to H-2(n)(p(n)). We study the question of whether these tamperings are detectable asymptotically as n -%26gt; infinity.
- 出版日期2013-2-18
