On the Expected Capacity of Binomial and Random Concentrators

DOI10.1137/0219010MaRDI QIDQ4712680zbMATH OpenOpenAlexFDO

Authors Edward Scheinerman

Publication date 25 June 1992

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0219010

zbMATH Keywords

bipartite graphcapacityconcentrator

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Random capacities and their distributions
• scientific article; zbMATH DE number 3864225
• On total capacity of \(k\)-out-of-\(n\) systems with random weights
• On the Discreteness of Capacity-Achieving Distributions
• Concentration and Gaussian Approximation for Randomized Sums
• On the maximum-entropy probability which is consistent with a convex capacity
• Concentration inequalities and limit theorems for randomized sums
• A refined randomized concentration inequality

Cited in

(7)

• The capacity of the subarray partial concentrators
• Natural bounded concentrators
• scientific article; zbMATH DE number 5863579 (Why is no real title available?)
• The Expected Capacity of Concentrators
• Explicit Concentrators from Generalized N-Gons
• Asymptotic results for partial concentrators
• scientific article; zbMATH DE number 1535255 (Why is no real title available?)

This page was built for publication: On the Expected Capacity of Binomial and Random Concentrators

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