arXiv subjects

Gerardo Iñiguez

Publications and source records attributed to Gerardo Iñiguez.

At least 37 records · Page 2Linked to original sources

arXiv2021

Opinion formation on social networks with algorithmic bias: Dynamics and bias imbalance

We investigate opinion dynamics and information spreading on networks under the influence of content filtering technologies. The filtering mechanism, present in many online social platforms, reduces individuals' exposure to disagreeing opinions, producing algorithmic bias. We derive evolution equations for global opinion variables in the presence of algorithmic bias, network community structure, noise (independent behavior of individuals), and pairwise or group interactions. We consider the case where the social platform shows a predilection for one opinion over its opposite, unbalancing the dynamics in favor of that opinion. We show that if the imbalance is strong enough, it may determine the final global opinion and the dynamical behavior of the population. We find a complex phase diagram including phases of coexistence, consensus, and polarization of opinions as possible final states of the model, with phase transitions of different order between them. The fixed point structure of the equations determines the dynamics to a large extent. We focus on the time needed for convergence and conclude that this quantity varies within a wide range, showing occasionally signatures of critical slowing down and meta-stability.

physics.soc-ph↗

arXiv2021

Identifying tax evasion in Mexico with tools from network science and machine learning

Mexico has kept electronic records of all taxable transactions since 2014. Anonymized data collected by the Mexican federal government comprises more than 80 million contributors (individuals and companies) and almost 7 billion monthly-aggregations of invoices among contributors between January 2015 and December 2018. This data includes a list of almost ten thousand contributors already identified as tax evaders, due to their activities fabricating invoices for non-existing products or services so that recipients can evade taxes. Harnessing this extensive dataset, we build monthly and yearly temporal networks where nodes are contributors and directed links are invoices produced in a given time slice. Exploring the properties of the network neighborhoods around tax evaders, we show that their interaction patterns differ from those of the majority of contributors. In particular, invoicing loops between tax evaders and their clients are over-represented. With this insight, we use two machine-learning methods to classify other contributors as suspects of tax evasion: deep neural networks and random forests. We train each method with a portion of the tax evader list and test it with the rest, obtaining more than 0.9 accuracy with both methods. By using the complete dataset of contributors, each method classifies more than 100 thousand suspects of tax evasion, with more than 40 thousand suspects classified by both methods. We further reduce the number of suspects by focusing on those with a short network distance from known tax evaders. We thus obtain a list of highly suspicious contributors sorted by the amount of evaded tax, valuable information for the authorities to further investigate illegal tax activity in Mexico. With our methods, we estimate previously undetected tax evasion in the order of \$10 billion USD per year by about 10 thousand contributors.

cs.SI↗

arXiv2020

Dynamics of cascades on burstiness-controlled temporal networks

Burstiness, the tendency of interaction events to be heterogeneously distributed in time, is critical to information diffusion in physical and social systems. However, an analytical framework capturing the effect of burstiness on generic dynamics is lacking. We develop a master equation formalism to study cascades on temporal networks with burstiness modelled by renewal processes. Supported by numerical and data-driven simulations, we describe the interplay between heterogeneous temporal interactions and models of threshold-driven and epidemic spreading. We find that increasing interevent time variance can both accelerate and decelerate spreading for threshold models, but can only decelerate epidemic spreading. When accounting for the skewness of different interevent time distributions, spreading times collapse onto a universal curve. Our framework uncovers a deep yet subtle connection between generic diffusion mechanisms and underlying temporal network structures that impacts on a broad class of networked phenomena, from spin interactions to epidemic contagion and language dynamics.

physics.soc-ph↗

arXiv2020

Extracting the multimodal fingerprint of urban transportation networks

Urban mobility increasingly relies on multimodality, combining the use of bicycle paths, streets, and rail networks. These different modes of transportation are well described by multiplex networks. Here we propose the overlap census method which extracts a multimodal profile from a city's multiplex transportation network. We apply this method to 15 cities, identify clusters of cities with similar profiles, and link this feature to the level of sustainable mobility of each cluster. Our work highlights the importance of evaluating all the transportation systems of a city together to adequately identify and compare its potential for sustainable, multimodal mobility.

physics.soc-ph↗

arXiv2020

Bridging the gap between graphs and networks

