اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStructure of Business Firm Networks and Scale-Free Models
123
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the structure of business firm networks and scale-free models with degree distribution $P(q) propto (q+c)^{-lambda}$ using the method of $k$-shell decomposition.We find that the Life Sciences industry network consist of three components: a ``nucleus, which is a small well connected subgraph, ``tendrils, which are small subgraphs consisting of small degree nodes connected exclusively to the nucleus, and a ``bulk body which consists of the majority of nodes. At the same time we do not observe the above structure in the Information and Communication Technology sector of industry. We also conduct a systematic study of these three components in random scale-free networks. Our results suggest that the sizes of the nucleus and the tendrils decrease as $lambda$ increases and disappear for $lambda geq 3$. We compare the $k$-shell structure of random scale-free model networks with two real world business firm networks in the Life Sciences and in the Information and Communication Technology sectors. Our results suggest that the observed behavior of the $k$-shell structure in the two industries is consistent with a recently proposed growth model that assumes the coexistence of both preferential and random agreements in the evolution of industrial networks.
قيم البحث
اقرأ أيضاً
Self-similarity is a property of fractal structures, a concept introduced by Mandelbrot and one of the fundamental mathematical results of the 20th century. The importance of fractal geometry stems from the fact that these structures were recognized
in numerous examples in Nature, from the coexistence of liquid/gas at the critical point of evaporation of water, to snowflakes, to the tortuous coastline of the Norwegian fjords, to the behavior of many complex systems such as economic data, or the complex patterns of human agglomeration. Here we review the recent advances in self-similarity of complex networks and its relation to transport, diffusion, percolations and other topological properties such us degree distribution, modularity, and degree-degree correlations.
Despite the structural properties of online social networks have attracted much attention, the properties of the close-knit friendship structures remain an important question. Here, we mainly focus on how these mesoscale structures are affected by th
e local and global structural properties. Analyzing the data of four large-scale online social networks reveals several common structural properties. It is found that not only the local structures given by the indegree, outdegree, and reciprocal degree distributions follow a similar scaling behavior, the mesoscale structures represented by the distributions of close-knit friendship structures also exhibit a similar scaling law. The degree correlation is very weak over a wide range of the degrees. We propose a simple directed network model that captures the observed properties. The model incorporates two mechanisms: reciprocation and preferential attachment. Through rate equation analysis of our model, the local-scale and mesoscale structural properties are derived. In the local-scale, the same scaling behavior of indegree and outdegree distributions stems from indegree and outdegree of nodes both growing as the same function of the introduction time, and the reciprocal degree distribution also shows the same power-law due to the linear relationship between the reciprocal degree and in/outdegree of nodes. In the mesoscale, the distributions of four closed triples representing close-knit friendship structures are found to exhibit identical power-laws, a behavior attributed to the negligible degree correlations. Intriguingly, all the power-law exponents of the distributions in the local-scale and mesoscale depend only on one global parameter -- the mean in/outdegree, while both the mean in/outdegree and the reciprocity together determine the ratio of the reciprocal degree of a node to its in/outdegree.
We bring rigor to the vibrant activity of detecting power laws in empirical degree distributions in real-world networks. We first provide a rigorous definition of power-law distributions, equivalent to the definition of regularly varying distribution
s that are widely used in statistics and other fields. This definition allows the distribution to deviate from a pure power law arbitrarily but without affecting the power-law tail exponent. We then identify three estimators of these exponents that are proven to be statistically consistent -- that is, converging to the true value of the exponent for any regularly varying distribution -- and that satisfy some additional niceness requirements. In contrast to estimators that are currently popular in network science, the estimators considered here are based on fundamental results in extreme value theory, and so are the proofs of their consistency. Finally, we apply these estimators to a representative collection of synthetic and real-world data. According to their estimates, real-world scale-free networks are definitely not as rare as one would conclude based on the popular but unrealistic assumption that real-world data comes from power laws of pristine purity, void of noise and deviations.
Fractal scale-free networks are empirically known to exhibit disassortative degree mixing. It is, however, not obvious whether a negative degree correlation between nearest neighbor nodes makes a scale-free network fractal. Here we examine the possib
ility that disassortativity in complex networks is the origin of fractality. To this end, maximally disassortative (MD) networks are prepared by rewiring edges while keeping the degree sequence of an initial uncorrelated scale-free network that is guaranteed to become fractal by rewiring edges. Our results show that most of MD networks with different topologies are not fractal, which demonstrates that disassortativity does not cause the fractal property of networks. In addition, we suggest that fractality of scale-free networks requires a long-range repulsive correlation in similar degrees.
Understanding cities is central to addressing major global challenges from climate and health to economic resilience. Although increasingly perceived as fundamental socio-economic units, the detailed fabric of urban economic activities is only now ac
cessible to comprehensive analyses with the availability of large datasets. Here, we study abundances of business categories across U.S. metropolitan statistical areas to investigate how diversity of economic activities depends on city size. A universal structure common to all cities is revealed, manifesting self-similarity in internal economic structure as well as aggregated metrics (GDP, patents, crime). A derivation is presented that explains universality and the observed empirical distribution. The model incorporates a generalized preferential attachment process with ceaseless introduction of new business types. Combined with scaling analyses for individual categories, the theory quantitatively predicts how individual business types systematically change rank with city size, thereby providing a quantitative means for estimating their expected abundances as a function of city size. These results shed light on processes of economic differentiation with scale, suggesting a general structure for the growth of national economies as integrated urban systems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
