Searcharxiv⌕ Search

arXiv subjects

Márton Karsai

Publications and source records attributed to Márton Karsai.

At least 37 records · Page 2Linked to original sources

The temporal dynamics of group interactions in higher-order social networks

Representing social systems as networks, starting from the interactions between individuals, sheds light on the mechanisms governing their dynamics. However, networks encode only pairwise interactions, while most social interactions occur among groups of individuals, requiring higher-order network representations. Despite the recent interest in higher-order networks, little is known about the mechanisms that govern the formation and evolution of groups, and how people move between groups. Here, we leverage empirical data on social interactions among children and university students to study their temporal dynamics at both individual and group levels, characterising how individuals navigate groups and how groups form and disaggregate. We find robust patterns across contexts and propose a dynamical model that closely reproduces empirical observations. These results represent a further step in understanding social systems, and open up research directions to study the impact of group dynamics on dynamical processes that evolve on top of them.

physics.soc-ph↗

Distinguishing mechanisms of social contagion from local network view

The adoption of individual behavioural patterns is largely determined by stimuli arriving from peers via social interactions or from external sources. Based on these influences, individuals are commonly assumed to follow simple or complex adoption rules, inducing social contagion processes. In reality, multiple adoption rules may coexist even within the same social contagion process, introducing additional complexity into the spreading phenomena. Our goal is to understand whether coexisting adoption mechanisms can be distinguished from a microscopic view, at the egocentric network level, without requiring global information about the underlying network, or the unfolding spreading process. We formulate this question as a classification problem, and study it through a Bayesian likelihood approach and with random forest classifiers in various synthetic and data-driven experiments. This study offers a novel perspective on the observations of propagation processes at the egocentric level and a better understanding of landmark contagion mechanisms from a local view.

cs.CY↗

Socioeconomic reorganization of communication and mobility networks in response to external shocks

Socioeconomic segregation patterns in networks usually evolve gradually, yet they can change abruptly in response to external shocks. The recent COVID-19 pandemic and the subsequent government policies induced several interruptions in societies, potentially disadvantaging the socioeconomically most vulnerable groups. Using large-scale digital behavioral observations as a natural laboratory, here we analyze how lockdown interventions lead to the reorganization of socioeconomic segregation patterns simultaneously in communication and mobility networks in Sierra Leone. We find that while segregation in mobility clearly increased during lockdown, the social communication network reorganized into a less segregated configuration as compared to reference periods. Moreover, due to differences in adaption capacities, the effects of lockdown policies varied across socioeconomic groups, leading to different or even opposite segregation patterns between the lower and higher socioeconomic classes. Such secondary effects of interventions need to be considered for better and more equitable policies.

physics.soc-ph↗

Coordination-free Decentralised Federated Learning on Complex Networks: Overcoming Heterogeneity

Federated Learning (FL) is a well-known framework for successfully performing a learning task in an edge computing scenario where the devices involved have limited resources and incomplete data representation. The basic assumption of FL is that the devices communicate directly or indirectly with a parameter server that centrally coordinates the whole process, overcoming several challenges associated with it. However, in highly pervasive edge scenarios, the presence of a central controller that oversees the process cannot always be guaranteed, and the interactions (i.e., the connectivity graph) between devices might not be predetermined, resulting in a complex network structure. Moreover, the heterogeneity of data and devices further complicates the learning process. This poses new challenges from a learning standpoint that we address by proposing a communication-efficient Decentralised Federated Learning (DFL) algorithm able to cope with them. Our solution allows devices communicating only with their direct neighbours to train an accurate model, overcoming the heterogeneity induced by data and different training histories. Our results show that the resulting local models generalise better than those trained with competing approaches, and do so in a more communication-efficient way.

cs.LG↗

Mobility Segregation Dynamics and Residual Isolation During Pandemic Interventions

External shocks embody an unexpected and disruptive impact on the regular life of people. This was the case during the COVID-19 outbreak that rapidly led to changes in the typical mobility patterns in urban areas. In response, people reorganised their daily errands throughout space. However, these changes might not have been the same across socioeconomic classes leading to possibile additional detrimental effects on inequality due to the pandemic. In this paper we study the reorganisation of mobility segregation networks due to external shocks and show that the diversity of visited places in terms of locations and socioeconomic status is affected by the enforcement of mobility restriction during pandemic. We use the case of COVID-19 as a natural experiment in several cities to observe not only the effect of external shocks but also its mid-term consequences and residual effects. We build on anonymised and privacy-preserved mobility data in four cities: Bogota, Jakarta, London, and New York. We couple mobility data with socioeconomic information to capture inequalities in mobility among different socioeconomic groups and see how it changes dynamically before, during, and after different lockdown periods. We find that the first lockdowns induced considerable increases in mobility segregation in each city, while loosening mobility restrictions did not necessarily diminished isolation between different socioeconomic groups, as mobility mixing has not recovered fully to its pre-pandemic level even weeks after the interruption of interventions. Our results suggest that a one fits-all policy does not equally affect the way people adjust their mobility, which calls for socioeconomically informed intervention policies in the future.

