Advertisement
Published in:
2013 | OriginalPaper | Chapter
Uniformly Generating Origin Destination Tables
Authors : David M. Einstein, Lee K. Jones
Published in: Information Theory, Combinatorics, and Search Theory
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.