Skip to main content

Rank-Based Models of Network Structure and the Discovery of Content

  • Conference paper
Algorithms and Models for the Web Graph (WAW 2011)

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

Included in the following conference series:

  • 789 Accesses

Abstract

Research on self-organizing networks, especially in the context of the Web graph, holds great promise to understand the complexity that underlies many social systems. We argue that models of social network structure should begin to consider how structure arises from the “content” of networks, a term we use to describe attributes of network actors that are independent of their structural position, such as skill, intelligence, or wealth. We propose a rank model of how content (operationalized as attribute rank relative to other individuals) may change amongst agents over time within a stochastic system. We then propose a model of network self-organization based on this rank model. Finally, we demonstrate how one may make inferences about the content of networks when attributes are unobserved, but network structures are readily measured. This approach holds promise to enhance our study of social interactions within the Web graph and in complex social networks in general.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Podolny, J.M., Page, K.L.: Network Forms of Organization. Annual Review of Sociology 24, 57–76 (1998)

    Article  Google Scholar 

  2. Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)

    Book  MATH  Google Scholar 

  3. Thatcher, M.: The Development of Policy Network Analysis: From Modest Origins to Overarching Frameworks. Journal of Theoretical Politics 10(4), 389–416 (1998)

    Article  Google Scholar 

  4. Laumann, E.O., Knocke, D.: The Organizational State: Social Choice in National Policy Domains. University of Wisconsin Press, Madison (1987)

    Google Scholar 

  5. Jackson, M.O.: Social and Economic Networks. Princeton University Press, Princeton (2008)

    MATH  Google Scholar 

  6. Bonato, A.: A Course on the Web graph, Providence, Rhode Island. American Mathematical Society Graduate Studies Series in Mathematics (2008)

    Google Scholar 

  7. Chung, F.R.K., Lu, L.: Complex graphs and networks. American Mathematical Society, U.S.A (2004)

    MATH  Google Scholar 

  8. Henry, A.D.: Measuring Social Networks Using the World Wide Web. In: American Association for the Advancement of Science Annual Meeting, Chicago, Illinois (2009)

    Google Scholar 

  9. Ingold, K.M.: How Network Structures Influence Policy Outputs. Policy Studies Journal (forthcoming)

    Google Scholar 

  10. Borgs, C., Chayes, J.T., Daskalakis, C., Roch, S.: First to Market is not Everything: an Analysis of Preferential Attachment with Fitness. In: Proceedings of the 39rd Annual ACM Symposium on the Theory of Computing (STOC), pp. 135–144 (2007)

    Google Scholar 

  11. Skyrms, B., Pemantle, R.: A Dynamic Model of Social Network Formation. Proceedings of the National Academy of Sciences 97(16), 9340–9346 (2000)

    Article  MATH  Google Scholar 

  12. Janssen, J., Prałat, P., Wilson, R.: Estimating node similarity from co-citation in a spatial graph model. In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC) – Special Track on Self-organizing Complex Systems, pp. 1329–1333 (2010)

    Google Scholar 

  13. Łuczak, T., Prałat, P.: Protean graphs. Internet Mathematics 3, 21–40 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Prałat, P.: A note on the diameter of protean graphs. Discrete Mathematics 308, 3399–3406 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Pralat, P.: Connectivity threshold and recovery time in rank-based models for complex networks. To appear in Discrete Mathematics

    Google Scholar 

  16. Prałat, P., Wormald, N.: Growing protean graphs. Internet Mathematics 4, 1–16 (2009)

    MathSciNet  MATH  Google Scholar 

  17. Janssen, J., Prałat, P.: Protean graphs with a variety of ranking schemes. Theoretical Computer Science 410, 5491–5504 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  18. Janssen, J., Prałat, P.: Rank-based attachment leads to power law graphs. SIAM Journal on Discrete Mathematics 24, 420–440 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  19. Fortunato, S., Flammini, A., Menczer, F.: Scale-free network growth by ranking. Phys. Rev. Lett. 96(21), 218701 (2006)

    Article  Google Scholar 

  20. Wormald, N.: The differential equation method for random graph processes and greedy algorithms. In: Karoński, M., Prömel, H.J. (eds.) Lectures on Approximation and Randomized Algorithms, pp. 73–155. PWN, Warsaw (1999)

    Google Scholar 

  21. Wormald, N.C.: Random graphs and asymptotics. In: Gross, J.L., Yellen, J. (eds.) Handbook of Graph Theory, Section 8.2, pp. 817–836. CRC, Boca Raton (2004)

    Google Scholar 

  22. Janson, S., Łuczak, T., Ruciński, A.: Random Graphs. Wiley, New York (2000)

    Book  MATH  Google Scholar 

  23. Pittel, B., Spencer, J., Wormald, N.: Sudden emergence of a giant k-core in a random graph. J. Combinatorial Theory, Series B 67, 111–151 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Henry, A.D., Prałat, P. (2011). Rank-Based Models of Network Structure and the Discovery of Content. In: Frieze, A., Horn, P., Prałat, P. (eds) Algorithms and Models for the Web Graph. WAW 2011. Lecture Notes in Computer Science, vol 6732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21286-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21286-4_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21285-7

  • Online ISBN: 978-3-642-21286-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics