Eugenia-Maria Kontopoulou
ABSTRACT
What can graph and matrix based mathematical models tell us about ergodic literature? A digraph of storylets connected by links and the corresponding adjacency matrix encoding is used to formulate some queries regarding hypertexts of this type. It is reasoned that the Google random surfer provides a useful model for the behavior of the reader of such fiction. This motivates the use of graph and Web based metrics for ranking storylets and some other tasks. A dataset, termed childif, based on printed books from three series popular with children and young adults and its characteristics are described. Two link-based metrics, SMrank and versions of PageRank, are described and applied on childif to rank storylets. It is shown that several characteristics of these stories can be expressed as and computed with matrix operations. An interpretation of the ranking results is provided. Results on some acyclic digraphs indicate that the rankings convey useful information regarding plot development. In conclusion, using matrix and graph theoretic techniques one can extract useful information from this type of ergodic literature that would be harder to obtain by simply reading it or by examining the underlying digraph.
- E. Aarseth. Ergodic Literature. The Johns Hopkins University Press., Baltimore, MD, 1997. Google Scholar
Digital Library
- R. Barthes. S/Z: Essais. Seuil, Paris, 1970.Google Scholar
- M. Benzi, E. Estrada, and C. Klymko. Ranking hubs and authorities using matrix functions. Technical Report Math/CS TR-2012-003, Emory University, 2012.Google Scholar
- M. Bernstein. Storyspace 1. In Proc. 13th ACM Conf. Hypertext and Hypermedia, HT'02, pages 172--181, New York, NY, USA, 2002. ACM. Google ScholarDigital Library
- M. Bernstein. On hypertext narrative. In Proc. 20th ACM Conf. Hypertext and Hypermedia, HT'09, pages 5--14, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- R. A. Botafogo, E. Rivlin, and B. Shneiderman. Structural analysis of hypertexts: Identifying hierarchies and useful metrics. ACM Trans. Inf. Syst., 10:142--180, April 1992. Google ScholarDigital Library
- D. Bouyssou, D. de Werra, and O. Hudry. Claude Berge and the 'Oulipo'. EURO Newsletter, (6), 2006.Google Scholar
- S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 33:107--117, 1998. Google ScholarDigital Library
- A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the Web. Comput. Netw., 33(1--6):309--320, 2000. Google ScholarDigital Library
- R. Brualdi and D. Cvetkovic. A Combinatorial Approach to Matrix Theory and its Applications. Chapman & Hall/CRC, 2009.Google Scholar
- A. Bruckman. The combinatorics of storytelling: Mystery train interactive. Unpublished paper, MIT Media Lab in http://www.cc.gatech.edu/ asb/papers/misc/combinatorics-bruckman-90.pdf, 1990.Google Scholar
- K. Casey. The Runaway Game. May Davenport Publishers, Los Altos Hills, CA, 2001.Google Scholar
- M. P. Consens and A. O. Mendelzon. Expressing structural hypertext queries in Graphlog. In Proc. 2nd Annual ACM Conf. on Hypertext, HT'89, pages 269--292, New York, NY, USA, 1989. ACM. Google ScholarDigital Library
- C. Crawford. On interactive storytelling. New Riders Games, Berkeley, CA, 2005. Google ScholarDigital Library
- J. Crofts, E. Estrada, D. Higham, and A. Taylor. Mapping directed networks. Electronic Transactions on Numerical Analysis, 37:337--350, 2010.Google Scholar
- A. Doxiadis. The mathematical logic of narrative. In M. Manaresi, editor, Matematica e cultura in Europa, pages 171--181. Springer, Milan, 2005.Google Scholar
- D. Eggers. A Heartbreaking Work of Staggering Genius. Simon & Schuster, New York, 2000.Google Scholar
- L. Festinger. The analysis of sociograms using matrix algebra. Human Relations, 2:153--158, 1949.Google ScholarCross Ref
- M. Fredman and R. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34(3):596--615, July 1987. Google ScholarDigital Library
- I. Gessel and R. Stanley. Algebraic enumeration. In R.L. Graham et al., editor, Handbook of Combinatorics, volume 2, pages 1021--1061. Elsevier, 1995. Google ScholarDigital Library
- J. Gross and J. Yellen, editors. Handbook of Graph Theory. CRC Press, 2004.Google ScholarCross Ref
- L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18:39--43, 1953.Google ScholarCross Ref
- J. Kleinberg. Authoritative Sources in a Hyperlinked Environment. Journal of the ACM, 46(5):604--632, 1999. Google ScholarDigital Library
- G. Landow. Hypertext 3.0. Johns Hopkins University Press, 2006.Google Scholar
- A. Langville and C. Meyer. Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton Univ. Press, 2006. Google ScholarDigital Library
- M. Levene and G. Loizou. Web interaction and the navigation problem in hypertext. In Encyclopedia of Microcomputers, volume 28 (suppl. 7), pages 381--398. Marcel Dekker, New York, 2002.Google Scholar
- P. Mateti and N. Deo. On algorithms for enumerating all circuits of a graph. SIAM Journal on Computing, 5(1):90--99, 1976.Google ScholarCross Ref
- C. Meyer. Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia, 2001. Google ScholarDigital Library
- R. Mihalcea and D. Radev. Graph-based Natural Language Processing and Information Retrieval. Cambridge University Press, 2011. Google ScholarDigital Library
- N. Montfort. Cybertext killed the hypertext star: The hypertext murder case. Electronic Book Rev., 2000.Google Scholar
- N. Montfort. Twisty Little Passages. MIT Press, 2003.Google ScholarCross Ref
- A. Saemmer. Littératures numériques: tendances, perspectives, outils d'analyse. Études Françaises, 43:111--131, 2007.Google Scholar
- S. Schreibman, R. Siemens, and J. Unsworth, editors. A Companion to Digital Humanities. Blackwell, Oxford, 2004. Google ScholarDigital Library
- J. Shiga. Meanwhile: Pick Any Path. 3,856 Story Possibilities. Amulet Books, 2010.Google Scholar
- R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146--160, 1972.Google ScholarDigital Library
- S. Vigna. Spectral ranking. CoRR, abs/0912.0238, 2009.Google Scholar
Index Terms
- Graph and matrix metrics to analyze ergodic literature for children
Recommendations
Onomatology and content analysis of ergodic literature
NHT '13: Proceedings of the 3rd Narrative and Hypertext WorkshopWe first establish a connection between the concept of ergodicity in mathematics and "ergodic literature" of the Choose-your-own-Adventure (CYOA) type that serves to answer some existing objections regarding the use of the term in the latter context. We ...
Ranking target objects of navigational queries
WIDM '06: Proceedings of the 8th annual ACM international workshop on Web information and data managementWeb navigation plays an important role in exploring public interconnected data sources such as life science data. A navigational query in the life science graph produces a result graph which is a layered directed acyclic graph (DAG). Traversing the ...
Querying the web graph
SPIRE'10: Proceedings of the 17th international conference on String processing and information retrievalThis paper focuses on using hyperlinks in the ranking of web search results. We give a brief overview of the vast body of work in the area; we provide a quantitative comparison of the different features; we sketch how link-based ranking features can be ...
Comments