Better Expanders and Superconcentrators by Kolmogorov Complexity
نویسنده
چکیده
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best known bounds on the size of expanders and superconcentrators can be obtained this way. In the case of (acyclic) superconcentrators we obtain the density 34. Also, we review related graph properties, like magnification, edge-magnification, isolation, and develop bounds based on the Kolmogorov approach.
منابع مشابه
Eigenvalues, Expanders and Superconcentrators
Explicit construction of families of linear expanders and superconcentrators is relevant to theoretical computer science in several ways. There is essentially only one known explicit construction. Here we show a correspondence between the eigenvalues of the adjacency matrix of a graph and its expansion properties, and combine it with results on Group Representations to obtain many new examples ...
متن کاملSuperconcentrators of Density 25.3
An N -superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. We prove the existence of such superconcentrators with asymptotic density 25.3 (where the density is t...
متن کاملil,, lsoperimetric Inequalities for Graphs, and Superconcentrators
A general method for obtaining asymptotic isoperimetric inequalities for families of graphs is developed. Some of these inequalities have been applied to functional analysis, This method uses the second smallest eigenvalue of a certain matrix associated with the graph and it is the discrete version of a method used before for Riemannian manifolds. Also some results are obtained on spectra of gr...
متن کامل3D Scene and Object Classification Based on Information Complexity of Depth Data
In this paper the problem of 3D scene and object classification from depth data is addressed. In contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. In order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. Exploiting the algorithmic information theory, a new def...
متن کاملNovel measures based on the Kolmogorov complexity for use in complex system behavior studies and time series analysis
We have proposed novel measures based on the Kolmogorov complexity for use in complex system behavior studies and time series analysis. We have considered background of the Kolmogorov complexity and also we have discussed meaning of the physical as well as other complexities. To get better insights into the complexity of complex systems and time series analysis we have introduced the three nove...
متن کامل