title: Deterministic ripple-spreading model for complex networks.
abstract: This paper proposes a deterministic complex network model, which is inspired by the natural ripple-spreading phenomenon. The motivations and main advantages of the model are the following: (i) The establishment of many real-world networks is a dynamic process, where it is often observed that the influence of a few local events spreads out through nodes, and then largely determines the final network topology. Obviously, this dynamic process involves many spatial and temporal factors. By simulating the natural ripple-spreading process, this paper reports a very natural way to set up a spatial and temporal model for such complex networks. (ii) Existing relevant network models are all stochastic models, i.e., with a given input, they cannot output a unique topology. Differently, the proposed ripple-spreading model can uniquely determine the final network topology, and at the same time, the stochastic feature of complex networks is captured by randomly initializing ripple-spreading related parameters. (iii) The proposed model can use an easily manageable number of ripple-spreading related parameters to precisely describe a network topology, which is more memory efficient when compared with traditional adjacency matrix or similar memory-expensive data structures. (iv) The ripple-spreading model has a very good potential for both extensions and applications.
authors: State Key Laboratory of Earth Surface Processes and Resource Ecology, Beijing Normal University, China.
authors: Xiao-Bing
authors: XB
authors: Hu
authors: Ming
authors: M
authors: Wang
authors: Mark S
authors: MS
authors: Leeson
authors: Evor L
authors: EL
authors: Hines
authors: Ezequiel
authors: E
authors: Di Paolo