# Impact of interactions on human dynamics

###### Abstract

Queueing theory has been recently proposed as a framework to model the heavy tailed statistics of human activity patterns. The main predictions are the existence of a power-law distribution for the interevent time of human actions and two decay exponents and . Current models lack, however, a key aspect of human dynamics, i.e. several tasks require, or are determined by, interactions between individuals. Here we introduce a minimal queueing model of human dynamics that already takes into account human-human interactions. To achieve large scale simulations we obtain a coarse-grained version of the model, allowing us to reach large interevent times and reliable scaling exponents estimations. Using this we show that the interevent distribution of interacting tasks exhibit the scaling exponents , 3/2 and a series of numerable values between 3/2 and 1. This work demonstrates that, within the context of queueing models of human dynamics, interactions change the exponent of the power-law distributed interevent times. Beyond the study of human dynamics, these results are relevant to systems where the event of interest consists of the simultaneous occurrence of two (or more) events.

###### pacs:

89.75.Da,02.50.Le,89.65.Ef,89.75.HcUnderstanding the timing of human activities is extremely important to model human related activities such as communication systems reynolds03 () and the spreading of computer viruses vazquez07 (). In the recent years we have experienced an increased research activity in this area motivated by the increased availability of empirical data. We now count with measurements of human activities covering several individuals and several events per individual ebel02 (); eckmann04 (); Barabási (2005); Oliveira and Barabási (2005); dezso06 (). Thanks to this data we are in a position to investigate the laws and patterns of human dynamics using a scientific approach.

Barabási has taken an important step in this direction reconsidering queueing theory Cohen (1969); Gross and Harris (1998) as framework to model human dynamics Barabási (2005). Within this framework, the to do list of an individual is modeled as a finite length queue with a task selection protocol, such as highest priority first. The main predictions are the existence of a power law distribution of interevent times and two universality classes characterized by exponents Barabási (2005); Vazquez (2005); Vazquez et al. (2006) and Oliveira and Barabási (2005); Vazquez et al. (2006). These universality classes have been corroborated by empirical data for email Barabási (2005); Vazquez et al. (2006) and regular mail communications Oliveira and Barabási (2005); Vazquez et al. (2006), respectively, motivating further theoretical research Grinstein and Linsker (2006); Gabrielli and Caldarelli (2007); Blanchard and Hongler (2007).

The models proposed so far have been limited, however, to single individual dynamics. In practice people are connected in social networks and several of their activities are not performed independently. This reality forces us to model human dynamics in the presence of interactions between individuals. Our past experience with phase transitions has shown us that interactions and their nature are a key factor determining the universality classes and their corresponding scaling exponents stanley71 (). Furthermore, beyond the study of human dynamics, there are several systems where the event of interest consists of the simultaneous occurrence of two (or more) events. For example, collective phenomena in disordered media, such as the interaction of two (or more) particles in cluster formation.

To investigate the impact of human-human interactions on the timing of their activities we consider a minimal model consisting of two agents, A and B (Fig. 1). Each agent is modeled by a priority list containing two tasks, interacting task (I) and aggregate non-interacting task (O). The interacting task models a common activity such as meeting each other, requiring the simultaneous execution of that task by both agents. On the other hand, the non-interacting task represents an aggregate meta-activity accounting for all other tasks the agents execute, which do not require an interaction between them. To each task we assign random priorities (; ) extracted from a probability density function (pdf) (see Fig. 1).

The rules governing the dynamics are as follows. Initial condition: We start with a random initial condition, assigning a priority to the I and O tasks from their corresponding pdf. Updating step: At each time step, both agents select the task with higher priority in their list. If (i) both agents select the interacting task then it is executed, (ii) otherwise each agent executes the O task, representing the execution of any of their non-interacting tasks.

Our aim is to determine the impact of the interaction between the agents and the shape of on the scaling exponent of the interevent time distribution of the interacting task I. For simplicity, we focus on the following priority distribution. Consider the case where each agent has () tasks, one I task and non-interacting tasks, their priorities following a uniform distribution in the interval . The pdf of the highest priority among tasks is in this case given by , resulting in

(1) |

This example shows that the priorities pdf of task I and O are in general different. All the results shown below were obtained using the pdf in Eq. (1).

To investigate the interevent time distribution we perform extensive numerical simulations. Figure 2 shows the interevent time distribution as obtained from direct simulations of the model introduced above. It becomes clear that for large and/or we do not obtain a good statistics, even after waiting for updating steps. This observation is a consequence of the behavior of when and/or are large (Fig. 3). Focusing on agent A, as increases gets more concentrated around priority one, while the priority of the I task remains uniformly spread between zero and one. This fact results in increasingly large interevent times between the execution of the I task.

