Abhijin Adiga

Learn More
The largest eigenvalue of the adjacency matrix of a network (referred to as the spectral radius) is an important metric in its own right. Further, for several models of epidemic spread on networks (e.g., the 'flu-like' SIS model), it has been shown that an epidemic dies out quickly if the spectral radius of the graph is below a certain threshold that(More)
Simple diffusion processes on networks have been used to model, analyze and predict diverse phenomena such as spread of diseases, information and memes. More often than not, the underlying network data is noisy and sampled. This prompts the following natural question: how sensitive are the diffusion dynamics and subsequent conclusions to uncertainty in the(More)
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × I b , where each Ii is a closed interval of unit length on the real line. The cubicity of G, denoted by cub(G) is the minimum positive integer b such that the vertices in G can be mapped to axis(More)
A k-box B = (R 1 , R 2 ,. .. , R k), where each R i is a closed interval on the real line, is defined to be the Cartesian product R 1 × R 2 × · · · × R k. If each R i is a unit length interval, we call B a k-cube. Boxicity of a graph G, denoted as box(G), is the minimum integer k such that G is an intersection graph of k-boxes. Similarly, the cubicity of G,(More)