IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v142y2021ics0960077920309012.html
   My bibliography  Save this article

Enriched line graph: A new structure for searching language collocations

Author

Listed:
  • Criado-Alonso, Ángeles
  • Battaner-Moro, Elena
  • Aleja, David
  • Romance, Miguel
  • Criado, Regino

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.

Suggested Citation

  • Criado-Alonso, Ángeles & Battaner-Moro, Elena & Aleja, David & Romance, Miguel & Criado, Regino, 2021. "Enriched line graph: A new structure for searching language collocations," Chaos, Solitons & Fractals, Elsevier, vol. 142(C).
    • Handle: RePEc:eee:chsofr:v:142:y:2021:i:c:s0960077920309012
    DOI: 10.1016/j.chaos.2020.110509
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077920309012
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2020.110509?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. T. S. Evans & R. Lambiotte, 2010. "Line graphs of weighted networks for overlapping communities," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 77(2), pages 265-272, September.
    2. Jay Bagga, 2004. "Old and new generalizations of line graphs," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2004, pages 1-13, January.
    3. Martinčić-Ipšić, Sanda & Margan, Domagoj & Meštrović, Ana, 2016. "Multilayer network of language: A unified framework for structural analysis of linguistic subsystems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 457(C), pages 117-128.
    4. Porta, Sergio & Crucitti, Paolo & Latora, Vito, 2006. "The network analysis of urban streets: A dual approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 369(2), pages 853-866.
    5. Réka Albert & Hawoong Jeong & Albert-László Barabási, 1999. "Diameter of the World-Wide Web," Nature, Nature, vol. 401(6749), pages 130-131, September.
    6. Aleja, David & Criado, Regino & García del Amo, Alejandro J. & Pérez, Ángel & Romance, Miguel, 2019. "Non-backtracking PageRank: From the classic model to hashimoto matrices," Chaos, Solitons & Fractals, Elsevier, vol. 126(C), pages 283-291.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rasul Kochkarov, 2021. "Research of NP-Complete Problems in the Class of Prefractal Graphs," Mathematics, MDPI, vol. 9(21), pages 1-20, October.
    2. Rasul Kochkarov & Azret Kochkarov, 2022. "Introduction to the Class of Prefractal Graphs," Mathematics, MDPI, vol. 10(14), pages 1-17, July.
    3. Criado-Alonso, Ángeles & Aleja, David & Romance, Miguel & Criado, Regino, 2022. "Derivative of a hypergraph as a tool for linguistic pattern analysis," Chaos, Solitons & Fractals, Elsevier, vol. 163(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Criado-Alonso, Ángeles & Aleja, David & Romance, Miguel & Criado, Regino, 2022. "Derivative of a hypergraph as a tool for linguistic pattern analysis," Chaos, Solitons & Fractals, Elsevier, vol. 163(C).
    2. Badie, Reza & Aleahmad, Abolfazl & Asadpour, Masoud & Rahgozar, Maseud, 2013. "An efficient agent-based algorithm for overlapping community detection using nodes’ closeness," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(20), pages 5231-5247.
    3. Iglesias Pérez, Sergio & Moral-Rubio, Santiago & Criado, Regino, 2021. "A new approach to combine multiplex networks and time series attributes: Building intrusion detection systems (IDS) in cybersecurity," Chaos, Solitons & Fractals, Elsevier, vol. 150(C).
    4. Lei Kang & Chao Yang & Jeffrey C Peters & Peng Zeng, 2016. "Empirical analysis of road networks evolution patterns in a government-oriented development area," Environment and Planning B, , vol. 43(4), pages 698-715, July.
    5. Mohd-Zaid, Fairul & Kabban, Christine M. Schubert & Deckro, Richard F. & White, Edward D., 2017. "Parameter specification for the degree distribution of simulated Barabási–Albert graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 141-152.
    6. Jiang, Bin, 2007. "A topological pattern of urban street networks: Universality and peculiarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 384(2), pages 647-655.
    7. He, He & Yang, Bo & Hu, Xiaoming, 2016. "Exploring community structure in networks by consensus dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 342-353.
    8. Boeing, Geoff, 2017. "OSMnx: New Methods for Acquiring, Constructing, Analyzing, and Visualizing Complex Street Networks," SocArXiv q86sd, Center for Open Science.
    9. Elias Carroni & Paolo Pin & Simone Righi, 2020. "Bring a Friend! Privately or Publicly?," Management Science, INFORMS, vol. 66(5), pages 2269-2290, May.
    10. Zhou, Yaoming & Wang, Junwei, 2018. "Efficiency of complex networks under failures and attacks: A percolation approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 658-664.
    11. Lordan, Oriol & Sallan, Jose M., 2019. "Core and critical cities of global region airport networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 513(C), pages 724-733.
    12. Duan, Shuyu & Wen, Tao & Jiang, Wen, 2019. "A new information dimension of complex network based on Rényi entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 529-542.
    13. Baek, Seung Ki & Kim, Tae Young & Kim, Beom Jun, 2008. "Testing a priority-based queue model with Linux command histories," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(14), pages 3660-3668.
    14. Freddy Hernán Cepeda López, 2008. "La topología de redes como herramienta de seguimiento en el Sistema de Pagos de Alto Valor en Colombia," Borradores de Economia 513, Banco de la Republica de Colombia.
    15. Chung-Yuan Huang & Chuen-Tsai Sun & Hsun-Cheng Lin, 2005. "Influence of Local Information on Social Simulations in Small-World Network Models," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 8(4), pages 1-8.
    16. Wagner, Roy, 2008. "On the metric, topological and functional structures of urban networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(8), pages 2120-2132.
    17. Xue Guo & Hu Zhang & Tianhai Tian, 2019. "Multi-Likelihood Methods for Developing Stock Relationship Networks Using Financial Big Data," Papers 1906.08088, arXiv.org.
    18. Chang, Chia-ling & Chen, Shu-heng, 2011. "Interactions in DSGE models: The Boltzmann-Gibbs machine and social networks approach," Economics Discussion Papers 2011-25, Kiel Institute for the World Economy (IfW Kiel).
    19. Lin, Yi & Zhang, Jianwei & Yang, Bo & Liu, Hong & Zhao, Liping, 2019. "An optimal routing strategy for transport networks with minimal transmission cost and high network capacity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 551-561.
    20. Stefano Breschi & Lucia Cusmano, 2002. "Unveiling the Texture of a European Research Area: Emergence of Oligarchic Networks under EU Framework Programmes," KITeS Working Papers 130, KITeS, Centre for Knowledge, Internationalization and Technology Studies, Universita' Bocconi, Milano, Italy, revised Jul 2002.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:142:y:2021:i:c:s0960077920309012. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.