6
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Lipschitz embeddings of random sequences

      Preprint
      ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We develop a new multi-scale framework flexible enough to solve a number of problems involving embedding random sequences into random sequences. Grimmett, Liggett and Richthammer asked whether there exists an increasing M-Lipschitz embedding from one i.i.d. Bernoulli sequences into an independent copy with positive probability. We give a positive answer for large enough M. A closely related problem is to show that two independent Poisson processes on R are roughly isometric (or quasi-isometric). Our approach also applies in this case answering a conjecture of Szegedy and of Peled. Our theorem also gives a new proof to Winkler's compatible sequences problem.

          Related collections

          Most cited references3

          • Record: found
          • Abstract: not found
          • Article: not found

          Almost All Words Are Seen In Critical Site Percolation On The Triangular Lattice

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Percolation of arbitrary words in one dimension

              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              On rough isometries of Poisson processes on the line

              Ron Peled (2007)
              Intuitively, two metric spaces are rough isometric (or quasi-isometric) if their large-scale metric structure is the same, ignoring fine details. This concept has proven fundamental in the geometric study of groups. Ab\'{e}rt, and later Szegedy and Benjamini, have posed several probabilistic questions concerning this concept. In this article, we consider one of the simplest of these: are two independent Poisson point processes on the line rough isometric almost surely? Szegedy conjectured that the answer is positive. Benjamini proposed to consider a quantitative version which roughly states the following: given two independent percolations on \(\mathbb {N}\), for which constants are the first \(n\) points of the first percolation rough isometric to an initial segment of the second, with the first point mapping to the first point and with probability uniformly bounded from below? We prove that the original question is equivalent to proving that absolute constants are possible in this quantitative version. We then make some progress toward the conjecture by showing that constants of order \(\sqrt{\log n}\) suffice in the quantitative version. This is the first result to improve upon the trivial construction which has constants of order \(\log n\). Furthermore, the rough isometry we construct is (weakly) monotone and we include a discussion of monotone rough isometries, their properties and an interesting lattice structure inherent in them.
                Bookmark

                Author and article information

                Journal
                13 April 2012
                2012-04-19
                Article
                1204.2931
                d01d9045-ea20-45e2-b3c0-fd5c4b1cd377

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                46 pages, 3 figures added
                math.PR math.CO

                Comments

                Comment on this article