21.7k citations · 24.7k across the 43 of their papers we have counts for
5 papers · 1 filter
Local Leaders in Random Networks
V. D. Blondel, J. -L. Guillaume, J. M. Hendrickx +2
We consider local leaders in random uncorrelated networks, i.e. nodes whose degree is higher or equal than the degree of all of their neighbors. An analytical expression is found f…
Distance distribution in random graphs and application to networks exploration
Vincent D. Blondel, Jean-Loup Guillaume, Julien M. Hendrickx +1
We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all ot…
Linear time algorithms for Clobber
Vincent D. Blondel, Julien M. Hendrickx, Raphael M. Jungers
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizati…
On the Finiteness Property for Rational Matrices
Raphael M. Jungers, Vincent D. Blondel
We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrice…
Observable Graphs
Raphael M. Jungers, Vincent D. Blondel
An edge-colored directed graph is \emph{observable} if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of t…