• Comparing Structure and Dynamics of Transition Graphs by the Symmetric Difference Metric Over an Edge-Filtration 

      Pascual, Belen Garcia; Salbu, Lars Moberg; Renz, Jessica; Giannakis, Konstantinos; Johnston, Iain (Journal article; Peer reviewed, 2024)
      Transition graphs or transition diagrams, describing the rates and probabilities with which a system changes between discrete states, are common throughout the sciences. In many cases, parameterisations of transition graphs ...
    • Determining homology of an unknown space from a sample 

      Brun, Morten; Garcia Pascual, Belen; Salbu, Lars Moberg (Journal article; Peer reviewed, 2023)
      The homology of an unknown subspace of Euclidean space can be determined from the intrinsic Čech complex of a sample of points in the subspace, without reference to the ambient Euclidean space. More precisely, given a ...
    • Dowker’s Theorem by Simplicial Sets and a Category of 0-Interleavings 

      Salbu, Lars Moberg (Master thesis, 2019-06-21)
      In this thesis we look at an alternative proof of Dowker’s theorem [4] using simplical sets. We prove the strongest version of the theorem [3], which can be applied to persistence homology in the sense that every nested ...
    • The parameterized complexity of finding minimum bounded chains 

      Blaser, Nello; Brun, Morten; Salbu, Lars Moberg; Vågset, Erlend Raa (Journal article; Peer reviewed, 2024)
      Finding the smallest d-chain with a specific (d − 1)-boundary in a simplicial complex is known as the Minimum Bounded Chain problem (MBCd). MBCd is NP-hard for all d ≥2. In this paper, we prove that it is also W[1]-hard ...
    • The Rectangle Complex of a Relation 

      Brun, Morten; Salbu, Lars Moberg (Journal article; Peer reviewed, 2023)
      We construct a simplicial complex, the rectangle complex of a relation R, and show that it is homotopy equivalent to the Dowker complex of . This results in a short and conceptual proof of functorial versions of Dowker’s ...
    • Simplicial Constructions in Applied Topology 

      Salbu, Lars Moberg (Doctoral thesis, 2024-10-16)
      I topologisk dataanalyse (TDA) analyserer man data ved å først konstruere et rom som fanger opp interessante egenskaper i dataen, og så studerer man topologien til dette rommet. Det er praktisk å jobbe med rom som har en ...