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 🙂

Leave a Reply

Your email address will not be published. Required fields are marked *