\indent probabilistic graphical models or markov random fields provide a graph-based framework for capturing conditional independence relationships between random variables of a high-dimensional multivariate distribution. this interdisciplinary topic has found widespread application in a variety of areas including image processing, bioinformatics, combinatorial optimization and machine learning. estimating the graph structure of the model from samples drawn from it forms an important task, since the structure reveals important relationships between the variables. however, structure estimation has several challenges: in general graphical models, it is np-hard; the models are also typically in the high-dimensional regime where the number of variables is much larger than the number of samples obtained. i will address these challenges in the talk. \indent i will talk about our recent results on learning lsing models on sparse erdos-renyi random graphs. we establish achievability of consistent structure learning when the model is in the so-called uniqueness regime, where there is a decay of long-range correlations. the algorithm is based on a set of conditional mutual information tests and is shown to be consistent for structure estimation with almost order-optimal sample complexity. a simpler algorithm based on correlation thresholding is also consistent, but under more stringent conditions. thus, we establish that correlation decay is a sufficient condition for consistent structure learning in random graphs. we also prove a converse result on the number of samples required by any algorithm to consistently recover the random graph structure. i will also provide an overview on our recent results on structure learning in tree models, and more generally, in latent tree models with hidden variables.