Home
CV Email me
Research
Research Projects Recent Presentations Software and Data
Teaching
Computational Redistricting Ethics Resources LaTeX Workshops Crossroads Problems
Course Notes
Intro to MCMC Dartmouth Written Qual Complex Networks Topology Videos

Cantor Endpoints

This is an interact module for constructing regularly branching trees and computing their eigenvalues as described in the paper On the Spectrum of Finite Rooted Homogeneous Trees joint with my Ph.D. advisor Dan Rockmore. The parameters are the number of branches or nodes adjacent to the root and a list representing the branching pattern. More details are available on GitHub.