Abstract Objectives/Hypothesis: To evaluate the ability of the Ad28.gfap.atoh1 to promote hair cell regeneration and hearing recovery in cochlea injured with kanamycin and furosemide. Summary: Timea's current home is located at Lawrence, KS. Personal details about Timea include: political affiliation is unknown; ethnicity is Caucasian; and religious views are listed as Christian. Dc.contributor.author: Houdre, Christian: dc.contributor.author: Talata, Zsolt: dc.date.accessioned: 2015-03-26T17:08:49Z: dc.date.available: 2015-03-26T17:08:49Z. Project Euclid - mathematics and statistics online. The rate of convergence of the distribution of the length of the longest increasing subsequence, toward the maximal eigenvalue of certain matrix ensembles, is investigated.
Zsolt Talata received the M.S. degree with excellent qualification in Electrical Engineering from the Budapest University of Technology and Economics, Hungary, in 2000. He was a Ph.D. scholar of the Rényi Institute of Mathematics of the Hungarian Academy of Sciences, and received the Ph.D. degree summa cum laude in Applied Mathematics from the Budapest University of Technology and Economics in 2005. His thesis advisor was Imre Csiszár. He held a visiting appointment at Université Paris-Sud, France, in 2005. He was a Visiting Assistant Professor at the School of Mathematics of the Georgia Institute of Technology, USA, between 2005 and 2007. From 2007 to 2015, he was an Assistant Professor at the Department of Mathematics of The University of Kansas. He has been an Associate Professor of Mathematics at The University of Kansas since 2015.
Zsolt Talata's research area is mathematical statistics, overlapping with information theory and probability theory. His research has been supported by the Division of Mathematical Sciences of the U.S. National Science Foundation and the Mathematical Sciences Division of the U.S. Army Research Office. He has been inducted to Phi Beta Delta, an Honor Society for International Scholars, and has been the representative of Mu Sigma Rho, the National Honorary Society for Statistics, at The University of Kansas. He received the 'Thanks For Being a Great Teacher' recognition from the Georgia Institute of Technology. He has chaired sessions at the Joint Statistical Meetings of the American Statistical Association, at the International Symposium on Mathematical Theory of Networks and Systems and at the European Meeting of Statisticians of the Bernoulli Society for Mathematical Statistics and Probability.
For further information, choose from the menu on the top.

Students of current courses should visit Blackboard for syllabi, announcements, assignments and other course materials. Days and times of the office hours are included in the syllabus.
All prospective graduate students need to be admitted to the graduate program. Information on the application procedure can be found here.
- Volume 22, Number 6 (2012), 2539-2559.
On the rate of approximation in finite-alphabet longest increasing subsequence problems

Christian Houdré and Zsolt Talata
More by Christian Houdré
Search this author in:
More by Zsolt Talata
Zsolt Talata Ku
Search this author in:
Abstract
The rate of convergence of the distribution of the length of the longest increasing subsequence, toward the maximal eigenvalue of certain matrix ensembles, is investigated. For finite-alphabet uniform and nonuniform i.i.d. sources, a rate of $log n/sqrt{n}$ is obtained. The uniform binary case is further explored, and an improved $1/sqrt{n}$ rate obtained.
Article information
Source
Ann. Appl. Probab., Volume 22, Number 6 (2012), 2539-2559.
Dates
First available in Project Euclid: 23 November 2012
Permanent link to this document
https://projecteuclid.org/euclid.aoap/1353695961
Digital Object Identifier
doi:10.1214/12-AAP853
Mathematical Reviews number (MathSciNet)
MR3024976
Zentralblatt MATH identifier
1261.60012
Subjects
Primary: 60C05: Combinatorial probability60G15: Gaussian processes60G17: Sample path properties62E17: Approximations to distributions (nonasymptotic)62E20: Asymptotic distribution theory
Keywords
Longest increasing subsequenceBrownian functionalapproximationrate of convergence
Citation
Houdré, Christian; Talata, Zsolt. On the rate of approximation in finite-alphabet longest increasing subsequence problems. Ann. Appl. Probab. 22 (2012), no. 6, 2539--2559. doi:10.1214/12-AAP853. https://projecteuclid.org/euclid.aoap/1353695961
Format:
Delivery Method:

