Testing Convexity and Acyclicity, and New Constructions for Dense Graph Embeddings
Property testing, especially that of geometric and graph properties, is an ongoing area of research. In this thesis, we present a result from each of the two areas. For the problem of convexity testing in high dimensions, we give nearly matching upper and lower bounds for the sample complexity of al...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://doi.org/10.7916/d8-fs41-c774 |