Disjoint paths in expander graphs via random walks: A short survey - FRIEZE - 1998 () Citation Context ...xpansion property of the graph. (A precise upper bound for was not computed, but it is clearly less than 1/3). This result has been improved and extended by Broder, Frieze, and...
Moore graphs and beyond: a survey of the degree/diameter problem Electron. J. Combin., 61 (2005), pp. 1-63 Google Scholar [44] A. Nilli On the second eigenvalue of a graph Discrete Math., 91 (2) (1991), pp. 207-210 View PDFView articleView in ScopusGoogle Scholar [45] D.K....
operations on the graph’s edges. Reiter et al. [26] maintains an almostd-regular graph, i.e., with degrees varying aroundd, using uniform sampling to select, for each node, a set of expander-neighbors. The protocol of [23] gives a distributed algorithm for maintaining a sparse random ...
be the hypothesis that a certain type of expander graph has an explicit construction. Let io-SPACE(T(n)) be the class of problems solvable by algorithms that for infinitely many inputs use at most space T(n). Then the following holds: There exists ϵ > 0 such that for any polynomial...
graph. In particular, the eigenspace of eigenvalue 1 has dimension |V | instead of dimension 1. 2 Never the less, Ambainis and Smith obtained the following quantum expander that is implicit in their work: Theorem 1.1. [AS04] There exists an explicit ( log 2 N λ 2 ,λ) quantum expa...
expander graphWe survey a derivation of asymptotically good error-correcting codes from expander graphs. These codes, called Expander Codes, can be decoded in linear time. We explain how to modify this construction to produce asymptotically good codes that can be encoded as well as decoded in ...
Lossless condensers, unbalanced expanders, and extractors - Ta-Shma, Umans, et al. - 2007 () Citation Context ...tribution that is statistically close to uniform; a function f with this property is called an extractor. There is a large body of recent work on extractors (see the survey [...
Spanders [8] is a self-stabilizing construction of an expander network that is a spanner of the graph. Cooper et al. [6] shows a way of constructing random regular graphs (which are good expanders, w.h.p.) by performing a series of random 'flip' operations on the graph's edges. ...