Extracting spatial information from networks with low-order eigenvectors

We consider the problem of inferring meaningful spatial information in networks from incomplete information on the connection intensity between the nodes of the network. We consider two spatially distributed networks: a population migration flow network within the US, and a network of mobile phone calls between cities in Belgium. For both networks we use the eigenvectors of the Laplacian matrix constructed from the link intensities to obtain informative visualizations and capture natural geographical subdivisions. We observe that some low order eigenvectors localize very well and seem to reveal small geographically cohesive regions that match remarkably well with political and administrative boundaries. We discuss possible explanations for this observation by describing diffusion maps and localized eigenfunctions. In addition, we discuss a possible connection with the weighted graph cut problem, and provide numerical evidence supporting the idea that lower order eigenvectors point out local cuts in the network. However, we do not provide a formal and rigorous justification for our observations.

[1]  S. Strogatz,et al.  Redrawing the Map of Great Britain from a Network of Human Interactions , 2010, PloS one.

[2]  E. Lee.  A theory of migration , 1966, Demography.

[3]  Paul B. Slater,et al.  Hubs and Clusters in the Evolving U. S. Internal Migration Network , 2008, ArXiv.

[4]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[5]  P. Mucha,et al.  Spectral tripartitioning of networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Carlo Ratti,et al.  Eigenplaces: Analysing Cities Using the Space–Time Structure of the Mobile Phone Network , 2009 .

[7]  Nicolas Burq,et al.  Bouncing Ball Modes and Quantum Chaos , 2003, SIAM Rev..

[8]  Marc J. Perry,et al.  State-to-State Migration Flows: 1995 to 2000 , 2003 .

[9]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[10]  Ronald R. Coifman,et al.  Diffusion Maps, Reduction Coordinates, and Low Dimensional Representation of Stochastic Systems , 2008, Multiscale Model. Simul..

[11]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[12]  F. Calabrese,et al.  Urban gravity: a model for inter-city telecommunication flows , 2009, 0905.0692.

[13]  Ann B. Lee,et al.  Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[14]  Ronald R. Coifman,et al.  Diffusion Maps, Spectral Clustering and Eigenfunctions of Fokker-Planck Operators , 2005, NIPS.

[15]  Etienne Huens,et al.  Geographical dispersal of mobile communication networks , 2008, 0802.2178.

[16]  Carl Dean Meyer,et al.  Stochastic Data Clustering , 2010, SIAM J. Matrix Anal. Appl..

[17]  C. Delbruck,et al.  [The theory of migration]. , 1993, Jahrbucher fur Nationalokonomie und Statistik.

[18]  Herbert A. Simon,et al.  Aggregation of Variables in Dynamic Systems , 1961 .

[19]  Bernard Sapoval,et al.  IRREGULAR AND FRACTAL RESONATORS WITH NEUMANN BOUNDARY CONDITIONS : DENSITY OF STATES AND LOCALIZATION , 1997 .

[20]  Renaud Lambiotte,et al.  Uncovering space-independent communities in spatial networks , 2010, Proceedings of the National Academy of Sciences.

[21]  Robert S. Strichartz,et al.  Localized Eigenfunctions: Here You See Them, There You Don't , 2009, 0909.0783.

[22]  Stéphane Lafon,et al.  Diffusion maps , 2006 .

[23]  Graeme Hugo,et al.  Theories of international migration: a review and appraisal. , 1993 .

[24]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[25]  M. Maggioni,et al.  Manifold parametrizations by eigenfunctions of the Laplacian and heat kernels , 2008, Proceedings of the National Academy of Sciences.

[26]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Jukka-Pekka Onnela,et al.  Geographic Constraints on Social Network Groups , 2010, PloS one.