Tag Archives: lectures

Interesting probability theory descriptions of games like minesweeper

minesweeperWhat are some interesting probability theory descriptions of games like minesweeper?

The Minesweeper game was (surprisingly) often used as a toy model for studying randomized algorithms and algorithms working in random environments.

A nice introduction to both algorithmic and probabilistic aspects of the Minesweeper can be found in this B. Sc. thesis “Algorithmic Approaches to Playing Minesweeper” by David J. Becerra from Harvard.

Some advanced studies exploring different algorithms and their relation to probabilistic models of the Minesweeper can be seen in the paper “Optimistic Heuristics for MineSweeper” by O. Buffet, Ch.-Sh. Lee, W. Lin, O. Teytaud,

or in the paper by M. Sebag and O. Teytaud “Combining Myopic Optimization and Tree Search: Application to MineSweeper”.

As for games like minesweeper in general, some of them were found to be connected with percolation theory (which is one of the most fashionable branches of probability at the moment), as well as with Markov decision processes, and computational complexity studies.

A good example of research in this direction is a paper “The Minesweeper game: Percolation and Complexity” written by Elchanan Mossel from Microsoft Research.

pc-gamersWhat does all of this beautiful mathematics says to a passionate gamer? Namely, what would be a good algorithm for solving the puzzle, and is the solution computationally hard?

In fact, the minesweeper is one of the classical board puzzles based on algebras of binary variables. Algorithmic solutions to these problems are typically sought with the use of integer linear programming. Unlike simple linear programming, integer programming problems are typically NP-hard. This is true even for binary integer programming where variables can only be 0 or 1 rather than arbitrary integers.

This transforms into the fact that, in its general formulation, the minesweeper is indeed algorithmically NP-complete. However, there is an argument that, if the minesweeper board is already known to be consistent, solving it is only guaranteed to be co-NP-complete, and might be (or not be) NP-complete.

And here is the raining defending Minesweeper world rekord holder Kamil Muranski performs his skillful play. Not sure if his brain is using integer linear programming or not 🙂


Good introduction to general relativity theory for mathematicians

einstein1_7What is a good introduction to general relativity for a mathematician?

A direct and specific Quora question. Definitely demands a direct and specific answer 🙂

If you are a fan of vintage classics, you can go with Hermann Weyl “Space, time, matter”.

It’s an old book, but still very readable as an introduction for mathematicians. And the author is Hermann Weyl, out of all people. And I personally like him even more since he also graduated from the University of Göttingen.

And then, of course, you have the all-time classics L.D. Landau & E.M. Lifshitz “The Classical Theory of Fields” ( Volume 2 of A Course of Theoretical Physics ).

Yes, these are the guys from the Landau-Lifshitz equation. Landau was a Nobel Prize winner (and a student at Göttingen 🙂 ), and both Landau and Evgeny Lifshitz were academicians of the Russian Academy of Sciences and honorary members of many other national scientific societies around the globe.

Their book is rough, tough and mathematical, but provides a great introduction and explains so many important aspects of the theory, while most of modern introductory books just do hand waving and popular lingo speaking for hundreds of pages.

And, as a note of caution: if you aim to understand the general relativity and do not want to read pseudo-scientific fantasy, avoid books by Stephen Hawking.

P.S.  The guy from the picture above is famous not only for his creation of the relativity theory, but also for some of the work that he did at the German Federal Institute of Physical and Technical Affairs, also known as PTB and as the place where I’m happily doing my own  research affairs for the past three years. The world feels so small right now 🙂

How can a Computer Science student achieve the same level of knowledge of Statistics as that of a Statistics graduate?

This is one of those questions that I am getting asked on a regular basis. When I saw this in my Inbox mailed to me by Quora, I knew it’s time to step up and speak out 🙂

In fact, that’s a very easy question that has a straightforward answer. Of course, the answer has to be generic, because there is no way to give a specific answer addressed to an abstract “Computer Science student”.


In order to achieve the same level of knowledge in statistics as a statistics graduate, you have to put in the same total effort to learn statistics as a statistician does. There’s no shortcut.

The same principle is valid the other way around. If a mathematics and statistics graduate like myself would like to learn to code as good or better than CS students, I could only achieve this by spending a lot of time improving my coding skills.

However, in case if you are already familiar with machine learning, then you have already made substantial efforts in the area and you are definitely not a beginner.

If you continue learning and reading about those areas of statistics that are relevant to your work, you will keep getting better and there will be no limit to your improvement.




Slides and photos from the Barcelona Conference on Asymptotic Statistics 2008

The Barcelona Conference on Asymptotic Statistics (BAS2008).

Mikhail Langovoy Barcelona 2008

Mikhail Langovoy among the participants of the Barcelona Conference on Asymptotic Statistics 2008

I was a fresh Ph.D. and greatly enjoyed having a travel grant from the Centre de Recerca Matemàtica. Great memories from both the city of Barcelona and the Bellaterra Campus where we stayed with a number of prominent statisticians.

This is the conference abstract that won me a place among the participants and the travel grant. And these are my talk slides.

I plan to upload further photos and materials related to this Conference to the Media section of my website.

Presentations and Media updates

Just started populating the media section of my website with slides of my presentations, publishable project materials, photos and videos of my lectures and talks. I will be uploading new materials as soon as I would be able to obtain relevant permissions.

As I still regularly use blackboards for my talks and lectures, parts of some presentations did not make into slides or other digital media. I also gave a number of talks that were blackboard-only, very old school of me.

Bear in mind that I also enjoy cracking a joke or two during most of the presentations. Of course, these jokes and stories are all witty, appropriate and on topic 🙂 , but they do not make it into the slides. Therefore, slides can appear a little dry and they can never fully capture a presentation or a lecture.

A video + the slides combination works much better, but only some of the talks were professionally recorded on camera, and not all of these videos could be posted on the web (not because of age restrictions, of course 🙂 ; most of the videos are copyrighted or contain discussions of sensitive data).

Therefore, the best way to enjoy these slides is still to attend one of my talks in person. Now I can sleep well, knowing that the newest technology is still unable to outperform me in some of my professional activities 🙂

Meanwhile, slides, pictures and videos will be getting uploaded to the Media area.