Persistent homology of collaboration networks (Q474153): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Kathy Horadam / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2013/815035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2126424784 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59030292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverage in sensor networks via persistent homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology and data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barcodes: The persistent topology of data / rank
 
Normal rank
Property / cites work
 
Property / cites work: From the Cover: The structure of scientific collaboration networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of persistence diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of random clique complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology for Computing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:52, 9 July 2024

scientific article
Language Label Description Also known as
English
Persistent homology of collaboration networks
scientific article

    Statements

    Persistent homology of collaboration networks (English)
    0 references
    0 references
    0 references
    0 references
    24 November 2014
    0 references
    Summary: Over the past few decades, network science has introduced several statistical measures to determine the topological structure of large networks. Initially, the focus was on binary networks, where edges are either present or not. Thus, many of the earlier measures can only be applied to binary networks and not to weighted networks. More recently, it has been shown that weighted networks have a rich structure, and several generalized measures have been introduced. We use persistent homology, a recent technique from computational topology, to analyse four weighted collaboration networks. We include the first and second Betti numbers for the first time for this type of analysis. We show that persistent homology corresponds to tangible features of the networks. Furthermore, we use it to distinguish the collaboration networks from similar random networks.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references