Flow in networks with random capacities

We study the problem of finding the maximum flow through a capacitated network in which the set of capacities is a collection of independent random variables, drawn from some known distribution. We find limit theorems when the underlying graph is either a branching tree or a complete graph. Finally, we discuss the difficulty of the problem of finding the expected maximum flow, using the language of computational complexity, and propose an easy approximate solution to the closely related reliability problem.

[1]  J. Hammersley,et al.  Percolation processes , 1957, Mathematical Proceedings of the Cambridge Philosophical Society.

[2]  R. R. Bahadur,et al.  On Deviations of the Sample Mean , 1960 .

[3]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[4]  T. E. Harris,et al.  The Theory of Branching Processes. , 1963 .

[5]  Michel Loève,et al.  Probability Theory I , 1977 .

[6]  J. Hammersley,et al.  First-Passage Percolation, Subadditive Processes, Stochastic Networks, and Generalized Renewal Theory , 1965 .

[7]  J. M. Hammersley,et al.  First‐Passage Percolation , 1966 .

[8]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[9]  E. Jamoulle,et al.  Transportation networks with random arc capacities , 1972 .

[10]  J. Kingman Subadditive Ergodic Theory , 1973 .

[11]  Andrew W. Shogan Sequential Bounding of the Reliability of a Stochastic Network , 1976, Oper. Res..

[12]  R. Smythe,et al.  First-passage percolation on the square lattice. I , 1977, Advances in Applied Probability.

[13]  John Gill,et al.  Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..

[14]  Janos Simon,et al.  On the Difference Between One and Many (Preliminary Version) , 1977, ICALP.

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[17]  Leslie G. Valiant,et al.  Completeness classes in algebra , 1979, STOC.

[18]  J. M. Hammersley,et al.  Percolation theory and its ramifications , 1980 .