Related papers: Preferential attachment during the evolution of a …
We apply energy landscape methods to digital alchemy, defining a system in which the parameters of the potential are treated as degrees of freedom. Using geometrical optimisation, we locate minima and transition states on the landscape for…
In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small world effect. While the average shortest path length increases…
In many networks such as transportation or communication networks, distance is certainly a relevant parameter. In addition, real-world examples suggest that when long-range links are existing, they usually connect to hubs-the well connected…
Inspired by scientific collaboration networks, especially our empirical analysis of the network of econophysicists, an evolutionary model for weighted networks is proposed. Both degree-driven and weight-driven models are considered.…
Many complex networks from the World-Wide-Web to biological networks are growing taking into account the heterogeneous features of the nodes. The feature of a node might be a discrete quantity such as a classification of a URL document as…
We introduce a self-organized model of graph evolution associated with preferential network random walkers. The idea is developed by using two different types of walkers, the interactions of which lead to a dynamic graph. The walkers of the…
All real networks are different, but many have some structural properties in common. There seems to be no consensus on what the most common properties are, but scale-free degree distributions, strong clustering, and community structure are…
We study scale free simple graphs with an exponent of the degree distribution $\gamma$ less than two. Generically one expects such extremely skewed networks -- which occur very frequently in systems of virtually or logically connected units…
The knowledge of the Free Energy Landscape topology is the essential key to understand many biochemical processes. The determination of the conformers of a protein and their basins of attraction takes a central role for studying molecular…
We study network growth from a fixed set of initially isolated nodes placed at random on the surface of a sphere. The growth mechanism we use adds edges to the network depending on strictly local gain and cost criteria. Only nodes that are…
The area of networks is very interdisciplinary and exhibits many applications in several fields of science. Nevertheless, there are few studies focusing on geographically located $d$-dimensional networks. In this paper, we study scaling…
Biological evolution can be conceptualized as a search process in the space of gene sequences guided by the fitness landscape, a mapping that assigns a measure of reproductive value to each genotype. Here we discuss probabilistic models of…
Many real-world networks exhibit scale-free feature, have a small diameter and a high clustering tendency. We have studied the properties of a growing network, which has all these features, in which an incoming node is connected to its…
The energy landscapes of proteins have evolved to be different from most random heteropolymers. Many studies have concluded that evolutionary selection for rapid and reliable folding to a given structure that is stable at biological…
In this paper we provide numerical evidence of the richer behavior of the connectivity degrees in heterogeneous preferential attachment networks in comparison to their homogeneous counterparts. We analyze the degree distribution in the…
In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that…
We propose a model that generates a new class of networks exhibiting power-law degree distribution with a spectrum of exponents depending on the number of links ($m$) with which incoming nodes join the existing network. Unlike the…
Ever since the Barab\'{a}si-Albert (BA) scale-free network has been proposed, network modeling has been studied intensively in light of the network growth and the preferential attachment (PA). However, numerous real systems are featured…
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…
A network growth mechanism based on a two-step preferential rule is investigated as a model of network growth in which no global knowledge of the network is required. In the first filtering step a subset of fixed size $m$ of existing nodes…