Flow in networks with random capacities

DOI10.1080/17442508208833219zbMath0496.60009OpenAlexW2030590435MaRDI QIDQ3961523

Geoffrey R. Grimmett, Dominic J. A. Welsh

Publication date: 1982

Published in: Stochastics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17442508208833219

zbMATH Keywords

computational complexityreliabilitypercolationrandom capacitiessubadditive process

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Special processes (60K99) Combinatorial probability (60C05) Applications of renewal theory (reliability, demand theory, etc.) (60K10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items

Finding the shortest path in stochastic networks ⋮ First-passage percolation, network flows and electrical resistances ⋮ The maximal flow through a directed graph with random capacities ⋮ Limit theorems for Mandelbrot's multiplicative cascades.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subadditive ergodic theory
• On Deviations of the Sample Mean
• Computational Complexity of Probabilistic Turing Machines