7 citations · 12 across the 3 of their papers we have counts for
4 papers · 1 filter
Optimal couplings between sparse block models
James Hirst
We study the problem of coupling a stochastic block model with a planted bisection to a uniform random graph having the same average degree. Focusing on the regime where the averag…
Limits of Boolean Functions on F_p^n
Hamed Hatami, Pooya Hatami, James Hirst
We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a…
The Inducibility of Graphs on Four Vertices
James Hirst
We consider the problem of determining the maximum induced density of a graph H in any graph on n vertices. The limit of this density as n tends to infinity is called the inducibil…
The inducibility of blow-up graphs
Hamed Hatami, James Hirst, Serguei Norine
The blow-up of a graph is obtained by replacing every vertex with a finite collection of copies so that the copies of two vertices are adjacent if and only if the originals are. If…