Natural bounded concentrators
type: Item
instance of: scholarly article
title: Natural bounded concentrators
zbMATH Open document ID: 0822.05038
DOI: 10.1007/BF01294463
author: Moshe Morgenstern
published in: Combinatorica
publication date: 1995-10-05T00:00:00Z
review text: An \((n, \theta, k,\alpha)\)-bounded concentrator is a bipartite graph with \(n\) inputs, \(\theta n\) outputs, \(\theta< 1\), at most \(kn\) edges, and any set of at most \(\alpha n\) inputs is covered by a perfect matching. The author provides a direct construction of a family of bounded concentrators in which \(n\) tends to infinity linearly and \(\theta\), \(k\), and \(\alpha\) are fixed.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 750662
zbMATH Keywords: superconcentrator
zbMATH Keywords: bounded concentrators
reviewed by: Peter Horák
MaRDI profile type: Publication
cites work: Better expanders and superconcentrators
cites work: Asymptotically optimal switching circuits
cites work: Proof of Peterson's conjecture for GL(2) over a global field of \(characteristic\quad p\).
cites work: Automorphic spectra on the tree of \(PGL_ 2\)
cites work: Automorphic Forms on Adele Groups. (AM-83)
cites work: Explicit constructions of linear-sized superconcentrators
cites work: Q5566772
cites work: Q3913574
cites work: Limitations on Explicit Constructions of Expanding Graphs
cites work: Ramanujan graphs
cites work: Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
cites work: Ramanujan Diagrams
cites work: Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
cites work: Strong approximation for semi-simple groups over function fields
cites work: Q3341041
cites work: Explicit Concentrators from Generalized N-Gons
full work available at URL: https://doi.org/10.1007/bf01294463
OpenAlex ID: W2077681687
description: scientific article; zbMATH DE number 750662