Sciweavers

1806 search results - page 50 / 362
» Randomness and halting probabilities
Sort
View
APPROX
2004
Springer
129views Algorithms» more  APPROX 2004»
14 years 1 months ago
The Chromatic Number of Random Regular Graphs
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...
Dimitris Achlioptas, Cristopher Moore
AML
2008
66views more  AML 2008»
13 years 7 months ago
Algorithmic randomness of continuous functions
We investigate notions of randomness in the space C(2N ) of continuous functions on 2N . A probability measure is given and a version of the Martin-L
George Barmpalias, Paul Brodhead, Douglas A. Cenze...
DM
2007
93views more  DM 2007»
13 years 7 months ago
Small subgraphs of random regular graphs
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...
Jeong Han Kim, Benny Sudakov, Van H. Vu
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
13 years 9 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
JCB
2008
106views more  JCB 2008»
13 years 7 months ago
Statistics of Random Protein Superpositions: p-Values for Pairwise Structure Alignment
Quantification of statistical significance is essential for the interpretation of protein structural similarity. To address this, a random model for protein structure comparison w...
James O. Wrabl, Nick V. Grishin