Abstract: River basin geomorphology is a very old subject of study initiated by Horton (1945). Various statistical models of drainage networks have been proposed. Each such model is a random directed graph with its own nuances.
Abstract: In this talk, I present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, such as reachability and full linear temporal logic.
Abstract: We study the word problem for the free skew field of non-commutative rational functions. We prove that an existing algorithm due to Gurvits is actually a deterministic polynomial time algorithm for this problem (over the rationals).
Abstract: Given a graph $G$, a valid colouring of $G$ is defined as an assignment of colours to the vertices of $G$ such that no two adjacent vertices share the same colour.
Abstract: It is known from the works of Lovett et al., Tao and Ziegler, and more recently, Bhowmick and Lovett, that there are Boolean functions which do not correlate well with classical polynomials of a certain degree but have good correlation w
Abstract: Consider a scenario where we are given an input graph $G = (V, E)$, and at each time-step either a new edge is inserted into the graph or an already existing edge is deleted from the graph.
Abstract: Traditionally, research focusing on the design of routing and staffing policies for service systems has modeled servers as having fixed (possibly heterogeneous) service rates.
Abstract: Consider the ordinal optimization problem of finding a population amongst many with the smallest mean when these means are unknown but population samples can be generated via simulation.
