50 citations · 182 across the 38 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.PR2013★ 20 cited
The densest subgraph problem in sparse random graphs
Venkat Anantharam, Justin Salez
We determine the asymptotic behavior of the maximum subgraph density of large random graphs with a prescribed degree sequence. The result applies in particular to the Erdős-Rényi m…
cs.IT2013
On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover
Venkat Anantharam, Amin Gohari, Sudeep Kamath +1
In this paper we provide a new geometric characterization of the Hirschfeld-Gebelein-Rényi maximal correlation of a pair of random , as well as of the chordal slope of the n…