Ermagun, AlirezaLevinson, David M2017-09-062017-09-062017-08https://hdl.handle.net/11299/189878This study examines the dependency between traffic links using a three-dimensional data detrend- ing algorithm to build a network weight matrix in a real-world example. The network weight matrix reveals how links are spatially dependent in a complex network and detects the competi- tive and complementary nature of traffic links. We model the traffic flow of 140 traffic links in a sub-network of the Minneapolis - St. Paul highway system for both rush hour and non-rush hour time intervals, and validate the extracted network weight matrix. The results of the modeling indi- cate: (1) the spatial weight matrix is unstable over time-of-day, while the network weight matrix is robust in all cases and (2) the performance of the network weight matrix in non-rush hour traffic regimes is significantly better than rush hour traffic regimes. The results of the validation show the network weight matrix outperforms the traditional way of capturing spatial dependency between traffic links. Averaging over all traffic links and time, this superiority is about 13.2% in rush hour and 15.3% in non-rush hour, when only the 1st -order neighboring links are embedded in modeling. Aside from the superiority in forecasting, a remarkable capability of the network weight matrix is its stability and robustness over time, which is not observed in spatial weight matrix. In addition, this study proposes a naïve two-step algorithm to search and identify the best look-back time win- dow for upstream links. We indicate the best look-back time window depends on the travel time between two study detectors, and it varies by time-of-day and traffic link.enTraffic Forecasting; Spatial correlation; Competitive links; Traffic Flow; Weight matrixWorking Paper