Wed, February 5, 2020
Public Access Category: All |
|||||||||||||||||||||
|
- Time:
- 11:00am-12:30pm
- Location:
- Ramanujan Hall, Department of Mathematics
- Description:
- 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.
- Time:
- 4:00pm-5:00pm
- Location:
- Ramanujan Hall, Department of Mathematics
- Description:
- 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.