# The Library

### Testing periodicity

Tools

Lachish, Oded and Newman, Ilan.
(2011)
*Testing periodicity.*
Algorithmica, Volume 60
(Number 2).
pp. 401-420.
ISSN 0178-4617

**Full text not available from this repository.**

Official URL: http://dx.doi.org/10.1007/s00453-009-9351-y

## Abstract

We study the string-property of being periodic and having periodicity smaller than a given bound. Let I pound be a fixed alphabet and let p,n be integers such that P <= n/2 . A length-n string over I pound, alpha=(alpha (1),aEuro broken vertical bar,alpha (n) ), has the property Period(p) if for every i,ja{1,aEuro broken vertical bar,n}, alpha (i) =alpha (j) whenever ia parts per thousand j (mod p). For an integer parameter the property Period(a parts per thousand currency signg) is the property of all strings that are in Period(p) for some pa parts per thousand currency signg. The property is also called Periodicity. An epsilon-test for a property P of length-n strings is a randomized algorithm that for an input alpha distinguishes between the case that alpha is in P and the case where one needs to change at least an epsilon-fraction of the letters of alpha to get a string in P. The query complexity of the epsilon-test is the number of letter queries it makes for the worst case input string of length n. We study the query complexity of epsilon-tests for Period(a parts per thousand currency signg) as a function of the parameter g, when g varies from 1 to , while ignoring the exact dependence on the proximity parameter epsilon. We show that there exists an exponential phase transition in the query complexity around g=log n. That is, for every delta > 0 and ga parts per thousand yen(log n)(1+delta) , every two-sided error, adaptive epsilon-test for Period(a parts per thousand currency signg) has a query complexity that is polynomial in g. On the other hand, for , there exists a one-sided error, non-adaptive epsilon-test for Period(a parts per thousand currency signg), whose query complexity is poly-logarithmic in g. We also prove that the asymptotic query complexity of one-sided error non-adaptive epsilon-tests for Periodicity is , ignoring the dependence on epsilon.

Item Type: | Journal Article |
---|---|

Subjects: | Q Science > QA Mathematics Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software |

Divisions: | Faculty of Science > Computer Science |

Library of Congress Subject Headings (LCSH): | Periodic functions, Algorithms, Computational complexity |

Journal or Publication Title: | Algorithmica |

Publisher: | Springer Verlag |

ISSN: | 0178-4617 |

Date: | June 2011 |

Volume: | Volume 60 |

Number: | Number 2 |

Page Range: | pp. 401-420 |

Identification Number: | 10.1007/s00453-009-9351-y |

Status: | Peer Reviewed |

Publication Status: | Published |

Access rights to Published version: | Restricted or Subscription Access |

Funder: | Israel Science Foundation (ISF) |

Grant number: | 1011/06 (ISF) |

References: | 1. Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Simple construction of almost k-wise independent random variables. Random Struct. Algorithms 3(3), 289–304 (1992) and Addendum at same journal 4(1) 119–120 (1993) 2. Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley, New York (2000) 3. Ergun, F., Muthukrishnan, S., Sahinalp, C.: Sub-linear methods for detecting periodic trends in data streams. In: LATIN 2004, Proc. of the 6th Latin American Symposium on Theoretical Informatics, pp. 16–28 (2004) 4. Fischer, E.: The art of uninformed decisions: A primer to property testing. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science: The Challenge of the New Century, vol. I, pp. 229–264. World Scientific, Singapore (2004) 5. Gilbert, A.C., Guha, S., Indyk, P., Muthukrishnan, S., Strauss, M.: Near-optimal sparse Fourier representations via sampling. In: STOC 2002, Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 152–161 (2002) 6. Goldwasser, S., Goldreich, O., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45, 653–750 (1998) 7. Hadamard, J.: Sur la distribution des zéros de la fonction ζ(s) et ses conséquences arithmétiques. Bull. Soc. Math. France 24, 199–220 (1896) 8. Indyk, P., Koudas, N., Muthukrishnan, S.: Identifying representative trends in massive time series data sets using sketches. In: VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases, September 10–14, 2000, Cairo, Egypt, pp. 363–372. Morgan Kaufmann, San Mateo (2000) 9. Krauthgamer, R., Sasson, O.: Property testing of data dimensionality. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 18–27 (2003) 10. Naor, J., Naor, M.: Small-bias probability spaces: efficient construction and applications. SIAM J. Comput. 22(4), 838–856 (1993) 11. Newman, D.J.: Simple analytic proof of the prime number theorem. Am. Math. Mon. 87, 693–696 (1980) 12. Poussin, V.: Recherces analytiques sur la théorie des nombres premiers. Ann. Soc. Sci. Brux. (1897) 13. Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25, 252–271 (1996) 14. Ron, D.: Property testing (a tutorial). In: Handbook of Randomized Computing, pp. 597–649. Kluwer Academic, Dordrecht (2001) 15. Yao, A.C.: Probabilistic computations: Towards a unified measure of complexity. In: FOCS ’17: Proceedings of the 17th Annual Symposium on Foundations of Computer Science, pp. 222–227 (1977) |

URI: | http://wrap.warwick.ac.uk/id/eprint/41419 |

Data sourced from Thomson Reuters' Web of Knowledge

### Actions (login required)

View Item |