- Main
Scaling Properties of Random Networks Under Proximity-based Social Relations
Abstract
We present an analytical framework to investigate the interplay between a communication graph and an overlay of social relationships. Particularly, we focus on geographical distance as the key element that interrelates the concept of routing in a communication network with interaction patterns on the social graph. Through this regime, we attempt to identify classes of social relationships that let the ensuing system scale, i.e., accommodate a large number of users given only finite amount of resources. We establish that stochastically localized communication patterns are indispensable to network scalability.
Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.
Main Content
Enter the password to open this PDF file:
-
-
-
-
-
-
-
-
-
-
-
-
-
-