cs.SI↗

Social inequalities that matter for contact patterns, vaccination, and the spread of epidemics

Individuals socio-demographic and economic characteristics crucially shape the spread of an epidemic by largely determining the exposure level to the virus and the severity of the disease for those who got infected. While the complex interplay between individual characteristics and epidemic dynamics is widely recognized, traditional mathematical models often overlook these factors. In this study, we examine two important aspects of human behavior relevant to epidemics: contact patterns and vaccination uptake. Using data collected during the Covid-19 pandemic in Hungary, we first identify the dimensions along which individuals exhibit the greatest variation in their contact patterns and vaccination attitudes. We find that generally privileged groups of the population have higher number of contact and a higher vaccination uptake with respect to disadvantaged groups. Subsequently, we propose a data-driven epidemiological model that incorporates these behavioral differences. Finally, we apply our model to analyze the fourth wave of Covid-19 in Hungary, providing valuable insights into real-world scenarios. By bridging the gap between individual characteristics and epidemic spread, our research contributes to a more comprehensive understanding of disease dynamics and informs effective public health strategies.

physics.soc-ph↗

Temporal network compression via network hashing

Pairwise temporal interactions between entities can be represented as temporal networks, which code the propagation of processes such as epidemic spreading or information cascades, evolving on top of them. The largest outcome of these processes is directly linked to the structure of the underlying network. Indeed, a node of a network at given time cannot affect more nodes in the future than it can reach via time-respecting paths. This set of nodes reachable from a source defines an out-component, which identification is costly. In this paper, we propose an efficient matrix algorithm to tackle this issue and show that it outperforms other state-of-the-art methods. Secondly, we propose a hashing framework to coarsen large temporal networks into smaller proxies on which out-components are easier to estimate, and then recombined to obtain the initial components. Our graph hashing solution has implications in privacy respecting representation of temporal networks.

cs.SI↗

Detecting periodic time scales in temporal networks

Temporal networks are commonly used to represent dynamical complex systems like social networks, simultaneous firing of neurons, human mobility or public transportation. Their dynamics may evolve on multiple time scales characterising for instance periodic activity patterns or structural changes. The detection of these time scales can be challenging from the direct observation of simple dynamical network properties like the activity of nodes or the density of links. Here we propose two new methods, which rely on already established static representations of temporal networks, namely supra-adjacency matrices and temporal event graphs. We define dissimilarity metrics extracted from these representations and compute their Fourier Transform to effectively identify dominant periodic time scales characterising the original temporal network. We demonstrate our methods using synthetic and real-world data sets describing various kinds of temporal networks. We find that while in all cases the two methods outperform the reference measures, the supra-adjacency based method identifies more easily periodic changes in network density, while the temporal event graph based method is better suited to detect periodic changes in the group structure of the network. Our methodology may provide insights into different phenomena occurring at multiple time-scales in systems represented by temporal networks.

physics.soc-ph↗

Are machine learning technologies ready to be used for humanitarian work and development?

Novel digital data sources and tools like machine learning (ML) and artificial intelligence (AI) have the potential to revolutionize data about development and can contribute to monitoring and mitigating humanitarian problems. The potential of applying novel technologies to solving some of humanity's most pressing issues has garnered interest outside the traditional disciplines studying and working on international development. Today, scientific communities in fields like Computational Social Science, Network Science, Complex Systems, Human Computer Interaction, Machine Learning, and the broader AI field are increasingly starting to pay attention to these pressing issues. However, are sophisticated data driven tools ready to be used for solving real-world problems with imperfect data and of staggering complexity? We outline the current state-of-the-art and identify barriers, which need to be surmounted in order for data-driven technologies to become useful in humanitarian and development contexts. We argue that, without organized and purposeful efforts, these new technologies risk at best falling short of promised goals, at worst they can increase inequality, amplify discrimination, and infringe upon human rights.

physics.soc-ph↗

Efficient limited-time reachability estimation in temporal networks

Time-limited states characterise many dynamical processes on networks: disease infected individuals recover after some time, people forget news spreading on social networks, or passengers may not wait forever for a connection. These dynamics can be described as limited waiting-time processes, and they are particularly important for systems modelled as temporal networks. These processes have been studied via simulations, which is equivalent to repeatedly finding all limited-waiting time temporal paths from a source node and time. We propose a method yielding orders of magnitude more efficient way of tracking the reachability of such temporal paths. Our method gives simultaneous estimates of the in- or out-reachability (with any chosen waiting-time limit) from every possible starting point and time. It works on very large temporal networks with hundreds of millions of events on current commodity computing hardware. This opens up the possibility to analyse reachability and dynamics of spreading processes on large temporal networks in completely new ways. For example, one can now compute centralities based on global reachability for all events or can find with high probability the infected node and time, which would lead to the largest epidemic outbreak.

