Yadu Vasudev

Learn More
We initiate a thorough study of distributed property testing – producing algorithms for the approximation problems of property testing in the CONGEST model. In particular, for the so-called dense graph testing model we emulate sequential tests for nearly all graph properties having 1-sided tests, while in the general and sparse models we obtain faster tests(More)
We study optimization versions of Graph Isomorphism. Given two graphs G1, G2, we are interested in finding a bijection π from V (G1) to V (G2) that maximizes the number of matches (edges mapped to edges or non-edges mapped to non-edges). We give an n time approximation scheme that for any constant factor α < 1, computes an α-approximation. We prove this by(More)
We show that every non-adaptive property testing algorithm making a constant number of queries, over a fixed alphabet, can be converted to a sample-based (as per [Gold Reich and Ron, 2015]) testing algorithm whose average number of queries is a fixed, smaller than 1, power of n. Since the query distribution of the sample-based algorithm is not dependent at(More)
Distribution testing deals with what information can be deduced about an unknown distribution over {1, . . . , n}, where the algorithm is only allowed to obtain a relatively small number of independent samples from the distribution. In the extended conditional sampling model, the algorithm is also allowed to obtain samples from the restriction of the(More)
Let G = 〈S〉 be a solvable permutation group given as input by the generating set S. I.e. G is a solvable subgroup of the symmetric group Sn. We give a deterministic polynomial-time algorithm that computes an expanding generating set of size Õ(n2) for G. More precisely, given a λ < 1, we can compute a subset T ⊂ G of size Õ(n2) ( 1 λ )O(1) such that the(More)
The transmission of information in a MANET relies on the performance of the traffic scenario (application traffic agent and data traffic) used in a network. The traffic scenario determines the reliability and capability of information transmission, which necessitates its performance analysis. The objective of this paper is to compare the performance of(More)
Given two n-variable boolean functions f and g, we study the problem of computing an ε-approximate isomorphism between them. I.e. a permutation π of the n variables such that f(x1, x2, . . . , xn) and g(xπ(1), xπ(2), . . . , xπ(n)) differ on at most an ε fraction of all boolean inputs {0, 1}. We give a randomized 2 √ n polylog(n)) algorithm that computes a(More)
Let G = 〈S〉 be a solvable permutation group of the symmetric group Sn given as input by the generating set S. We give a deterministic polynomial-time algorithm that computes an expanding generating set of size Õ(n) for G. More precisely, the algorithm computes a subset T ⊂ G of size Õ(n)(1/λ) such that the undirected Cayley graph Cay(G, T ) is a λ-spectral(More)
We study the problem of testing conductance in the distributed computing model and give a two-sided tester that takes O(log n) rounds to decide if a graph has conductance at least Φ or is ǫ-far from having conductance at least Θ(Φ2) in the distributed CONGEST model. We also show that Ω(log n) rounds are necessary for testing conductance even in the LOCAL(More)
We present a one-sided error property testing algorithm for H-minor freeness in boundeddegree graphs for any minor H that is a minor of the (k× 2)-grid (for any k ∈ N). This includes, for example, testing whether a graph is a cactus graph and testing minor-freeness for minors which are cycles with parallel chords. The query complexity of our algorithm in(More)