Zsolt Talata Na
DownloadEmailReferences
Zsolt Talata Sa
- [1] Baryshnikov, Y. (2001). GUEs and queues. Probab. Theory Related Fields119 256–274.Mathematical Reviews (MathSciNet): MR1818248
Zentralblatt MATH: 0980.60042
Digital Object Identifier: doi:10.1007/PL00008760 - [2] Breton, J.-C. and Houdré, C. (2010). Asymptotics for random Young diagrams when the word length and alphabet size simultaneously grow to infinity. Bernoulli16 471–492.Mathematical Reviews (MathSciNet): MR2668911
Digital Object Identifier: doi:10.3150/09-BEJ218
Project Euclid: euclid.bj/1274821080 - [3] Etienne, M. P. and Vallois, P. (2004). Approximation of the distribution of the supremum of a centered random walk. Application to the local score. Methodol. Comput. Appl. Probab.6 255–275.Mathematical Reviews (MathSciNet): MR2073541
Zentralblatt MATH: 1045.60021
Digital Object Identifier: doi:10.1023/B:MCAP.0000026559.87023.ec - [4] Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd ed. Wiley, New York.
- [5] Glynn, P. W. and Whitt, W. (1991). Departures from many queues in series. Ann. Appl. Probab.1 546–572.
- [6] Gravner, J., Tracy, C. A. and Widom, H. (2001). Limit theorems for height fluctuations in a class of discrete space and time growth models. J. Stat. Phys.102 1085–1132.Mathematical Reviews (MathSciNet): MR1830441
Zentralblatt MATH: 0989.82030
Digital Object Identifier: doi:10.1023/A:1004879725949 - [7] Houdré, C. and Litherland, T. On the limiting shape of young diagrams associated with Markov random words. Preprint. Available at arXiv:1110.4570.
- [8] Houdré, C. and Litherland, T. J. (2009). On the longest increasing subsequence for finite and countable alphabets. In High Dimensional Probability V: The Luminy Volume. Inst. Math. Stat. Collect.5 185–212. IMS, Beachwood, OH.Mathematical Reviews (MathSciNet): MR2797948
- [9] Its, A. R., Tracy, C. A. and Widom, H. (2001). Random words, Toeplitz determinants, and integrable systems. I. In Random Matrix Models and Their Applications. Math. Sci. Res. Inst. Publ.40 245–258. Cambridge Univ. Press, Cambridge.Mathematical Reviews (MathSciNet): MR1842789
Zentralblatt MATH: 0986.68104 - [10] Its, A. R., Tracy, C. A. and Widom, H. (2001). Random words, Toeplitz determinants and integrable systems. II. Phys. D152/153 199–224.Mathematical Reviews (MathSciNet): MR1837910
Digital Object Identifier: doi:10.1016/S0167-2789(01)00171-3 - [11] Johansson, K. (2001). Discrete orthogonal polynomial ensembles and the Plancherel measure. Ann. of Math. (2) 153 259–296.Mathematical Reviews (MathSciNet): MR1826414
Zentralblatt MATH: 0984.15020
Digital Object Identifier: doi:10.2307/2661375 - [12] Komlós, J., Major, P. and Tusnády, G. (1975). An approximation of partial sums of independent RV’s and the sample DF. I. Z. Wahrsch. Verw. Gebiete32 111–131.Mathematical Reviews (MathSciNet): MR375412
Digital Object Identifier: doi:10.1007/BF00533093 - [13] Komlós, J., Major, P. and Tusnády, G. (1976). An approximation of partial sums of independent RV’s, and the sample DF. II. Z. Wahrsch. Verw. Gebiete34 33–58.Mathematical Reviews (MathSciNet): MR402883
Digital Object Identifier: doi:10.1007/BF00532688 - [14] Lifshits, M. (2000). Lecture notes on strong approximation. Pub. IRMA Lille53 No. 13, 25 pp.
- [15] Mehta, M. L. (2004). Random Matrices, 3rd ed. Pure and Applied Mathematics (Amsterdam) 142. Elsevier/Academic Press, Amsterdam.
- [16] Sakhanenko, A. I. (1984). Rate of convergence in the invariance principle for variables with exponential moments that are not identically distributed. In Limit Theorems for Sums of Random Variables. Trudy Inst. Mat.3 4–49. “Nauka” Sibirsk. Otdel., Novosibirsk.Mathematical Reviews (MathSciNet): MR749757
- [17] Tracy, C. A. and Widom, H. (2001). On the distributions of the lengths of the longest monotone subsequences in random words. Probab. Theory Related Fields119 350–380.Mathematical Reviews (MathSciNet): MR1821139
Zentralblatt MATH: 0989.60012
Digital Object Identifier: doi:10.1007/PL00008763 - [18] van Beek, P. (1972). An application of Fourier methods to the problem of sharpening the Berry–Esseen inequality. Z. Wahrsch. Verw. Gebiete23 187–196.Mathematical Reviews (MathSciNet): MR329000
Digital Object Identifier: doi:10.1007/BF00536558
