اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Scaling laws of Spatial Structure in Social Networks
442
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Social network structure is very important for understanding human information diffusing, cooperating and competing patterns. It can bring us with some deep insights about how people affect each other. As a part of complex networks, social networks have been studied extensively. Many important universal properties with which we are quite familiar have been recovered, such as scale free degree distribution, small world, community structure, self-similarity and navigability. According to some empirical investigations, we conclude that our social network also possesses another important universal property. The spatial structure of social network is scale invariable. The distribution of geographic distance between friendship is about $Pr(d)propto d^{-1}$ which is harmonious with navigability. More importantly, from the perspective of searching information, this kind of property can benefit individuals most.
قيم البحث
اقرأ أيضاً
In this paper, we study the structural properties of the complex bus network of Chennai. We formulate this extensive network structure by identifying each bus stop as a node, and a bus which stops at any two adjacent bus stops as an edge connecting t
he nodes. Rigorous statistical analysis of this data shows that the Chennai bus network displays small-world properties and a scale-free degree distribution with the power-law exponent, $gamma > 3$.
Recent approaches on elite identification highlighted the important role of {em intermediaries}, by means of a new definition of the core of a multiplex network, the {em generalised} $K$-core. This newly introduced core subgraph crucially incorporate
s those individuals who, in spite of not being very connected, maintain the cohesiveness and plasticity of the core. Interestingly, it has been shown that the performance on elite identification of the generalised $K$-core is sensibly better that the standard $K$-core. Here we go further: Over a multiplex social system, we isolate the community structure of the generalised $K$-core and we identify the weakly connected regions acting as bridges between core communities, ensuring the cohesiveness and connectivity of the core region. This gluing region is the {em Weak core} of the multiplex system. We test the suitability of our method on data from the society of 420.000 players of the Massive Multiplayer Online Game {em Pardus}. Results show that the generalised $K$-core displays a clearly identifiable community structure and that the weak core gluing the core communities shows very low connectivity and clustering. Nonetheless, despite its low connectivity, the weak core forms a unique, cohesive structure. In addition, we find that members populating the weak core have the best scores on social performance, when compared to the other elements of the generalised $K$-core. The weak core provides a new angle on understanding the social structure of elites, highlighting those subgroups of individuals whose role is to glue different communities in the core.
We study the evolutionary Prisoners Dilemma on two social networks obtained from actual relational data. We find very different cooperation levels on each of them that can not be easily understood in terms of global statistical properties of both net
works. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding perfect agreement with the observations in the real networks. Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.
Cities can be characterised and modelled through different urban measures. Consistency within these observables is crucial in order to advance towards a science of cities. Bettencourt et al have proposed that many of these urban measures can be predi
cted through universal scaling laws. We develop a framework to consistently define cities, using commuting to work and population density thresholds, and construct thousands of realisations of systems of cities with different boundaries for England and Wales. These serve as a laboratory for the scaling analysis of a large set of urban indicators. The analysis shows that population size alone does not provide enough information to describe or predict the state of a city as previously proposed, indicating that the expected scaling laws are not corroborated. We found that most urban indicators scale linearly with city size regardless of the definition of the urban boundaries. However, when non-linear correlations are present, the exponent fluctuates considerably.
We consider a cognitive network consisting of n random pairs of cognitive transmitters and receivers communicating simultaneously in the presence of multiple primary users. Of interest is how the maximum throughput achieved by the cognitive users sca
les with n. Furthermore, how far these users must be from a primary user to guarantee a given primary outage. Two scenarios are considered for the network scaling law: (i) when each cognitive transmitter uses constant power to communicate with a cognitive receiver at a bounded distance away, and (ii) when each cognitive transmitter scales its power according to the distance to a considered primary user, allowing the cognitive transmitter-receiver distances to grow. Using single-hop transmission, suitable for cognitive devices of opportunistic nature, we show that, in both scenarios, with path loss larger than 2, the cognitive network throughput scales linearly with the number of cognitive users. We then explore the radius of a primary exclusive region void of cognitive transmitters. We obtain bounds on this radius for a given primary outage constraint. These bounds can help in the design of a primary network with exclusive regions, outside of which cognitive users may transmit freely. Our results show that opportunistic secondary spectrum access using single-hop transmission is promising.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
