Geodesic
Limit probabilities for random sparse bit strings
The electronic journal of combinatorics, Tome 4 (1997) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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,{c\over n}}$. We show that for every first-order sentence $\phi$: $$ f_{\phi}(c) = \lim_{n\rightarrow\infty}{\Pr}[U_{n,{c\over n}} { 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$.
DOI : 10.37236/1308
Classification : 03C13, 60F20
Mots-clés : random unary predicate under linear order, almost sure theory, infinitely differentiable functions 
@article{10_37236_1308,
     author = {Katherine St. John},
     title = {Limit probabilities for random sparse bit strings},
     journal = {The electronic journal of combinatorics},
     year = {1997},
     volume = {4},
     number = {1},
     doi = {10.37236/1308},
     zbl = {0883.03013},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1308/}
}
TY  - JOUR
AU  - Katherine St. John
TI  - Limit probabilities for random sparse bit strings
JO  - The electronic journal of combinatorics
PY  - 1997
VL  - 4
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1308/
DO  - 10.37236/1308
ID  - 10_37236_1308
ER  - 
%0 Journal Article
%A Katherine St. John
%T Limit probabilities for random sparse bit strings
%J The electronic journal of combinatorics
%D 1997
%V 4
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1308/
%R 10.37236/1308
%F 10_37236_1308
Katherine St. John. Limit probabilities for random sparse bit strings. The electronic journal of combinatorics, Tome 4 (1997) no. 1. doi: 10.37236/1308

Cité par Sources :