293 research outputs found

    Almost-Euclidean subspaces of 1N\ell_1^N via tensor products: a simple approach to randomness reduction

    Get PDF
    It has been known since 1970's that the N-dimensional 1\ell_1-space contains nearly Euclidean subspaces whose dimension is Ω(N)\Omega(N). However, proofs of existence of such subspaces were probabilistic, hence non-constructive, which made the results not-quite-suitable for subsequently discovered applications to high-dimensional nearest neighbor search, error-correcting codes over the reals, compressive sensing and other computational problems. In this paper we present a "low-tech" scheme which, for any a>0a > 0, allows to exhibit nearly Euclidean Ω(N)\Omega(N)-dimensional subspaces of 1N\ell_1^N while using only NaN^a random bits. Our results extend and complement (particularly) recent work by Guruswami-Lee-Wigderson. Characteristic features of our approach include (1) simplicity (we use only tensor products) and (2) yielding "almost Euclidean" subspaces with arbitrarily small distortions.Comment: 11 pages; title change, abstract and references added, other minor change

    Convex recovery of a structured signal from independent random linear measurements

    Get PDF
    This chapter develops a theoretical analysis of the convex programming method for recovering a structured signal from independent random linear measurements. This technique delivers bounds for the sampling complexity that are similar with recent results for standard Gaussian measurements, but the argument applies to a much wider class of measurement ensembles. To demonstrate the power of this approach, the paper presents a short analysis of phase retrieval by trace-norm minimization. The key technical tool is a framework, due to Mendelson and coauthors, for bounding a nonnegative empirical process.Comment: 18 pages, 1 figure. To appear in "Sampling Theory, a Renaissance." v2: minor corrections. v3: updated citations and increased emphasis on Mendelson's contribution

    Wavelets and graph CC^*-algebras

    Full text link
    Here we give an overview on the connection between wavelet theory and representation theory for graph CC^{\ast}-algebras, including the higher-rank graph CC^*-algebras of A. Kumjian and D. Pask. Many authors have studied different aspects of this connection over the last 20 years, and we begin this paper with a survey of the known results. We then discuss several new ways to generalize these results and obtain wavelets associated to representations of higher-rank graphs. In \cite{FGKP}, we introduced the "cubical wavelets" associated to a higher-rank graph. Here, we generalize this construction to build wavelets of arbitrary shapes. We also present a different but related construction of wavelets associated to a higher-rank graph, which we anticipate will have applications to traffic analysis on networks. Finally, we generalize the spectral graph wavelets of \cite{hammond} to higher-rank graphs, giving a third family of wavelets associated to higher-rank graphs

    The road to deterministic matrices with the restricted isometry property

    Get PDF
    The restricted isometry property (RIP) is a well-known matrix condition that provides state-of-the-art reconstruction guarantees for compressed sensing. While random matrices are known to satisfy this property with high probability, deterministic constructions have found less success. In this paper, we consider various techniques for demonstrating RIP deterministically, some popular and some novel, and we evaluate their performance. In evaluating some techniques, we apply random matrix theory and inadvertently find a simple alternative proof that certain random matrices are RIP. Later, we propose a particular class of matrices as candidates for being RIP, namely, equiangular tight frames (ETFs). Using the known correspondence between real ETFs and strongly regular graphs, we investigate certain combinatorial implications of a real ETF being RIP. Specifically, we give probabilistic intuition for a new bound on the clique number of Paley graphs of prime order, and we conjecture that the corresponding ETFs are RIP in a manner similar to random matrices.Comment: 24 page

    Baryon number violation, baryogenesis and defects with extra dimensions

    Full text link
    In generic models for grand unified theories(GUT), various types of baryon number violating processes are expected when quarks and leptons propagate in the background of GUT strings. On the other hand, in models with large extra dimensions, the baryon number violation in the background of a string is not trivial because it must depend on the mechanism of the proton stabilization. In this paper we argue that cosmic strings in models with extra dimensions can enhance the baryon number violation to a phenomenologically interesting level, if the proton decay is suppressed by the mechanism of localized wavefunctions. We also make some comments on baryogenesis mediated by cosmological defects. We show at least two scenarios will be successful in this direction. One is the scenario of leptogenesis where the required lepton number conversion is mediated by cosmic strings, and the other is the baryogenesis from the decaying cosmological domain wall. Both scenarios are new and have not been discussed in the past.Comment: 20pages, latex2e, comments and references added, to appear in PR

    Cosmological bounds on large extra dimensions from non-thermal production of Kaluza-Klein modes

    Full text link
    The existing cosmological constraints on theories with large extra dimensions rely on the thermal production of the Kaluza-Klein modes of gravitons and radions in the early Universe. Successful inflation and reheating, as well as baryogenesis, typically requires the existence of a TeV-scale field in the bulk, most notably the inflaton. The non-thermal production of KK modes with masses of order 100 GeV accompanying the inflaton decay sets the lower bounds on the fundamental scale M_*. For a 1 TeV inflaton, the late decay of these modes distort the successful predictions of Big Bang Nucleosynthesis unless M_*> 35, 13, 7, 5 and 3 TeV for 2, 3, 4, 5 and 6 extra dimensions, respectively. This improves the existing bounds from cosmology on M_* for 4, 5 and 6 extra dimensions. Even more stringent bounds are derived for a heavier inflaton.Comment: 17 pages, latex, 4 figure

    On twisted Fourier analysis and convergence of Fourier series on discrete groups

    Full text link
    We study norm convergence and summability of Fourier series in the setting of reduced twisted group CC^*-algebras of discrete groups. For amenable groups, F{\o}lner nets give the key to Fej\'er summation. We show that Abel-Poisson summation holds for a large class of groups, including e.g. all Coxeter groups and all Gromov hyperbolic groups. As a tool in our presentation, we introduce notions of polynomial and subexponential H-growth for countable groups w.r.t. proper scale functions, usually chosen as length functions. These coincide with the classical notions of growth in the case of amenable groups.Comment: 35 pages; abridged, revised and update

    Standard Model baryogenesis through four-fermion operators in braneworlds

    Get PDF
    We study a new baryogenesis scenario in a class of braneworld models with low fundamental scale, which typically have difficulty with baryogenesis. The scenario is characterized by its minimal nature: the field content is that of the Standard Model and all interactions consistent with the gauge symmetry are admitted. Baryon number is violated via a dimension-6 proton decay operator, suppressed today by the mechanism of quark-lepton separation in extra dimensions; we assume that this operator was unsuppressed in the early Universe due to a time-dependent quark-lepton separation. The source of CP violation is the CKM matrix, in combination with the dimension-6 operators. We find that almost independently of cosmology, sufficient baryogenesis is nearly impossible in such a scenario if the fundamental scale is above 100 TeV, as required by an unsuppressed neutron-antineutron oscillation operator. The only exception producing sufficient baryon asymmetry is a scenario involving out-of-equilibrium c quarks interacting with equilibrium b quarks.Comment: 39 pages, 5 figures v2: typos, presentational changes, references and acknowledgments adde

    Minimal Scenarios for Leptogenesis and CP Violation

    Full text link
    The relation between leptogenesis and CP violation at low energies is analyzed in detail in the framework of the minimal seesaw mechanism. Working, without loss of generality, in a weak basis where both the charged lepton and the right-handed Majorana mass matrices are diagonal and real, we consider a convenient generic parametrization of the Dirac neutrino Yukawa coupling matrix and identify the necessary condition which has to be satisfied in order to establish a direct link between leptogenesis and CP violation at low energies. In the context of the LMA solution of the solar neutrino problem, we present minimal scenarios which allow for the full determination of the cosmological baryon asymmetry and the strength of CP violation in neutrino oscillations. Some specific realizations of these minimal scenarios are considered. The question of the relative sign between the baryon asymmetry and CP violation at low energies is also discussed.Comment: 36 pages, 5 figures; minor corrections and references updated. Final version to appear in Phys. Rev.

    User-friendly tail bounds for sums of random matrices

    Get PDF
    This paper presents new probability inequalities for sums of independent, random, self-adjoint matrices. These results place simple and easily verifiable hypotheses on the summands, and they deliver strong conclusions about the large-deviation behavior of the maximum eigenvalue of the sum. Tail bounds for the norm of a sum of random rectangular matrices follow as an immediate corollary. The proof techniques also yield some information about matrix-valued martingales. In other words, this paper provides noncommutative generalizations of the classical bounds associated with the names Azuma, Bennett, Bernstein, Chernoff, Hoeffding, and McDiarmid. The matrix inequalities promise the same diversity of application, ease of use, and strength of conclusion that have made the scalar inequalities so valuable.Comment: Current paper is the version of record. The material on Freedman's inequality has been moved to a separate note; other martingale bounds are described in Caltech ACM Report 2011-0
    corecore