Graph and matrix metrics to analyze ergodic literature for children

HT'12 - Proceedings of 23rd ACM Conference on Hypertext and Social Media

Volumn , Issue , 2012, Pages 133-142

  Kontopoulou, Eugenia Maria ^a   Predari, Maria ^a   Kostakis, Thymios ^b   Gallopoulos, Efstratios ^a  

^a UNIVERSITY OF PATRAS   (Greece)

^b SEOKO   (Greece)

Author keywords

Directed graph; Ergodic; Hypertext; Interactive fiction; Link analysis; Matrix function; PageRank; Path problem; Ranking; SMRank; Stochastic matrix; Storylet

Indexed keywords

ERGODICS; HYPERTEXT; INTERACTIVE FICTION; LINK ANALYSIS; MATRIX FUNCTIONS; PAGERANK; PATH PROBLEMS; RANKING; SMRANK; STOCHASTIC MATRICES; STORYLET;

HYPERTEXT SYSTEMS; INFORMATION USE; MATHEMATICAL MODELS;

DIRECTED GRAPHS;

EID: 84864066564     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2309996.2310018     Document Type: Conference Paper

References (36)

1. E. Aarseth. Ergodic Literature. The Johns Hopkins University Press., Baltimore, MD, 1997.
2. R. Barthes. S/Z: Essais. Seuil, Paris, 1970.
3. M. Benzi, E. Estrada, and C. Klymko. Ranking hubs and authorities using matrix functions. Technical Report Math/CS TR-2012-003, Emory University, 2012.
4. M. Bernstein. Storyspace 1. In Proc. 13th ACM Conf. Hypertext and Hypermedia, HT'02, pages 172-181, New York, NY, USA, 2002. ACM.
5. M. Bernstein. On hypertext narrative. In Proc. 20th ACM Conf. Hypertext and Hypermedia, HT'09, pages 5-14, New York, NY, USA, 2009. ACM.
6. 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. (Pubitemid 23599677)
7. D. Bouyssou, D. de Werra, and O. Hudry. Claude Berge and the "Oulipo". EURO Newsletter, (6), 2006.
8. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 33:107-117, 1998.
9. 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.
10. R. Brualdi and D. Cvetkovic. A Combinatorial Approach to Matrix Theory and its Applications. Chapman & Hall/CRC, 2009.
11. 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.
12. K. Casey. The Runaway Game. May Davenport Publishers, Los Altos Hills, CA, 2001.
13. 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.
14. C. Crawford. On interactive storytelling. New Riders Games, Berkeley, CA, 2005.
15. J. Crofts, E. Estrada, D. Higham, and A. Taylor. Mapping directed networks. Electronic Transactions on Numerical Analysis, 37:337-350, 2010.
16. A. Doxiadis. The mathematical logic of narrative. In M. Manaresi, editor, Matematica e cultura in Europa, pages 171-181. Springer, Milan, 2005.
17. D. Eggers. A Heartbreaking Work of Staggering Genius. Simon & Schuster, New York, 2000.
18. L. Festinger. The analysis of sociograms using matrix algebra. Human Relations, 2:153-158, 1949.
19. M. Fredman and R. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34(3):596-615, July 1987.
20. I. Gessel and R. Stanley. Algebraic enumeration. In R.L. Graham et al., editor, Handbook of Combinatorics, volume 2, pages 1021-1061. Elsevier, 1995.
21. J. Gross and J. Yellen, editors. Handbook of Graph Theory. CRC Press, 2004.
22. L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18:39-43, 1953.
23. J. Kleinberg. Authoritative Sources in a Hyperlinked Environment. Journal of the ACM, 46(5):604-632, 1999.
24. G. Landow. Hypertext 3.0. Johns Hopkins University Press, 2006.
25. A. Langville and C. Meyer. Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton Univ. Press, 2006.
26. 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.
27. P. Mateti and N. Deo. On algorithms for enumerating all circuits of a graph. SIAM Journal on Computing, 5(1):90-99, 1976.
28. C. Meyer. Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia, 2001.
29. R. Mihalcea and D. Radev. Graph-based Natural Language Processing and Information Retrieval. Cambridge University Press, 2011.
30. N. Montfort. Cybertext killed the hypertext star: The hypertext murder case. Electronic Book Rev., 2000.
31. N. Montfort. Twisty Little Passages. MIT Press, 2003.
32. A. Saemmer. Littératures numériques: tendances, perspectives, outils d'analyse. Études Françaises, 43:111-131, 2007.
33. S. Schreibman, R. Siemens, and J. Unsworth, editors. A Companion to Digital Humanities. Blackwell, Oxford, 2004.
34. J. Shiga. Meanwhile: Pick Any Path. 3,856 Story Possibilities. Amulet Books, 2010.
35. R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972.
36. S. Vigna. Spectral ranking. CoRR, abs/0912.0238, 2009.