Vertex-Pursuit in Hierarchical Social Networks
Hierarchical social networks appear in a variety of contexts, such as the on-line social network Twitter, the social organization of companies, and terrorist networks. We examine a dynamic model for the disruption of information flow in hierarchical social networks by considering the vertex-pursuit game Seepage played in directed acyclic graphs (DAGs). In Seepage, agents attempt to block the movement of an intruder who moves downward from the source node to a sink. We propose a generalized stochastic model for DAGs with given expected total degree sequence. Seepage is analyzed rigorously in stochastic DAGs in both the cases of a regular and power law degree sequence.
KeywordsRandom Graph Degree Distribution Directed Acyclic Graph Regular Graph Degree Sequence
Unable to display preview. Download preview PDF.
- 4.Chayes, J.T., Bollobás, B., Borgs, C., Riordan, O.: Directed scale-free graphs. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (2003)Google Scholar
- 7.Diestel, R.: Graph theory. Springer, New York (2000)Google Scholar
- 9.Farley, J.D.: Toward a Mathematical Theory of Counterterrorism. The Proteus Monograph Series. Stanford University (2007)Google Scholar
- 10.Gupte, M., Muthukrishnan, S., Shankar, P., Iftode, L., Li, J.: Finding hierarchy in directed online social networks. In: Proceedings of WWW 2011 (2011)Google Scholar
- 14.Twitaholic, http://twitaholic.com/ (accessed January 10, 2012)
- 15.West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall (2001)Google Scholar
- 16.Wormald, N.C.: Models of random regular graphs. In: Lamb, J.D., Preece, D.A. (eds.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 276, pp. 239–298. Cambridge University Press, Cambridge (1999)Google Scholar