physics.soc-ph↗

Directed Percolation in Random Temporal Network Models with Heterogeneities

The event graph representation of temporal networks suggests that the connectivity of temporal structures can be mapped to a directed percolation problem. However, similar to percolation theory on static networks, this mapping is valid under the approximation that the structure and interaction dynamics of the temporal network are determined by its local properties, and otherwise, it is maximally random. We challenge these conditions and demonstrate the robustness of this mapping in case of more complicated systems. We systematically analyze random and regular network topologies and heterogeneous link-activation processes driven by bursty renewal or self-exciting processes using numerical simulation and finite-size scaling methods. We find that the critical percolation exponents characterizing the temporal network are not sensitive to many structural and dynamical network heterogeneities, while they recover known scaling exponents characterizing directed percolation on low dimensional lattices. While it is not possible to demonstrate the validity of this mapping for all temporal network models, our results establish the first batch of evidence supporting the robustness of the scaling relationships in the limited-time reachability of temporal networks.

physics.soc-ph↗

Directed Percolation in Temporal Networks

Connectivity and reachability on temporal networks, which can describe the spreading of a disease, decimation of information or the accessibility of a public transport system over time, have been among the main contemporary areas of study in complex systems for the last decade. However, while isotropic percolation theory successfully describes connectivity in static networks, a similar description has not been yet developed for temporal networks. Here address this problem and formalize a mapping of the concept of temporal network reachability to percolation theory. We show that the limited-waiting-time reachability, a generic notion of constrained connectivity in temporal networks, displays directed percolation phase transition in connectivity. Consequently, the critical percolation properties of spreading processes on temporal networks can be estimated by a set of known exponents characterising the directed percolation universality class. This result is robust across a diverse set of temporal network models with different temporal and topological heterogeneities, while by using our methodology we uncover similar reachability phase transitions in real temporal networks too. These findings open up an avenue to apply theory, concepts and methodology from the well-developed directed percolation literature to temporal networks.

physics.soc-ph↗

Interpreting wealth distribution via poverty map inference using multimodal data

Poverty maps are essential tools for governments and NGOs to track socioeconomic changes and adequately allocate infrastructure and services in places in need. Sensor and online crowd-sourced data combined with machine learning methods have provided a recent breakthrough in poverty map inference. However, these methods do not capture local wealth fluctuations, and are not optimized to produce accountable results that guarantee accurate predictions to all sub-populations. Here, we propose a pipeline of machine learning models to infer the mean and standard deviation of wealth across multiple geographically clustered populated places, and illustrate their performance in Sierra Leone and Uganda. These models leverage seven independent and freely available feature sources based on satellite images, and metadata collected via online crowd-sourcing and social media. Our models show that combined metadata features are the best predictors of wealth in rural areas, outperforming image-based models, which are the best for predicting the highest wealth quintiles. Our results recover the local mean and variation of wealth, and correctly capture the positive yet non-monotonous correlation between them. We further demonstrate the capabilities and limitations of model transfer across countries and the effects of data recency and other biases. Our methodology provides open tools to build towards more transparent and interpretable models to help governments and NGOs to make informed decisions based on data availability, urbanization level, and poverty thresholds.

cs.LG↗

Randomized reference models for temporal networks

Many dynamical systems can be successfully analyzed by representing them as networks. Empirically measured networks and dynamic processes that take place in these situations show heterogeneous, non-Markovian, and intrinsically correlated topologies and dynamics. This makes their analysis particularly challenging. Randomized reference models (RRMs) have emerged as a general and versatile toolbox for studying such systems. Defined as random networks with given features constrained to match those of an input (empirical) network, they may, for example, be used to identify important features of empirical networks and their effects on dynamical processes unfolding in the network. RRMs are typically implemented as procedures that reshuffle an empirical network, making them very generally applicable. However, the effects of most shuffling procedures on network features remain poorly understood, rendering their use nontrivial and susceptible to misinterpretation. Here we propose a unified framework for classifying and understanding microcanonical RRMs (MRRMs) that sample networks with uniform probability. Focusing on temporal networks, we survey applications of MRRMs found in the literature, and we use this framework to build a taxonomy of MRRMs that proposes a canonical naming convention, classifies them, and deduces their effects on a range of important network features. We furthermore show that certain classes of MRRMs may be applied in sequential composition to generate new MRRMs from the existing ones surveyed in this article. We finally provide a tutorial showing how to apply a series of MRRMs to analyze how different network features affect a dynamic process in an empirical temporal network.