To speed-off the numerical simulations we derive a coarse-grained version of the model, allowing us to analyze the scaling behavior of the interevent time distribution over several orders of magnitude (inset of Fig. 2). We start by noticing that, given , the joint pdf of factorizes and the probability that both agents execute I right after O is given by

(2) |

This factorization is possible because the execution of the I task requires its priority to be the largest for both agents. In turn, with probability both agents continue to execute O. Thus, the probability distribution that I waits steps before being executed follows the geometric distribution

(3) |

Once the I task is executed it can be executed again resulting in interevent times of one step (). The overall interevent time distribution of the I task is given by

(4) |

where

(5) |

is the expected number of consecutive executions of the I task and denotes the expectation over different realizations of , just at the step of switching from task I to O. Finally, at the step of switching from O to I, the O task priority of both agents must fall below that of the I task. Therefore, the pdf of () just after the switch from O to I is given by

(6) |

where . This later result together with Eq. (3) allow us to condense all steps with consecutive executions of the O task into a single coarse-grained step. More important, this mapping is exact.

Putting all together the coarse-grained model runs as follows. Initial condition: We start with random initial priorities extracted from the pdfs . Updating step: At each step, (i) if for both agents the I task priority is larger than that for the O task we run the model as defined above, both agents executing the I task and updating their I task priorities using the pdfs (). (ii) Otherwise, we generate a random interevent time from the probability distribution (3) and a new O task priority for each agent using the pdf (6). This second step avoids going over successive executions of the O task which, for a large number of non-interacting tasks, significantly slow down the simulations.

The second step of the coarse grained model requires us to extract a random number from a geometric distribution. This can be achieved very efficiently exploiting the fact that the integer part of a real random variable with an exponential distribution follows a geometric distribution. Using this fact, when , we extract exactly from the distribution in Eq. (3), which differs from the corresponding branch of Eq. (4). Normalization by the total number of task I executions, including those with , provides distributed according to Eq. (4).

The I task interevent time distribution obtained from simulations of the coarse-grained model is plotted in Fig. 4a. When it follows a power-law tail with exponent . As increases approaches one. A guess to this dependence, in good agreement with the measured values, is given by (inset of Fig. 4a). The numerical results indicate that there are several numerable universality classes parameterized by and . Notice that the second largest value of (obtained when and , or vice-versa) is close to and, therefore, our results do not show universality classes with exponent between 3/2 and 2 (unless we assume real valued queue lengths).

The power laws in Fig. 4a exhibit a cutoff at a certain value of . To investigate if this is a natural cutoff or just a finite size effect, we investigate the shape of the interevent time distribution as a function of the observation time window . The later is defined as the total number of steps considering both the I and O task and satisfy

(7) |

where is the number of executions of the I task within the time window and () is the sequence of interevent times between executions of the I task. We assume that the cutoff is determined by the finite time window and that the interevent time distribution follows the scaling form

(8) |

where A is a constant, is a scaling exponent and is a scaling function with the asymptotic behaviors when and when . Under this assumption when , with . Given this power law tail and exponent, the number of interevent times necessary to cover the window is of the order of magnitude of Feller (1971). In turn, the mean intervent time is of the order of

(9) |

To check our scaling assumption we plot as a function of (Fig. 4b). The symbols corresponding to different time windows clearly overlap into a single curve, demonstrating that the scaling assumption in Eq. (8) is correct with . Thus, in the limit the I task intervent time distribution exhibits a true power law tail .

Within the context of queuing models of human dynamics, only two universality classes were previously identified, corresponding to the single queue models of Cobham Oliveira and Barabási (2005); Cobham (1954) () and Barabási Barabási (2005) (). The analysis of the two interacting agents model reveals that that the interaction between agents results in a richer set of exponents. Our numerical results provide evidence of a new universality class with exponent and exponents between 3/2 and 1. It is worth noticing that the exponents 2 and 1 may also result from a Poisson proccesses with a time dependent rate hidalgo06 (); vazquezPA07 ().

Because the exponent depends on the systems details, here represented by the agent’s queue lengths and , we conclude that the model with two interacting agents exhibits non-universal behavior. Interestingly, the exponent is asymptotically reached when the number of tasks of one or both agents becomes large. As humans get engaged in several tasks this later asymptotic behavior may explain the ubiquitous observation of the exponent Vazquez et al. (2006).

