Error message

Friday, 17 November 2023
Time Speaker Title Resources
09:30 to 10:20 Souvik Dhara (Purdue University, USA) Modern methods in Network Science - I
10:30 to 11:20 Souvik Dhara (Purdue University, USA) Modern methods in Network Science - II
14:10 to 14:30 Ananya Lahiri (IIT Tirupati, India) Dynamic portfolio optimization using extreme value theory

We will discuss a methodology for dynamic portfolio optimization while accessing extreme value behaviors of stocks in the portfolio and its limitations. In the talk we will focus the future opportunities based on a work jointly done with MS student Sushhma from IISER Tirupati.

14:30 to 14:50 Krishanu Maulik (ISI Kolkata, India) Berry-Esseen bounds for two colour urns

We shall consider Berry-Esseen bounds for the normal limits in case of subcritical and critical two colour urns. We shall compare the bounds when the replacement matrix is doubly stochastic with the case when it is only balanced. This is joint work with Aritra Majumdar.

16:30 to 16:50 Vivek Borkar (IIT Bombay, India) In search of Markov solutions

The talk will describe some recent work with Anugu Sumith Reddy and K. Suresh Kumar on an alternative approach to selecting a Markov solution for degenerate diffusions using small noise limits.

16:50 to 17:10 Manikandan Rangaswamy (Central University of Kerala, Kasaragod, India) Comparisons between Parallel and Series Models in a Reliability-Queueing-Inventory System- a Concise Discussion

In this talk, we consider an integrated Reliability-Queueing-Inventory (RQI) system; and briefly discuss a comparative study between a parallel system (Model I) and a series system (Model II) concerning the repair and replenishment of failed components. These systems are composed of inde- pendent and identical components. In Model I, we investigate a parallel system (1-out-of-n: G), where the repair of failed components precedes the placing of the replenishment order. Failed components form a queue awaiting for repair, where the repair starts when the number of operational components reaches L (L < n). Upon further reduction to N (N < L), an order of n units is placed for replenishment. Whereas, in Model II, we analyze a series system (n-out-of-n: G), assuming that repair commences immediately when the number of working components decreases to n−1. Here, the replenishment order ensures precisely n operational and 1 spare components in the system. We explicitly derive the steady-state probabilities using Chapman-Kolmogrov difference-differential equations. Various key performance measures are calculated for both models, facilitating a comprehensive comparison to determine the most reliable system. Optimization problems are thoroughly explored, with achieved results facilitating the identification of the model that optimally balances reliability and cost efficiency.

17:10 to 17:30 Anand Deo (IIM Bengaluru, India) Efficient Importance Scenario Generation for Optimisation with Rare Events
Saturday, 18 November 2023
Time Speaker Title Resources
09:30 to 10:20 Souvik Dhara (Purdue University, USA) Modern methods in Network Science - III
10:30 to 11:20 Souvik Dhara (Purdue University, USA) Modern methods in Network Science - IV
12:10 to 13:00 Jayakrishnan Nair (IIT Bombay, India) Fundamentals of Heavy-tails: Properties, Emergence, and Identification - I
14:10 to 15:00 Jayakrishnan Nair (IIT Bombay, India) Fundamentals of Heavy-tails: Properties, Emergence, and Identification - II
15:10 to 16:00 Jayakrishnan Nair (IIT Bombay, India) Fundamentals of Heavy-tails: Properties, Emergence, and Identification - III
17:10 to 17:30 Parimal Parag (IISc, Bengaluru, India) Storage of balls into finite storage bins for fast collection

Consider equal-sized balls of finitely many colors, with exactly equal number of balls of each color. We are interested in placing these balls into finitely many bins where each can store only finitely many balls.
We assume that one is interested in collecting one ball of each color, where the collection time for each ball is random independent and exponentially distributed with unit rate.
We want to find out the optimal placement of balls into bins and their access order at each bin to minimize the mean ball collection time. We show that the mean ball collection time can be lower bounded in terms of the mean number of useful bins summed over all colors. In addition, we present deterministic placement schemes that attempt to maximize the number of useful bins.

Monday, 20 November 2023
Time Speaker Title Resources
09:30 to 10:20 Souvik Dhara (Purdue University, USA) Modern methods in Network Science - V
10:30 to 11:20 Souvik Dhara (Purdue University, USA) Modern methods in Network Science - VI
12:10 to 13:00 Jayakrishnan Nair (IIT Bombay, India) Fundamentals of Heavy-tails: Properties, Emergence, and Identification - IV
14:10 to 15:00 Jayakrishnan Nair (IIT Bombay, India) Fundamentals of Heavy-tails: Properties, Emergence, and Identification - V
15:10 to 16:00 Jayakrishnan Nair (IIT Bombay, India) Fundamentals of Heavy-tails: Properties, Emergence, and Identification - VI
Tuesday, 21 November 2023
Time Speaker Title Resources
09:30 to 10:20 Souvik Dhara (Purdue University, USA) Modern methods in Network Science - VII
10:30 to 11:20 Souvik Dhara (Purdue University, USA) Modern methods in Network Science - VIII
11:40 to 12:30 Jayakrishnan Nair (IIT Bombay, India) Fundamentals of Heavy-tails: Properties, Emergence, and Identification - VII
12:40 to 13:30 Jayakrishnan Nair (IIT Bombay, India) Fundamentals of Heavy-tails: Properties, Emergence, and Identification - VIII