Subdivision Bifiltration
   HOME





Subdivision Bifiltration
In topological data analysis, a subdivision bifiltration is a collection of filtered simplicial complexes, typically built upon a set of data points in a metric space, that captures shape and density information about the underlying data set. The subdivision bifiltration relies on a natural filtration of the barycentric subdivision of a simplicial complex by flags of minimum dimension, which encodes density information about the metric space upon which the complex is built. The subdivision bifiltration was first introduced by Donald Sheehy in 2011 as part of his doctoral thesis (later subsumed by a conference paper in 2012) as a discrete model of the multicover bifiltration, a continuous construction whose underlying framework dates back to the 1970s. In particular, Sheehy applied the construction to both the Vietoris-Rips and Čech filtrations, two common objects in the field of topological data analysis. Whereas single parameter filtrations are not robust with respect to outlie ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Topological Data Analysis
In applied mathematics, topological data analysis (TDA) is an approach to the analysis of datasets using techniques from topology. Extraction of information from datasets that are high-dimensional, incomplete and noisy is generally challenging. TDA provides a general framework to analyze such data in a manner that is insensitive to the particular metric chosen and provides dimensionality reduction and robustness to noise. Beyond this, it inherits functoriality, a fundamental concept of modern mathematics, from its topological nature, which allows it to adapt to new mathematical tools. The initial motivation is to study the shape of data. TDA has combined algebraic topology and other tools from pure mathematics to allow mathematically rigorous study of "shape". The main tool is persistent homology, an adaptation of homology to point cloud data. Persistent homology has been applied to many types of data across many fields. Moreover, its mathematical foundation is also of theoretica ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Functor
In mathematics, specifically category theory, a functor is a Map (mathematics), mapping between Category (mathematics), categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) are associated to topological spaces, and maps between these algebraic objects are associated to continuous function, continuous maps between spaces. Nowadays, functors are used throughout modern mathematics to relate various categories. Thus, functors are important in all areas within mathematics to which category theory is applied. The words ''category'' and ''functor'' were borrowed by mathematicians from the philosophers Aristotle and Rudolf Carnap, respectively. The latter used ''functor'' in a Linguistics, linguistic context; see function word. Definition Let ''C'' and ''D'' be category (mathematics), categories. A functor ''F'' from ''C'' to ''D'' is a mapping that * associates each Mathematical object, object X in ''C'' to ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Applied Mathematics
Applied mathematics is the application of mathematics, mathematical methods by different fields such as physics, engineering, medicine, biology, finance, business, computer science, and Industrial sector, industry. Thus, applied mathematics is a combination of mathematical science and specialized knowledge. The term "applied mathematics" also describes the profession, professional specialty in which mathematicians work on practical problems by formulating and studying mathematical models. In the past, practical applications have motivated the development of mathematical theories, which then became the subject of study in pure mathematics where abstract concepts are studied for their own sake. The activity of applied mathematics is thus intimately connected with research in pure mathematics. History Historically, applied mathematics consisted principally of Mathematical analysis, applied analysis, most notably differential equations; approximation theory (broadly construed, ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


CW Complex
In mathematics, and specifically in topology, a CW complex (also cellular complex or cell complex) is a topological space that is built by gluing together topological balls (so-called ''cells'') of different dimensions in specific ways. It generalizes both manifolds and simplicial complexes and has particular significance for algebraic topology. It was initially introduced by J. H. C. Whitehead to meet the needs of homotopy theory. (open access) CW complexes have better categorical properties than simplicial complexes, but still retain a combinatorial nature that allows for computation (often with a much smaller complex). The C in CW stands for "closure-finite", and the W for "weak" topology. Definition CW complex A CW complex is constructed by taking the union of a sequence of topological spaces \emptyset = X_ \subset X_0 \subset X_1 \subset \cdots such that each X_k is obtained from X_ by gluing copies of k-cells (e^k_\alpha)_\alpha, each homeomorphic to the open k- bal ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Polyhedral Surface
In geometry, a polyhedron (: polyhedra or polyhedrons; ) is a three-dimensional figure with flat polygonal faces, straight edges and sharp corners or vertices. The term "polyhedron" may refer either to a solid figure or to its boundary surface. The terms solid polyhedron and polyhedral surface are commonly used to distinguish the two concepts. Also, the term ''polyhedron'' is often used to refer implicitly to the whole structure formed by a solid polyhedron, its polyhedral surface, its faces, its edges, and its vertices. There are many definitions of polyhedron. Nevertheless, the polyhedron is typically understood as a generalization of a two-dimensional polygon and a three-dimensional specialization of a polytope, a more general concept in any number of dimensions. Polyhedra have several general characteristics that include the number of faces, topological classification by Euler characteristic, duality, vertex figures, surface area, volume, interior lines, Dehn invariant, ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Herbert Edelsbrunner
Herbert Edelsbrunner (born March 14, 1958) is a computer scientist working in the field of computational geometry, the Arts & Science Professor of Computer Science and Mathematics at Duke University, Professor at the Institute of Science and Technology Austria (ISTA), and the co-founder of Geomagic, Inc. He was the first of only three computer scientists to win the National Science Foundation's Alan T. Waterman Award. Academic biography Edelsbrunner was born in 1958 in Graz, Austria.Who is Who – Cyberworlds 2007
.
He received his in 1980 and Ph.D. in 1982, both from
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Rhomboid
Traditionally, in two-dimensional geometry, a rhomboid is a parallelogram in which adjacent sides are of unequal lengths and angles are non-right angled. The terms "rhomboid" and "parallelogram" are often erroneously conflated with each other (i.e, when most people refer to a "parallelogram" they almost always mean a rhomboid, a specific subtype of parallelogram); however, while all rhomboids are parallelograms, not all parallelograms are rhomboids. A parallelogram with sides of equal length ( equilateral) is called a ''rhombus'' but not a rhomboid. A parallelogram with right angled corners is a ''rectangle'' but not a rhomboid. A parallelogram is a rhomboid if it is neither a rhombus nor a rectangle. History Euclid introduced the term in his '' Elements'' in Book 1, Definition 22, Euclid never used the definition of rhomboid again and introduced the word parallelogram in Proposition 34 of Book 1; ''"In parallelogrammic areas the opposite sides and angles are equal to on ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Weak Equivalence (homotopy Theory)
In mathematics, a weak equivalence is a notion from homotopy theory that in some sense identifies objects that have the same "shape". This notion is formalized in the axiomatic definition of a model category. A model category is a category with classes of morphisms called weak equivalences, fibrations, and cofibrations, satisfying several axioms. The associated homotopy category of a model category has the same objects, but the morphisms are changed in order to make the weak equivalences into isomorphisms. It is a useful observation that the associated homotopy category depends only on the weak equivalences, not on the fibrations and cofibrations. Topological spaces Model categories were defined by Quillen as an axiomatization of homotopy theory that applies to topological spaces, but also to many other categories in algebra and geometry. The example that started the subject is the category of topological spaces with Serre fibrations as fibrations and weak homotopy equival ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Polynomial-time
In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor. Since an algorithm's running time may vary among different inputs of the same size, one commonly considers the worst-case time complexity, which is the maximum amount of time required for inputs of a given size. Less common, and usually specified explicitly, is the average-case complexity, which is the average of the time taken on inputs of a given size (this makes sense because there are only a finite number of possible inputs of a given size). In both cases, the time complexity is gener ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Homology (mathematics)
In mathematics, the term homology, originally introduced in algebraic topology, has three primary, closely-related usages. The most direct usage of the term is to take the ''homology of a chain complex'', resulting in a sequence of Abelian group, abelian groups called ''homology groups.'' This operation, in turn, allows one to associate various named ''homologies'' or ''homology theories'' to various other types of mathematical objects. Lastly, since there are many homology theories for Topological space, topological spaces that produce the same answer, one also often speaks of the ''homology of a topological space''. (This latter notion of homology admits more intuitive descriptions for 1- or 2-dimensional topological spaces, and is sometimes referenced in popular mathematics.) There is also a related notion of the cohomology of a Cochain complexes, cochain complex, giving rise to various cohomology theories, in addition to the notion of the cohomology of a topological space. Ho ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Rips Complex
Rips may refer to: Places * Rips, Sarandë, a location in Albania on the border with Greece * De Rips, a village in the Netherlands People * Eliyahu Rips (1948–2024), Israeli mathematician * Lance Rips (born 1948), American psychologist * Nicolaia Rips (born 1998), American author Other uses * ''Rips'' (album), a 2014 album by American indie rock band Ex Hex * RIPS (Re-Inforce Programming Security), a software static code analysis tool ** RIPS Technologies, the company that publishes RIPS * Radio-isotope power system, or radioisotope thermoelectric generator See also * * Rip (other) RIP (abbreviating ''rest in peace'', or ) is a common element of Christian epitaphs. RIP may also refer to: Arts, entertainment, and media Music * RIP (band), punk band from Basque Country (Spain) * R.I.P. or R.I.P. Productions, an alias of t ...
* {{disambiguation ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Partially Ordered Set
In mathematics, especially order theory, a partial order on a Set (mathematics), set is an arrangement such that, for certain pairs of elements, one precedes the other. The word ''partial'' is used to indicate that not every pair of elements needs to be comparable; that is, there may be pairs for which neither element precedes the other. Partial orders thus generalize total orders, in which every pair is comparable. Formally, a partial order is a homogeneous binary relation that is Reflexive relation, reflexive, antisymmetric relation, antisymmetric, and Transitive relation, transitive. A partially ordered set (poset for short) is an ordered pair P=(X,\leq) consisting of a set X (called the ''ground set'' of P) and a partial order \leq on X. When the meaning is clear from context and there is no ambiguity about the partial order, the set X itself is sometimes called a poset. Partial order relations The term ''partial order'' usually refers to the reflexive partial order relatio ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]