## Projects

#### Efficiency of Road Networks April, 2021

For any two points on the Earth, the geodesic (as the crow flies) distance between them is usually different from the travel distance (along roads). For example, the fastest driving route from Boston to Dallas is about 1750 miles long, but the geodesic distance between Boston and Dallas (as the crow flies) is only about 1520 miles. By comparing the geodesic distance to the travel distance for millions of pairs of points, it is possible to measure the efficiency of road networks across distance and geography.

#### Geographic Voronoi Diagrams December, 2020

Voronoi diagrams are a useful geometric tool across a number of applications. However, most software which deals with Voronoi diagrams in the context of geography work by projecting the Earth to a plane, and then computing the euclidean Voronoi diagram. While this approach can give approximate results over small regions, it fails over larger ones. In this quick project, I implement spherical Voronoi diagrams in Mathematica, integrating with the existing Geo-functions.

#### Map of Empire Density July, 2020

For any two points on the Earth, the geodesic (as the crow flies) distance between them is usually different from the travel distance (along roads). For example, the fastest driving route from Boston to Dallas is about 1750 miles long, but the geodesic distance between Boston and Dallas (as the crow flies) is only about 1520 miles. By comparing the geodesic distance to the travel distance for millions of pairs of points, it is possible to measure the efficieny of road networks across distance and geography.

#### Network Models of COVID-19 March, 2020

In March of 2020, at the beginning of the COVID-19 pandemic in the US, there was endless talk of disease spread modeling. Many models were studied without proper understanding of their sensitivity to arbitrary modeling assumptions. This paper explores a large space of network SIR models in search of robust results.

#### Highest-Resolution Income Map of the US March, 2019

I couldn’t find a high-resolution map of household income for the whole United States, so I decided to make one. This map uses the highest-resolution available data form the US Census 5-year ACS, which goes down to the block group level (each block group contains about 1000 people).

#### Rush Hour Game Graph Analysis December, 2017

Rush Hour is a logic puzzle board game in which the player slides “cars” around a grid with the goal of driving a particular target car to the exit. In this project, I generated the graphs of reachable configurations from each of those 40 starting configurations, with the goal of measuring whether differences in the topology of the game graphs correlate with the subjective difficulty of the puzzles for humans.

#### Lifespan of News Stories October, 2017

News stories have a life cycle: they break, they are covered for a while, and then they fade into irrelevance. The goal of this project was to quantify the lifespan of news stories, and to study how that lifespan has varied over time.

#### Where Is the Center of the US? July, 2017

Where is the geographic center of the US? According to the National Geologic Survey, the center of the conterminous US is at 39°50’N 98°35’W, and the center of all US states (including Alaska and Hawaii) is at 44°58’N 103°46’W. The thing is, the center of a region on the globe is not entirely well defined. That is, there are multiple ways of characterizing the center of a region like the US.

#### Flag Analysis February, 2017

I trained a variational autoencoder (VAE) on a set of thousands of flags from around the world, making it possible to generate new flags and to measure the “probability” of existing ones. My original goal was to quantify whether distance in flag space is correlated to distance in geographic space, but all of my results were negative, and the dataset I used made it difficult to connect flags to geography.

#### Functional Completeness and Optimization November, 2016

Some logical connectives (boolean functions like AND, OR, and NAND) are *functionally complete*, which means they can be used to emulate any of the other logical connectives. The property of functional completeness is crucial to chip design, as it makes it possible to build a fully-functional chip while only manufacturing a single type of gate. While the 2-input connectives are well-studied, their 3-input counterparts are less so. This project uses dynamic programming to find minimal expressions for using 3-input logical connectives to represent other 3-input logical connectives. In doing so, I answer the question of which connective you would want to use if you wanted to create a computer with 3-input gates assuming you wanted to minimize the number of gates. Spoilers: it isn’t the choice that the Apollo Guidance Computer made (which used 3-input gates).

#### Billboard Hot 100 Analysis September, 2016

Since 1958, Billboard magazine has been publishing its Hot 100 list of the 100 “hottest” songs every week (based on sales, radio play, streaming, etc.) Using data from the Billboard website, I was able to study the rise and fall of individual songs, albums, and artists, as well as the dynamics of the music industry as a whole.

#### Aspect Ratios of Historical Societies May, 2016

In his book *Guns, Germs, and Steel*, Jared Diamond proposed that societies grow in accordance with regional differences in climate, and that because climate varies more drastically when moving north-south than when moving east-west, large societies will grow faster east-west than north-south. I characterize aspect ratio for regions on the globe and find that societies are on average wider than they are tall, supporting Diamond’s claim. However, I also find a similar effect with small and large societies, suggesting another underlying cause. I then investigate the first part of Diamond’s claim, and find that societies do not grow in accordance with climate in the manner he predicts.

#### Math OCR July, 2015

Rush Hour is a logic puzzle board game in which the player slides “cars” around a grid with the goal of driving a particular target car to the exit. In this project, I generated the graphs of reachable configurations from each of those 40 starting configurations, with the goal of measuring whether differences in the topology of the game graphs correlate with the subjective difficulty of the puzzles for humans.

####
Science Consulting on *Arrival* May, 2015

I worked as a science consultant on the science fiction movie *Arrival (2016)* which centers around a linguist trying to understand an alien language. My role was to perform realistic computer analysis of the fictional alien script which could be shown on screens throughout the movie.

#### Education Analytics of an Online Classroom February, 2015

Back in 2015, while I was a Sophomore at the Stanford Online High School (OHS), I wrote a series of programs for extracting and analyzing data from recordings of my online classes. I was able to generate tons of class-specific statistics, like the “agreement” network of students in the text chat, as well as more general results, like that the amount and type of student participation varied when the teacher was replaced, etc.

#### Phase Diagram of Boids September, 2014

Boids is a simple model of flocking behavior which has been used to simulate the movements of birds in a flock, fish in a school, etc. Boids is one of the classic examples of emergent behavior, with simple and local rules producing complex global behavior. I create an efficient implementation of boids and used it to study how their global behavior changes with the parameters of the individual agents.

#### Cryptography System for WL June, 2014

I was the primary developer of the original cryptography functions shipped with every copy of Wolfram Language (Mathematica) since 2015 (version 10.1). Those functions include `Encrypt`

, `Decrypt`

, `GenerateSymmetricKey`

, `GenerateAsymmetricKeyPair`

, `EncryptFile`

, `DecryptFile`

, `EncryptedObject`

, `SymmetricKey`

, `PrivateKey`

, `PublicKey`

. Most of the functionality was backed by OpenSSL.

#### Wolfram Tweet-a-Program January, 2014

Rush Hour is a logic puzzle board game in which the player slides “cars” around a grid with the goal of driving a particular target car to the exit. In this project, I generated the graphs of reachable configurations from each of those 40 starting configurations, with the goal of measuring whether differences in the topology of the game graphs correlate with the subjective difficulty of the puzzles for humans.