Enriched line graph: A new structure for searching language collocations

Abstract The specific terminology of a specialty language comes, essentially, from specific uses of already existing words and/or from specific combinations of words so called “collocations”. In this work we introduce a new mathematical structure (enriched line graph) and a new methodology to extract properties and characteristics of a type of multilayer linguistic networks associated with these types of languages. Specifically, this work is focused on the description of a methodology based on a variant of the PageRank algorithm to locate the linguistic collocations and on defining a new structure (enriched line graph) that can be interpreted as a certain type of “interpolation” between the original graph and its associated line graph, showing new results, properties and applications of this concept, and, in particular, certain characteristics of the specialty language produced by the scientific community of complex networks.

[1]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[2]  Miguel Romance,et al.  On the edges' PageRank and line graphs. , 2018, Chaos.

[3]  Renaud Lambiotte,et al.  Line graphs of weighted networks for overlapping communities , 2010 .

[4]  Miguel Romance,et al.  Structural properties of the line-graphs associated to directed networks , 2012, Networks Heterog. Media.

[5]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[6]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[7]  Ana Mestrovic,et al.  Multilayer Network of Language: a Unified Framework for Structural Analysis of Linguistic Subsystems , 2015, ArXiv.

[8]  Sebastiano Vigna,et al.  PageRank: Functional dependencies , 2009, TOIS.

[9]  V. Latora,et al.  Complex Networks: Principles, Methods and Applications , 2017 .

[10]  Lucas Antiqueira,et al.  Analyzing and modeling real-world phenomena with complex networks: a survey of applications , 2007, 0711.3199.

[11]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[12]  Alexandre Arenas,et al.  Semantic Networks: Structure and Dynamics , 2010, Entropy.

[13]  S N Dorogovtsev,et al.  Language as an evolving word web , 2001, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[14]  Miguel Romance,et al.  Efficient algorithms for estimating loss of information in a complex network: Applications to intentional risk analysis , 2015, Networks Heterog. Media.

[15]  Tony McEnery,et al.  Corpus Linguistics: Method, Theory and Practice , 1996 .

[16]  Miguel Romance,et al.  Analytical relationships between metric and centrality measures of a network and its dual , 2011, J. Comput. Appl. Math..

[17]  G. J. Rodgers,et al.  Network properties of written human language. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Haitao Liu,et al.  Dependency distance: A new perspective on syntactic patterns in natural languages. , 2017, Physics of life reviews.

[19]  M. Aigner On the linegraph of a directed graph , 1967 .

[20]  Jay Bagga Old and new generalizations of line graphs , 2004, Int. J. Math. Math. Sci..

[21]  H. Whitney Congruent Graphs and the Connectivity of Graphs , 1932 .

[22]  Miguel Romance,et al.  Non-backtracking PageRank: From the classic model to hashimoto matrices , 2019, Chaos, Solitons & Fractals.

[23]  Miguel Romance,et al.  Intentional Risk Management through Complex Networks Analysis , 2015 .

[24]  John Sinclair,et al.  Corpus, Concordance, Collocation , 1991 .

[25]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[26]  Haitao Liu,et al.  Approaching human language with complex networks. , 2014, Physics of life reviews.

[27]  Jesús Gómez-Gardeñes,et al.  A mathematical model for networks with structures in the mesoscale , 2010, Int. J. Comput. Math..

[28]  Miguel Romance,et al.  Centralities of a network and its line graph: an analytical comparison by means of their irregularity , 2014, Int. J. Comput. Math..

[29]  Mason A. Porter,et al.  Multilayer networks , 2013, J. Complex Networks.

[30]  Ricard Solé,et al.  Language: Syntax for free? , 2005, Nature.

[31]  Z. Wang,et al.  The structure and dynamics of multilayer networks , 2014, Physics Reports.

[32]  Haitao Liu,et al.  What role does syntax play in a language network , 2008 .

[33]  Béla Bollobás,et al.  The consequences of Zipf's law for syntax and symbolic reference , 2005, Proceedings of the Royal Society B: Biological Sciences.

[34]  R. Criado,et al.  Using complex networks to identify patterns in specialty mathematical language: a new approach , 2020, Social Network Analysis and Mining.

[35]  R. Lambiotte,et al.  Line graphs, link partitions, and overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  Ricard V. Solé,et al.  Language networks: Their structure, function, and evolution , 2010 .

[37]  Miguel Romance,et al.  Line graphs for a multiplex network. , 2016, Chaos.

[38]  V. Latora,et al.  The Network Analysis of Urban Streets: A Primal Approach , 2006 .

[39]  V. Latora,et al.  Centrality in networks of urban streets. , 2006, Chaos.

[40]  G. Pullum,et al.  The Cambridge Grammar of the English Language , 2002 .

[41]  Jennifer Pearson,et al.  Working with Specialized Language: A Practical Guide to Using Corpora , 2002 .

[42]  Ramon Ferrer i Cancho,et al.  The small world of human language , 2001, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[43]  John Scott What is social network analysis , 2010 .

[44]  Francisco Pedroche,et al.  On the Localization of the Personalized PageRank of Complex Networks , 2012, ArXiv.

[45]  Francisco Pedroche,et al.  A biplex approach to PageRank centrality: From classic to multiplex networks. , 2016, Chaos.

[46]  Mark Newman,et al.  Networks: An Introduction , 2010 .