Suppose there is an underlying 1 dimensional histogram stored in the cloud. As a concrete example, consider the distribution of bank deposits (x-axis is the amount of dollars, and the y-axis is the count of accounts). For simplicity let’s assume that all the amounts of money deposited are integers within the range . The histogram is queried by […]

Let  be independent uniform random variables from , and consider the random variable . Computing the expectation is a routine computation: . However, there a slick way of computing this expectation. Let be another uniform random variable in . Consider the probability . On the one hand due to symmetry, it is equal to , on […]

Recently, I compiled a collection of applications that rely on dense subgraph discovery for my KDD’15 tutorial with Aris Gionis. In general, dense subgraph discovery is a key graph mining primitive. While by “dense” we generally mean subgraphs which are large enough and contain many edges, the exact notion of dense is application dependent.  The […]