Origin of the Scaling Law in Human Mobility: Hierarchical Organization of Traffic Systems

Origin of the Scaling Law in Human Mobility: Hierarchical Organization of Traffic Systems

Xiao-Pu Han    Qiang Hao    Bing-Hong Wang    Tao Zhou Department of Modern Physics, University of Science and Technology of China, Hefei 230026, People’s Republic of China
Research Center for Complex System Science, University of Shanghai for Science and Technology, Shanghai 200093, People’s Republic of China
Department of Physics, University of Fribourg, Fribourg 1700, Switzerland
July 12, 2019

Uncovering the mechanism leading to the scaling law in human trajectories is of fundamental importance in understanding many spatiotemporal phenomena. We propose a hierarchical geographical model to mimic the real traffic system, upon which a random walker will generate a power-law travel displacement distribution with exponent -2. When considering the inhomogeneities of cities’ locations and attractions, this model reproduces a power-law displacement distribution with an exponential cutoff, as well as a scaling behavior in the probability density of having traveled a certain distance at a certain time. Our results agree very well with the empirical observations reported in [D. Brockmann et al., Nature 439, 462 (2006)].

89.75.Fb, 05.40.Fb, 89.75.Da

Studies on the non-Poisson statistics of human behaviors have recently attracted much attention bara (); vqz1 (); zhou (). Besides the inter-event or waiting time distribution, the spatial movements of human also exhibit non-Poisson statistics. Brockmann et al. bro () investigated the bank note dispersal, as a proxy for human movements, and revealed indirectly a power-law distribution of human travel displacements. Gonzalez et al. gon () studied the human travel patterns by measuring the distance of mobile phone users’ movements in different stations, and observed a similar scaling law. Actually, the mobility patterns of many animals also show power-law-like displacement distributions bart1 (); ramo (); sims (). The ubiquity of such kind of distributions attracts scientists to dig into the underlying mechanism. Some interpretations, such as optimal search strategy visw (); bart2 (), olfactory-driven foraging reyn () and deterministic walks santo (), have already been raised for the power-law displacement distribution in animals mobility patterns, however, they are based on the prey processes and thus cannot be used to explain the observed scaling law in human trajectories, which is still an open problem. In this paper, we propose a model to mimic the human travel pattern, where the hierarchical organization of the real human traffic systems is taken into account. Our model can reproduce the power-law displacement distributions, as well as the scaling behavior in probability density of having traveled a certain distance at a certain time, agreeing very well with the empirical results reported in Ref. bro ().

Figure 1: (Color online) Illustration of the hierarchical structure and moving rules in the present model. (a)-(c) show the connections among the different-layer cities (black lines) and the same-layer cities (blue lines). Where the green, red, and black circles denote the cities in 3rd, 2nd and 1st layers, respectively. (d) gives a typical trajectory of a walker moving from a lower-layer city to a higher-layer city in other sub-region. A fractal network model with similar motivation can be found in Ref. Kalapala2006 ().

Let’s think about the real human traffic systems. Generally speaking, a district (e.g., a province or a state) usually has a core city, like its capital; around this core city, there are several big cities as the secondary centers (e.g., municipalities); then, each of these centers is rounded by some counties; and towns and villages will surround each of the counties. A hierarchical traffic system is built accordingly. Imaging people traveling from a town, , subordinating to the central city, , to another town that is subordinated to the central city . There is usually no direct way connecting and , and the typical route is . This kind of hierarchical organization is not just inside a country or a district, but across the whole world. For example, if one wants to travel from the University of Science and Technology of China to the University of Fribourg, there is no direct way connecting Hefei and Fribourg, instead, one has to follow the route HefeiShanghaiZürichFribourg although it is much longer than the geographical distance between Hefei and Fribourg. Such a hierarchical organization as well as the resulting scale invariance in road networks have already been demonstrated recently Kalapala2006 ().

For simplicity, we call all the units cities. In our model, cities are organized in layers. A uniform 3-layer system is shown in Fig. 1, in which, 81 cities locate on the centers of a lattice. The most central city is put in the first layer, and the whole region is divided into 9 sub-regions, each contains a lattice. Except the middle sub-region, all other eight sub-regions have their own central cities, namely the second layer cities, which locate at the centers of those sub-regions. Meanwhile, there are eight third layer cities around each of the second layer cities as well as the first layer city. An illustration is shown in Fig. 1. Denote the number of layers and the number of first layer cities. We assign sub-regions to each of the 1st-layer cities, with the 1st-layer city locating in the center, and 2nd-layer cities are respectively put in the remain sub-regions. Each of the sub-regions is further divided into sub-sub-regions, with the 1st- or 2nd-layer cities locating in the center and newly generated 3rd-layer cities put in the remain sub-sub-regions. Repeating this process until the th-layer cities are generated. For , there are th-layer cities. Note that, in this model, to make sure the lattice is fulfilled with cities, must be equal to where is a certain integer larger than 1.

