Geolocalización de usuarios en Twitter utilizando redes convolucionales de grafos

En este trabajo utilizamos un conjunto de datos recolectados de la red social Twitter con el objetivo de analizar el desempeño de distintos modelos que proponemos para determinar la geolocalización de los usuarios de la plataforma. También realizamos un análisis sobre los perfiles de los usuarios para verificar qué tan fiable puede ser la determinación de su residencia. En el artículo detallamos distintas formas de construir las redes que modelan las relaciones entre los usuarios a fin de mejorar la estimación de su ubicación, con sus respectivas ventajas y desventajas. Por último, explicamos nuestro procedimiento para la detección de términos locales, y la conformación de secuencias para los métodos basados en redes neuronales.Sociedad Argentina de Informática e Investigación Operativ

SnailVis: a Paradigm to Visualize Complex Networks

We propose a new non-parametric and linear-complexity algorithm to visualize complex networks, which were previously decomposed in subsets according to some criteria. We show two representations: the first including all edges and vertices and the second, summarized, highlighting subsets and their relations. In this paper we use a community decomposition algorithm to generate the subsets; then we rank them by the number of inter-community connections. We also highlight the central core of each community, that is, the subset with the highest connectivity level, which is the kmax-core of the k-core decomposition.Sociedad Argentina de Informática e Investigación Operativ

Obtaining Communities with a Fitness Growth Process

The study of community structure has been a hot topic of research over the last years. But, while successfully applied in several areas, the concept lacks of a general and precise notion. Facts like the hierarchical structure and heterogeneity of complex networks make it difficult to unify the idea of community and its evaluation. The global functional known as modularity is probably the most used technique in this area. Nevertheless, its limits have been deeply studied. Local techniques as the ones by Lancichinetti et al. and Palla et al. arose as an answer to the resolution limit and degeneracies that modularity has. Here we start from the algorithm by Lancichinetti et al. and propose a unique growth process for a fitness function that, while being local, finds a community partition that covers the whole network, updating the scale parameter dynamically. We test the quality of our results by using a set of benchmarks of heterogeneous graphs. We discuss alternative measures for evaluating the community structure and, in the light of them, infer possible explanations for the better performance of local methods compared to global ones in these cases

Signs of criticality in social explosions

Abstract The success of an on-line movement could be defined in terms of the shift to large-scale and the later off-line massive street actions of protests. The role of social media in this process is to facilitate the transformation from small or local feelings of disagreement into large-scale social actions. The way how social media achieves that effect is by growing clusters of people and groups with similar effervescent feelings, which otherwise would not be in touch with each other. It is natural to think that these kinds of macro social actions, as a consequence of the spontaneous and massive interactions, will attain the growth and divergence of those clusters, like the correlation length of statistical physics, giving rise to important simplifications on several statistics. In this work, we report the presence of signs of criticality in social demonstrations. Namely, similar power-law exponents are found whenever the distributions are calculated either considering time windows of the same length or with the same number of hashtag usages. In particular, the exponents for the distributions during the event were found to be smaller than before the event, and this is also observed either if we count the hashtags only once per user or if all their usages are considered. By means of network representations, we show that the systems present two kinds of high connectedness, characterised by either high or low values of modularity. The importance of analysing systems near a critical point is that any small disturbance can escalate and induce large-scale—nationwide—chain reactions

Deciphering the global organization of clustering in real complex networks

We uncover the global organization of clustering in real complex networks. To this end, we ask whether triangles in real networks organize as in maximally random graphs with given degree and clustering distributions, or as in maximally ordered graph models where triangles are forced into modules. The answer comes by way of exploring m-core landscapes, where the m-core is defined, akin to the k-core, as the maximal subgraph with edges participating in at least m triangles. This property defines a set of nested subgraphs that, contrarily to k-cores, is able to distinguish between hierarchical and modular architectures. We find that the clustering organization in real networks is neither completely random nor ordered although, surprisingly, it is more random than modular. This supports the idea that the structure of real networks may in fact be the outcome of self-organized processes based on local optimization rules, in contrast to global optimization principles

Shopping mall attraction and social mixing at a city scale

Abstract In Latin America, shopping malls seem to offer an open, safe and democratic version of the public space. However, it is often difficult to quantitatively measure whether they indeed foster, hinder, or are neutral with respect to social inclusion. In this work, we investigate if, and by how much, people from different social classes are attracted by the same malls. Using a dataset of mobile phone network records from 387,152 devices identified as customers of 16 malls in Santiago de Chile, we performed several analyses to study whether malls with higher social mixing attract more people. Our pipeline, which starts with the socio-economic characterization of mall visitors, includes the estimation of social mixing and diversity of malls, the application of the gravity model of mobility, and the definition of a co-visitation model. Results showed that people tend to choose a profile of malls more in line with their own socio-economic status and the distance from their home to the mall, and that higher mixing does positively contribute to the process of choosing a mall. We conclude that (a) there is social mixing in malls, and (b) that social mixing is a factor at the time of choosing which mall to go to. Thus, the potential for social mixing in malls could be capitalized by designing public policies regarding transportation and mobility to make some malls strong social inclusion hubs

Deciphering the global organization of clustering in real complex networks

We uncover the global organization of clustering in real complex networks. To this end, we ask whether triangles in real networks organize as in maximally random graphs with given degree and clustering distributions, or as in maximally ordered graph models where triangles are forced into modules. The answer comes by way of exploring m-core landscapes, where the m-core is defined, akin to the k-core, as the maximal subgraph with edges participating in at least m triangles. This property defines a set of nested subgraphs that, contrarily to k-cores, is able to distinguish between hierarchical and modular architectures. We find that the clustering organization in real networks is neither completely random nor ordered although, surprisingly, it is more random than modular. This supports the idea that the structure of real networks may in fact be the outcome of self-organized processes based on local optimization rules, in contrast to global optimization principles