2006 · 153 citations · 21 references
ComputingInformation SystemsData AnalyticsMobile ComputingService OperationsCommunication NetworksGraph AlgorithmsGraph AnalyticsGraph TheoryMobile NetworksCall Graph ConstructionNetwork ReachabilityReachabilityReachability AnalysisTreasure Hunt
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward this end, existing approaches have almost solely focussed on the individual behaviour of customers. Call graphs, that is, graphs induced by people calling each other, can allow telecom operators to better understand the interaction behaviour of their customers, and potentially provide major insights for designing effective incentives. In this paper, we use the Call Detail Records of a mobile operator from four geographically disparate regions to construct call graphs, and analyse their structural properties. Our findings provide business insights and help devise strategies for Mobile Telecom operators. Another goal of this paper is to identify the shape of such graphs. In order to do so, we extend the well-known reachability analysis approach with some of our own techniques to reveal the shape of such massive graphs. Based on our analysis, we introduce the Treasure-Hunt model to describe the shape of mobile call graphs. The proposed techniques are general enough for analysing any large graph. Finally, how well the proposed model captures the shape of other mobile call graphs needs to be the subject of future studies.
21
Collective dynamics of ‘small-world’ networks
Duncan J. Watts, Steven H. Strogatz · Nature · 1998 · 43.2K citations
Emergence of Scaling in Random Networks
Albert-Ĺaszló Barabási, Réka Albert · Science · 1999 · 36.4K citations · Full text
The Structure and Function of Complex Networks
Michael Newman · SIAM Review · 2003 · 18.7K citations · Full text
Authoritative sources in a hyperlinked environment
Jon Kleinberg · Journal of the ACM · 1999 · 9.1K citations · Full text