VBVincent D. Blondel

Vincent D. Blondel

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Vincent D. Blondel has a total of 39 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Fast unfolding of communities in large networks: 15 years later

    by Vincent Blondel, Jean-Loup Guillaume, Renaud Lambiotte

    The Louvain method was proposed 15 years ago as a heuristic method for the fast detection of communities in large networks. During this period, it has emerged as one of the most popular methods for community detection, the task of partitioning vertices of a network into dense groups, usually called communities or clusters. Here, after a short introduction to the method, we give an overview of the different generalizations and modifications that have been proposed in the literature, and also survey the quality functions, beyond modularity, for which it has been implemented.


  • Open Access

    Markov modeling of online inter-arrival times

    by Corentin Vande Kerckhove, Balázs Gerencsér, Julien M. Hendrickx, Vincent D. Blondel

    In this paper, we investigate the arising communication patterns on social media, and in particular the series of events happening for a single user. While the distribution of inter-event times is often assimilated to power-law density functions, a debate persists on the nature of an underlying model that explains the observed distribution. In the present, we propose an intuitive explanation to understand the observed dependence of subsequent waiting times. Our contribution is twofold. The first idea consists of separating the short waiting times -- out of scope for power-law distributions -- from the long ones. The model is further enhanced by introducing a two-state Markovian process to incorporate memory.

  • Open Access

    Regions and borders of mobile telephony in Belgium and in the Brussels metropolitan zone

    by Vincent Blondel, Gautier Krings, Isabelle Thomas

    In this article, we examine the existence of regions and borders in Belgium by means of an original data set of more than 200 million mobile communications and a mathematical method which allows networks to be divided into coherent groups in a natural and automatic manner. A geography of mobile communications is thus proposed based on the relative frequency of communications as well as their average duration. In the case of the relative frequency of communications, we obtain a map of Belgium composed of 17 groups or “telephone areas” that each contain only adjacent municipalities. On this first map, the area of Brussels is the only one which runs across the linguistic border and covers the three institutional regions of the country. In the case of the average duration of communications, we obtain a group in the north and a group in the south of the country. These two groups concentrate within themselves almost 98% of telephone calls; only 2% of communications are from one group to the other. The group in the south includes the 19 municipalities of Brussels, all of the municipalities in the Walloon region as well as eight municipalities with facilities located in the Flemish region. In particular, all of the municipalities with facilities in the outskirts of Brussels (with the exception of Wemmel) are part of the group in the south of the country.


  • Open Access

    Regio’s en grenzen van mobiele telefonie in België en in het Brussels stadsgewest

    by Vincent Blondel, Gautier Krings, Isabelle Thomas

    In dit artikel onderzoeken we het bestaan van regio’s en van grenzen in België op basis van een originele databank die gegevens bevat van meer dan 200 miljoen mobiele telefoongesprekken en van een wiskundige methode die toelaat op automatische en natuurlijke wijze netwerken in coherente groepen te verdelen. Op die manier kan een geografie van mobiel telefoonverkeer voorgesteld worden op basis van de relatieve frequenties van de telefoongesprekken en hun gemiddelde duur. Als we de relatieve frequentie van de gesprekken als criterium gebruiken, krijgen we een kaart van België die bestaat uit 17 groepen of “telefoonbassins” die ruimtelijk verankerd zijn in gemeenten die allemaal verbazend aangrenzend zijn. Op deze eerste kaart is het enkel het bassin van Brussel dat de taalgrens nadrukkelijk doorbreekt en de drie institutionele gewesten van het land bedekt. Als we de gemiddelde duur van de gesprekken als criterium hanteren, krijgen we één groep in het noorden en één groep in het zuiden van het land. Binnen deze twee groepen vindt ongeveer 98% van de gesprekken plaats; slechts 2% van het telefoonverkeer gaat van de ene groep naar de andere. De zuidelijke groep bevat de 19 Brusselse gemeenten, alle gemeenten van het Waals Gewest en acht faciliteitengemeenten die in het Vlaams Gewest liggen. Het is opmerkelijk dat alle faciliteitengemeenten van de Brusselse rand (met uitzondering van Wemmel) deel uitmaken van de groep van het zuiden van het land.


  • Open Access

    Régions et frontières de téléphonie mobile en Belgique et dans l’aire métropolitaine bruxelloise

    by Vincent Blondel, Gautier Krings, Isabelle Thomas

    Dans cet article, nous explorons l’existence de régions et de frontières en Belgique au moyen d’un jeu de données original de plus de 200 millions de communications mobiles et d’une méthode mathématique qui permet de découper de manière naturelle et automatique des réseaux en groupes cohérents. Une géographie des communications mobiles est ainsi proposée sur la base de la fréquence relative des communications ainsi que de leur durée moyenne. Dans le cas de la fréquence relative des communications, nous obtenons une carte de Belgique composée de 17 groupes ou « bassins téléphoniques » spatialement bien ancrés, aux communes étonnamment toutes adjacentes. Sur cette première carte, le bassin de Bruxelles est le seul qui traverse largement la frontière linguistique et couvre les trois régions institutionnelles du pays. Dans le cas de la durée moyenne des communications, nous obtenons un groupe au nord et un groupe au sud du pays. Ces deux groupes concentrent en leur sein près de 98 % des appels téléphoniques ; seuls 2 % des communications passent d’un groupe à l’autre. Le groupe du sud comprend les 19 communes de Bruxelles, toutes les communes de la région Wallonne ainsi que huit communes à facilités situées en région flamande. En particulier, toutes les communes à facilités de la périphérie bruxelloise (à l’exception de Wemmel) font partie du groupe du sud du pays.


  • Top Cited Papers
    Open Access

    A survey of results on mobile phone datasets analysis

    by Vincent D Blondel, Adeline Decuyper, Gautier Krings


  • Open Access

    A survey of results on mobile phone datasets analysis

    by Vincent D. Blondel, Adeline Decuyper, Gautier Krings

    In this paper, we review some advances made recently in the study of mobile phone datasets. This area of research has emerged a decade ago, with the increasing availability of large-scale anonymized datasets, and has grown into a stand-alone topic. We will survey the contributions made so far on the social networks that can be constructed with such data, the study of personal mobility, geographical partitioning, urban planning, and help towards development as well as security and privacy issues.

  • Open Access

    How to decide consensus? A combinatorial necessary and sufficient condition and a proof that consensus is decidable but NP-hard

    by Vincent Blondel, Alex Olshevsky

    A set of stochastic matrices ${\cal P}$ is a consensus set if for every sequence of matrices $P(1), P(2), \ldots$ whose elements belong to ${\cal P}$ and every initial state $x(0)$, the sequence of states defined by $x(t) = P(t) P(t-1) \cdots P(1) x(0)$ converges to a vector whose entries are all identical. In this paper, we introduce an "avoiding set condition" for compact sets of matrices and prove in our main theorem that this explicit combinatorial condition is both necessary and sufficient for consensus. We show that several of the conditions for consensus proposed in the literature can be directly derived from the avoiding set condition. The avoiding set condition is easy to check with an elementary algorithm, and so our result also establishes that consensus is algorithmically decidable. Direct verification of the avoiding set condition may require more than a polynomial time number of operations. This is however likely to be the case for any consensus checking algorithm since we also prove in this paper that unless $P=NP$, consensus cannot be decided in polynomial time.

  • PageRank optimization by edge selection

    by Balázs Csanád Csáji, Raphaël M. Jungers, Vincent D. Blondel


  • Open Access

    Partition-Merge: Distributed Inference and Modularity Optimization

    by Vincent Blondel, Kyomin Jung, Pushmeet Kohli, Devavrat Shah

    This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our novel randomized partitioning scheme, runs the centralized algorithm on each partition separately, and then stitches the resulting solutions to produce a global solution. We demonstrate the efficiency of the PM algorithm on two popular problems: computation of Maximum A Posteriori (MAP) assignment in an arbitrary pairwise Markov Random Field (MRF), and modularity optimization for community detection. We show that the resulting distributed algorithms for these problems essentially run in time linear in the number of nodes in the graph, and perform as well -- or even better -- than the original centralized algorithm as long as the graph has geometric structures. Here we say a graph has geometric structures, or polynomial growth property, when the number of nodes within distance r of any given node grows no faster than a polynomial function of r. More precisely, if the centralized algorithm is a C-factor approximation with constant C \ge 1, the resulting distributed algorithm is a (C+\delta)-factor approximation for any small \delta>0; but if the centralized algorithm is a non-constant (e.g. logarithmic) factor approximation, then the resulting distributed algorithm becomes a constant factor approximation. For general graphs, we compute explicit bounds on the loss of performance of the resulting distributed algorithm with respect to the centralized algorithm.