5 papers
On Learning a Hidden Directed Graph with Path Queries
Mano Vikash Janardhanan, Lev Reyzin
In this paper, we consider the problem of reconstructing a directed graph using path queries. In this query model of learning, a graph is hidden from the learner, and the learner c…
On local matching property in groups and vector space
Mohsen Aliabadi, Mano Vikash Janardhanan
In this paper, we define locally matchable subsets of a group which is derived from the concept of matchings in groups and used as a tool to give alternative proofs for existing re…
Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)
Bhaskar DasGupta, Mano Vikash Janardhanan, Farzane Yahyanejad
problems (also called - problems) have been studied in data mining, statistics and computer science over the last several decades i…
On matchable subsets in abelian groups and their linear analogues
Mohsen Aliabadi, Mano Vikash Janardhanan
In this paper, we introduce the notions of matching matrices in groups and vector spaces, which lead to some necessary conditions for existence of acyclic matching in abelian group…
Network Construction with Ordered Constraints
Yi Huang, Mano Vikash Janardhanan, Lev Reyzin
In this paper, we study the problem of constructing a network by observing ordered connectivity constraints, which we define herein. These ordered constraints are made to capture r…