Related papers: Activity ageing in growing networks

We present analytical results for the emerging structure of networks that evolve via a combination of growth (by node addition and random attachment) and contraction (by random node deletion). To this end we consider a network model in…

We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…

A non-local model describing the growth of a tree-like transportation network with given allocation rules is proposed. In this model we focus on tree like networks, and the network transports the very resource it needs to build itself. Some…

We found that models of evolving random networks exhibit dynamic scaling similar to scaling of growing surfaces. It is demonstrated by numerical simulations of two variants of the model in which nodes are added as well as removed [Phys.…

We investigate by random-walk simulations and a mean-field theory how growth by biased addition of nodes affects flow of the current through the emergent conducting graph, representing a digital circuit. In the interior of a large network…

The analysis in this paper helps to explain the formation of growing networks with degree distributions that follow extended exponential or power-law tails. We present a generic model in which edge dynamics are driven by a continuous…

We model a system of networking agents that seek to optimize their centrality in the network while keeping their cost, the number of connections they are participating in, low. Unlike other game-theory based models for network evolution,…

Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior…

The effects of link rewiring are considered for the class of directed networks where each node has the same fixed out-degree. We model a network generated by three mechanisms that are present in various networked systems; growth, global…

Preferential attachment is a popular model of growing networks. We consider a generalized model with random node removal, and a combination of preferential and random attachment. Using a high-degree expansion of the master equation, we…

A rank-dependent deactivation mechanism is introduced to network evolution. The growth dynamics of the network is based on a finite memory of individuals, which is implemented by deactivating one site at each time step. The model shows…

We investigate transitions of portals users between different subpages. A weighted network of portals subpages is reconstructed where edge weights are numbers of corresponding transitions. Distributions of link weights and node strengths…

Many networks are complex dynamical systems, where both attributes of nodes and topology of the network (link structure) can change with time. We propose a model of co-evolving networks where both node at- tributes and network structure…

We study the effect of learning dynamics on network topology. A network of discrete dynamical systems is considered for this purpose and the coupling strengths are made to evolve according to a temporal learning rule that is based on the…

This paper presents a comprehensive analysis of the degree statistics in models for growing networks where new nodes enter one at a time and attach to one earlier node according to a stochastic rule. The models with uniform attachment,…

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…

We introduce models of gossip based communication networks in which each node is simultaneously a sensor, a relay and a user of information. We model the status of ages of information between nodes as a discrete time Markov chain. In this…

In citation networks, the activity of papers usually decreases with age and dormant papers may be discovered and become fashionable again. To model this phenomenon, a competition mechanism is suggested which incorporates two factors:…

We propose a model for an evolving citation network that incorporates the citation pattern followed in a particular discipline. We define the citation pattern in a discipline by three factors. The average number of references per article,…

Dynamical processes taking place on real networks define on them evolving subnetworks whose topology is not necessarily the same of the underlying one. We investigate the problem of determining the emerging degree distribution, focusing on…