in Erdős–Rényi (ER) and random scale free (SF) networks, with degree distribution P(k)=ck−λ. We show that the chemical … dimension is dl=2 for ER and SF networks with λ>4, as in percolation in d⩾dc=6 dimensions. For 3<λ<4 we show that dl=(λ−2)/(λ−3 …)/(λ−3) (3<λ<4). We discuss the meaning of these dimensions for networks. …

-free networks embedded by the suggested algorithm are studied both analytically and through simulations. Our findings indicate … dramatic changes in the embedded networks, in comparison to their off-lattice counterparts, and call into question the … applicability of off-lattice scale-free models to realistic, everyday-life networks. …

reconsider the definition of individual fitness which integrates the environment, denoted by the average payoff of all individual … neighbors, with the traditional individual payoffs by introducing a selection parameter u. Tuning u equal to zero returns the ….e., integrating neighborhoods in the evaluation of fitness, promotes cooperation. If we enhance the value of u, the invasion of …

’s trait that resembles the parent’s corresponding trait, which can be fitness, strategy, or the way of strategy adoption for … fitness of players is determined by the payoffs from the current interactions and their history. Based on extensive … the multiplication factor. We attribute the enhancement of cooperation to the inherited fitness that stabilizes the …

lattice made of three (economic) regions, firms, described by a scalar fitness, are allowed to move, adapt, merge or create … variation of the “external economic field condition”. For the firm fitness evolution, we take into account a constraint such … that the disappearance of a firm modifies the fitness of nearest-neighboring ones, as in Bak–Sneppen population fitness …

expected traffic of the network. By changing two parameters which control the fitness and the geographical constraints, the …

continuing fitness to occupy the office. …

Growing networks are introduced in which the vertices are allocated one of two possible growth rates; type A with … probability p(t), or type B with probability 1−p(t). We investigate the networks using rate equations to obtain their degree … a constant and then considering networks where p(t) depends on network parameters that change with time. We find the …

Three models of growing random networks with fitness-dependent growth rates are analysed using the rate equations for … of connectivity k and random additive fitness η, with rate (k−1)+η. For η>0 we find the connectivity distribution is … k, random additive fitness η and random multiplicative fitness ζ with rate ζ(k−1)+η. This model also has a power law …

-law-like degree distribution. Networks with better dynamical performance are achieved if structural evolution occurs much slower than …