اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOrganization of modular networks
65
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We examine the global organization of heterogeneous equilibrium networks consisting of a number of well distinguished interconnected parts--``communities or modules. We develop an analytical approach allowing us to obtain the statistics of connected components and an intervertex distance distribution in these modular networks, and to describe their global organization and structure. In particular, we study the evolution of the intervertex distance distribution with an increasing number of interlinks connecting two infinitely large uncorrelated networks. We demonstrate that even a relatively small number of shortcuts unite the networks into one. In more precise terms, if the number of the interlinks is any finite fraction of the total number of connections, then the intervertex distance distribution approaches a delta-function peaked form, and so the network is united.
قيم البحث
اقرأ أيضاً
The combination of the compactness of networks, featuring small diameters, and their complex architectures results in a variety of critical effects dramatically different from those in cooperative systems on lattices. In the last few years, researche
rs have made important steps toward understanding the qualitatively new critical phenomena in complex networks. We review the results, concepts, and methods of this rapidly developing field. Here we mostly consider two closely related classes of these critical phenomena, namely structural phase transitions in the network architectures and transitions in cooperative models on networks as substrates. We also discuss systems where a network and interacting agents on it influence each other. We overview a wide range of critical phenomena in equilibrium and growing networks including the birth of the giant connected component, percolation, k-core percolation, phenomena near epidemic thresholds, condensation transitions, critical phenomena in spin models placed on networks, synchronization, and self-organized criticality effects in interacting systems on networks. We also discuss strong finite size effects in these systems and highlight open problems and perspectives.
We examine the global organization of growing networks in which a new vertex is attached to already existing ones with a probability depending on their age. We find that the network is infinite- or finite-dimensional depending on whether the attachme
nt probability decays slower or faster than $(age)^{-1}$. The network becomes one-dimensional when the attachment probability decays faster than $(age)^{-2}$. We describe structural characteristics of these phases and transitions between them.
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different spanning trees to a set of destinations, has been argued to introduce un
controlled sampling biases that might produce statistical properties of the sampled graph which sharply differ from the original ones. Here we explore these biases and provide a statistical analysis of their origin. We derive a mean-field analytical approximation for the probability of edge and vertex detection that exploits the role of the number of sources and targets and allows us to relate the global topological properties of the underlying network with the statistical accuracy of the sampled graph. In particular we find that the edge and vertex detection probability is depending on the betweenness centrality of each element. This allows us to show that shortest path routed sampling provides a better characterization of underlying graphs with scale-free topology. We complement the analytical discussion with a throughout numerical investigation of simulated mapping strategies in different network models. We show that sampled graphs provide a fair qualitative characterization of the statistical properties of the original networks in a fair range of different strategies and exploration parameters. The numerical study also allows the identification of intervals of the exploration parameters that optimize the fraction of nodes and edges discovered in the sampled graph. This finding might hint the steps toward more efficient mapping strategies.
We introduce a minimal network model which generates a modular structure in a self-organized way. To this end, we modify the Barabasi-Albert model into the one evolving under the principle of division and independence as well as growth and preferenti
al attachment (PA). A newly added vertex chooses one of the modules composed of existing vertices, and attaches edges to vertices belonging to that module following the PA rule. When the module size reaches a proper size, the module is divided into two, and a new module is created. The karate club network studied by Zachary is a prototypical example. We find that the model can reproduce successfully the behavior of the hierarchical clustering coefficient of a vertex with degree k, C(k), in good agreement with empirical measurements of real world networks.
Universality in the behavior of complex systems often reveals itself in the form of scale-invariant distributions that are essentially independent of the details of the microscopic dynamics. A representative paradigm of complex behavior in nature is
cooperative evolution. The interaction of individuals gives rise to a wide variety of collective phenomena that strongly differ from individual dynamics---such as demographic evolution, cultural and technological development, and economic activity. A striking example of such cooperative phenomena is the formation of urban aggregates which, in turn, can be considered to cooperate in giving rise to nations. We find that population and area distributions of nations follow an inverse power-law behavior, as is known for cities. The exponents, however, are radically different in the two cases ($mu approx 1$ for nations, $mu approx 2$ for cities). We interpret these findings by developing growth models for cities and for nations related to basic properties of partition of the plane. These models allow one to understand the empirical findings without resort to the introduction of complex socio-economic factors.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
