Skip to main content

Vertex-Pursuit in Hierarchical Social Networks

  • Conference paper
  • 1022 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7287)

Abstract

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.

Keywords

  • Random Graph
  • Degree Distribution
  • Directed Acyclic Graph
  • Regular Graph
  • Degree Sequence

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

The authors gratefully acknowledge support from Mprime, NSERC, and Ryerson.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Almendral, J.A., López, L., Sanjuán, M.A.F.: Information flow in generalized hierarchical networks. Physica A 324, 424–429 (2003)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Bonato, A.: A Course on the Web Graph. Graduate Studies in Mathematics Series. American Mathematical Society, Providence (2008)

    MATH  Google Scholar 

  3. Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence (2011)

    MATH  Google Scholar 

  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 

  5. Chung, F.R.K., Lu, L.: Complex graphs and networks. American Mathematical Society, Providence (2006)

    MATH  Google Scholar 

  6. Clarke, N.E., Finbow, S., Fitzpatrick, S.L., Messinger, M.E., Nowakowski, R.J.: Seepage in directed acyclic graphs. Australasian Journal of Combinatorics 43, 91–102 (2009)

    MathSciNet  MATH  Google Scholar 

  7. Diestel, R.: Graph theory. Springer, New York (2000)

    Google Scholar 

  8. Farley, J.D.: Breaking Al Qaeda cells: a mathematical analysis of counterterrorism operations (A guide for risk assessment and decision making). Studies in Conflict & Terrorism 26, 399–411 (2003)

    CrossRef  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 

  11. Gutfraind, A., Hagberg, A., Pan, F.: Optimal Interdiction of Unreactive Markovian Evaders. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 102–116. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  12. Ikeda, K., Richey, S.E.: Japanese network capital: the impact of social networks on japanese political participation. Political Behavior 27, 239–260 (2005)

    CrossRef  Google Scholar 

  13. López, L., Mendes, J.F.F., Sanjuán, M.A.F.: Hierarchical social networks and information flow. Physica A: Statistical Mechanics and its Applications 316, 695–708 (2002)

    CrossRef  MathSciNet  MATH  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonato, A., Mitsche, D., Prałat, P. (2012). Vertex-Pursuit in Hierarchical Social Networks. In: Agrawal, M., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2012. Lecture Notes in Computer Science, vol 7287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29952-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29952-0_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29951-3

  • Online ISBN: 978-3-642-29952-0

  • eBook Packages: Computer ScienceComputer Science (R0)