This week we finished coding an additional method for identifying cycles. This method was suggested during a meeting I was luckily able to attend last year during the Vis conference. Carlos (one of our collaborators) suggested we use triangles in the graph to find additional walks, which we’ve finished using javaplex. My method is mostly finished as well, I’m now adding the ability to do many walks at a time where a walk ends if the node has already been visited. This has been a bit difficult because I cannot let nodes between the start point and revisited point count towards the overall probability. Next week we finish both of our methods and look to implement them together.

Featured image from the paper: “Persistent homology for the quantitative prediction of fullerene stability”, (Kelin Xia, Xin Feng, Yiying Tong, Guo-Wei Wei)

Leave a Reply

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