Monthly Archives: January 2013
Announcement: lecture notes on optimization
This semester at Princeton I am going to teach a graduate course on ‘advanced optimization’. As you can see from the title, I’m allowing myself a lot of flexibility, and I will discuss various topics. The syllabus for the course … Continue reading
Posted in Optimization
Comments Off on Announcement: lecture notes on optimization
Proof of the lower bound
Our proof of the lower bound for the clique number of random geometric graphs (see Theorem 1 in the previous post) is a little bit contrived, but it might actually have some value. Our approach can be described as follows. … Continue reading
Posted in Random graphs
Comments Off on Proof of the lower bound
Clique number of random geometric graphs in high dimension
I would like to discuss now another class of random graphs, called random geometric graphs. In general a random geometric graph arises by taking $latex {n}&fg=000000$ i.i.d. random variables in some metric space, and then putting an edge between two of … Continue reading
Posted in Random graphs
Comments Off on Clique number of random geometric graphs in high dimension
An unpleasant calculation?
At the end of my previous post I claimed that proving that $latex \sum_{s=2}^k \frac{{k \choose s} {n-k \choose k-s}}{{n \choose k}} 2^{{s \choose 2}} ,$ tends to $latex 0$ when $latex n$ tends to infinity and $latex k=(2-\epsilon)\log_2(n)$ was … Continue reading
Posted in Random graphs
1 Comment
Welcome! (with random graphs)
Welcome to the ‘I’m a bandit’ blog! If you are curious about this title, you can check my newly published book. However, despite its name, this blog will not be about bandits, but rather about more general problems in optimization, … Continue reading
Posted in Random graphs
3 Comments