An Improved Model for Effective Customer Network Future State Prediction

For the purpose of prediction analysis of customer relationships in social networks, this paper proposes a simple model that can generate future states of a social network based on relevant data analysis and previous research. In this model, we insert nodes and edges of a customer network at the same preferential attachment probabilities, but delete them at different anti-preferential attachment probabilities with the consideration of the limit of network size, the directions of incident links and the factor of time in attractiveness. Furthermore, we propose an improved model based on the simple model that computes the attractiveness measure of nodes by applying time series prediction and takes into account of node in-degrees. Networks generated from our models have a nice property that their in-degree distribution follows the power-law, which desirably characterizes an essential property of social networks. This property is derived by applying the mean-field theory [7]. It is validated through simulation that this model can effectively generate a social network's future state and incorporating the factor of node in-degrees in computing the attractiveness measure of nodes using time series prediction can improve the prediction result.

[1]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[2]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[5]  Christos H. Papadimitriou,et al.  Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet , 2002, ICALP.

[6]  G. B. A. Barab'asi Competition and multiscaling in evolving networks , 2000, cond-mat/0011029.

[7]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[8]  Jitao Sun,et al.  A local-world node deleting evolving network model , 2008 .

[9]  Christos Faloutsos,et al.  Scalable modeling of real graphs using Kronecker multiplication , 2007, ICML '07.

[10]  J M Carlson,et al.  Highly optimized tolerance: a mechanism for power laws in designed systems. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[11]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[12]  P. Erd Os,et al.  On the strength of connectedness of random graphs , 1961 .

[13]  Alan M. Frieze,et al.  Random Deletion in a Scale-Free Random Graph Process , 2004, Internet Math..

[14]  Xiang Li,et al.  A local-world evolving network model , 2003 .

[15]  Gabriele D'Angelo,et al.  Simulation of scale-free networks , 2009, SIMUTools 2009.

[16]  K. Kaski,et al.  A Model For Social Networks , 2006, physics/0601114.

[17]  S. N. Dorogovtsev,et al.  Scaling Behaviour of Developing and Decaying Networks , 2000, cond-mat/0005050.

[18]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[19]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[20]  Fan Chung Graham,et al.  Coupling Online and Offline Analyses for Random Power Law Graphs , 2004, Internet Math..

[21]  Narsingh Deo,et al.  Preferential deletion in dynamic models of web-like networks , 2007, Inf. Process. Lett..

[22]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.

[23]  V. Roychowdhury,et al.  Scale-free and stable structures in complex ad hoc networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.