A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
The number of accessible paths in the hypercube
2016
Bernoulli
Motivated by an evolutionary biology question, we study the following problem: we consider the hypercube {0,1}^L where each node carries an independent random variable uniformly distributed on [0,1], except (1,1,...,1) which carries the value 1 and (0,0,...,0) which carries the value x∈[0,1]. We study the number Θ of paths from vertex (0,0,...,0) to the opposite vertex (1,1,...,1) along which the values on the nodes form an increasing sequence. We show that if the value on (0,0,...,0) is set to
doi:10.3150/14-bej641
fatcat:dxv6bnsinrhuhbx7chwdpjbhle