I’ve been working on the code to finish using persistent homology and random walks to find cycles in a graph. Each node will have a probability of being on a cycle and I’ll use this to supplement the graph drawing later on. So far this past week I’ve implemented the algorithm and visualized the process. I also found out this week I was admitted to the University of British Columbia as a PhD track with Tamara Munzner’s group! I’m so excited! Hopefully I’ll still be able to make the Vis 2018 deadline on March 31st with upcoming grad visits. Thanks for checking out my blog 🙂

This week begins my last semester at USF (and last semester researching for CREU). I’ve already met with Dr. Rosen three times to get the ball rolling on our next project. We’re adding on to our software of 0-D graph drawing tools by creating a tool for 1-Dimensional features. So far this month I’ve coded two graphs, one that takes in a point cloud with (x,y) coordinates, a persistence value, and birth/death cycle associated with every event. The second graph will be a replica of this first graph, but now I will randomly choose a starting point and perform a random walk on the graph (using a distance matrix against a randomly assigned epsilon value) to see if I can[…]