On the Expected Capacity of Binomial and Random Concentrators

DOI10.1137/0219010zbMATH Open0741.05064OpenAlexW2026961123MaRDI QIDQ4712680

Edward R. 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)

Related Items (1)

Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Concentration inequalities and limit theorems for randomized sums 👍 👎
• Random capacities and their distributions 👍 👎
• A refined randomized concentration inequality 👍 👎
• ON THE MAXIMUM-ENTROPY PROBABILITY WHICH IS CONSISTENT WITH A CONVEX CAPACITY 👍 👎
• On the Discreteness of Capacity-Achieving Distributions 👍 👎
• On total capacity of k‐out‐of‐n systems with random weights 👍 👎
• Concentration and Gaussian Approximation for Randomized Sums 👍 👎

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)