Blog
About

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

      Optimal Cheeger cuts and bisections of random geometric graphs

      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

          Let \(d \geq 2\). The Cheeger constant of a graph is the minimum surface-to-volume ratio of all subsets of the vertex set with relative volume at most 1/2. There are several ways to define surface and volume here: the simplest method is to count boundary edges (for the surface) and vertices (for the volume). We show that for a geometric (possibly weighted) graph on \(n\) random points in a \(d\)-dimensional domain with Lipschitz boundary and with distance parameter decaying more slowly (as a function of \(n\)) than the connectivity threshold, the Cheeger constant (under several possible definitions of surface and volume), also known as conductance, suitably rescaled, converges for large \(n\) to an analogous Cheeger-type constant of the domain. Previously, Garc\'ia Trillos {\em et al.} had shown this for \(d \geq 3\) but had required an extra condition on the distance parameter when \(d=2\).

          Related collections

          Most cited references 9

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

          A Tutorial on Spectral Clustering

          In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algorithms such as the k-means algorithm. On the first glance spectral clustering appears slightly mysterious, and it is not obvious to see why it works at all and what it really does. The goal of this tutorial is to give some intuition on those questions. We describe different graph Laplacians and their basic properties, present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches. Advantages and disadvantages of the different spectral clustering algorithms are discussed.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            The longest edge of the random minimal spanning tree

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

              Tight bounds for minimax grid matching with applications to the average case analysis of algorithms

               T Leighton,  P. Shor (1989)
                Bookmark

                Author and article information

                Journal
                22 May 2018
                Article
                1805.08669

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

                Custom metadata
                05C80 (Primary) 60D05, 62H30 (Secondary)
                33 pages
                math.PR

                Probability

                Comments

                Comment on this article