11 citations · 17 across the 10 of their papers we have counts for
5 papers · 2 filters
On the Distribution of Range for Tree-Indexed Random Walks
Aaron Berger, Caleb Ji, Erik Metz
We study tree-indexed random walks as introduced by Benjamini, Häggström, and Mossel, i.e. labelings of a tree for which adjacent vertices have labels differing by 1. It is a conje…
Distinguishing Numbers and Generalizations
Caleb Ji
The distinguishing number of a graph was introduced by Albertson and Collins as a measure of the amount of symmetry contained in the graph. Tymoczko extended this definition to fai…
Brussels Sprouts, Noncrossing Trees, and Parking Functions
Caleb Ji, James Propp
We consider a variant of the game of Brussels Sprouts that, like Conway's original version, ends in a predetermined number of moves. We show that the endstates of the game are in n…
The sieving phenomenon for finite groups
Caleb Ji
The cyclic sieving phenomenon is a well-studied occurrence in combinatorics appearing when a cyclic group acts on a finite set. In this paper, we demonstrate a natural extension of…
On an Algorithm for Comparing the Chromatic Symmetric Functions of Trees
Sam Heil, Caleb Ji
It is a long-standing question of Stanley whether or not the chromatic symmetric function (CSF) distinguishes unrooted trees. Previously, the best computational result, due to Russ…