Related papers: The co-evolution of brand effect and competitivene…
In this paper, we propose a new model that allows us to investigate this competitive aspect of real networks in quantitative terms. Through theoretical analysis and numerical simulations, we find that the competitive network have the…
We show that to explain the growth of the citation network by preferential attachment (PA), one has to accept that individual nodes exhibit heterogeneous fitness values that decay with time. While previous PA-based models assumed either…
Modeling complex networks has been the focus of much research for over a decade. Preferential attachment (PA) is considered a common explanation to the self organization of evolving networks, suggesting that new nodes prefer to attach to…
Many social and biological networks consist of communities - groups of nodes within which connections are dense, but between which connections are sparser. Recently, there has been considerable interest in designing algorithms for detecting…
In spite of its relevance to the origin of complex networks, the interplay between form and function and its role during network formation remains largely unexplored. While recent studies introduce dynamics by considering rewiring processes…
Many societies are organized in networks that are formed by people who meet and interact over time. In this paper, we present a first model to capture the micro-foundations of social networks evolution, where boundedly rational agents of…
Inspired by empirical data on real world complex networks, the last few years have seen an explosion in proposed generative models to understand and explain observed properties of real world networks, including power law degree distribution…
Understanding of evolutionary mechanism of online social networks is greatly significant for the development of network science. However, present researches on evolutionary mechanism of online social networks are neither deep nor clear…
Models based on preferential attachment have had much success in reproducing the power law degree distributions which seem ubiquitous in both natural and engineered systems. Here, rather than assuming preferential attachment, we give an…
In most networks, the connection between a pair of nodes is the result of their mutual affinity and attachment. In this letter, we will propose a Mutual Attraction Model to characterize weighted evolving networks. By introducing the initial…
We propose a new preferential attachment-based network growth model in order to explain two properties of growing networks: (1) the power-law growth of node degrees and (2) the decay of node relevance. In preferential attachment models, the…
Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of…
In graph theory and network analysis, node degree is defined as a simple but powerful centrality to measure the local influence of node in a complex network. Preferential attachment based on node degree has been widely adopted for modeling…
Complex network theory has been used to study complex systems. However, many real-life systems involve multiple kinds of objects . They can't be described by simple graphs. In order to provide complete information of these systems, we…
The characterization of the "most connected" nodes in static or slowly evolving complex networks has helped in understanding and predicting the behavior of social, biological, and technological networked systems, including their robustness…
Several growth models have been proposed in the literature for scale-free complex networks, with a range of fitness-based attachment models gaining prominence recently. However, the processes by which such fitness-based attachment behaviour…
We propose a model of network growth in which the network is co-evolving together with the dynamics of a quantum mechanical system, namely a quantum walk taking place over the network. The model naturally generalizes the Barab\'{a}si-Albert…
Many real-world networks exhibit degree-assortativity, with nodes of similar degree more likely to link to one another. Particularly in social networks, the contribution to the total assortativity varies with degree, featuring a distinctive…
We introduce a family of one-dimensional geometric growth models, constructed iteratively by locally optimizing the tradeoffs between two competing metrics, and show that this family is equivalent to a family of preferential attachment…
Preferential attachment drives the evolution of many complex networks. Its analytical studies mostly consider the simplest case of a network that grows uniformly in time despite the accelerating growth of many real networks. Motivated by…