We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...
A set of pairwise edge-disjoint triangles of an edge-colored Kn is r-color avoiding if it does not contain r monochromatic triangles, each having a different color. Let fr(n) be th...
Ensembles of regular low-density parity-check codes over any finite Abelian group G are studied. The nonzero entries of the parity matrix are randomly chosen, independently and uni...
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
We study the second-order feasibility cone F = {y IRn : My gT y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decompo...