Testing graphs against an unknown distribution

@article{Gishboliner2019TestingGA,
  title={Testing graphs against an unknown distribution},
  author={Lior Gishboliner and A. Shapira},
  journal={Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing},
  year={2019}
}
  • Lior Gishboliner, A. Shapira
  • Published 2019
  • Computer Science, Mathematics
  • Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
The classical model of graph property testing, introduced by Goldreich, Goldwasser and Ron, assumes that the algorithm can obtain uniformly distributed vertices from the input graph. Goldreich introduced a more general model, called the Vertex-Distribution-Free model (or VDF for short) in which the testing algorithm obtains vertices drawn from an arbitrary and unknown distribution. The main motivation for this investigation is that it can allow one to give different weight/importance to… Expand
2 Citations
Testing graphs in vertex-distribution-free models
  • Oded Goldreich
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2018
  • 9
  • Highly Influenced
  • PDF
Average Gromov hyperbolicity and the Parisi ansatz
  • 3
  • PDF

References

SHOWING 1-3 OF 3 REFERENCES
Testing properties of graphs and functions
  • 82
  • Highly Influential
  • PDF
Property testing and its connection to learning and approximation
  • 986
  • Highly Influential
  • PDF
Bounds for graph regularity and removal lemmas
  • 92
  • Highly Influential
  • PDF