Related papers: Evolution equation for a model of surface relaxati…
We study the contact process on a class of evolving scale-free networks, where each node updates its connections at independent random times. We give a rigorous mathematical proof that there is a transition between a phase where for all…
Statistical behavior and scaling properties of iso-height lines in three different saturated two-dimensional grown surfaces with controversial universality classes are investigated using ideas from Schramm-Loewner evolution (SLE$_\kappa$).…
The paper presents results from kinetic Monte Carlo simulations of kinetic surface roughening using an important and experimentally relevant model of epitaxial growth -- the solid-on-solid model with Arrhenius dynamics. A restriction on…
Mathematical modelling of the evolution of the size-spectrum dynamics in aquatic ecosystems was discovered to be a powerful tool to have a deeper insight into impacts of human- and environmental driven changes on the marine ecosystem. In…
A class of solid-on-solid growth models with short range interactions and sequential updates is studied. The models exhibit both smooth and rough phases in dimension d=1. Some of the features of the roughening transition which takes place…
There has been considerable recent interest in the properties of networks, such as citation networks and the worldwide web, that grow by the addition of vertices, and a number of simple solvable models of network growth have been studied.…
Network growth as described by the Duplication-Divergence model proposes a simple general idea for the evolution dynamics of natural networks. In particular it is an alternative to the well known Barab\'asi-Albert model when applied to…
We extend our 2+1 dimensional discrete growth model (PRE 79, 021125 (2009)) with conserved, local exchange dynamics of octahedra, describing surface diffusion. A roughening process was realized by uphill diffusion and curvature dependence.…
We study a restricted solid-on-solid (RSOS) model involving deposition and evaporation with probabilities p and 1-p, respectively, in one-dimensional substrates. It presents a crossover from Edwards-Wilkinson (EW) to Kardar-Parisi-Zhang…
The rate equations are used to study the scale-free behavior of the weight distribution in evolving networks whose topology is determined only by degrees of preexisting vertices. An analysis of these equations shows that the degree…
This paper analyses a $(1,\lambda)$-Evolution Strategy, a randomised comparison-based adaptive search algorithm, on a simple constraint optimisation problem. The algorithm uses resampling to handle the constraint and optimizes a linear…
A recent paper "Emergence of scaling in random networks" (cond-mat/9910332) by Barabasi and Albert proposes a growth mechanism to produce a stationary scale free distribution of the number of edges per node in large networks such as the…
We discuss how various models of scale-free complex networks approach their limiting properties when the size N of the network grows. We focus mainly on equilibrated networks and their finite-size degree distributions. Our results show that…
Different types of interactions coexist and coevolve to shape the structure and function of a multiplex network. We propose here a general class of growth models in which the various layers of a multiplex network coevolve through a set of…
We study the evolution of structural disorder under cooling in supercooled liquids, focusing on covalent networks. We introduce a model for the energy of networks that incorporates weak non-covalent interactions. We show that at…
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…
Electromigration (EM) is one of the major concerns in the reliability analysis of very large scale integration (VLSI) systems due to the continuous technology scaling. Accurately predicting the time-to-failure of integrated circuits (IC)…
A large number of complex networks, both natural and artificial, share the presence of highly heterogeneous, scale-free degree distributions. A few mechanisms for the emergence of such patterns have been suggested, optimization not being…
Configurational arrangement of network architecture and interaction character of individuals are two most influential factors on the mechanisms underlying the evolutionary outcome of cooperation, which is explained by the well-established…
We suggest a method for embedding scale-free networks, with degree distribution P(k) k^-lambda, in regular Euclidean lattices. The embedding is driven by a natural constraint of minimization of the total length of the links in the system.…