We give a complete characterization for the limit probabilities of first order sentences over sparse random bit strings at the threshold of adjacency. For strings of length n, we let the probability that a bit is "on" be c/√n, for a real positive number c. For every first order sentence φ, we show that the limit probability function: fφ(c) = lim n→∞ Pr[Un, c/√n has the property φ] (where Un, c/√n is the random bit string of length n) is infinitely differentiable. Our methodology for showing this is in itself interesting. We begin with finite models, go to the infinite (via the almost sure theories) and then characterize fφ(c) as an infinite sum of products of polynomials and exponentials. We further show that if a sentence φ has limiting probability 1 for some c, then φ has limiting probability identically 1 for every c. This gives the surprising result that the almost sure theories are identical for every c.