The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...
We study the empirical meaning of randomness with respect to a family of probability distributions P, where is a real parameter, using algorithmic randomness theory. In the case w...
Abstract. We study the effect of randomness in the adversarial queueing model. All proofs of instability for deterministic queueing strategies exploit a finespun strategy of insert...
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...