A Study of the Spatio-Temporal Correlations in Mobile Calls Networks

  title={A Study of the Spatio-Temporal Correlations in Mobile Calls Networks},
  author={Romain Guigour{\`e}s and Marc Boull{\'e} and Fabrice Rossi},
For the last few years, the amount of data has significantly increased in the companies. It is the reason why data analysis methods have to evolve to meet new demands. In this article, we introduce a practical analysis of a large database from a telecommunication operator. The problem is to segment a territory and characterize the retrieved areas owing to their inhabitant behavior in terms of mobile telephony. We have call detail records collected during five months in France. We propose a two… 


Regions and borders of mobile telephony in Belgium and in the Brussels metropolitan zone
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
Segmentation of towns using call detail records
A nonparametric method based on a Bayesian Approach is proposed to determine the finest segmentation of towns using call detail records, and makes a coclustering on the edges defined as bidimensionnal items described by two features : the source and target nodes.
Community detection in graphs
A Triclustering Approach for Time Evolving Graphs
A novel technique to track structures in time evolving graphs based on a parameter free approach for three-dimensional co-clustering of the source vertices, the target vertices and the time, where the time segments are directly inferred from the evolution of the edge distribution between the vertices.
Role models for complex networks
A framework for automatically decomposing the functional classes of agents within a complex network represented by the nodes of an image graph, using a first principles approach, to derive a measure for the fit of a network to any given image graph allowing objective hypothesis testing.
Fast unfolding of communities in large networks
This work proposes a heuristic method that is shown to outperform all other known community detection methods in terms of computation time and the quality of the communities detected is very good, as measured by the so-called modularity.
Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions
This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings and proposes three effective and efficient techniques for obtaining high-quality combiners (consensus functions).
A Mathematical Theory of Communication
It is proved that the authors can get some positive data rate that has the same small error probability and also there is an upper bound of the data rate, which means they cannot achieve the data rates with any encoding scheme that has small enough error probability over the upper bound.
Modularity and community structure in networks.
  • M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2006
It is shown that the modularity of a network can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which is called modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times.
Social Structure from Multiple Networks. I. Blockmodels of Roles and Positions
Networks of several distinct types of social tie are aggregated by a dual model that partitions a population while simultaneously identifying patterns of relations. Concepts and algorithms are