Skip to main content

Mining and Modeling Character Networks

  • Conference paper
  • First Online:
Algorithms and Models for the Web Graph (WAW 2016)

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

Included in the following conference series:

Abstract

We investigate social networks of characters found in cultural works such as novels and films. These character networks exhibit many of the properties of complex networks such as skewed degree distribution and community structure, but may be of relatively small order with a high multiplicity of edges. Building on recent work of Beveridge and Shan [4], we consider graph extraction, visualization, and network statistics for three novels: Twilight by Stephanie Meyer, Steven King’s The Stand, and J.K. Rowling’s Harry Potter and the Goblet of Fire. Coupling with 800 character networks from films found in the http://moviegalaxies.com/ database, we compare the data sets to simulations from various stochastic complex networks models including random graphs with given expected degrees (also known as the Chung-Lu model), the configuration model, and the preferential attachment model. Using machine learning techniques based on motif (or small subgraph) counts, we determine that the Chung-Lu model best fits character networks and we conjecture why this may be the case.

Research supported by grants from NSERC and Ryerson University; Gleich and Hou’s work were supported by NSF CAREER Award CCF-1149756, IIS-1546488, CCF-093937, and DARPA SIMPLEX.

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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

References

  1. Alberich, R., Miro-Julia, J., Rossello, F.: Marvel Universe looks almost like a real social network. arXiv preprint arXiv:0202174 (2002)

  2. Agarwal, A., Corvalan, A., Jensen, J., Rambow, O.: Social network analysis of “Alice in Wonderland”. In: Proceedings of the Workshop on Computational Linguistics for Literature (2012)

    Google Scholar 

  3. Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for exploring and manipulating networks, In: Proceedings of the International AAAI Conference on Weblogs and Social Media (2009)

    Google Scholar 

  4. Beveridge, A., Shan, J.: Network of thrones. Math Horizons Mag. 23, 18–22 (2016)

    Article  MathSciNet  Google Scholar 

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

    Book  MATH  Google Scholar 

  6. Bonato, A., Gleich, D.F., Kim, M., Mitsche, D., Pralat, P., Tian, A., Young, S.J.: Dimensionality matching of social networks using motifs and eigenvalues. PLOS ONE 9(9), e106052 (2014)

    Article  Google Scholar 

  7. Bonato, A., Tian, A.: Complex networks and social networks. In: Kranakis, E. (ed.) Social Networks. Mathematics in Industry series. Springer, Heidelberg (2011)

    Google Scholar 

  8. Elenberg, E.R., Shanmugam, K., Borokhovich, M., Dimakis, A.G.: Beyond triangles: a distributed framework for estimating 3-profiles of large graphs, In: Proceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2015)

    Google Scholar 

  9. Elenberg, E.R., Shanmugam, K., Borokhovich, M., Dimakis, A.G.: Distributed estimation of graph 4-profiles. In: Proceedings of International World Wide Web Conference (2016)

    Google Scholar 

  10. Elson, D., Dames, N., McKeown, K.: Extracting social networks from literary fiction. In: Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (2010)

    Google Scholar 

  11. Freund, Y., Schapire, R.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55, 119–139 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gleiser, P.M.: How to become a superhero. J. Stat. Mech.:Theor. Exp. 2007, P09020 (2007)

    Article  Google Scholar 

  13. Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. Springer, Heidelberg (2009)

    Book  MATH  Google Scholar 

  14. Janssen, J., Hurshman, M., Kalyaniwalla, N.: Model selection for social networks using graphlets. Internet Math. 8, 338–363 (2012)

    Article  MathSciNet  Google Scholar 

  15. Kaminski, J., Schober, M., Albaladejo, R., Zastupailo, O., Hidalgo, C.: Moviegalaxies - social networks in movies (2011). http://moviegalaxies.com. Accessed September 2016

  16. Pržulj, N.: Biological network comparison using graphlet degree distribution. Bioinformatics 23, 77–183 (2007)

    Article  Google Scholar 

  17. Reagan, A.J., Mitchell, L., Kiley, D., Danforth, C.M., Dodds, P.S.: The emotional arcs of stories are dominated by six basic shapes, arXiv preprint arXiv:1606.07772 (2016)

  18. Ribeiro, M.A., Vosgerau, R.A., Andruchiw, M.L.P., Ely de Souza Pinto, S.: The complex social network from the Lord of the Rings. Rev. Bras. Ensino Fs 38, 1304 (2016)

    Google Scholar 

  19. Sack, G.: Character networks for narrative generation. In: Intelligent Narrative Technologies: Papers from the AIIDE Workshop, AAAI Technical Report WS-12-14 (2012)

    Google Scholar 

  20. Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning from Theory to Algorithms. Cambridge University Press, Cambridge (2014)

    Book  MATH  Google Scholar 

  21. Shervashidze, N., Vishwanathan, S.V.N., Petri, T.H., Mehlhorn, K., Borgwardt, K.M.: Efficient graphlet kernels for large graph comparison, In: Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (2009)

    Google Scholar 

  22. West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Bonato, A., D’Angelo, D.R., Elenberg, E.R., Gleich, D.F., Hou, Y. (2016). Mining and Modeling Character Networks. In: Bonato, A., Graham, F., Prałat, P. (eds) Algorithms and Models for the Web Graph. WAW 2016. Lecture Notes in Computer Science(), vol 10088. Springer, Cham. https://doi.org/10.1007/978-3-319-49787-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49787-7_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49786-0

  • Online ISBN: 978-3-319-49787-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics