๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Flow equivalence and stochastic equivalence in G-networks

โœ Scribed by Jean-Michel Fourneau; Erol Gelenbe

Book ID
106307913
Publisher
Springer-Verlag
Year
2004
Tongue
English
Weight
113 KB
Volume
1
Category
Article
ISSN
1619-697X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Characterizing the flow equivalent trees
Characterizing the flow equivalent trees of a network
โœ David Hartvigsen ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 115 KB

Consider a connected graph G with positive edge capacities. Gomory and Hu (J. SIAM 9 (1961) 551) showed that there always exists a tree T with positive edge capacities, on the same node set as G, such that the max ow value between any pair of nodes in G is the same as the max ow value between the co

Probabilistic equivalence and stochastic
Probabilistic equivalence and stochastic model reduction in multiscale analysis
โœ M. Arnst; R. Ghanem ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 374 KB

This paper presents a probabilistic upscaling of mechanics models. A reduced-order probabilistic model is constructed as a coarse-scale representation of a specified fine-scale model whose probabilistic structure can be accurately determined. Equivalence of the fine-and coarse-scale representations