Related papers: Discrete surface growth process as a synchronizati…
In this paper we derive analytically the evolution equation of the interface for a model of surface growth with relaxation to the minimum (SRM) in complex networks. We were inspired by the disagreement between the scaling results of the…
Synchronization problems in complex networks are very often studied by researchers due to its many applications to various fields such as neurobiology, e-commerce and completion of tasks. In particular, Scale Free networks with degree…
In this paper we study the steady state of the fluctuations of the surface for a model of surface growth with relaxation to any of its lower nearest neighbors (SRAM) [F. Family, J. Phys. A {\bf 19}, L441 (1986)] in scale free networks. It…
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.…
In this paper we study the scaling behavior of the fluctuations in the steady state $W_S$ with the system size $N$ for a surface growth process given by the competition between the surface relaxation (SRM) and the Ballistic Deposition (BD)…
We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…
Motivated by synchronization problems in noisy environments, we study the Edwards-Wilkinson process on weighted uncorrelated scale-free networks. We consider a specific form of the weights, where the strength (and the associated cost) of a…
A scale-free network is grown in the Euclidean space with a global directional bias. On a vertical plane, nodes are introduced at unit rate at randomly selected points and a node is allowed to be connected only to the subset of nodes which…
In this paper we study a model of synchronization process on scale free networks with degree-degree correlations. This model was already studied on this kind of networks without correlations by Pastore y Piontti {\it et al.}, Phys. Rev. E…
In this paper we study the scaling behavior of the interface fluctuations (roughness) for a discrete model with conservative noise on complex networks. Conservative noise is a noise which has no external flux of deposition on the surface…
We investigate the behavior of discrete interface growth models belonging to the Edwards--Wilkinson (EW) and Kardar--Parisi--Zhang (KPZ) universality classes, when defined on a complete graph, a topology commonly used to probe the…
We considered the Edwards-Wilkinson model on a small-world network. We studied the finite-size behavior of the surface width by performing exact numerical diagonalization for the underlying coupling matrix. We found that the spectrum…
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…
Motivated by a fundamental synchronization problem in scalable parallel computing and by a recent criterion for ``mean-field'' synchronizability in interacting systems, we study the Edwards-Wilkinson model on two variations of a…
Using a simple model with link removals as well as link additions, we show that an evolving network is scale free with a degree exponent in the range of (2, 4]. We then establish a relation between the network evolution and a set of…
We simulate competitive two-component growth on a one dimensional substrate of $L$ sites. One component is a Poisson-type deposition that generates Kardar-Parisi-Zhang (KPZ) correlations. The other is random deposition (RD). We derive the…
Isolated complex networks have been studied deeply in the last decades due to the fact that many real systems can be modeled using these types of structures. However, it is well known that the behavior of a system not only depends on…
Critical phenomena on scale-free networks with a degree distribution $p_k \sim k^{-\lambda}$ exhibit rich finite-size effects due to its structural heterogeneity. We systematically study the finite-size scaling of percolation and identify…
Motivated by a synchronization problem in distributed computing we studied a simple growth model on regular and small-world networks, embedded in one and two-dimensions. We find that the synchronization landscape (corresponding to the…
A random network is grown by introducing at unit rate randomly selected nodes on the Euclidean space. A node is randomly connected to its $i$-th predecessor of degree $k_i$ with a directed link of length $\ell$ using a probability…