Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 134 for “"Simplicial complexes"”.
-
Decompositions of Simplicial Complexes
… algebraic, and topological properties of simplicial complexes. We focus on when these properties imply the existence of decompositions of the face poset. In Chapter 2, we present a counterexample to Stanley's partitionability conjecture, we give a characterization of the h-vectors of …
-
Central Sets of Simplicial Complexes
… a new approach to defining a central set of a simplicial complex is presented. The focus on simplicial complexes is not arbitrary and stems from the fact that a vast majority of medial axis computations are done using simplicial (or polygonal) approximations. It is demonstrated that our notion …
-
Random Permutations and Simplicial Complexes
… combinatorial objects, permutations and simplicial complexes. First we study strong α-logarithmic measures on the symmetric group, including the well- studied Ewens sampling formula (see [21] and [20] for reference). We show that, for almost every α, precisely ⌈(1 − α log 2)−1⌉ are need …
-
Topological modeling with simplicial complexes
Simplicial complexes are useful for modeling shape of a discrete geometric domain and for discretizing continuous domains. A geometric triangulation of a point set S is a simplicial complex whose vertex set is contained in S and whose underlying space is the convex hull of S. In this thesis we …
-
Random simplicial complexes and Stein’s method
… data analysis (TDA). By studying random simplicial complexes, which serve as null models in TDA, the thesis falls within the framework of stochastic topology. Despite various success stories involving applications of algebraic topology, there is a lack of statistical tools that allow to …
-
Towards a Spectral Theory for Simplicial Complexes
… we study combinatorial Hodge Laplacians on simplicial com-</p><p>plexes using tools generalized from spectral graph theory. Specifically, we consider</p><p>generalizations of graph Cheeger numbers and graph random walks. The results in</p><p>this dissertation can be thought of as the …
-
On Properties of Algebraic Structures Related to Simplicial Complexes
In this document, we look at simplicial complexes and some algebraic constructions related to simplicial complexes. A squarefree monomial ideal in a polynomial ring is associated to a simplicial complex via the Stanley-Reisner correspondence. Further, the Alexander dual ideal of a simplicial …
-
Collapsing of simplicial complexes crossed with the unit interval
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1969
-
Non-Commutative Probability for the Spectral Analysis of Simplicial Complexes
… a new interpretation of Betti numbers for simplicial complexes in terms of distributions in an operator-valued probability space. This thesis is mostly an exposition of the areas of free probability and algebraic topology; here, we do not present cutting-edge research in either free …
-
Dynamics on Simplicial Complexes Using a Dimensionally Balanced Hodge Laplacian
… over networks to higher dimensional models using simplicial complexes and tools from algebraic topology, including homology, Hodge theory, and persistent homology. First, we develop a framework for consensus dynamics on simplicial complexes in which edges carry numerical states and interact …
-
Discrete Morse theory and the geometry of nonpositively curved simplicial complexes
Understanding the conditions under which a simplicial complex collapses is a central issue in many problems in topology and combinatorics. Let K be a simplicial complex endowed with the piecewise Euclidean geometry given by declaring edges to have unit length, and satisfying the property that every …
-
Graphs, Simplicial Complexes and Beyond: Topological Tools for Multi-agent Coordination
In this work, connectivity graphs have been studied as models of local interactions in multi-agent robotic systems. A systematic study of the space of connectivity graphs has been done from a geometric and topological point of view. Some results on the realization of connectivity graphs in their …
-
Sampling and Limit Theories for Graph Signal Processing and Large Simplicial Complexes
… meaningful limiting objects of graphs and simplicial complexes. The study undertaken in this thesis both enhances the understanding of current methods, as well as inspires new methods in light of the notions of transferability defined by sampling.
-
Some characteristics of the second betti number of random two dimensional simplicial complexes
… through generating random two-dimensional simplicial complexes, we studied the event (b₂=0) for some specific probabilities. We found when the probability of event (b₂=0) takes on certain specific values, the pair (n₀,n₂) lies on certain lines. However, this research is limited by our …
-
Simplicial Complexes and a Partial Classification of Almost Completely Decomposable Torsion Free Abelian Groups
The thesis treats the problem of how different two quasi-isomorphic groups can be.
-
Persistence stability for metric thickenings
Persistent homology often begins with a filtered simplicial complex, such as the Vietoris–Ripscomplex or the Čech complex, the vertex set of which is a metric space. An important result, the stability of persistent homology, shows that for certain types of filtered simplicial complexes, two metric …
-
A Polynomial Invariant of Partial Orders
… 4 to the setting of A-species, where A is any simplicial hyperplane arrangement. In chapter 5, we study a polynomial invariant which is defined for any poset p, and whose value at 1 is the number of linear extensions of the poset. We prove that the polynomial invariant studied in [9] is a …
-
Hypergraphs and their homology
… a major role in this thesis, are hypergraphs and simplicial complexes. Hypergraphs have grown in popularity over the past decades, and are becoming standard combinatorial objects used in network representations. They differ from graphs only in that an edge in a hypergraph can have any number of …
Page 1 of 7