5,204 research outputs found
Two families of graphs satisfying the cycle basis interpolation property
AbstractThe length of a cycle basis of a graph G is the sum of the lengths of its cycles. Let c−,c+ be the lengths of the minimal and maximal cycle basis, respectively. Then G has the cycle basis interpolation property (cbip) if for all integers c, c−⩽c⩽c+, there exists a cycle basis of length c. We construct two families of graphs with the cbip, namely snake-graphs and kite-graphs
Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI
With the objective of employing graphs toward a more generalized theory of
signal processing, we present a novel sampling framework for (wavelet-)sparse
signals defined on circulant graphs which extends basic properties of Finite
Rate of Innovation (FRI) theory to the graph domain, and can be applied to
arbitrary graphs via suitable approximation schemes. At its core, the
introduced Graph-FRI-framework states that any K-sparse signal on the vertices
of a circulant graph can be perfectly reconstructed from its
dimensionality-reduced representation in the graph spectral domain, the Graph
Fourier Transform (GFT), of minimum size 2K. By leveraging the recently
developed theory of e-splines and e-spline wavelets on graphs, one can
decompose this graph spectral transformation into the multiresolution low-pass
filtering operation with a graph e-spline filter, and subsequent transformation
to the spectral graph domain; this allows to infer a distinct sampling pattern,
and, ultimately, the structure of an associated coarsened graph, which
preserves essential properties of the original, including circularity and,
where applicable, the graph generating set.Comment: To appear in Appl. Comput. Harmon. Anal. (2017
Harmonic functions on multiplicative graphs and interpolation polynomials
We construct examples of nonnegative harmonic functions on certain graded
graphs: the Young lattice and its generalizations. Such functions first emerged
in harmonic analysis on the infinite symmetric group. Our method relies on
multivariate interpolation polynomials associated with Schur's S and P
functions and with Jack symmetric functions. As a by-product, we compute
certain Selberg-type integrals.Comment: AMSTeX, 35 page
Nonlinear spectral calculus and super-expanders
Nonlinear spectral gaps with respect to uniformly convex normed spaces are
shown to satisfy a spectral calculus inequality that establishes their decay
along Cesaro averages. Nonlinear spectral gaps of graphs are also shown to
behave sub-multiplicatively under zigzag products. These results yield a
combinatorial construction of super-expanders, i.e., a sequence of 3-regular
graphs that does not admit a coarse embedding into any uniformly convex normed
space.Comment: Typos fixed based on referee comments. Some of the results of this
paper were announced in arXiv:0910.2041. The corresponding parts of
arXiv:0910.2041 are subsumed by the current pape
Pareto optimality in house allocation problems
We study Pareto optimal matchings in the context of house allocation problems. We present an O(\sqrt{n}m) algorithm, based on Gales Top Trading Cycles Method, for finding a maximum cardinality Pareto optimal matching, where n is the number of agents and m is the total length of the preference lists. By contrast, we show that the problem of finding a minimum cardinality Pareto optimal matching is NP-hard, though approximable within a factor of 2. We then show that there exist Pareto optimal matchings of all sizes between a minimum and maximum cardinality Pareto optimal matching. Finally, we introduce the concept of a signature, which allows us to give a characterization, checkable in linear time, of instances that admit a unique Pareto optimal matching
- …