TBTolson Bell

Tolson Bell

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Tolson Bell has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Rainbow powers of a Hamilton cycle in G(n,p)

    by Tolson Bell, Alan Frieze

    We show that the threshold for having a rainbow copy of a power of a Hamilton cycle in a randomly edge colored copy of $G_{n,p}$ is within a constant factor of the uncolored threshold. Our proof requires $(1+\varepsilon)$ times the minimum number of colors.

  • Open Access

    Giant Rainbow Trees in Sparse Random Graphs

    by Tolson Bell, Alan Frieze

    For any small constant $ε>0$, the Erdős-Rényi random graph $G(n,\frac{1+ε}{n})$ with high probability has a unique largest component which contains $(1\pm O(ε))2εn$ vertices. Let $G_c(n,p)$ be obtained by assigning each edge in $G(n,p)$ a color in $[c]$ independently and uniformly. Cooley, Do, Erde, and Missethan proved that for any fixed $α>0$, $G_{αn}(n,\frac{1+ε}{n})$ with high probability contains a rainbow tree (a tree that does not repeat colors) which covers $(1\pm O(ε))\fracα{α+1}εn$ vertices, and conjectured that there is one which covers $(1\pm O(ε))2εn$. In this paper, we achieve the correct leading constant and prove their conjecture correct up to a logarithmic factor in the error term, as we show that with high probability $G_{αn}(n,\frac{1+ε}{n})$ contains a rainbow tree which covers $(1\pm O(ε\log(1/ε)))2εn$ vertices.

  • Open Access

    The Park-Pham Theorem with Optimal Convergence Rate

    by Tolson Bell

    Park and Pham's recent proof of the Kahn-Kalai conjecture was a major breakthrough in the field of graph and hypergraph thresholds. Their result gives an upper bound on the threshold at which a probabilistic construction has a $1-\epsilon$ chance of achieving a given monotone property. While their bound in other parameters is optimal up to constant factors for any fixed $\epsilon$, it does not have the optimal dependence on $\epsilon$ as $\epsilon\rightarrow 0$. In this short paper, we prove a version of the Park-Pham Theorem with optimal $\epsilon$-dependence.

  • Open Access

    The Park-Pham Theorem with Optimal Convergence Rate

    by Tolson Bell

    Park and Pham's recent proof of the Kahn-Kalai conjecture was a major breakthrough in the field of graph and hypergraph thresholds. Their result gives an upper bound on the threshold at which a probabilistic construction has a $1-\epsilon$ chance of achieving a given monotone property. While their bound in other parameters is optimal up to constant factors for any fixed $\epsilon$, it does not have the optimal dependence on $\epsilon$ as $\epsilon\rightarrow 0$. In this short paper, we prove a version of the Park-Pham Theorem with optimal $\epsilon$-dependence.


  • Critical points of the random cluster model with Newman–Ziff sampling

    by Tolson H Bell, Jerrell M Cockerham, Clayton M Mizgerd, Melita F Wiles, Christian R Scullard

    We present a method for computing transition points of the random cluster model using a generalization of the Newman–Ziff algorithm, a celebrated technique in numerical percolation, to the random cluster model. The new method is straightforward to implement and works for real cluster weight q > 0. Furthermore, results for an arbitrary number of values of q can be found at once within a single simulation. Because the algorithm used to sweep through bond configurations is identical to that of Newman and Ziff, which was conceived for percolation, the method loses accuracy for large lattices when q > 1. However, by sampling the critical polynomial, accurate estimates of critical points in two dimensions can be found using relatively small lattice sizes, which we demonstrate here by computing critical points for non-integer values of q on the square lattice, to compare with the exact solution, and on the unsolved non-planar square matching lattice. The latter results would be much more difficult to obtain using other techniques.

  • Open Access

    Critical points of the random cluster model with Newman-Ziff sampling

    by Tolson H. Bell, Jerrell M. Cockerham, Clayton M. Mizgerd, Melita F. Wiles, Christian R. Scullard

    We present a method for computing transition points of the random cluster model using a generalization of the Newman-Ziff algorithm, a celebrated technique in numerical percolation, to the random cluster model. The new method is straightforward to implement and works for real cluster weight $q>0$. Furthermore, results for an arbitrary number of values of $q$ can be found at once within a single simulation. Because the algorithm used to sweep through bond configurations is identical to that of Newman and Ziff, which was conceived for percolation, the method loses accuracy for large lattices when $q>1$. However, by sampling the critical polynomial, accurate estimates of critical points in two dimensions can be found using relatively small lattice sizes, which we demonstrate here by computing critical points for non-integer values of $q$ on the square lattice, to compare with the exact solution, and on the unsolved non-planar square matching lattice. The latter results would be much more difficult to obtain using other techniques.