Let Wbe a sum of independent random variables. We apply the zero bias transformation to deduce recursive asymptotic expansions for in terms of normal expectations, or of Poisson expectations for integer-valued random variables. We also discuss the estimates of remaining errors.
Let Gₙ be the random graph on [n] = 1,...,n with the probability of i,j being an edge decaying as a power of the distance, specifically the probability being , where the constant α ∈ (0,1) is irrational. We analyze this theory using an appropriate weight function on a pair (A,B) of graphs and using an equivalence relation on B∖A. We then investigate the model theory of this theory, including a “finite compactness”. Lastly, as a consequence, we prove that the zero-one law (for first order logic)...
Let Gₙ be the random graph on [n] = 1,...,n with the possible edge i,j having probability for j ≠ i, i+1, i-1 with α ∈ (0,1) irrational. We prove that the zero-one law (for first order logic) holds..