Limit probabilities for random sparse bit strings (Q1378516)

From MaRDI portal





scientific article; zbMATH DE number 1118008
Language Label Description Also known as
English
Limit probabilities for random sparse bit strings
scientific article; zbMATH DE number 1118008

    Statements

    Limit probabilities for random sparse bit strings (English)
    0 references
    0 references
    15 February 1998
    0 references
    Summary: Let \(n\) be a positive integer, \(c\) a real positive constant, and \(p(n) = c/n\). Let \(U_{n,p}\) be the random unary predicate under the linear order, and \(S_c\) the almost sure theory of \(U_{n,\frac{c}{n}}\). We show that for every first-order sentence \(\phi\): \[ f_{\phi}(c) = \lim_{n\rightarrow\infty} \text{Pr}[U_{n,\frac{c}{n}} \text{ has property } \phi] \] is an infinitely differentiable function. Further, let \(S = \bigcap_c S_c\) be the set of all sentences that are true in every almost sure theory. Then, for every \(c>0\), \(S_c = S\).
    0 references
    random unary predicate under linear order
    0 references
    almost sure theory
    0 references
    infinitely differentiable functions
    0 references

    Identifiers