Network science has become a powerful tool to describe the structure and dynamics of real-world complex physical, biological, social, and technological systems. Largely built on empirical observations to tackle heterogeneous, temporal, and adaptive patterns of interactions, its intuitive and flexible nature has contributed to the popularity of the field. With pioneering work on the evolution of random graphs, graph theory is often cited as the mathematical foundation of network science. Despite this narrative, the two research communities are still largely disconnected. In this Commentary we discuss the need for further cross-pollination between fields -- bridging the gap between graphs and networks -- and how network science can benefit from such influence. A more mathematical network science may clarify the role of randomness in modeling, hint at underlying laws of behavior, and predict yet unobserved complex networked phenomena in nature.

physics.soc-ph↗

arXiv2019

Elites, communities and the limited benefits of mentorship in electronic music

While the emergence of success in creative professions, such as music, has been studied extensively, the link between individual success and collaboration is not yet fully uncovered. Here we aim to fill this gap by analyzing longitudinal data on the co-releasing and mentoring patterns of popular electronic music artists appearing in the annual Top 100 ranking of DJ Magazine. We find that while this ranking list of popularity publishes 100 names, only the top 20 is stable over time, showcasing a lock-in effect on the electronic music elite. Based on the temporal co-release network of top musicians, we extract a diverse community structure characterizing the electronic music industry. These groups of artists are temporally segregated, sequentially formed around leading musicians, and represent changes in musical genres. We show that a major driving force behind the formation of music communities is mentorship: around half of musicians entering the top 100 have been mentored by current leading figures before they entered the list. We also find that mentees are unlikely to break into the top 20, yet have much higher expected best ranks than those who were not mentored. This implies that mentorship helps rising talents, but becoming an all-time star requires more. Our results provide insights into the intertwined roles of success and collaboration in electronic music, highlighting the mechanisms shaping the formation and landscape of artistic elites in electronic music.

physics.soc-ph↗

arXiv2019

Data-driven strategies for optimal bicycle network growth

Urban transportation networks, from sidewalks and bicycle paths to streets and rail lines, provide the backbone for movement and socioeconomic life in cities. These networks can be understood as layers of a larger multiplex transport network. Because most cities are car-centric, the most developed layer is typically the street layer, while other layers can be highly disconnected. To make urban transport sustainable, cities are increasingly investing to develop their bicycle networks. However, given the usually patchy nature of the bicycle network layer, it is yet unclear how to extend it comprehensively and effectively given a limited budget. Here we develop data-driven, algorithmic network growth strategies and apply them to cities around the world, showing that small but focused investments allow to significantly increase the connectedness and directness of urban bicycle networks. We motivate the development of our algorithms with a network component analysis and with multimodal urban fingerprints that reveal different classes of cities depending on the connectedness between different network layers. We introduce two greedy algorithms to add the most critical missing links in the bicycle layer: The first algorithm connects the two largest connected components, the second algorithm connects the largest with the closest component. We show that these algorithms outmatch both a random approach and a baseline minimum investment strategy that connects the closest components ignoring size. Our computational approach outlines novel pathways from car-centric towards sustainable cities by taking advantage of urban data available on a city-wide scale. It is a first step towards a quantitative consolidation of bicycle infrastructure development that can become valuable for urban planners and stakeholders.

physics.soc-ph↗

arXiv2019

Reentrant phase transitions in threshold driven contagion on multiplex networks

Models of threshold driven contagion explain the cascading spread of information, behavior, systemic risk, and epidemics on social, financial and biological networks. At odds with empirical observation, these models predict that single-layer unweighted networks become resistant to global cascades after reaching sufficient connectivity. We investigate threshold driven contagion on weight heterogeneous multiplex networks and show that they can remain susceptible to global cascades at any level of connectivity, and with increasing edge density pass through alternating phases of stability and instability in the form of reentrant phase transitions of contagion. Our results provide a novel theoretical explanation for the observation of large scale contagion in highly connected but heterogeneous networks.

physics.soc-ph↗

arXiv2018

Cumulative effects of triadic closure and homophily in social networks

Much of the structure in social networks has been explained by two seemingly independent network evolution mechanisms: triadic closure and homophily. While it is common to consider these mechanisms separately or in the frame of a static model, empirical studies suggest that their dynamic interplay is the very process responsible for the homophilous patterns of association seen in off- and online social networks. By combining these two mechanisms in a minimal solvable dynamic model, we confirm theoretically the long-held and empirically established hypothesis that homophily can be amplified by the triadic closure mechanism. This research approach allows us to estimate how much of the observed homophily in various friendship and communication networks is due to amplification for a given amount of triadic closure. We find that the cumulative advantage-like process leading to homophily amplification can, under certain circumstances, also lead to the widely documented core-periphery structure of social networks, as well as to the emergence of memory of previous homophilic constraints (equivalent to hysteresis phenomena in physics). The theoretical understanding provided by our results highlights the importance of early intervention in managing at the societal level the most adverse effects of homophilic decision-making, such as inequality, segregation and online echo chambers.

