Network Origin-Demand Estimation Using Percolation (NODE)

David Levinson
Additional contact information
David Levinson: TransportLab, School of Civil Engineering, University of Sydney

Working Papers from University of Minnesota: Nexus Research Group

Abstract: This paper presents a network origin–destination estimation (NODE) method for trip distribution that applies a percolation-like graph search to allocate trips from origins to destinations. Expanding in cost order from each origin, NODE matches productions to available attractions, depleting destination capacities as they are filled. Multiple origins compete for the same destinations; later arrivals may be diverted to more distant alternatives. The result is an OD matrix spatially constrained by network topology and impedance, without a global gravity function or logit structure. NODE can replicate gravity results in some settings, but departs in cases of destination capacity constraints, network bottlenecks, and heterogeneous acceptance, offering a simple, network-aware alternative to conventional models.

Keywords: transportation; transport networks (search for similar items in EconPapers)
JEL-codes: R40 (search for similar items in EconPapers)
Date: 2026
References: Add references at CitEc
Citations:

Published in Findings

Downloads: (external link)
https://doi.org/10.32866/001c.147387 Published version landing page, 2026 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:nex:wpaper:paper-2026-05

DOI: 10.32866/001c.147387

Access Statistics for this paper

More papers in Working Papers from University of Minnesota: Nexus Research Group Contact information at EDIRC.
Bibliographic data for series maintained by David Levinson ().