3 citations · 4 across the 4 of their papers we have counts for
4 papers
Spectral bounds for non-uniform hypergraphs using weighted clique expansion
Ashwin Guha, Ambedkar Dukkipati
Hypergraphs are an invaluable tool to understand many hidden patterns in large data sets. Among many ways to represent hypergraph, one useful representation is that of weighted cli…
Analytic Connectivity in General Hypergraphs
Ashwin Guha, Muni Sreenivas Pydi, Biswajit Paria +1
In this paper we extend the known results of analytic connectivity to non-uniform hypergraphs. We prove a modified Cheeger's inequality and also give a bound on analytic connectivi…
A Faster Algorithm For Testing Polynomial Representability Of Functions Over Finite Integer Rings
Ashwin Guha, Ambedkar Dukkipati
Given a function from to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization…
An Algorithmic Characterization of Polynomial Functions over
Ashwin Guha, Ambedkar Dukkipati
In this paper we consider polynomial representability of functions defined over , where is a prime and is a positive integer. Our aim is to provide an algorithmic…