Wed, February 5, 2020
Public Access

Category: All

February 2020
Mon Tue Wed Thu Fri Sat Sun
          1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29  
11:00am [11:00am] Pranabendu Misra: Max-Planck Institute for Informatics.:
Combinatorics Seminar. Speaker: Pranabendu Misra. Affiliation: Max-Planck Institute for Informatics. Date and Time: Wednesday 05 February, 11:00 am - 12:30 pm. Venue: Ramanujan Hall, Department of Mathematics. Title: Deterministic Representation of Linear Matroids. Abstract: Matroids are combinatorial objects that generalize the notion of linear independence. They have several applications in design and analysis of algorithms. Linear matroids are a subclass of matroids that can be represented by a matrix. Recently, these matroids have found applications in Parameterized Complexity, including some breakthrough results. In this talk, we will discuss the problem of constructing a matrix representation of linear matroids, especially via deterministic algorithms.

4:00pm [4:00pm] Siva Athreya: Indian Statistical Institute, Bangalore.: Mathematics Colloquium
Mathematics Colloquium. Speaker: Siva Athreya. Affiliation: Indian Statistical Institute, Bangalore. Date and Time: Wednesday 05 February, 04:00 pm - 05:00 pm. Venue: Ramanujan Hall, Department of Mathematics. Title: Dense Networks: Sampling and Dynamics. Abstract: Understanding hidden populations governed by an underlying network has always been a challenge using standard sampling methods. The reasons being cost, lack of sampling frame, privacy concerns, and populations constituting a small proportion. A network is dense if the number of edges scales quadratically with the number of vertices. In this talk we shall discuss limitations of a particular sampling procedure called Respondent Driven Sampling intended to understand hidden populations and a natural class of dynamics in dense networks arising from such re-sampling in multi-type population.