1806 search results - page 38 / 362 » Randomness and halting probabilities |
COMBINATORICS
2000
13 years 7 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— Working in Winfree’s abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n × n...
RSA
2006
13 years 7 months ago
2006
In this paper, we prove that there exists a function k = (4 + o(1))k such that G(n, /n) contains a k-regular graph with high probability whenever > k. In the case of k = 3, it...
TWC
2008
13 years 7 months ago
2008
Abstract-- In this paper, we first present an analytical procedure for the computation of the node isolation probability and coverage in an ad hoc network in the presence of channe...
CPC
2011
13 years 2 months ago
2011
Let X be the random variable that counts the number of triangles in the binomial random graph G(n, p). We show that for some positive constant c, the probability that X deviates f...