Searcharxiv⌕ Search

arXiv subjects

Márton Karsai

Publications and source records attributed to Márton Karsai.

81 records · Page 5Linked to original sources

Correlated dynamics in egocentric communication networks

We investigate the communication sequences of millions of people through two different channels and analyze the fine grained temporal structure of correlated event trains induced by single individuals. By focusing on correlations between the heterogeneous dynamics and the topology of egocentric networks we find that the bursty trains usually evolve for pairs of individuals rather than for the ego and his/her several neighbors thus burstiness is a property of the links rather than of the nodes. We compare the directional balance of calls and short messages within bursty trains to the average on the actual link and show that for the trains of voice calls the imbalance is significantly enhanced, while for short messages the balance within the trains increases. These effects can be partly traced back to the technological constrains (for short messages) and partly to the human behavioral features (voice calls). We define a model that is able to reproduce the empirical results and may help us to understand better the mechanisms driving technology mediated human communication dynamics.

physics.soc-ph↗

Effects of time window size and placement on the structure of aggregated networks

Complex networks are often constructed by aggregating empirical data over time, such that a link represents the existence of interactions between the endpoint nodes and the link weight represents the intensity of such interactions within the aggregation time window. The resulting networks are then often considered static. More often than not, the aggregation time window is dictated by the availability of data, and the effects of its length on the resulting networks are rarely considered. Here, we address this question by studying the structural features of networks emerging from aggregating empirical data over different time intervals, focussing on networks derived from time-stamped, anonymized mobile telephone call records. Our results show that short aggregation intervals yield networks where strong links associated with dense clusters dominate; the seeds of such clusters or communities become already visible for intervals of around one week. The degree and weight distributions are seen to become stationary around a few days and a few weeks, respectively. An aggregation interval of around 30 days results in the stablest similar networks when consecutive windows are compared. For longer intervals, the effects of weak or random links become increasingly stronger, and the average degree of the network keeps growing even for intervals up to 180 days. The placement of the time window is also seen to affect the outcome: for short windows, different behavioural patterns play a role during weekends and weekdays, and for longer windows it is seen that networks aggregated during holiday periods are significantly different.

physics.soc-ph↗

Entropy of dynamical social networks

Human dynamical social networks encode information and are highly adaptive. To characterize the information encoded in the fast dynamics of social interactions, here we introduce the entropy of dynamical social networks. By analysing a large dataset of phone-call interactions we show evidence that the dynamical social network has an entropy that depends on the time of the day in a typical week-day. Moreover we show evidence for adaptability of human social behavior showing data on duration of phone-call interactions that significantly deviates from the statistics of duration of face-to-face interactions. This adaptability of behavior corresponds to a different information content of the dynamics of social human interactions. We quantify this information by the use of the entropy of dynamical networks on realistic models of social interactions.

physics.soc-ph↗

Multiscale Analysis of Spreading in a Large Communication Network

In temporal networks, both the topology of the underlying network and the timings of interaction events can be crucial in determining how some dynamic process mediated by the network unfolds. We have explored the limiting case of the speed of spreading in the SI model, set up such that an event between an infectious and susceptible individual always transmits the infection. The speed of this process sets an upper bound for the speed of any dynamic process that is mediated through the interaction events of the network. With the help of temporal networks derived from large scale time-stamped data on mobile phone calls, we extend earlier results that point out the slowing-down effects of burstiness and temporal inhomogeneities. In such networks, links are not permanently active, but dynamic processes are mediated by recurrent events taking place on the links at specific points in time. We perform a multi-scale analysis and pinpoint the importance of the timings of event sequences on individual links, their correlations with neighboring sequences, and the temporal pathways taken by the network-scale spreading process. This is achieved by studying empirically and analytically different characteristic relay times of links, relevant to the respective scales, and a set of temporal reference models that allow for removing selected time-domain correlations one by one.

physics.soc-ph↗

Universal features of correlated bursty behaviour

Inhomogeneous temporal processes, like those appearing in human communications, neuron spike trains, and seismic signals, consist of high-activity bursty intervals alternating with long low-activity periods. In recent studies such bursty behavior has been characterized by a fat-tailed inter-event time distribution, while temporal correlations were measured by the autocorrelation function. However, these characteristic functions are not capable to fully characterize temporally correlated heterogenous behavior. Here we show that the distribution of the number of events in a bursty period serves as a good indicator of the dependencies, leading to the universal observation of power-law distribution in a broad class of phenomena. We find that the correlations in these quite different systems can be commonly interpreted by memory effects and described by a simple phenomenological model, which displays temporal behavior qualitatively similar to that in real systems.

physics.soc-ph↗

Circadian pattern and burstiness in mobile phone communication

The temporal communication patterns of human individuals are known to be inhomogeneous or bursty, which is reflected as the heavy tail behavior in the inter-event time distribution. As the cause of such bursty behavior two main mechanisms have been suggested: a) Inhomogeneities due to the circadian and weekly activity patterns and b) inhomogeneities rooted in human task execution behavior. Here we investigate the roles of these mechanisms by developing and then applying systematic de-seasoning methods to remove the circadian and weekly patterns from the time-series of mobile phone communication events of individuals. We find that the heavy tails in the inter-event time distributions remain robustly with respect to this procedure, which clearly indicates that the human task execution based mechanism is a possible cause for the remaining burstiness in temporal mobile phone communication patterns.

physics.soc-ph↗

Temporal motifs in time-dependent networks

Temporal networks are commonly used to represent systems where connections between elements are active only for restricted periods of time, such as networks of telecommunication, neural signal processing, biochemical reactions and human social interactions. We introduce the framework of temporal motifs to study the mesoscale topological-temporal structure of temporal networks in which the events of nodes do not overlap in time. Temporal motifs are classes of similar event sequences, where the similarity refers not only to topology but also to the temporal order of the events. We provide a mapping from event sequences to colored directed graphs that enables an efficient algorithm for identifying temporal motifs. We discuss some aspects of temporal motifs, including causality and null models, and present basic statistics of temporal motifs in a large mobile call network.

physics.data-an↗

Cooperative behaviour in complex systems

In my PhD thesis I studied cooperative phenomena arise in complex systems using the methods of statistical and computational physics. The aim of my work was also to study the critical behaviour of interacting many-body systems during their phase transitions and describe their universal features analytically and by means of numerical calculations. In order to do so I completed studies in four different subjects. My first investigated subject was a study of non-equilibrium phase transitions in weighted scale-free networks. The second problem I examined was the ferromagnetic random bond Potts model with large values of q on evolving scale-free networks which problem is equivalent to an optimal cooperation problem. The third examined problem was related to the large-q sate random bond Potts model also and I examined the critical density of clusters which touched a certain border of a perpendicular strip like geometry and expected to hold analytical forms deduced from conformal invariance. The last investigated problem was a study of the non-equilibrium dynamical behaviour of the antiferromagnetic Ising model on two-dimensional triangular lattice at zero temperature in the absence of external field and at the Kosterlitz-Thouless phase transition point.

cond-mat.stat-mech↗

Nonequilibrium phase transitions and finite size scaling in weighted scale-free networks

We consider nonequilibrium phase transitions in weighted scale-free networks, in which highly connected nodes, which are created earlier in time are partially immunized. For epidemic spreading we solve the dynamical mean-field equations and discuss finite-size scaling theory. The theoretical predictions are confronted with the results of large scale Monte Carlo simulations on the weighted Barabási-Albert network. Local scaling exponents are found different at a typical site and at a node with very large connectivity.

cond-mat.stat-mech↗