A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
Recently, intellectual property protection (IPP) techniques attracted a great deal of attention from semiconductor, system integration and software companies. A number of watermar...
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...