Examinando por Autor "Aleja, David"

Mostrando 1 - 8 de 8

A compartmental model for cyber-epidemics
(ELSEVIER, 2022-06-17) Aleja, David; Contreras-Aso, Gonzalo; Alfaro-Bittner, Karin; Primo, Eva; Criado, Regino; Romance, Miguel; Boccaletti, Stefano
In our more and more interconnected world, a specific risk is that of a cyber-epidemic (or cyber-pandemic), produced either accidentally or intentionally, where a cyber virus propagates from device to device up to undermining the global Internet system with devastating consequences in terms of economic costs and societal harms related to the shutdown of essential services. We introduce a compartmental model for studying the spreading of a malware and of the awareness of its incidence through different waves which are evolving on top of the same graph structure (the global network of connected devices). This is realized by considering vectorial compartments made of two components, the first being descriptive of the state of the device with respect to the new malware's propagation, and the second accounting for the awareness of the device's user about the presence of the cyber threat. By introducing suitable transition rates between such compartments, one can then follow the evolution of a cyber-epidemic from the moment at which a new virus is seeded in the network, up to when a given user realizes that his/her device has suffered a damage and consequently starts a wave of awareness which eventually ends up with the development of a proper antivirus software. We then compare the overall damage that a malware is able to produce in Erdős-Rényi and scale-free network architectures for both the case in which the virus is causing a fixed damage on each device and the case where, instead, the virus is engineered to mutate while replicating from device to device. Our result constitutes actually the attempt to build a specific compartmental model whose variables and parameters are entirely customized for describing cyber-epidemics.
A new insight into linguistic pattern analysis based on multilayer hypergraphs for the automatic extraction of text summaries
(John Wiley & Sons Ltd, 2023-03-13) Criado-Alonso, Ángeles; Aleja, David; Romance, Miguel; Criado, Regino
La lingüística forense y la estilometría tienen en la exploración de patrones lingüísticos una de sus herramientas fundamentales. Estructuras matemáticas como las redes multicapa y los hipergrafos proporcionan recursos notables para representar y analizar textos. En este trabajo, presentamos un modelo que incluye algunas relaciones mesoscópicas específicas entre los distintos tipos de palabras de un corpus (palabras léxicas, verbos, palabras de enlace, otras palabras) en función de las frases o párrafos en los que aparecen. Este modelo se apoya en diversas estructuras matemáticas, como los hipergrafos multicapa y sus grafos derivados. La metodología propuesta desde este nuevo punto de vista es de singular ayuda para encontrar frases significativas de cualquier texto, establecer un resumen automático del mismo y, eventualmente, determinar su nivel lingüístico.
A new insight into linguistic pattern analysis based on multilayer hypergraphs for the automatic extraction of text summaries
(Wiley, 2023) Criado-Alonso, Ángeles; Aleja, David; Romance, Miguel; Criado, Regino
Forensic linguistics and stylometry have in the exploration of linguistic patternsone of their fundamental tools. Mathematical structures such as complex multi-layer networks and hypergraphs provide remarkable resources to represent andanalyzetexts.Inthispaper,wepresentamodelthatincludessomespecificmeso-scopic relations between the different types of words in a corpus (lexical words,verbs, linking words, other words) according to the sentences or paragraphs inwhich they appear. This model is supported by various mathematical structuressuch as partial multiline graphs, multilayer hypergraphs, and their derivativegraphs. The methodology proposed from this new point of view is of singularhelp to find meaningful sentencesfrom any text to set up an automatic summaryof the text and, eventually, to determine its linguistic level.
Derivative of a hypergraph as a tool for linguistic pattern analysis
(Elsevier, 2022-10) Criado-Alonso, Ángeles; Aleja, David; Romance, Miguel; Criado, Regino
La búsqueda de patrones lingüísticos junto con la estilometría y la lingüística forense tiene en la teoría de redes complejas, sus estructuras y sus herramientas matemáticas asociadas recursos esenciales para representar y analizar textos. En este trabajo introducimos un nuevo modelo capaz de analizar las relaciones mesoscópicas entre frases, párrafos, capítulos y textos. Este modelo se apoya en varias estructuras matemáticas como los hipergrafos o el concepto de grafo derivado. La metodología planteada desde esta perspectiva se centra no sólo en un índice cuantitativo sino también en dos estructuras matemáticas peculiares denominadas grafo derivado y grafo de homogeneidad. Estas estructuras son de singular ayuda tanto para detectar el estilo de un autor como para determinar el nivel lingüístico de un texto y, eventualmente, también para detectar similitudes y disimilitudes en textos e incluso el plagio.
Derivative of a hypergraph as a tool for linguistic pattern analysis
(Elsevier, 2022) Criado-Alonso, Ángeles; Aleja, David; Romance, Miguel; Criado, Regino
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.
Implementing and morphing Boolean gates with adaptive synchronization: The case of spiking neurons
(ELSEVIER, 2022-08-19) Yang, Jinling; Primo, Eva; Aleja, David; Criado, Regino; Boccaletti, Stefano; Alfaro-Bittner, Karin
Boolean logic is the paradigm through which modern computation is performed in silica. When nonlinear dynamical systems are interacting in a directed graph, we show that computation abilities emerge spontaneously from adaptive synchronization, which actually can emulate Boolean logic. Precisely, we demonstrate that a single dynamical unit, a spiking neuron modeled by the Hodgkin-Huxley model, can be used as the basic computational unit for realizing all the 16 Boolean logical gates with two inputs and one output, when it is coupled adaptively in a way that depends on the synchronization level between the two input signals. This is realized by means of a set of parameters, whose tuning offers even the possibility of constructing a morphing gate, i.e., a logical gate able to switch efficiently from one to another of such 16 Boolean gates. Extensive simulations demonstrate the efficiency and the accuracy of the proposed computational paradigm.
Non-backtracking PageRank: From the classic model to hashimoto matrices
(Elsevier, 2019-09) Aleja, David; Criado, Regino; García del Amo, Alejandro; Pérez, Ángel; Romance, Miguel
La centralidad sin retroceso se introdujo como una forma de corregir lo que puede entenderse como una deficiencia en la centralidad de vector propio, ya que la centralidad de vector propio en una red puede aumentar artificialmente en nodos de alto grado (hubs) dado que un hub es central debido a que sus vecinos son también centrales, pero estos, a su vez, son centrales sólo porque son vecinos del hub. Definimos el PageRank sin retroceso como una nueva medida que modifica el conocido PageRank clásico para evitar la posibilidad de que el caminante aleatorio vuelva al nodo inmediatamente visitado (caminata sin rastreo). Pero, como mostramos, esta medida presenta una brecha y una diferencia notable entre el límite de "no penalización por viajes de ida y vuelta" y el cálculo directo del PageRank sin seguimiento. Además, como se muestra en las aplicaciones presentadas, en ciertos casos esta nueva medida produce variaciones notables con respecto a las clasificaciones obtenidas por el PageRank clásico.
Why are there six degrees of separation in a social network?
(American Physical Society, 2023-05-31) Samoylenko, Ivan; Aleja, David; Primo, Eva; Alfaro-Bittner, Karin; Vasilyeva, Ekaterina; Kovalenko, Kirill; Musatov, Daniil; Raigorodskii, Andreii M.; Criado, Regino; Romance, Miguel; Papo, David; Perc, Matjaz; Barzel, Baruch; Boccaletti, Stefano
A wealth of evidence shows that real-world networks are endowed with the small-world property, i.e., that the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. In addition, most social networks are organized so that no individual is more than six connections apart from any other, an empirical regularity known as the six degrees of separation. Why social networks have this ultrasmall-world organization, whereby the graph’s diameter is independent of the network size over several orders of magnitude, is still unknown. We show that the “six degrees of separation” is the property featured by the equilibrium state of any network where individuals weigh between their aspiration to improve their centrality and the costs incurred in forming and maintaining connections. We show, moreover, that the emergence of such a regularity is compatible with all other features, such as clustering and scale-freeness, that normally characterize the structure of social networks. Thus, our results show how simple evolutionary rules of the kind traditionally associated with human cooperation and altruism can also account for the emergence of one of the most intriguing attributes of social networks.