اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدScale-free networks without growth
399
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this letter, we proposed an ungrowing scale-free network model, wherein the total number of nodes is fixed and the evolution of network structure is driven by a rewiring process only. In spite of the idiographic form of $G$, by using a two-order master equation, we obtain the analytic solution of degree distribution in stable state of the network evolution under the condition that the selection probability $G$ in rewiring process only depends on nodes degrees. A particular kind of the present networks with $G$ linearly correlated with degree is studied in detail. The analysis and simulations show that the degree distributions of these networks can varying from the Possion form to the power-law form with the decrease of a free parameter $alpha$, indicating the growth may not be a necessary condition of the self-organizaton of a network in a scale-free structure.
قيم البحث
اقرأ أيضاً
We consider the discrete surface growth process with relaxation to the minimum [F. Family, J. Phys. A {bf 19} L441, (1986).] as a possible synchronization mechanism on scale-free networks, characterized by a degree distribution $P(k) sim k^{-lambda}$
, where $k$ is the degree of a node and $lambda$ his broadness, and compare it with the usually applied Edward-Wilkinson process [S. F. Edwards and D. R. Wilkinson, Proc. R. Soc. London Ser. A {bf 381},17 (1982) ]. In spite of both processes belong to the same universality class for Euclidean lattices, in this work we demonstrate that for scale-free networks with exponents $lambda<3$ this is not true. Moreover, we show that for these ubiquitous cases the Edward-Wilkinson process enhances spontaneously the synchronization when the system size is increased, which is a non-physical result. Contrarily, the discrete surface growth process do not present this flaw and is applicable for every $lambda$.
Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of unlike type
. Such bipartite graphs appear in many social networks, for instance in affiliation networks and in sexual contact networks in which both types of nodes show the scale-free characteristic for the degree distribution. During the depreciation process, an edge between nodes with degrees k and q is retained with probability proportional to (kq)^(-alpha), where alpha is positive so that links between hubs are more prone to failure. The removal process is studied analytically by introducing a generating functions theory. We deduce exact self-consistent equations describing the system at a macroscopic level and discuss the percolation transition. Critical exponents are obtained by exploiting the Fortuin-Kasteleyn construction which provides a link between our model and a limit of the Potts model.
Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a network in wh
ich the probability for an edge between nodes $i$ and $j$ to be retained is proportional to $(k_ik_j)^{-alpha}$ with $k_i$ and $k_j$ the degrees of the nodes. We discuss two methods of network reconstruction, sequential and simultaneous, and investigate their properties by analytical and numerical means. The system is examined away from the percolation transition, where the size of the giant cluster is obtained, and close to the transition, where nonuniversal critical exponents are extracted using the generating functions method. The theory is found to agree quite well with simulations. By introducing an extension of the Fortuin-Kasteleyn construction, we find that biased percolation is well described by the $qto 1$ limit of the $q$-state Potts model with inhomogeneous couplings.
We introduce a network growth model in which the preferential attachment probability includes the fitness vertex and the Euclidean distance between nodes. We grow a planar network around its barycenter. Each new site is fixed in space by obeying a power law distribution.
Contrary to many recent models of growing networks, we present a model with fixed number of nodes and links, where it is introduced a dynamics favoring the formation of links between nodes with degree of connectivity as different as possible. By appl
ying a local rewiring move, the network reaches equilibrium states assuming broad degree distributions, which have a power law form in an intermediate range of the parameters used. Interestingly, in the same range we find non-trivial hierarchical clustering.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
