Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2203.07581 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910690464235520 |
|---|---|
| author | Fekete, Panna Tímea Kunszenti-Kovács, Dávid |
| author_facet | Fekete, Panna Tímea Kunszenti-Kovács, Dávid |
| contents | Generalizing the bounded kernel results of Borgs, Chayes, Lovász, Sós and Vesztergombi (2008), we prove two Sampling Lemmas for unbounded kernels with respect to the cut norm. On the one hand, we show that given a (symmetric) kernel $U\in L^p([0,1]^2)$ for some $3<p<\infty$, the cut norm of a random $k$-sample of $U$ is with high probability within $O(k^{-\frac14+\frac{1}{4p}})$ of the cut norm of $U$. The cut norm of the sample has a strong bias to being larger than the original, allowing us to actually obtain a stronger high probability bound of order $O(k^{-\frac 12+\frac1p+\varepsilon})$ for how much smaller it can be (for any $p>2$ here). These results are then partially extended to the case of vector valued kernels. On the other hand, we show that with high probability, the $k$-samples are also close to $U$ in the cut metric, albeit with a weaker bound of order $O((\ln k)^{-\frac12+\frac1{2p}})$ (for any appropriate $p>2$). As a corollary, we obtain that whenever $U\in L^p$ with $p>4$, the $k$-samples converge almost surely to $U$ in the cut metric as $k\to\infty$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2203_07581 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | The cut norm and Sampling Lemmas for unbounded kernels Fekete, Panna Tímea Kunszenti-Kovács, Dávid Probability Combinatorics Functional Analysis Primary: 60F15, 41A17, 05C80, Secondary: 60B20 Generalizing the bounded kernel results of Borgs, Chayes, Lovász, Sós and Vesztergombi (2008), we prove two Sampling Lemmas for unbounded kernels with respect to the cut norm. On the one hand, we show that given a (symmetric) kernel $U\in L^p([0,1]^2)$ for some $3<p<\infty$, the cut norm of a random $k$-sample of $U$ is with high probability within $O(k^{-\frac14+\frac{1}{4p}})$ of the cut norm of $U$. The cut norm of the sample has a strong bias to being larger than the original, allowing us to actually obtain a stronger high probability bound of order $O(k^{-\frac 12+\frac1p+\varepsilon})$ for how much smaller it can be (for any $p>2$ here). These results are then partially extended to the case of vector valued kernels. On the other hand, we show that with high probability, the $k$-samples are also close to $U$ in the cut metric, albeit with a weaker bound of order $O((\ln k)^{-\frac12+\frac1{2p}})$ (for any appropriate $p>2$). As a corollary, we obtain that whenever $U\in L^p$ with $p>4$, the $k$-samples converge almost surely to $U$ in the cut metric as $k\to\infty$. |
| title | The cut norm and Sampling Lemmas for unbounded kernels |
| topic | Probability Combinatorics Functional Analysis Primary: 60F15, 41A17, 05C80, Secondary: 60B20 |
| url | https://arxiv.org/abs/2203.07581 |