physics.soc-ph↗

arXiv2018

Status maximization as a source of fairness in a networked dictator game

Human behavioural patterns exhibit selfish or competitive, as well as selfless or altruistic tendencies, both of which have demonstrable effects on human social and economic activity. In behavioural economics, such effects have traditionally been illustrated experimentally via simple games like the dictator and ultimatum games. Experiments with these games suggest that, beyond rational economic thinking, human decision-making processes are influenced by social preferences, such as an inclination to fairness. In this study we suggest that the apparent gap between competitive and altruistic human tendencies can be bridged by assuming that people are primarily maximising their status, i.e., a utility function different from simple profit maximisation. To this end we analyse a simple agent-based model, where individuals play the repeated dictator game in a social network they can modify. As model parameters we consider the living costs and the rate at which agents forget infractions by others. We find that individual strategies used in the game vary greatly, from selfish to selfless, and that both of the above parameters determine when individuals form complex and cohesive social networks.

cs.MA↗

arXiv2018

Rank dynamics of word usage at multiple scales

The recent dramatic increase in online data availability has allowed researchers to explore human culture with unprecedented detail, such as the growth and diversification of language. In particular, it provides statistical tools to explore whether word use is similar across languages, and if so, whether these generic features appear at different scales of language structure. Here we use the Google Books $N$-grams dataset to analyze the temporal evolution of word usage in several languages. We apply measures proposed recently to study rank dynamics, such as the diversity of $N$-grams in a given rank, the probability that an $N$-gram changes rank between successive time intervals, the rank entropy, and the rank complexity. Using different methods, results show that there are generic properties for different languages at different scales, such as a core of words necessary to minimally understand a language. We also propose a null model to explore the relevance of linguistic structure across multiple scales, concluding that $N$-gram statistics cannot be reduced to word statistics. We expect our results to be useful in improving text prediction algorithms, as well as in shedding light on the large-scale features of language use, beyond linguistic and cultural differences across human populations.

physics.soc-ph↗

arXiv2017

Trajectory stability in the traveling salesman problem

Two generalizations of the traveling salesman problem in which sites change their position in time are presented. The way the rank of different trajectory lengths changes in time is studied using the rank diversity. We analyze the statistical properties of rank distributions and rank dynamics and give evidence that the shortest and longest trajectories are more predictable and robust to change, that is, more stable.

nlin.AO↗

arXiv2017

Threshold driven contagion on weighted networks

Weighted networks capture the structure of complex systems where interaction strength is meaningful. This information is essential to a large number of processes, such as threshold dynamics, where link weights reflect the amount of influence that neighbours have in determining a node's behaviour. Despite describing numerous cascading phenomena, such as neural firing or social contagion, threshold models have never been explicitly addressed on weighted networks. We fill this gap by studying a dynamical threshold model over synthetic and real weighted networks with numerical and analytical tools. We show that the time of cascade emergence depends non-monotonously on weight heterogeneities, which accelerate or decelerate the dynamics, and lead to non-trivial parameter spaces for various networks and weight distributions. Our methodology applies to arbitrary binary state processes and link properties, and may prove instrumental in understanding the role of edge heterogeneities in various natural and social phenomena.

physics.soc-ph↗

arXiv2017

Service adoption spreading in online social networks

The collective behaviour of people adopting an innovation, product or online service is commonly interpreted as a spreading phenomenon throughout the fabric of society. This process is arguably driven by social influence, social learning and by external effects like media. Observations of such processes date back to the seminal studies by Rogers and Bass, and their mathematical modelling has taken two directions: One paradigm, called simple contagion, identifies adoption spreading with an epidemic process. The other one, named complex contagion, is concerned with behavioural thresholds and successfully explains the emergence of large cascades of adoption resulting in a rapid spreading often seen in empirical data. The observation of real world adoption processes has become easier lately due to the availability of large digital social network and behavioural datasets. This has allowed simultaneous study of network structures and dynamics of online service adoption, shedding light on the mechanisms and external effects that influence the temporal evolution of behavioural or innovation adoption. These advancements have induced the development of more realistic models of social spreading phenomena, which in turn have provided remarkably good predictions of various empirical adoption processes. In this chapter we review recent data-driven studies addressing real-world service adoption processes. Our studies provide the first detailed empirical evidence of a heterogeneous threshold distribution in adoption. We also describe the modelling of such phenomena with formal methods and data-driven simulations. Our objective is to understand the effects of identified social mechanisms on service adoption spreading, and to provide potential new directions and open questions for future research.

