Uniformly generating origin destination tables

Authors:
David M. Einstein;Lee K. Jones
Affiliations:
Department of Mathematical Sciences, University of Massachusetts Lowell;Department of Mathematical Sciences, University of Massachusetts Lowell
Venue:
Information Theory, Combinatorics, and Search Theory
Year:
2013

Citing 4
Cited 0

Sampling contingency tables

Random Structures & Algorithms
Random walks and an O*(n5) volume algorithm for convex bodies

Random Structures & Algorithms
Negative examples for sequential importance sampling of binary contingency tables

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Monte Carlo Strategies in Scientific Computing

Monte Carlo Strategies in Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

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.