We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...