# Sekhar Tatikonda

## Courses

### STAT 667/ENAS503/AMTH605 Probabilistic Networks, Algorithms, and Applications

This course examines probabilistic and computational methods for the statistical modeling of complex data. The emphasis is on the unifying framework provided by graphical models, a formalism that merges aspects of graph theory and probability theory. Graphical models: Markov random fields, Bayesian networks, and factor graphs. Algorithms: filtering, smoothing, belief-propagation, sum-product, and junction tree. Variational techniques: mean-field and convex relaxations. Markov processes on graphs: MCMC, factored HMMs, and Glauber dynamics. Some statistical physics techniques: cavity and replica methods. Applications to error-correcting codes, computer vision, bio-informatics, and combinatorial optimization.

### STAT 699ab Research Seminar in Probability

Continuation of the Yale Probability Group Seminar. Student and faculty explanations of current research in areas such as random graph theory, spectral graph theory, Markov chains on graphs, and the objective method.

Credit only with the explicit permission of the seminar organizers.

### STAT 699ab Research Seminar in Probability

Continuation of the Yale Probability Group Seminar. Student and faculty explanations of current research in areas such as random graph theory, spectral graph theory, Markov chains on graphs, and the objective method.

Credit only with the explicit permission of the seminar organizers.