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

Derivative of a hypergraph as a tool for linguistic pattern analysis

Author

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

Abstract

The search for linguistic patterns together with stylometry and forensic linguistics has in the theory of complex networks, its structures and its associated mathematical tools essential resources for representing and analyzing texts. In this paper we introduce a new model able to analyze the mesoscopic relationships between sentences, paragraphs, chapters and texts. This model is supported by several mathematical structures such as the hypergraphs or the concept of derivative graph. The methodology raised from this perspective focuses not only in a quantitative index but also in two peculiar mathematical structures named derivative graph and homogeneity graph. These structures are of singular help to both: detecting the style of an author and determining the linguistic level of a text and, eventually, also for detecting similarities and dissimilarities in texts and even plagiarism.

Suggested Citation

  • 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).
    • Handle: RePEc:eee:chsofr:v:163:y:2022:i:c:s0960077922007901
    DOI: 10.1016/j.chaos.2022.112604
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077922007901
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2022.112604?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. Eduardo G Altmann & Janet B Pierrehumbert & Adilson E Motter, 2009. "Beyond Word Frequency: Bursts, Lulls, and Scaling in the Temporal Distributions of Words," PLOS ONE, Public Library of Science, vol. 4(11), pages 1-7, November.
    2. Michael Brusco & J Dennis Cradit & Douglas Steinley, 2021. "A comparison of 71 binary similarity coefficients: The effect of base rates," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-19, April.
    3. 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.
    4. Jay Bagga, 2004. "Old and new generalizations of line graphs," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2004, pages 1-13, January.
    5. 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).
    6. 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.
    7. 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. Amiri, Babak & Karimianghadim, Ramin, 2024. "A novel text clustering model based on topic modelling and social network analysis," Chaos, Solitons & Fractals, Elsevier, vol. 181(C).
    2. Contreras-Aso, Gonzalo & Criado, Regino & Vera de Salas, Guillermo & Yang, Jinling, 2023. "Detecting communities in higher-order networks by using their derivative graphs," Chaos, Solitons & Fractals, Elsevier, vol. 177(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 & 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).
    2. Contreras-Aso, Gonzalo & Criado, Regino & Vera de Salas, Guillermo & Yang, Jinling, 2023. "Detecting communities in higher-order networks by using their derivative graphs," Chaos, Solitons & Fractals, Elsevier, vol. 177(C).
    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. Casablanca, Rocío M. & Criado, Regino & Mesa, Juan A. & Romance, Miguel, 2024. "Analytical results on local resilience and a composed resilience proposal for complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 187(C).
    5. Eduardo G Altmann & Janet B Pierrehumbert & Adilson E Motter, 2011. "Niche as a Determinant of Word Fate in Online Groups," PLOS ONE, Public Library of Science, vol. 6(5), pages 1-12, May.
    6. Zhou, Xu & Liu, Yanheng & Wang, Jian & Li, Chun, 2017. "A density based link clustering algorithm for overlapping community detection in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 65-78.
    7. Li, Hanwen & Shang, Qiuyan & Deng, Yong, 2021. "A generalized gravity model for influential spreaders identification in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 143(C).
    8. 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.
    9. Yue Yang & Changgui Gu & Qin Xiao & Huijie Yang, 2017. "Evolution of scaling behaviors embedded in sentence series from A Story of the Stone," PLOS ONE, Public Library of Science, vol. 12(2), pages 1-14, February.
    10. Dongxiao He & Di Jin & Carlos Baquero & Dayou Liu, 2014. "Link Community Detection Using Generative Model and Nonnegative Matrix Factorization," PLOS ONE, Public Library of Science, vol. 9(1), pages 1-10, January.
    11. Johannes Wachs & Mih'aly Fazekas & J'anos Kert'esz, 2019. "Corruption Risk in Contracting Markets: A Network Science Perspective," Papers 1909.08664, arXiv.org.
    12. Zhang, Renquan & Wei, Ting & Sun, Yifan & Pei, Sen, 2024. "Influence maximization based on simplicial contagion models," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 645(C).
    13. Kumiko Tanaka-Ishii & Armin Bunde, 2016. "Long-Range Memory in Literary Texts: On the Universal Clustering of the Rare Words," PLOS ONE, Public Library of Science, vol. 11(11), pages 1-14, November.
    14. Heng Chen & Haitao Liu, 2018. "Quantifying Evolution of Short and Long-Range Correlations in Chinese Narrative Texts across 2000 Years," Complexity, Hindawi, vol. 2018, pages 1-12, February.
    15. Chen, Yanguang, 2012. "Zipf’s law, 1/f noise, and fractal hierarchy," Chaos, Solitons & Fractals, Elsevier, vol. 45(1), pages 63-73.
    16. Zörnig, Peter, 2010. "Statistical simulation and the distribution of distances between identical elements in a random sequence," Computational Statistics & Data Analysis, Elsevier, vol. 54(10), pages 2317-2327, October.
    17. Yuan, Qianshun & Semba, Sherehe & Zhang, Jing & Weng, Tongfeng & Gu, Changgui & Yang, Huijie, 2021. "Multi-scale transition matrix approach to time series," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    18. Vieira, Denner S. & Picoli, Sergio & Mendes, Renio S., 2018. "Robustness of sentence length measures in written texts," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 506(C), pages 749-754.
    19. Solomija Buk & Yuri Krynytskyi & Andrij Rovenchak, 2019. "Properties Of Autosemantic Word Networks In Ukrainian Texts," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 22(06), pages 1-22, December.
    20. Cui, Xue-Mei & Yoon, Chang No & Youn, Hyejin & Lee, Sang Hoon & Jung, Jean S. & Han, Seung Kee, 2017. "Dynamic burstiness of word-occurrence and network modularity in textbook systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 487(C), pages 103-110.

    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:163:y:2022:i:c:s0960077922007901. 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.