Flow in networks with random capacities

DOI10.1080/17442508208833219MaRDI QIDQ3961523zbMATH OpenOpenAlexFDO

Authors G. R. Grimmett, D. 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 complexitypercolationrandom capacitiesreliabilitysubadditive process

Mathematics Subject Classification ID

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

Cites work

• Computational Complexity of Probabilistic Turing Machines
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3190745 (Why is no real title available?)
• On Deviations of the Sample Mean
• Subadditive ergodic theory

Cited in

(4)

• Limit theorems for Mandelbrot's multiplicative cascades.
• 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

This page was built for publication: Flow in networks with random capacities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3961523)