Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Bhatnagar, Nayantara"'
Autor:
Bhatnagar, Nayantara
The Markov Chain Monte Carlo (MCMC) method has been widely used in practice since the 1950's in areas such as biology, statistics, and physics. However, it is only in the last few decades that powerful techniques for obtaining rigorous performance gu
Externí odkaz:
http://hdl.handle.net/1853/16323
In this paper we study the mixing time of a biased transpositions shuffle on a set of $N$ cards with $N/2$ cards of two types. For a parameter $0
Externí odkaz:
http://arxiv.org/abs/1709.03477
We study the lengths of monotone subsequences for permutations drawn from the Mallows measure. The Mallows measure was introduced by Mallows in connection with ranking problems in statistics. Under this measure, the probability of a permutation $\pi$
Externí odkaz:
http://arxiv.org/abs/1601.02003
Autor:
Bhatnagar, Nayantara, Randall, Dana
Simulated and parallel tempering are families of Markov Chain Monte Carlo algorithms where a temperature parameter is varied during the simulation to overcome bottlenecks to convergence due to multimodality. In this work we introduce and analyze the
Externí odkaz:
http://arxiv.org/abs/1508.04521
A key insight from statistical physics about spin systems on random graphs is the central role played by Gibbs measures on trees. We determine the local weak limit of the hardcore model on random regular graphs asymptotically until just below its con
Externí odkaz:
http://arxiv.org/abs/1405.6160
Autor:
Bhatnagar, Nayantara, Peled, Ron
Publikováno v:
Probability Theory and Related Fields 161, no. 3-4 (2015): 719-780
We study the length of the longest increasing and longest decreasing subsequences of random permutations drawn from the Mallows measure. Under this measure, the probability of a permutation pi in S_n is proportional to q^{inv(pi)} where q is a real p
Externí odkaz:
http://arxiv.org/abs/1306.3674
Autor:
Bhatnagar, Nayantara, Linial, Nathan
Publikováno v:
Journal of Combinatorial Theory, Series A, 119(1):63-82, 2012
We view the RSK correspondence as associating to each permutation $\pi \in S_n$ a Young diagram $\lambda=\lambda(\pi)$, i.e. a partition of $n$. Suppose now that $\pi$ is left-multiplied by $t$ transpositions, what is the largest number of cells in $
Externí odkaz:
http://arxiv.org/abs/1012.1819
An important problem in the implementation of Markov Chain Monte Carlo algorithms is to determine the convergence time, or the number of iterations before the chain is close to stationarity. For many Markov chains used in practice this time is not kn
Externí odkaz:
http://arxiv.org/abs/1007.0089
Publikováno v:
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
In this paper we consider the reconstruction problem on the tree for the hardcore model. We determine new bounds for the non-reconstruction regime on the k-regular tree showing non-reconstruction when lambda < (ln 2-o(1))ln^2(k)/(2 lnln(k)) improving
Externí odkaz:
http://arxiv.org/abs/1004.3531
Autor:
Bhatnagar, Nayantara, Maneva, Elitza
Publikováno v:
SIAM J. on Discrete Math, 25(2):854-871, 2011
For a tree Markov random field non-reconstruction is said to hold if as the depth of the tree goes to infinity the information that a typical configuration at the leaves gives about the value at the root goes to zero. The distribution of the measure
Externí odkaz:
http://arxiv.org/abs/0903.4812