2020arXiv (Cornell University)Open access

A methodology to evaluate the evolution of networks using topological\n data analysis

João Pita Costa, Tihana Galinac Grbac

Open full text 0 citations

Abstract

Networks are important representations in computer science to communicate\nstructural aspects of a given system of interacting components. The evolution\nof a network has several topological properties that can provide us information\non the network itself. In this paper, we present a methodology to compare the\nthe topological characteristics of the evolution of a network, encoded into a\n(persistence) diagram that tracks the lifetimes of those features. This will\nenable us to classify the evolution of networks based on the distance between\nthe diagrams that represent such network evolution. In that, we also consider\ncomplex vectors that bring a complementary perspective to the distance-based\nclassification that is closer to the computational methods, aims to enhance the\ncomputational efficiency of those comparisons, and that is by itself a source\nof open research questions.\n

Open-access reader

About this research paper

What this paper is about

Networks are important representations in computer science to communicate\nstructural aspects of a given system of interacting components. The evolution\nof a network has several topological properties that can provide us information\non the network itself. In this paper, we present a methodology to compare the\nthe topological characteristics of the evolution of a network, encoded into a\n(persistence) diagram that tracks the lifetimes of those features. This will\nenable us to classify the evolution of networks based on the distance between\nthe diagrams that represent such network evolution. In that, we also consider\ncomplex vectors that bring a complementary perspective to the distance-based\nclassification that is closer to the computational methods, aims to enhance the\ncomputational efficiency of those comparisons, and that is by itself a source\nof open research questions.\n

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Networks are important representations in computer science to communicate\nstructural aspects of a given system of interacting components. The evolution\nof a network has several topological properties that can provide us information\non the network itself. In this paper, we present a methodology to compare the\nthe topological characteristics of the evolution of a network, encoded into a\n(persistence) diagram that tracks the lifetimes of those features. This will\nenable us to classify the evolution of networks based on the distance between\nthe diagrams that represent such network evolution. In that, we also consider\ncomplex vectors that bring a complementary perspective to the distance-based\nclassification that is closer to the computational methods, aims to enhance the\ncomputational efficiency of those comparisons, and that is by itself a source\nof open research questions.\n

Key concepts: Topological data analysis, Computer science, Data science, Network analysis, Topology (electrical circuits), Data mining, Mathematics, Engineering

Related papers

Back to paper searchBrowse research topicsOriginal source
A methodology to evaluate the evolution of networks using topological\n data analysis — Research Paper | ScholarLens