40 search results - page 1 / 8 » On Failure of 0-1 Laws |
SIAMCO
2000
13 years 4 months ago
2000
We study almost-sure limiting properties, taken as 0, of the finite horizon sequence of random estimates { 0, 1, 2, . . . , T/ } for the linear stochastic gradient algorithm n+1 ...
SIAMCOMP
2002
13 years 4 months ago
2002
We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recur...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
SIAMDM
2010
13 years 3 months ago
2010
Abstract. We investigate the degree distribution resulting from graph generation models based on rank-based attachment. In rank-based attachment, all vertices are ranked according ...
CORR
2012
Springer
12 years 15 days ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...