An Introduction to the Network Weight Matrix

This study introduces the network weight matrix as a replacement for the spatial weight matrix to measure the spatial dependence between links of a network. This matrix stems from the concept of betweenness centrality and vulnerability in network science. The elements of the matrix are a function not simply of proximity, but of network topology, network structure, and demand configuration. The network weight matrix has distinctive characteristic, which are capable of reflecting spatial dependence between traffic links: (1) The elements are allowed to have negative and positive values, which capture competitive and complementary nature of links, (2) The diagonal elements are not fixed to zero, which takes the self-dependence of a link upon itself into consideration, and (3) The elements not only reflect the spatial dependence based on the network structure, but they acknowledge the demand configuration as well. We verified the network weight matrix by modeling traffic flows in a 3x3 grid test network with 9 nodes and 24 directed links connecting 72 origin-destination (OD) pairs. The results disclose models encompassing the network weight matrix outperform both models without spatial components and models with the spatial weight matrix. This leads inexorably to the conclusion that the network weight matrix represents a more accurate and defensible spatial dependency between traffic links, and thereby augments traffic flow prediction.

[1]  Y. Kamarianakis,et al.  Forecasting Traffic Flow Conditions in an Urban Network: Comparison of Multivariate and Univariate Approaches , 2003 .

[2]  A. Getis.  Spatial Weights Matrices , 2009 .

[3]  Snigdhansu Chatterjee,et al.  Using temporal detrending to observe the spatial correlation of traffic , 2017, PloS one.

[4]  Jiaqiu Wang,et al.  Spatio-temporal autocorrelation of road network data , 2012, J. Geogr. Syst..

[5]  Alex Bavelas.  A Mathematical Model for Group Structures , 1948 .

[6]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[7]  Eleni I. Vlahogianni,et al.  Short-term traffic forecasting: Where we are and where we’re going , 2014 .

[8]  G. Hewings,et al.  Competitive and Complementary Relationship between Regional Economies: A Study of the Great Lake States , 2015 .

[9]  Benny Sudakov,et al.  Local resilience of graphs , 2008 .

[10]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[11]  David E. Boyce,et al.  A discrete transportation network design problem with combined trip distribution and assignment , 1980 .

[12]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[13]  A. Getis,et al.  Using AMOEBA to Create a Spatial Weights Matrix and Identify Spatial Clusters , 2006 .

[14]  W. Tobler.  A Computer Movie Simulating Urban Growth in the Detroit Region , 1970 .

[15]  Peter Gould,et al.  LETTING THE DATA SPEAK FOR THEMSELVES , 1981 .

[16]  F. Harary.  The Determinant of the Adjacency Matrix of a Graph , 1962 .

[17]  Alex Bavelas,et al.  Communication Patterns in Task‐Oriented Groups , 1950 .

[18]  Arnab Bhattacharjee,et al.  Estimation of the Spatial Weights Matrix under Structural Constraints , 2013 .

[19]  François Bavaud,et al.  MODELS FOR SPATIAL WEIGHTS: A SYSTEMATIC LOOK , 2010 .

[20]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.