physics.soc-ph↗

Real-time estimation of the effective reproduction number of COVID-19 from behavioral data

Near-real time estimations of the effective reproduction number are among the most important tools to track the progression of a pandemic and to inform policy makers and the general public. However, these estimations rely on reported case numbers, commonly recorded with significant biases. The epidemic outcome is strongly influenced by the dynamics of social contacts, which are neglected in conventional surveillance systems as their real-time observation is challenging. Here, we propose a concept using online and offline behavioral data, recording age-stratified contact matrices at a daily rate. Modeling the epidemic using the reconstructed matrices we dynamically estimate the effective reproduction number during the two first waves of the COVID-19 pandemic in Hungary. Our results demonstrate how behavioral data can be used to build alternative monitoring systems complementing the established public health surveillance. They can identify and provide better signals during periods when official estimates appear unreliable due to observational biases.

physics.soc-ph↗

Understanding hesitancy with revealed preferences across COVID-19 vaccine types

Many countries have secured larger quantities of COVID-19 vaccines than their populace is willing to take. This abundance and variety of vaccines created a historical moment to understand vaccine hesitancy better. Never before were more types of vaccines available for an illness and the intensity of vaccine-related public discourse is unprecedented. Yet, the heterogeneity of hesitancy by vaccine types has been neglected so far, even though factual or believed vaccine characteristics and patient attributes are known to influence acceptance. We address this problem by analysing acceptance and assessment of five vaccine types using information collected with a nationally representative survey at the end of the third wave of the COVID-19 pandemic in Hungary, where a unique portfolio of vaccines were available to the public in large quantities. Our special case enables us to quantify revealed preferences across vaccine types since one could evaluate a vaccine unacceptable and even could reject an assigned vaccine to wait for another type. We find that the source of information that respondents trust characterizes their attitudes towards vaccine types differently and leads to divergent vaccine hesitancy. Believers of conspiracy theories were significantly more likely to evaluate the mRNA vaccines (Pfizer and Moderna) unacceptable while those who follow the advice of politicians evaluate vector-based (AstraZeneca and Sputnik) or whole-virus vaccines (Sinopharm) acceptable with higher likelihood. We illustrate that the rejection of non-desired and re-selection of preferred vaccines fragments the population by the mRNA versus other type of vaccines while it generally improves the assessment of the received vaccine. These results highlight that greater variance of available vaccine types and individual free choice are desirable conditions that can widen the acceptance of vaccines in societies.

econ.GN↗

Universal role of commuting in the reduction of social assortativity in cities

Millions commute to work every day in cities and interact with colleagues, customers, providers, friends, and strangers. Commuting facilitates the mixing of people from distant and diverse neighborhoods, but whether this has an imprint on social inclusion or instead, connections remain assortative is less explored. In this paper, we aim to better understand income sorting in social networks inside cities and investigate how commuting distance conditions the online social ties of Twitter users in the 50 largest metropolitan areas of the United States. Home and work locations are identified from geolocated tweets that enable us to infer the socio-economic status of individuals. Our results show that an above-median commuting distance in cities is associated with more diverse individual networks in terms of connected peers and their income. The degree that distant commutes link neighborhoods of different socio-economic backgrounds greatly varies by city size and structure. However, we find that above-median commutes are associated with a nearly uniform, moderate reduction of social tie assortativity across the top 50 US cities suggesting a universal role of commuting in integrating disparate social networks in cities. Our results inform policy that facilitating access across distant neighborhoods can advance the social inclusion of low-income groups.

physics.soc-ph↗

Socioeconomic biases in urban mixing patterns of US metropolitan areas

Urban areas serve as melting pots of people with diverse socioeconomic backgrounds, who may not only be segregated but have characteristic mobility patterns in the city. While mobility is driven by individual needs and preferences, the specific choice of venues to visit is usually constrained by the socioeconomic status of people. The complex interplay between people and places they visit, given their personal attributes and homophily leaning, is a key mechanism behind the emergence of socioeconomic stratification patterns ultimately leading to urban segregation at large. Here we investigate mixing patterns of mobility in the twenty largest cities of the United States by coupling individual check-in data from the social location platform Foursquare with census information from the American Community Survey. We find strong signs of stratification indicating that people mostly visit places in their own socioeconomic class, occasionally visiting locations from higher classes. The intensity of this `upwards bias' increases with socioeconomic status and correlates with standard measures of racial residential segregation. Our results indicate an even stronger socioeconomic segregation in individual mobility than one would expect from system-level distributions, shedding further light on uneven mobility mixing patterns in cities.

physics.soc-ph↗