Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these invest...
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...