The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
Daniel R. Figueiredo, Philippe Nain, Bruno F. Ribe...
Digital music distribution industry has seen a tremendous growth in resent years. Tasks such us automatic music genre discrimination address new and exciting research challenges. A...