Dependent Random Choice
Dependent Random Choice is a probabilistic method in extremal combinatorics that selects vertices in a graph based on the adjacency structure to guarantee the existence of dense subsets with prescribed intersection properties.
7
Publications
397
Citations
18
Authors
14
Institutions
Publications per year
2017–2026
1
Parents
7
Jacob Fox, Benny Sudakov · Random Structures and Algorithms · 2010 · 126 citations · Full text
Measuring and Modeling Attention
Andrew Caplin · Annual Review of Economics · 2016 · 110 citations · Full text
1–5 of 7
18
1
h-index
1 publications · 12 citations
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 18
14
University of Utah
Salt Lake City, United States
1 h-index
1 publications
96 citations
The Ohio State University
Columbus, United States
1 h-index
1 publications
15 citations
University of California, San Francisco
San Francisco, United States
1 h-index
4 publications
384 citations
University of Oxford
Oxford, United Kingdom
1 h-index
2 publications
52 citations
University of Bern
Bern, Switzerland
1 h-index
2 publications
24 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
1 publications
126 citations
University of California, Los Angeles
Los Angeles, United States
1 h-index
1 publications
126 citations

Tel Aviv University
Tel Aviv, Israel
1 h-index
1 publications
26 citations
1–8 of 14
Repository · 1 publications · 12 citations
1
h-index
TRAN · 1 publications · 26 citations
1
h-index
1 publications · 15 citations
1
h-index
1 publications · 12 citations
1
h-index
1 publications · 96 citations
1
h-index
1–5