1806 search results - page 15 / 362 » Randomness and halting probabilities |
CAI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...
RSA
2006
13 years 7 months ago
2006
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
ALENEX
2004
13 years 9 months ago
2004
We study the asymptotic probability that a random composition of an integer n is gap-free, that is, that the sizes of parts in the composition form an interval. We show that this ...
CCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
CP
2000
Springer
13 years 11 months ago
2000
Springer
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...