We use the number of non-interacting tasks as a mean to modulate the distribution of the non-interacting aggregate task priority. Yet, it is the distribution shape the primary factor determining the scaling exponent . The effect of increasing and/or is a concentration of the non-interacting aggregate task priority around priority one, resulting in values of that approaches one. This means that the limit is achieved for low priority interacting tasks that remain most of the time in the queue without being executed, at expenses of the execution of tasks which in general have a higher priorities.

Considering the interaction between agents we also solve one of the longstanding problems of the original single queue Barabási model, related to the stationarity of the interevent time distribution Vazquez (2005); Gabrielli and Caldarelli (2007). In the Barabási single queue model the task with highest priority is executed with a probability , otherwise a task is selected at random for execution. When is close to one the interevent time distribution exhibits a peak at one step and when . When the distribution is non-stationary and when time . In contrast, in the model considered here there is no need to introduce the random selection rule and the corresponding model parameter . The interacting task interevent time distribution is stationary even when the - highest priority first - selection rule is applied. In turn, the exponent is not exactly one, but reaches one asymptotically with increasing the number of tasks. Finally, the interevent time distribution of the Barabási model exhibits a natural cutoff determined by the parameter , while for the model introduced here it is a true power law up to finite size effects. However, it is worth noticing that in a recent work goncalves08 () it has been found that the original Barabási’s model with variable task execution rate can generate interevent time distributions with exponent . In principle, in our model also different choice of model parameters could result in other exponents in the range between 1 and 3/2.

This work represents the first step in understanding how interactions among agents affect their activity pattern. Based on recent works using queueing theory we describe the model in the context of human dynamics. It can be generalized to consider a larger number of agents connected by a specific social network. Also, the model can potencially be used more generally to study the time statistics of events requiring synchronization between two physical systems.

We thank J.F.F. Mendes for useful comments and suggestions.

## References

- (1) P. Reynolds, Call Center Staffing (The Call Center School Press, Lebanon, Tennessee, 2003).
- (2) A. Vazquez, B. Rácz, A. Lukács and A.-L. Barabási, Phys. Rev. Lett. 98, 158702 (2007).
- (3) H. Ebel, L.-I. Mielsch, and S. Bornholdt, Phys. Rev. E 66, R35103 (2002).
- (4) J.-P. Eckmann, E. Moses, and D. Sergi, Proc. Natl. Acad. Sci. U.S.A. 101, 14333 (2004).
- Barabási (2005) A.-L. Barabási, Nature (London) 435, 207 (2005).
- Oliveira and Barabási (2005) J. G. Oliveira and A.-L. Barabási, Nature (London) 437, 1251 (2005).
- (7) Z. Dezso, E. Almaas, A. Lukács, B. Rácz, I. Szakadát and A.-L. Barabási, Phys. Rev. E 73, 066132 (2006).
- Cohen (1969) J. W. Cohen, The Single Server Queue (North-Holland, Amsterdam, 1969).
- Gross and Harris (1998) D. Gross and C. M. Harris, Fundamentals of Queueing Theory (John Wiley & Sons, New York, 1998).
- Vazquez (2005) A. Vazquez, Phys. Rev. Lett. 95, 248701 (2005).
- Vazquez et al. (2006) A. Vazquez, J. G. Oliveira, Z. Dezső, K.-I. Goh, I. Kondor, and A.-L. Barabási, Phys. Rev. E 73, 036127 (2006).
- Grinstein and Linsker (2006) G. Grinstein and R. Linsker, Phys. Rev. Lett. 97, 130201 (2006).
- Gabrielli and Caldarelli (2007) A. Gabrielli and G. Caldarelli, Phys. Rev. Lett. 98, 208701 (2007).
- Blanchard and Hongler (2007) P. Blanchard and M.-O. Hongler, Phys. Rev. E 75, 026102 (2007).
- (15) H. E. Stanley, Introduction to Phase Transitions and Critical Phenomena (Oxford University Press, New York, 1971).
- Feller (1971) W. Feller, An introduction to probability theory and its applications, vol. II (Wiley, New York, 1971).
- Cobham (1954) A. Cobham, J. Op. Res. Soc. 2, 70 (1954).
- (18) C. A. Hidalgo, Physica A 369, 877-883 (2006).
- (19) A. Vazquez, Physica A 373, 747 (2007).
- (20) B. Gonçalves and J. J. Ramasco, E-print: arxiv.org/abs/0803.4018.