Boolean functions form the backbone of modern cryptographic systems, serving as essential components in the design of stream ciphers, block ciphers, and other security protocols.

In this paper we prove sharp thresholds for monotone functions taking values in an arbitrary finite set. We also provide examples of applications of the results to social choice and to random graph ...

We define and analyse a random coverage process of the d-dimensional Euclidean space which allows us to describe a continuous spectrum that ranges from the Boolean model to the Poisson-Voronoi ...