3 citations · 4 across the 5 of their papers we have counts for
6 papers
Non-trivial squares and Sidorenko's conjecture
Pranav Garg, Annie Raymond, Amanda Redlich
Let be the homomorphism density of a graph into a graph . Sidorenko's conjecture states that for any bipartite graph , for all gra…
Balanced Allocation: Patience is not a Virtue
John Augustine, William K. Moses, Amanda Redlich +1
Load balancing is a well-studied problem, with balls-in-bins being the primary framework. The greedy algorithm of Azar et al. places each ball by probing $d >…
Modular statistics for subgraph counts in sparse random graphs
Bobby DeMarco, Jeff Kahn, Amanda Redlich
Answering a question of Kolaitis and Kopparty, we show that, for given integer and pairwise nonisomorphic connected graphs , if is such that $\Pr(G_{n,p}…
Unbalanced Allocations
Amanda Redlich
We consider the unbalanced allocation of balls into bins by a randomized algorithm using the "power of two choices". For each ball, we select a set of bins at random, then…
Remarks on Combinatorial Aspects of the KP Equation
Shabnam Beheshti, Amanda Redlich
We survey several results connecting combinatorics and Wronskian solutions of the KP equation, contextualizing the successes of a recent approach introduced by Kodama, et. al. We i…
Graph decomposition and parity
Bobby DeMarco, Amanda Redlich
Motivated by a recent extension of the zero-one law by Kolaitis and Kopparty, we study the distribution of the number of copies of a fixed disconnected graph in the random graph $G…