The transmission capacity of an ad-hoc network is the maximum density of active transmitters per unit area, given an outage constraint at each receiv…

In the existing financial literature, entropy based ideas have been proposed in portfolio optimization, in model calibration for options pricing as w…

We show that the popular water-filling algorithm for maximizing the mutual information in parallel Gaussian channels is sub-modular. The sub-modulari…

Generalized network tomography (GNT) deals with estimation of link performance parameters for networks with arbitrary topologies using only end-to-en…

Given a bipartite graph G = (A u B, E) with strict preference lists and and edge e*, we ask if there exists a popular matching in G that contains the…

We investigate the limits of communication over the discrete-time Additive White Gaussian Noise (AWGN) channel, when the channel output is quantized …

We consider popular matching problems in both bipartite and non-bipartite graphs with strict preference lists. It is known that every stable matching…

We consider the max-size popular matching problem in a roommates instance G = (V,E) with strict preference lists. A matching M is popular if there is…

A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater th…

Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisso…

For a single transmit and receive antenna system, a new constellation design is proposed to combat errors in the phase estimate of the channel coeffi…

We consider the problem of efficient simulation estimation of the density function at the tails, and the probability of large deviations for a sum of…

We define catalytic networks as chemical reaction networks with an essentially catalytic reaction pathway: one which is on in the presence of certain…

Given an undirected $n$-node unweighted graph $G = (V, E)$, a spanner with stretch function $f(\cdot)$ is a subgraph $H\subseteq G$ such that, if two…

The author would like to thank Arkadev Chattopadhyay and Prahladh Harsha for many helpful discussions. The author is thankful to Prahladh Harsha for his help in improving the presentation of this article significantly.

We prove that the Fourier dimension of any Boolean function with Fourier sparsity $s$ is at most $O\left(s^{2/3}\right)$. Our proof method yields an …

An energy-limited source trying to transmit multiple packets to a destination with possibly different sizes is considered. With limited energy, the s…

Delay-reliability (D-R), and throughput-delay-reliability (T-D-R) tradeoffs in an ad hoc network are derived for single hop and multi-hop transmissio…

We consider the problem of maximizing the lifetime of coverage (MLCP) of targets in a wireless sensor network with battery-limited sensors. We first …

I thank Ashley Montanaro for pointing me to his work [HMS11] on compression of quantum states and Johnson Lindenstrauss lemma during a talk given on a preliminary version of this work at a workshop in CRM, Montréal, Canada, October 2011.

The famous Johnson-Lindenstrauss lemma states that for any set of n vectors, there is a linear transformation into a space of dimension O(log n) that…

A basic combinatorial online resource allocation problem is considered, where multiple servers have individual capacity constraints, and at each time…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account