Abstract
Given a network and the total flows into and out of each of the sink and source nodes, it is useful to select uniformly at random an origin-destination (O-D) matrix for which the total in and out flows at sinks and sources (column and row sums) matches the given data. We give an algorithm for small networks (less than 16 nodes) for sampling such O-D matrices with exactly the uniform distribution and apply it to traffic network analysis. This algorithm also can be applied to communication networks and used in the statistical analysis of contingency tables. © Springer-Verlag Berlin Heidelberg 2013.
Author supplied keywords
Cite
CITATION STYLE
Einstein, D. M., & Jones, L. K. (2013). Uniformly generating origin destination tables. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7777, pp. 209–216). Springer Verlag. https://doi.org/10.1007/978-3-642-36899-8_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
