# Past Events

# Uniform Geometric and Subgeometric Ergodicity for Multiclass Many Server Queues in Heavy Traffic

## Speaker:

## Organisers:

## Time:

## Venue:

**Abstract:** We study ergodic properties of multiclass multi-server queues, which are uniform over scheduling policies, as well as the size n of the system. The system is heavily loaded in the Halfin-Whitt regime, and the scheduling

# On the Structure and Lower Bounds for Multilinear Branching Programs

## Speaker:

## Organisers:

## Time:

## Venue:

**Abstract: **Polynomials are the most fundamental mathematical objects in algebra and it is compelling to understand the complexity of computing polynomials. That is, given a polynomial we want to understand the number of arithmetic

# Data Assimilation for Deterministic High Dimensional Dynamical Systems

## Speaker:

## Time:

## Venue:

Data assimilation refers to the problem of estimation of state of a high dimensional chaotic system given noisy, partial observations of the system.

# Sparsity Bound for Matrix Identities

## Organisers:

## Time:

## Venue:

**Abstract: **A polynomial $f(x_1,\ldots,x_n)$ is said to be an identity for $m \times m$ matrices if $f(M_1,\ldots,M_n) = 0$ for all choices of $m \times m$ matrices for $M_i$s.

# Betti Numbers of Gaussian Excursions in the Sparse Regime

## Speaker:

## Organisers:

## Time:

## Venue:

Abstract: A function's excursion set is the sub-domain where its value exceeds some threshold. Some key examples illustrating the central role that excursion sets play in different application areas are as follows.

# Extending Partial Functions

## Time:

## Venue:

In the problem of partial function extension, we are given a partial function consisting of a set of $n$ points in a domain and a function value at each point.

# Communication and Rank

## Organisers:

## Time:

## Venue:

Abstract: The communication complexity of a function f(x,y) is the number of bits that Alice and Bob need to communicate in order to compute f, when Alice has x and Bob has y.

# A Fresh Look at an Old Problem: Network Utility Maximization—Convergence, Delay, and Complexity

## Speaker:

## Organisers:

## Time:

## Venue:

**Absract:** Network Utility Maximization has been studied for resource allocation problems in communication networks for nearly two decades.

# Algorithms from Physics

## Speaker:

## Organisers:

## Time:

## Venue:

**Abstract:** In understanding physical systems over hundreds of years, physicists have developed a wealth of dynamics and viewpoints.