Abstract
The technique of measuring similarity between topological spaces using Wasserstein distance
 between persistence diagrams is extended to graph networks in this paper. A relationship
 between the Wasserstein distance of the Cartesian product of topological spaces and the
 Wasserstein distance of individual spaces is found to ease the comparative study of the
 Cartesian product of topological spaces. The Cartesian product and the strong product of
 weighted graphs are defined, and the relationship between the Wasserstein distance between
 graph products and the Wasserstein distance between individual graphs is determined. For
 this, clique complex filtration and the Vietoris- Rips filtration are used.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
