activity
20102023
most citedSimplicial Closure and higher-order link prediction

555 citations · 2.9k across the 55 of their papers we have counts for

collaborators
Showing 2016Show all

5 papers · 1 filter

physics.soc-ph2016★ 38 cited

Random Multi-Hopper Model. Super-Fast Random Walks on Graphs

Ernesto Estrada, Jean-Charles Delvenne, Naomichi Hatano +4

We develop a model for a random walker with long-range hops on general graphs. This random multi-hopper jumps from a node to any other node in the graph with a probability that dec…

cs.SI2016★ 155 cited

The many facets of community detection in complex networks

Michael T. Schaub, Jean-Charles Delvenne, Martin Rosvall +1

Community detection, the decomposition of a graph into essential building blocks, has been a core research topic in network science over the past years. Since a precise notion of w…

physics.soc-ph2016★ 151 cited

Graph partitions and cluster synchronization in networks of oscillators

Michael T. Schaub, Neave O'Clery, Yazan N. Billeh +3

Synchronization over networks depends strongly on the structure of the coupling between the oscillators. When the coupling presents certain regularities, the dynamics can be coarse…

math.NA2016★ 9 cited

Sparse matrix factorizations for fast linear solvers with application to Laplacian systems

Michael T. Schaub, Maguy Trefois, Paul Van Dooren +1

In solving a linear system with iterative methods, one is usually confronted with the dilemma of having to choose between cheap, inefficient iterates over sparse search directions…

physics.soc-ph2016★ 44 cited

Using higher-order Markov models to reveal flow-based communities in networks

Vsevolod Salnikov, Michael T. Schaub, Renaud Lambiotte

Complex systems made of interacting elements are commonly abstracted as networks, in which nodes are associated with dynamic state variables, whose evolution is driven by interacti…