Daniel Aguilar-velázquez

Dr. Daniel Aguilar-velázquez


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 November 2015 in Entropy
Verified
Journal Article
Open access
PDF file
LGLev Guzman-Vargas
Lev Guzman-Vargas
BOBibiana Obregón-Quintana
Bibiana Obregón-Quintana
DADaniel Aguilar-velázquez
Daniel Aguilar-velázquez
RHRicardo Hernandez-Perez
Ricardo Hernandez-Perez
LLLarry S. Liebovitch
Larry S. Liebovitch
We study the correlation properties of word lengths in large texts from 30 ebooks in the English language from the Gutenberg Project (www.gutenberg.org) using the natural visibility graph method (NVG). NVG converts a time series into a graph and then analyzes its graph properties. First, the original sequence of words is transformed into a sequence of values containing the length of each word, and then, it is integrated. Next, we apply the NVG to the integrated word-length series and construct the network. We show that the degree distribution of that network follows a power law, P ( k ) ∼ k - γ , with two regimes, which are characterized by the exponents γ s ≈ 1 . 7 (at short degree scales) and γ l ≈ 1 . 3 (at large degree scales). This suggests that word lengths are much more strongly correlated at large distances between words than at short distances between words. That finding is also supported by the detrended fluctuation analysis (DFA) and recurrence time distribution. These results provide new information about the universal characteristics of the structure of written texts beyond that given by word frequencies.

23 May 2019 in Entropy
Verified
Journal Article
Open access
PDF file
EBEdgar Baeza-Blancas
Edgar Baeza-Blancas
BOBibiana Obregón-Quintana
Bibiana Obregón-Quintana
CHCandelario Hernández-Gómez
Candelario Hernández-Gómez
DGDomingo Gómez-Meléndez
Domingo Gómez-Meléndez
DADaniel Aguilar-velázquez
Daniel Aguilar-velázquez
LGLev Guzman-Vargas
Lev Guzman-Vargas
We present a study of natural language using the recurrence network method. In our approach, the repetition of patterns of characters is evaluated without considering the word structure in written texts from different natural languages. Our dataset comprises 85 ebookseBooks written in 17 different European languages. The similarity between patterns of length m is determined by the Hamming distance and a value r is considered to define a matching between two patterns, i.e., a repetition is defined if the Hamming distance is equal or less than the given threshold value r. In this way, we calculate the adjacency matrix, where a connection between two nodes exists when a matching occurs. Next, the recurrence network is constructed for the texts and some representative network metrics are calculated. Our results show that average values of network density, clustering, and assortativity are larger than their corresponding shuffled versions, while for metrics like such as closeness, both original and random sequences exhibit similar values. Moreover, our calculations show similar average values for density among languages which that belong to the same linguistic family. In addition, the application of a linear discriminant analysis leads to well-separated clusters of family languages based on based on the network-density properties. Finally, we discuss our results in the context of the general characteristics of written texts.