In collaboration with David Simmons and Justin Coon from Oxford Engineering, Animesh has had a paper published in Linear Algebra and Its Applications (DOI: 10.1016/j.laa.2017.06.038) which explores the relationship between the symmetric Laplacian of a graph (an extension of the graph Laplacian to irregular graphs) and the partial trace of an entangled pure state which can be associated with that graph. They show that the Von Neumann entropy of the graph can be a measure of bipartite entanglement in the corresponding pure state and explore the Renyi entropies of various graphs; demonstrating that the complete graph attains maximum entropy and showing extremal values for the k-regular and star graphs which contrasts with results obtained from analysing the ordinary graph Laplacians.