Vincent D. Blondel

Author Info

Name	Affiliation	Papers
VINCENT D. BLONDEL	Department of Mathematical Engineering, Center for Systems Engineering and Applied Mechanics, Université catholique de Louvain, Avenue George Lemaítre, 4 B-1348 Louvain-la-Neuve, Belgium	69
Collaborators	Citations	PageRank
103	1880	184.86
Referers	Referees	References
3319	645	498

Search Limit

1001000

Publications (69 rows)

Collaborators (100 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Clean up or mess up: the effect of sampling biases on measurements of degree distributions in mobile phone datasets.	0	0.34	2016
Modelling Influence And Opinion Evolution In Online Collective Behaviour	3	0.50	2015
Markov modeling of Twitter tweet inter-arrival times.	0	0.34	2015
On The Use Of Human Mobility Proxies For Modeling Epidemics	29	1.90	2014
How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard.	8	0.57	2014
D4D-Senegal: The Second Mobile Phone Data for Development Challenge.	24	1.40	2014
Career On The Move: Geography, Stratification, And Scientific Impact	25	0.97	2014
Estimating Food Consumption and Poverty Indices with Mobile Phone Data.	3	0.50	2014
Evaluating socio-economic state of a country analyzing airtime credit and mobile phone datasets.	9	0.76	2013
Bursts Of Vertex Activation And Epidemics In Evolving Networks	7	0.56	2013
An experimental study of approximation algorithms for the joint spectral radius	1	0.37	2013
On Primitivity of Sets of Matrices.	2	0.38	2013
Flow Motifs Reveal Limitations of the Static Framework to Represent Human interactions	1	0.35	2013
Explicit Solutions for Root Optimization of a Polynomial Family With One Affine Constraint.	3	0.78	2012
Data for Development: the D4D Challenge on Mobile Phone Data	59	2.79	2012
Bursts Of Vertex Activation And Epidemics In Evolving Networks	10	0.67	2012
Exploring the Mobility of Mobile Phone Users	20	1.23	2012
Effects of time window size and placement on the structure of aggregated networks	36	1.42	2012
Cramér-Rao bounds for synchronization of rotations	23	0.96	2012
The interplay between telecommunications and face-to-face interactions - an initial study using mobile phone data	1	0.46	2011
Extracting spatial information from networks with low-order eigenvectors	5	0.48	2011
An upper bound on community size in scalable community detection	2	0.49	2011
Fast computation of minimal elementary decompositions of metabolic flux vectors	2	0.43	2011
Beyond Space For Spatial Networks	3	0.50	2010
Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications	55	2.75	2010
The continuous Skolem-Pisot problem	17	1.91	2010
Joint Spectral Characteristics of Matrices: A Conic Programming Approach	28	1.37	2010
Pagerank optimization in polynomial time by stochastic shortest path reformulation	8	0.69	2010
PageRank optimization by edge selection.	16	0.71	2009
On Krause's Multi-Agent Consensus Model With State-Dependent Connectivity	36	2.34	2009
Scaling Behaviors in the Communication Network between Cities	5	0.66	2009
On the number of alpha-power-free binary words for 2alpha<=7/3	5	0.63	2009
Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices	6	0.60	2009
Fast unfolding of community hierarchies in large networks	76	7.24	2008
Formation Reorganization by Primitive Operations on Directed Graphs	3	0.60	2008
On Krause's consensus formation model with state-dependent connectivity	8	1.04	2008
Computing the growth of the number of overlap-free words with spectra of matrices	2	0.41	2008
Descent methods for Nonnegative Matrix Factorization	23	1.27	2008
Overlap-free words and spectra of matrices	9	0.75	2007
Observable graphs	3	0.44	2007
Linear time algorithms for Clobber	0	0.34	2007
Three and higher dimensional autonomous formations: Rigidity, persistence and structural persistence	65	6.24	2007
Efficient algorithms for deciding the type of growth of products of integer matrices	19	1.61	2006
Primitive operations for the construction and reorganization of minimally persistent formations	6	1.07	2006
Complexity of Control on Finite Automata	2	0.40	2006
Computationally Efficient Approximations of the Joint Spectral Radius	41	3.37	2005
Decidable and Undecidable Problems about Quantum Automata	33	1.51	2005
Convergence In Multiagent Coordination, Consensus, And Flocking	327	36.76	2005
Computational universality in symbolic dynamical systems	4	0.51	2004
Fault Tolerant Control: A Simultaneous Stabilization Result	33	2.69	2004

1
2
50 / page