Browsing by Subject "TEORIA DE GRAFOS"
Now showing 1 - 4 of 4
Results Per Page
Sort Options
póster.listelement.badge Structural differences between non-lucid, lucid dreams and out-of-body experience reports assessed by graph analysis(2021) Gallo, Francisco; Tommasel, Antonela; Herrero, Nerea; Forcato, Cecilia; Godoy, Daniela; Gleiser, Pablo"It has been recently found using graph theory that measures of network structure can predict ratings of dream complexity, where increases in connectedness and decreases in randomness are observed in relation to increasing dream report complexity. This approach proved to be useful to differentiate dream reports in the pathological population as well as NREM and REM dream reports, but it has not yet been used to study the differences between different oneiric experiences. In this work we analyze dream reports that include non-lucid, lucid dreams and out-of body experiences initiated from sleep paralysis. The reports are presented as directed graphs, where each different word plays the role of a node, and consecutive words are connected by a directed, unweighted edge. We analyze different network measures to compare the graphs. Preliminary results presented here suggest that both local measures, such as the degree of nodes, and global measures, such as clustering and the number of strongly connected components, allow for a categorization of different dream experiences."ponencia en congreso.listelement.badge Studying the evolution of content providers in the internet core(2018) Carisimo, Esteban; Selmo, Carlos; Álvarez-Hamelin, Ignacio; Dhamdhere, Amogh"There is recent evidence that the core of the Internet, which was formerly dominated by large transit providers, has been reshaped after the transition to a multimedia-oriented network, first by general-purpose CDNs and now by private CDNs. In this work we use k-cores, an element of graph theory, to define which ASes compose the core of the Internet and to track the evolution of the core since 1999. Specifically, we investigate whether large players in the Internet content and CDN ecosystem belong to the core and, if so, since when. We further investigate regional differences in the evolution of large content providers. Finally, we show that the core of the Internet has incorporated an increasing number of content ASes in recent years. To enable reproducibility of this work, we provide a website to allow interactive analysis of our datasets to detect, for example, “up and coming” ASes using customized queries."artículo de publicación periódica.listelement.badge Two classes of bipartite networks: nested biological and social systems(2008) Burgos, Enrique; Ceva, Horacio; Hernández, Laura; Perazzo, Roberto P. J.; Devoto, Mariano; Medan, Diego"Bipartite graphs have received some attention in the study of social networks and of biological mutualistic systems. A generalization of a previous model is presented, that evolves the topology of the graph in order to optimally account for a given Contact Preference Rule between the two guilds of the network. As a result, social and biological graphs are classified as belonging to two clearly different classes. Projected graphs, linking the agents of only one guild, are obtained from the original bipartite graph. The corresponding evolution of its statistical properties is also studied. An example of a biological mutualistic network is analyzed in detail, and it is found that the model provides a very good fitting of all the main statistical features. The model also provides a proper qualitative description of the same features observed in social webs, suggesting the possible reasons underlying the difference in the organization of these two kinds of bipartite networks."artículo de publicación periódica.listelement.badge Uniform stability properties of switched systems with switchings governed by digraphs(2005-05) Mancilla-Aguilar, J. L.; García Galiñanes, Rafael; Sontag, E.; Wang, Y."Characterizations of various uniform stability properties of switched systems described by differential inclusions, and whose switchings are governed by a digraph, are developed. These characterizations are given in terms of stability properties of the system with restricted switchings and also in terms of Lyapunov functions."