The first layer cities are fully connected with each other, each of which is connected with the nearest th-layer cities and the nearest second layer cities. Each of the second layer cities is connected with the nearest th-layer cities, the nearest third layer cities, as well as the other second layer cities belonging to the same first layer city. Actually, for , each of the th-layer cities is connected with the nearest th-layer cities, the nearest th-layer cities, as well as the other th-layer cities belong to the same th-layer city. Note that, all the connections are symmetry, and the direct move between two cities is allowed only if they are connected. Figure 1 illustrates an example with , and . The modeled system can be viewed as a hierarchical network. Different from the real hierarchical networks rav2 () or the mathematical models an (); ran (), it is hierarchical but not scale-free.

Figure 2: (Color online) Burstiness of long-range travels. Parameters are set as , , and . We choose because it is typical in the real world, such as province-city-county-town-village in China and region-department-arrondissement-canton-commune in France. (a) The sequence of the displacement, , of a random walker in consecutive steps. (b) The walker’s trajectory in 2000 consecutive steps. (c) The distribution , where the dash line, as a guide for eyes, is of slope -2. The data in panel (c) is obtained by averaging over 100 independent runs, and each lasts steps.

We consider the simplest case where a random walker is consequently moving from one city to a random neighboring city (two cities are said to be neighboring if they are connected). Figure 1(d) shows a typical trajectory of a walker moving from a lower-layer city to a higher-layer city in other sub-region. The displacement of the walker in one step is defined as the geometric distance , and the distribution of is what we mainly concern in this paper. As shown in Fig. 2, burstiness of long-range travels is clearly observed and the distribution of travel displacement, , approximately obeys a power-law form with exponent -2.

The essential physics of this model is a random-walk process in a geographical network where edges are of different geometric distances. For a random walker in a connected symmetry (undirected) network, in the long time limit, each edge has the same chance to be visited (this proposition is hold even for a very heterogenous network, since for an arbitrary node, the number of times being visited is proportional to its degree while the probability that a specific adjacent edge of this node is consecutively visited is inversely proportional to the degree. Details can be found in Ref. Lovasz1996 ()). Therefore, the displacement distribution of a random walker is equivalent to the distribution of edges’ geometric distances. Let denote the average geometric distance of edges connecting two th-layer cities (they must belong to the same th-layer city) and an th-layer city and an th-layer city (the former belongs to the latter), and denote the total number of edges contributed to . Obviously, for , . , and can be considered as constants, and thus we have . On the other hand, for , where . That is, . Roughly speaking, and play the roles of geometric distance and the number of edges associated with such a distance. As we have already obtained the scaling , we can deductive that the displacement distribution for a system with sufficiently large and in the long time limit obeys the scaling , which is in accordance with the simulation result shown in Fig. 2(c). The observed result implies that the scaling law in human trajectories may results from the inherent hierarchical organization in traffic systems.

Figure 3: (Color online) Illustration of a typical five-step movements in a 3-layer inhomogeneous model, where red, blue, and yellow respectively denote the 1st-layer, 2nd-layer and 3rd-layer cities. For clarity, we do not plot the connections between cities in the same layer.

Figure 4: The trajectory of a walker in 2000 consecutive steps in the heterogeneous model with parameter setting , , , and . (a) and (b) respectively correspond to the cases of and .

Figure 5: (Color online) Displacement distribution, , for inhomogeneous model, obtained by 100 independent runs, each of which lasts time steps. The parameters are , , and . Red circles, green triangles and violet rectangles correspond to the cases of , , and , respectively. The blue lines denote the fitting functions, for , and for . The inset shows the relation between the power-law exponent and the parameter .

Although the present model can reproduce the power-law displacement distribution, the absolute value of exponent is higher than the empirical ones bro (); gon (), and the model is obviously oversimplified. Firstly, real cities are not located in a completely uniform matter, but with some irregularity. Secondly, the model assumes that each city has the same attraction for the walker, however, in the real world, a central city is generally much more attractive than a small town. We next propose a modified model taking into consideration the inhomogeneous locations and attractions of cities. In this inhomogeneous model, all cities are randomly distributed in an square (we keep the number of cities in each layer the same as the original model), each of the th-layer cities is connected to the nearest higher-layer city, and two th-layer cities are connected if they are connected to the same higher-layer city. All the 1st-layer cities are fully connected to each other.

As mentioned above, the center city should have greater attraction, which is represented by a layer-dependent weight, , where denotes the layer and is a free parameter. The probability that the walker will move along an edge is proportional to its weight (A similar weighted random walk model has previously been proposed to explain the nonlinear dependence of the airport throughput on the connectivity Ou2007 ()). Clearly, the larger indicates higher heterogeneity. In Fig. 3, we show an illustration of a typical trajectory in a 3-layer inhomogeneous model, and in Fig. 4 we report the trajectories for and in a 5-layer inhomogeneous model. As shown in Fig. 5, for the inhomogeneous model, the displacement distribution, , is still heavy-tailed and can be well fitted by a power-law function with an exponential cutoff, as . In addition, as shown in the inset of Fig. 5, when increases from 1.0 to 2.0, the power-law exponent, , monotonously decreases from 2.70 to 1.51, covering the range of empirical observations bro (); gon (). This result suggests that the inhomogeneity in cities’ attractions may be the reason why the absolute value of power-law exponent in the real human displacement distribution is lower than that predicted by the homogeneous model (i.e., 2.0), while the inhomogeneity of cities’ locations enlarges the absolute value of such exponent.

