A graph is $r$-regular if all its vertices have the same degree $r$. A random $r$-regular graph with $n$ vertices is a graph sampled uniformly at random from the set of all $r$-regular graphs on $n$ vertices.
Recent years have seen significant progress on the algorithmic aspects of the Lovasz Local Lemma: e.g., one can now handle super-polynomially many events that need to be avoided.
We consider the non-cooperative choice of arrival times by individual users, or customers, to a service system that opens at a given time, and where users queue up and are served in order of arrival.
This talk concerns the basic facts of convex optimization and variational inequalities. We will discuss about subgradients and provide important examples.
In this talk we essentially discuss a work on variational inequalities by Yuri Nestrov where the so called prox-functions play a major role. We discuss the approach in details giving complexity bounds and related results.
In this talk, we discuss three problems. The first is on an asynchronous multi-antenna wireless communication system and the later two are on collaborative estimation.
