1511 search results - page 35 / 303 » Randomness, lowness and degrees |
IM
2007
14 years 11 months ago
2007
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...
IWOCA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
WAW
2004
Springer
15 years 5 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
163
click to vote
CC
2010
Springer
14 years 6 months ago
2010
Springer
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
111
click to vote
ISPA
2004
Springer
15 years 5 months ago
2004
Springer
The Monte Carlo (MC) method is a simple but effective way to perform simulations involving complicated or multivariate functions. The QuasiMonte Carlo (QMC) method is similar but...