Scaling laws for the movement of people between locations in a large city

Large scale simulations of the movements of people in a ``virtual'' city and their analyses are used to generate new insights into understanding the dynamic processes that depend on the interactions between people. Models, based on these interactions, can be used in optimizing traffic flow, slowing the spread of infectious diseases or predicting the change in cell phone usage in a disaster. We analyzed cumulative and aggregated data generated from the simulated movements of 1.6 million individuals in a computer (pseudo agent-based) model during a typical day in Portland, Oregon. This city is mapped into a graph with $181,206$ nodes representing physical locations such as buildings. Connecting edges model individual's flow between nodes. Edge weights are constructed from the daily traffic of individuals moving between locations. The number of edges leaving a node (out-degree), the edge weights (out-traffic), and the edge-weights per location (total out-traffic) are fitted well by power law distributions. The power law distributions also fit subgraphs based on work, school, and social/recreational activities. The resulting weighted graph is a ``small world'' and has scaling laws consistent with an underlying hierarchical structure. We also explore the time evolution of the largest connected component and the distribution of the component sizes. We observe a strong linear correlation between the out-degree and total out-traffic distributions and significant levels of clustering. We discuss how these network features can be used to characterize social networks and their relationship to dynamic processes.Comment: 18 pages, 10 figure

Leverage and Regression Through the Origin

15 pages, 1 article*Leverage and Regression Through the Origin* (Casella, George) 15 page

Evaluating Estimators Conditionally

27 pages, 1 article*Evaluating Estimators Conditionally* (Casella, George) 27 page

Deciphering the Output of Anova Programs for Unequal-Subclass-Numbers Data Using Benchmark Data Sets

9 pages, 1 article*Deciphering the Output of Anova Programs for Unequal-Subclass-Numbers Data Using Benchmark Data Sets* (Searle, S. R.) 9 page

Sampling and Estimation Details for the New York Portion of the National Inventory of Soil and Water Conservation Needs

21 pages, 1 article*Sampling and Estimation Details for the New York Portion of the National Inventory of Soil and Water Conservation Needs* (Beetle, Thomas M.) 21 page

On Characterizations of Orthogonal Designs

21 pages, 1 article*On Characterizations of Orthogonal Designs* (Eccleston, J. A.) 21 page

A Simple Procedure for Constructing Experiment Designs with Incomplete Blocks of Sizes 2 and 3

12 pages, 1 article*A Simple Procedure for Constructing Experiment Designs with Incomplete Blocks of Sizes 2 and 3* (Federer, Walter T.) 12 page

[ ]-Minimax Estimation II: The Design Problem

15 pages, 1 article*[ ]-Minimax Estimation II: The Design Problem* (Solomon, Daniel L.) 15 page

A Nonlinear Ergodic Theorem for Discrete Systems

27 pages, 1 article*A Nonlinear Ergodic Theorem for Discrete Systems* (Crowe, K. M.) 27 page

A Discrete Time Stochastic Model of a Two Prey, One Predator Species Interaction

This issue was undated. The date given is an estimate.26 pages, 1 article*A Discrete Time Stochastic Model of a Two Prey, One Predator Species Interaction* (Poole, Robert W.) 26 page