
Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering
Triangle counting is a fundamental technique in network analysis, that h...
read it

Randomized Algorithms for Scientific Computing (RASC)
Randomized algorithms have propelled advances in artificial intelligence...
read it

NearLinear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles
Counting homomorphisms of a constant sized pattern graph H in an input g...
read it

DistributionFree Models of Social Networks
The structure of largescale social networks has predominantly been arti...
read it

Provably and Efficiently Approximating Nearcliques using the Turán Shadow: PEANUTS
Clique and nearclique counts are important graph properties with applic...
read it

How to Count Triangles, without Seeing the Whole Graph
Triangle counting is a fundamental problem in the analysis of large grap...
read it

How the Degeneracy Helps for Triangle Counting in Graph Streams
We revisit the wellstudied problem of triangle count estimation in grap...
read it

The impossibility of low rank representations for trianglerich complex networks
The study of complex networks is a significant development in modern sci...
read it

The Power of Pivoting for Exact Clique Counting
Clique counting is a fundamental task in network analysis, and even the ...
read it

Efficiently Counting Vertex Orbits of All 5vertex Subgraphs, by EVOKE
Subgraph counting is a fundamental task in network analysis. Typically, ...
read it

Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six
We consider the problem of counting all kvertex subgraphs in an input g...
read it

Random walks and forbidden minors II: A poly(dε^1)query tester for minorclosed properties of boundeddegree graphs
Let G be a graph with n vertices and maximum degree d. Fix some minorcl...
read it

Faster sublinear approximations of kcliques for low arboricity graphs
Given query access to an undirected graph G, we consider the problem of ...
read it

Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions in dDimensions
We describe a Õ(d^5/6)query monotonicity tester for Boolean functions f...
read it

Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions on Hypergrids
Testing monotonicity of Boolean functions over the hypergrid, f:[n]^d →{...
read it

Finding forbidden minors in sublinear time: a n^1/2+o(1)query onesided tester for minor closed properties on bounded degree graphs
Let G be an undirected, bounded degree graph with n vertices. Fix a fini...
read it

Fiding forbidden minors in sublinear time: a O(n^1/2 + o(1))query onesided tester for minor closed properties on bounded degree graphs
Let G be an undirected, bounded degree graph with n vertices. Fix a fini...
read it

Finding Cliques in Social Networks: A New DistributionFree Model
We propose a new distributionfree model of social networks. Our definit...
read it

Adaptive Boolean Monotonicity Testing in Total Influence Time
The problem of testing monotonicity of a Boolean function f:{0,1}^n →{0,...
read it

A o(d) ·polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n]^d
We study monotonicity testing of Boolean functions over the hypergrid [n...
read it

Provable and practical approximations for the degree distribution using sublinear graph samples
The degree distribution is one of the most fundamental properties used i...
read it

Influence and Dynamic Behavior in Random Boolean Networks
We present a rigorous mathematical framework for analyzing dynamics of a...
read it
C. Seshadhri
is this you? claim profile