Nayantara Bhatnagar


nayantara.bhatnagar @ gmail.com
naya @ math.udel.edu 


Mail: Ewing Hall,
Mathematical Sciences,
University of Delaware,
Newark, DE, 19716.

Research Interests: Probability and combinatorics, often motivated by problems from statistical physics, statistics and theoretical computer science. In particular, mixing times of Markov chains, random walks, random permutations and Gibbs measures on trees and random graphs.

Aug 2012 - Present: Assistant Professor at the Department of Mathematical Sciences, University of Delaware.
Feb 2011 - Jul 2012 : Adjunct Assistant Professor at the Department of Statistics, UC Berkeley.
2009 - Jan 2011: Postdoctoral fellow in the Department of Computer Science and Engineering, Hebrew University of Jerusalem.
2007 - 09 : Visiting Neyman Assistant Professor at the Department of Statistics, UC Berkeley.
2007: PhD in Algorithms, Combinatorics and Optimization, Georgia Tech. My advisors were  Dana Randall and Eric Vigoda.


Probability Seminar Calendar



Papers:


[1] N. Bhatnagar, A. Sly, and P. Tetali. Decay of Correlations for the Hardcore Model on the d-regular Random Graph. 2014. on Arxiv.

[2] N. Bhatnagar and R. Peled. Lengths of Monotone Subsequences in a Mallows Permutation. 2013. To appear in Probability Theory and Related Fields.  on Arxiv.

[3] N. Bhatnagar, N. Crawford, E. Mossel, and A. Sen. Scaling Limits for Width 2 Partially Ordered Sets: the Incomparability Window. Order, 30(1):289-311, 2013. on Arxiv.

[4] N. Bhatnagar and N. Linial. On the Lipschitz constant of the RSK correspondence. Journal of Combinatorial Theory, Series A, 119(1):63-82, 2012. on Arxiv.

[5] N. Bhatnagar and E. Maneva. A Computational Method for Bounding the Probability of Reconstruction on Trees. SIAM J. on Discrete Math, Special Issue for Message Passing Algorithms, 25(2):854-871, 2011. on Arxiv.

[6] N. Bhatnagar, J. Vera, E. Vigoda, and D. Weitz. Reconstruction for Colorings on Trees. SIAM J. on Discrete Math, Special Issue for Message Passing Algorithms, 25(2):809-826, 2011. on Arxiv.

[7] N. Bhatnagar, A. Bogdanov, and E. Mossel. The Computational Complexity of Estimating Convergence Time. In Proceedings of the 15th International Conference on Randomization and Computation (RANDOM), 2011. on Arxiv.

[8] N. Bhatnagar, A. Sly, and P. Tetali. Reconstruction Threshold for the Hardcore Model. In Proceedings of the 14th International Conference on Randomization and Computation (RANDOM), volume 6302 of Lecture Notes in Computer Science, pages 434-447. Springer, 2010. on Arxiv.

[9] I. Bezáková, N. Bhatnagar, and D. Randall. On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries. In 15th Annual International Conference on Computing and Combinatorics (COCOON), volume 5609 of Lecture Notes in Computer Science. Springer, 2009. [ .pdf ]

[10] N. Bhatnagar, S. Greenberg, and D. Randall. Sampling stable marriages: why spouse-swapping won't work. In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1223-1232, 2008. [ .pdf ]

[11] N. Bhatnagar, D. Randall, V. Vazirani, and E. Vigoda. Random Bichromatic Matchings. Algorithmica, 50(4):418-445, 2008. Extended abstract appears in Proceedings of the 7th International Latin American Symposium on Theoretical Informatics (LATIN), LNCS Volume 3887, pp. 190-201, 2006. [ .ps | .pdf ]

[12] N. Bhatnagar, P. Caputo, P. Tetali, and E. Vigoda. Analysis of Top-Swap Shuffling for Genome Rearrangements. Annals of Applied Probability, 17(4):1424-1445, 2007. [ .ps | .pdf ]

[13] I. Bezáková, N. Bhatnagar, and E. Vigoda. Sampling binary contingency tables with a greedy start. Random Structures and Algorithms, 30:168-205, 2007. Extended abstract appears in Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 168-205, 2006. [ .ps | .pdf ]

[14] N. Bhatnagar, S. Greenberg, and D. Randall. The Effect of Boundary Conditions on Mixing Rates of Markov Chains. In Proceedings of the 10th International Conference on Randomization and Computation (RANDOM), volume 4110 of Lecture Notes in Computer Science, pages 280-291. Springer, 2006. [ .ps | .pdf ]

[15] N. Bhatnagar and D. Randall. Torpid Mixing of Simulated Tempering on the Potts Model (extended abstract). In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 278-287, 2004. [ .ps | .pdf ]

[16] N. Bhatnagar. Annealing and Tempering for Sampling and Counting. PhD thesis, Georgia Institute of Technology, 2007. [ .pdf ]  





Generated by bibtex2html 1.95.