Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Amir Sarid"'
Autor:
Amir Sarid
Publikováno v:
Random Structures & Algorithms.
We bound the second eigenvalue of random $d$-regular graphs, for a wide range of degrees $d$, using a novel approach based on Fourier analysis. Let $G_{n, d}$ be a uniform random $d$-regular graph on $n$ vertices, and let $\lambda (G_{n, d})$ be its
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22aade92d8a707bc6e9856e3bd1a3017
https://doi.org/10.1002/rsa.21150
https://doi.org/10.1002/rsa.21150
Publikováno v:
Journal of Combinatorial Theory, Series A. 150:248-266
Consider the following strong Ramsey game. Two players take turns in claiming a previously unclaimed edge of the complete graph on n vertices until all edges have been claimed. The first player to build a copy of K q ( q ≥ 3 ) is declared the winne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::891a2d60656e0ee145127167a43d2f91
https://doi.org/10.1016/j.jcta.2017.03.008
https://doi.org/10.1016/j.jcta.2017.03.008
Publikováno v:
computational complexity. 26:393-420
We show that approximating the second eigenvalue of stochastic operators is BPL-complete, thus giving a natural problem complete for this class. We also show that approximating any eigenvalue of a stochastic and Hermitian operator with constant accur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d39c7d33ba4e53a90cc7fcc3b3e1566
https://doi.org/10.1007/s00037-016-0150-y
https://doi.org/10.1007/s00037-016-0150-y
Autor:
Sarid, Amir
Publikováno v:
Random Structures & Algorithms; Sep2023, Vol. 63 Issue 2, p557-587, 31p
Publikováno v:
Computational Complexity; Jun2017, Vol. 26 Issue 2, p393-420, 28p