physics.soc-ph↗

arXiv2017

Modelling community formation driven by the status of individual in a society

In human societies, people's willingness to compete and strive for better social status as well as being envious of those perceived in some way superior lead to social structures that are intrinsically hierarchical. Here we propose an agent-based, network model to mimic the ranking behaviour of individuals and its possible repercussions in human society. The main ingredient of the model is the assumption that the relevant feature of social interactions is each individual's keenness to maximise his or her status relative to others. The social networks produced by the model are homophilous and assortative, as frequently observed in human communities and most of the network properties seem quite independent of its size. However, it is seen that for small number of agents the resulting network consists of disjoint weakly connected communities while being highly assortative and homophilic. On the other hand larger networks turn out to be more cohesive with larger communities but less homophilic. We find that the reason for these changes is that larger network size allows agents to use new strategies for maximizing their social status allowing for more diverse links between them.

cs.MA↗

arXiv2016

Universal temporal features of rankings in competitive sports and games

Many complex phenomena, from the selection of traits in biological systems to hierarchy formation in social and economic entities, show signs of competition and heterogeneous performance in the temporal evolution of their components, which may eventually lead to stratified structures such as the wealth distribution worldwide. However, it is still unclear whether the road to hierarchical complexity is determined by the particularities of each phenomena, or if there are universal mechanisms of stratification common to many systems. Human sports and games, with their (varied but simplified) rules of competition and measures of performance, serve as an ideal test bed to look for universal features of hierarchy formation. With this goal in mind, we analyse here the behaviour of players and team rankings over time for several sports and games. Even though, for a given time, the distribution of performance ranks varies across activities, we find statistical regularities in the dynamics of ranks. Specifically the rank diversity, a measure of the number of elements occupying a given rank over a length of time, has the same functional form in sports and games as in languages, another system where competition is determined by the use or disuse of grammatical structures. Our results support the notion that hierarchical phenomena may be driven by the same underlying mechanisms of rank formation, regardless of the nature of their components. Moreover, such regularities can in principle be used to predict lifetimes of rank occupancy, thus increasing our ability to forecast stratification in the presence of competition.

physics.soc-ph↗

arXiv2016

Local cascades induced global contagion: How heterogeneous thresholds, exogenous effects, and unconcerned behaviour govern online adoption spreading

Adoption of innovations, products or online services is commonly interpreted as a spreading process driven to large extent by social influence and conditioned by the needs and capacities of individuals. To model this process one usually introduces behavioural threshold mechanisms, which can give rise to the evolution of global cascades if the system satisfies a set of conditions. However, these models do not address temporal aspects of the emerging cascades, which in real systems may evolve through various pathways ranging from slow to rapid patterns. Here we fill this gap through the analysis and modelling of product adoption in the world's largest voice over internet service, the social network of Skype. We provide empirical evidence about the heterogeneous distribution of fractional behavioural thresholds, which appears to be independent of the degree of adopting egos. We show that the structure of real-world adoption clusters is radically different from previous theoretical expectations, since vulnerable adoptions --induced by a single adopting neighbour-- appear to be important only locally, while spontaneous adopters arriving at a constant rate and the involvement of unconcerned individuals govern the global emergence of social spreading.

physics.soc-ph↗

arXiv2015

Dynamics of deceptive interactions in social networks

In this paper we examine the role of lies in human social relations by implementing some salient characteristics of deceptive interactions into an opinion formation model, so as to describe the dynamical behaviour of a social network more realistically. In this model we take into account such basic properties of social networks as the dynamics of the intensity of interactions, the influence of public opinion, and the fact that in every human interaction it might be convenient to deceive or withhold information depending on the instantaneous situation of each individual in the network. We find that lies shape the topology of social networks, especially the formation of tightly linked, small communities with loose connections between them. We also find that agents with a larger proportion of deceptive interactions are the ones that connect communities of different opinion, and in this sense they have substantial centrality in the network. We then discuss the consequences of these results for the social behaviour of humans and predict the changes that could arise due to a varying tolerance for lies in society.

physics.soc-ph↗