Corpus ID: 201666529

Breadth-first search on a Ramanujan graph

@article{Bhm2019BreadthfirstSO,
  title={Breadth-first search on a Ramanujan graph},
  author={Janko B{\"o}hm and Michael Joswig and Lars Kastner and Andrew Newman},
  journal={ArXiv},
  year={2019},
  volume={abs/1908.09575}
}
  • Janko Böhm, Michael Joswig, +1 author Andrew Newman
  • Published in ArXiv 2019
  • Mathematics, Computer Science
  • The behavior of the randomized breadth-first search algorithm is analyzed on arbitrary regular and non-regular graphs. Our argument is based on the expander mixing lemma, which entails that the results are strongest for Ramanujan graphs, which asymptotically maximize the spectral gap. We compare our theoretical results with computational experiments on flip graphs of point configurations. The latter is relevant for enumerating triangulations. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 13 REFERENCES

    and Komei Fukuda . “ Reverse search for enumeration . ” English

    • David Avis
    • The probabilistic method . Fourth . Wiley Series in Discrete Mathematics and Optimization
    • 2016

    The Flip-Graph of the 4-Dimensional Cube is Connected

    De Loera , Jörg Rambau , and Francisco Santos . Triangulations . Vol . 25 . Algorithms and Computation in Mathematics . Structures for algorithms and applications

    • Fan Chung, Ron Graham, A. Jesús
    • 2010

    De Loera , Jörg Rambau , and Francisco Santos . Triangulations . Vol . 25 . Algorithms and Computation in Mathematics . Structures for algorithms and applications

    • Fan Chung, Ron Graham, A. Jesús
    • 2010