In a graph, we call a vertex well-mixing if the standard random walk starting from that vertex reaches close to its stationary distribution fast (say within 'polylogarithmic in the size of the vertex set' steps).

(This talk consists of joint work with Prof. Rajeeva L.

Agent-based simulators are a popular epidemiological modelling tool to study the impact of various non-pharmaceutical interventions in managing an evolving pandemic.

In the first part of this talk we will discuss the notion of rank of decision trees, which is essentially the largest depth of a complete subtree embedded in the initial tree.