Sökning: "Simplicial complex"

Hittade 5 uppsatser innehållade orden Simplicial complex.

  1. 1. Towards topology-aware Variational Auto-Encoders : from InvMap-VAE to Witness Simplicial VAE

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Aniss Aiman Medbouhi; [2022]
    Nyckelord :Variational Auto-Encoder; Nonlinear dimensionality reduction; Generative model; Inverse projection; Computational topology; Algorithmic topology; Topological Data Analysis; Data visualisation; Unsupervised representation learning; Topological machine learning; Betti number; Simplicial complex; Witness complex; Simplicial map; Simplicial regularization.; Variations autokodare; Ickelinjär dimensionalitetsreducering; Generativ modell; Invers projektion; Beräkningstopologi; Algoritmisk topologi; Topologisk Data Analys; Datavisualisering; Oövervakat representationsinlärning; Topologisk maskininlärning; Betti-nummer; Simplicielt komplex; Vittneskomplex; Simpliciel avbildning; Simpliciel regularisering.;

    Sammanfattning : Variational Auto-Encoders (VAEs) are one of the most famous deep generative models. After showing that standard VAEs may not preserve the topology, that is the shape of the data, between the input and the latent space, we tried to modify them so that the topology is preserved. LÄS MER

  3. 2. Comparison in Barcode and Computing Time for Persistent Homology Applied to a Subset of a Point Cloud

    Kandidat-uppsats,

    Författare :André Lasses Armatowski; [2022]
    Nyckelord :;

    Sammanfattning : At the intersection of topology and computer science lies the field of topological data analysis(TDA). TDA uses the concept of persistence to identify low dimensional topological features of data embedded in high dimensions. LÄS MER

  4. 3. The Weak Lefschetz Property For Artinian Quadratic Monomial Algebras

    Master-uppsats, Uppsala universitet/Algebra, logik och representationsteori

    Författare :Einar Waara; [2022]
    Nyckelord :;

    Sammanfattning : In this thesis we aim to study the Lefschetz properties ofmonomial algebras. First, we present the necessary concepts and resultsfrom commutative algebra, in particular we build up to the Hilbert-Serre theorem regarding the rationality of Hilbert series. LÄS MER

  5. 4. Properties of Discrete Laplacians With Application on Brain Networks

    Master-uppsats, KTH/Matematisk statistik

    Författare :David Thinsz; [2022]
    Nyckelord :Graph Laplacian; Combinatorial Laplacian; Persistent Laplacian; Topological data analysis; Spectral theory; Homology; Clustering.; Graf-Laplacian; Kombinatorisk Laplacian; Beständig Laplacian; Topologisk dataanalys; Spektralteori; Homologi; Klustring.;

    Sammanfattning : This thesis investigates three discrete Laplace operators: the graph Laplacian, combinatorial Laplacian, and the more recently introduced persistent Laplacian. We discuss how these operators relate to each other and study their spectral properties. The graph Laplacian is a well-studied operator that plays a central role in spectral graph theory. LÄS MER

  7. 5. From Relations to Simplicial Complexes: A Toolkit for the Topological Analysis of Networks

    Master-uppsats, KTH/Matematik (Avd.)

    Författare :Johan Lord; [2021]
    Nyckelord :applied algebraic topology; complex networks; topological data analysis; brain network analysis;

    Sammanfattning : We present a rigorous yet accessible introduction to structures on finite sets foundational for a formal study of complex networks. This includes a thorough treatment of binary relations, distance spaces, their properties and similarities. LÄS MER