Finally, we check whether our model can reproduce the spatiotemporal statistics of real human mobility. Providing the trajectory of a random walker, one can obtain the probability of having traveled a distance at time (the same technique has been adopted in preparing Fig. 2a in Ref. bro (), please see details there). As shown in Fig. 6, a scaling behavior with is clearly observed, which agrees well with the empirical result, , reported in Ref. bro (). Similar scaling behavior can also be observed for , however, the exponent, , is far less than the empirical value. In addition, providing the travel displacement distribution, this scaling behavior with around 1.0 can not be reproduced by a Lévy flight bro ().

Figure 6: (Color online) The probability of having traveled a distance at time . The parameters are , , , and . This plot is obtained by averaging 1000 independent runs, each of which lasts time steps. The black dash line, as a guide of eyes, is of slope 1.

Uncovering the human traveling pattern is of fundamental importance in the understanding of various spatiotemporal phenomena bro (); gon (), and may finds applications in the design of traffic systems Barthelemy2006 (), the control of human infectious disease Hufnagel2004 (), the military service planning Zhao2008 (), and so on. Although empirical results about the scaling law of long-range human travels have been reported for years, it lacks the understanding of the underlying mechanism. This work gives raise to a very possible reason causing the heavy-tailed displacement distribution, , that is, the hierarchical organization of traffic systems. The secondary ingredient, also playing appreciable role in determining the traveling pattern, is the inhomogeneities of the locations and attractions of cities: The former enlarges the exponent , while the latter depresses it (essentially, the inhomogeneity of attractions results from the inhomogeneous population density and economic development). Actually, as shown in Fig. 5, with tunable strength of inhomogeneity, the exponent is also tunable. When , meaning the topper-layer cities having greater attractions, the statistical features produced by our model are very close to the empirical ones reported in Ref. bro (), not only the displacement distribution, but also the spatiotemporal statistics of mobility.

We acknowledge Changsong Zhou and Aaron Clauset for valuable suggestions. This work is supported by 973 program (2006CB705500), and the National Natural Science Foundation of China (10532060, 10635040 and 70871082). Authors are ordered in alphabet.


  • (1) A.-L. Barabási, Nature 435, 207 (2005).
  • (2) A. Vázquez et al., Phys. Rev. E 73, 036127 (2006).
  • (3) T. Zhou et al., Towards the Understanding of Human Dynamics, in M. Burguete and L. Lam (eds.), Science Matters: Humanities as Complex Systems (World Scientific, Singapore, 2008, pp. 207-233), arXiv: 0801.1389.
  • (4) D. Brockmann et al., Nature 439, 462 (2006).
  • (5) M. C. González et al., Nature 453, 779 (2008).
  • (6) F. Bartumeus et al., Proc. Natl. Acad. Sci. U.S.A. 100, 12771 (2003).
  • (7) G. Ramos-Fernández et al., Behav. Ecol. Sociobiol. 55, 223 (2004).
  • (8) D. W. Sims et al., Nature 451, 1098 (2008).
  • (9) G. M. Viswanathan et al., Nature 401, 911 (1999).
  • (10) F. Bartumeus et al., Phys. Rev. Lett. 88, 097901 (2002).
  • (11) A. M. Reynolds, Phys. Rev. E 72, 041928 (2005).
  • (12) M. C. Santos et al., Phys. Rev. E 75, 061114 (2007).
  • (13) V. Kalapala et al., Phys. Rev. E 73, 026130 (2006).
  • (14) E. Ravasz et al., Phys. Rev. E 67, 026112 (2002).
  • (15) J. S. Andrade et al., Phys. Rev. Lett. 94, 018702 (2005).
  • (16) T. Zhou et al., Phys. Rev. E 71, 046141 (2005).
  • (17) L. Lovász, Random walks on graphs: A survey, in D. Miklos et al. (eds.), Combinatorics, Paul Erdös is Eighty, Vol. 2 (Janos Bolyai Mathematical Society, Budapest, 1996, pp. 353-398).
  • (18) Q. Ou et al., Phys. Rev. E 75, 021102 (2007).
  • (19) M. Barthélemy et al., J. Stat. Mech. L07002 (2006).
  • (20) L. Hufnage et al., Proc. Natl. Acad. Sci. U.S.A. 101, 15124 (2004).
  • (21) M. Zhao et al., Proc. Military Commun. Conf. 2008 (IEEE Press, 2008, pp. 1-7).
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
Add comment
Loading ...
This is a comment super asjknd jkasnjk adsnkj
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test description