Description The area of non-adaptive group testing is a well-sought topic in recent years. The general problem is - we have a large set of elements, N which contains some 'special items'. The (sub)set...
On Counting Weighted Graph Homomorphisms Description Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovasz Local Lemma : The Lovasz Local Lemma is a useful tool for making...
Description Network games provide a basic framework for studying the diffusion of new ideas or behaviors through a population. In these models, agents decide to adopt a new idea based on optimizing...
Description Attacker defender games are (two-player) games played on graphs. The player strategies are subsets of the edges or vertices of the graph (for example the defender sends message(s) through...
Description In Coding Theory, the maximum size of binary codes of length n with minimum distance d is a well studied problem. In this talk, we study binary codes when there is a restriction on maximum...
Description The nontrivial lower bounds of the spectral gap for discrete Laplacian of the basis-exchange graph of a Matroid have algorithmic importance. First, we will present some background...
Description Graphs (networks) are widely used in science and technology to represent relationships between entities, such as social or ecological links between organisms, enzymatic interactions in...
Description Given a large sparse data set, two of the fundamental questions relevant for statistical analysis are: (1) what are model parameters that "best explain the data", in the sense that they...
Description Introduction to non-adaptive group testing. Basic probabilistic methods, some improvements (given time explanations as to why they work), non-probabilistic method(s) (group theory/number...
Description The nontrivial lower bounds of the spectral gap for discrete Laplacian of the basis-exchange graph of a Matroid have algorithmic importance. In the first part of this presentation, we will...
