Study on expected topology of random subcomplexes in subdivided finite simplicial complexes.
problem Understanding the expected topology of random subcomplexes in subdivided finite simplicial complexes.
method Analysis of successive barycentric subdivisions and study of expected Betti numbers, average Morse inequalities, and Euler characteristic.
result Asymptotic upper and lower bounds for the expected Betti numbers of random subcomplexes.
Study on vanishing cohomology groups in random simplicial complexes.
problem Determining when cohomology groups vanish in random simplicial complexes.
method Analysis of binomial random (k+1)-uniform hypergraphs and their downward-closure. result Vanishing of cohomology groups with coefficients in F2 has a sharp threshold. Probabilistic model for exhaustion in infinite-genus curve complexes.
problem Action rigidity in infinite-genus curve complexes.
method Costa and Farber's model for random simplicial complexes.
result Probabilistic evidence for exhaustion via rigid expansions.
Researchers calculate spectral dimension of complex networks using renormalization group theory.
problem Understanding diffusion properties in complex systems.
method Renormalization group theory applied to graph Laplacians of simplicial complexes.
result Spectral dimension decreases with randomness in topological structure.
RSHT algorithm simplifies complex shapes to points.
problem Simplifying complex shapes to points in higher dimensions.
method Combines simplicial collapses and expansions.
result Reduces triangulated d-manifolds to points using RSHT.
Proposes SGM for modeling complex dependencies in high-dimensional systems.
problem Limited pairwise interactions in PGMs for high-dimensional systems.
method Simplicial Gaussian model (SGM) using discrete Hodge theory and independent random components.
result Maximum-likelihood inference algorithm for parameter recovery and conditional dependence structure.
Proposes a probabilistic framework for stationary topological signals on simplicial complexes.
problem Complex data structures require new models and tools.
method Generalizes stationarity to topological signals on simplicial complexes.
result Defines topological power spectral density (PSD) for stationary signals.
Paper introduces Simplet Frequency Distribution (SFD) for SCs.
problem Frequency analysis of simplets in large SCs.
method Developed SFD vector and uniform sampling-based algorithm.
result Validated theoretical bounds with experiments.
The study explores discrete versions of Riemannian geometry structures on manifolds.
problem Understanding the relationship between discrete structures and continuous Riemannian geometry.
method Surveying and analyzing discrete counterparts of Riemannian geometry concepts on graphs and simplicial complexes.
result Recent developments include Cheeger type inequalities for higher-dimensional simplicial complexes and Floer type constructions.
We present extremal constructions connected with the property of simplicial collapsibility. (1) For each d≥2, there are collapsible (and shellable) simplicial d-complexes with only one free face. Also, there are non-evasive d-complexes with only two free faces. (Both results are optimal in all dimensions.) (2…
Random complexes can be embedded linearly if certain conditions on parameters are met.
problem Embedding random simplicial complexes linearly in Euclidean space.
method Established strict inequalities on parameters for linear embedding into R^(2d).
result Necessary and sufficient conditions for linear embedding of random complexes.
We study random 2-dimensional complexes in the Linial - Meshulam model and find torsion in their fundamental groups at various regimes. We find a simple algorithmically testable criterion for a subcomplex of a random 2-complex to be aspherical; this implies that any aspherical subcomplex of a random 2-complex satisfies…
Threshold found for embedding 2D complexes into random 2-complexes.
problem Embedding 2D simplicial complexes into random 2-complexes.
method Multi-parameter model with independent simplex probabilities; geometric subdivisions and inequalities.
result Threshold $p_0 p_1^3 p_2^2 = rac{1}{n}$ for embedding 2D complexes into random 2-complexes.
New Markov chains defined on simplicial complexes for understanding their topology.
problem Understanding the topology of simplicial complexes and hypergraphs.
method Defining new Markov chains on simplicial complexes and studying their properties.
result The generator of the new Markov chain is the upper Laplacian, and the Markov chain is positive recurrent.
The simplicial condition and other stronger conditions that imply it have recently played a central role in developing polynomial time algorithms with provable asymptotic consistency and sample complexity guarantees for topic estimation in separable topic models. Of these algorithms, those that rely solely on the simpl…
We investigate the probability of detecting combinatorial Morse flows on a simplicial complex via a random search. We prove that it is really small, in a quantifiable way.
Proposes a method to learn representations of higher-dimensional simplicial complexes.
problem Lack of methods for representing entire simplicial complexes.
method Geometric message passing schemes for end-to-end learning of simplicial complex representations.
result First method for learning representations of entire simplicial complexes.
In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and prove that similar connections exist between the combinatorial expansion of a compl…
Alexander's conjecture extended to infinite simplicial complexes.
problem Alexander's conjecture for infinite simplicial complexes.
method Generalization of recent result for finite simplicial complexes.
result Alexander's conjecture holds for infinite simplicial complexes.
The study examines conditions for minimal volume entropy of simplicial complexes.
problem Conditions for minimal volume entropy of simplicial complexes.
method Topological conditions and growth of fundamental groups.
result Examples of simplicial complexes with zero simplicial volume and large minimal volume entropy.
Abstract Szegedy walks on simplicial complexes are studied, revealing connections to combinatorial and geometric properties.
problem Investigating spectral structures of abstract Szegedy walks on simplicial complexes.
method Introduced modified Grover walks on simplicial complexes, focusing on orientations of simplices.
result Strong relationships between the spectrum of discriminants and combinatorial/geometry/topology properties of simplicial complexes.
Mixes higher-order simplicial complexes for data augmentation.
problem Lack of labeled data for complex systems with multiway interactions.
method Proposes mixup mechanisms for simplicial complexes, including linear and nonlinear mixup, and a convex clustering mixup.
result Synthetic simplicial complexes interpolate between existing data based on homomorphism densities.
Defined Ricci curvature on simplicial complexes and proved bounds.
problem No specific problem stated; generalization of graph Ricci curvature to simplicial complexes.
method Modified Ricci curvature definition for simplicial complexes and proved bounds.
result Upper and lower bounds of Ricci curvature on simplicial complexes.
We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erdős-Rényi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the first homology group, which was shown earlier by Linial and Meshulam to be p = 2 log(…
Paper calculates simplicial complexity of surface groups and proves stability under free product.
problem Stability of simplicial complexity under free product with free groups.
method Computing simplicial complexity for surface groups and proving stability.
result Stability of simplicial complexity under free product with free groups.
An additional minimal simplicial n-complex contains a non-splittable link in R^(2n).
problem Constructing minimal simplicial n-complexes with a specific link property.
method Presenting a new minimal simplicial n-complex.
result An additional simplicial n-complex with the same link property.
We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erdős-Rényi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the first homology group, which was shown earlier by Linial and Meshulam to be p = 2 log(…
Constructs simplified or complexified simplicial complexes.
problem Efficiently simplifying or complexifying complex spaces.
method Embeddings of simplicial complexes into a simplicial ball with bounded degrees and low volume.
result Realizes complicated spaces as parts of a ball/sphere or gives spheres specific metrics.
We study the multiscale simplicial flat norm (MSFN) problem, which computes flat norm at various scales of sets defined as oriented subcomplexes of finite simplicial complexes in arbitrary dimensions. We show that the multiscale simplicial flat norm is NP-complete when homology is defined over integers. We cast the mul…
Minimal volume entropy vanishes or is positive under certain fiber growth conditions.
problem Conditions for minimal volume entropy to be zero or positive.
method Analyzes topological conditions related to fiber growth of maps.
result Examples of finite simplicial complexes with zero simplicial volume and large minimal volume entropy.
A new clustering method for simplicial complexes using homology.
problem Clustering simplicial complexes efficiently and accurately.
method Inspired by graph spectral clustering, the method uses sparse eigenproblems.
result Produces clusters sensitive to simplicial complex homology.
Hypernetworks are simplified simplicial complexes with curvature.
problem Representing hypernetworks geometrically for analysis.
method Hypernetworks are interpreted as posets, which are simplicial complexes with Forman Ricci curvature.
result Hypernetworks have intrinsic curvature that correlates with their Euler characteristic.
Minimal simplicial complexes in high dimensions always contain complex links.
problem Existence of complex links in high-dimensional embeddings.
method Demonstrated through minimal simplicial complexes in R2n. result Minimal simplicial n-complexes inevitably contain a nonsplittable two-component link. Study of harmonic maps on 2D simplicial complexes, proving existence and regularity.
problem Existence and regularity of harmonic maps between 2D simplicial complexes.
method Extending previous work, study metrics conformal to flat or ideal hyperbolic, proving existence, uniqueness, and regularity of harmonic maps.
result Existence, uniqueness, and regularity results for harmonic maps between 2D simplicial complexes.
New simplicial complexes show unavoidable link of spheres in high dimensions.
problem Finding unavoidable links of spheres in high-dimensional spaces.
method Simple argument in piecewise linear topology and application of the van Kampen--Flores theorem.
result Existence of additional simplicial complexes with unavoidable links of spheres.
These are expanded notes of a course given in Grenoble in june 2004. After a brief description of the harmonic map proof of Margulis' superrigidity and arithmeticity theorems, it is shown how the method might generalize to fundamental groups of simplicial complexes whose links have large enough nonlinear spectral gaps,…
Develops manifold calculus for simplicial complexes.
problem Approximating functors from simplicial complexes to topological spaces.
method Adapting manifold calculus to simplicial complexes and proving an approximation theorem.
result Functors can be approximated by polynomial functors under certain conditions.
Characterizes simplicial complexes embedding into spheres with few vertices.
problem Characterizing simplicial complexes that embed into spheres with few vertices.
method Simple characterization using non-face families and analogy with Fáry's theorem.
result Recovery of van Kampen--Flores theorem and Erd\H os--Ko--Rado theorem.
Proves existence and regularity of energy-minimizing maps between ideal hyperbolic simplicial complexes.
problem Existence and regularity of energy-minimizing maps between ideal hyperbolic simplicial complexes.
method Proves existence and regularity results for energy minimizing maps between ideal hyperbolic 2-dimensional simplicial complexes.
result Establishes existence and regularity of energy-minimizing maps between ideal hyperbolic simplicial complexes.
Discrete version of Liouville's theorem for simplicial complexes.
problem Finding equivalent simplicial complexes under discrete conformal equivalence.
method Proving an analogous statement for simplicial complexes, considering combinatorial equivalence and scale factors associated with vertices.
result All discretely conformally equivalent simplicial complexes are combinatorially equivalent.
We consider closed simplicial and cubical n-complexes in terms of link of their (n−2)-faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every (n−2)-face is contained in 3 or 4 n-faces. Such simplicial complexes with {\em short} (i.e. of length 3 or 4) links are completely classified…
Estimates simplicial volume for complex hyperbolic surfaces.
problem Bounding the simplicial volume of complex hyperbolic surfaces.
method Estimates Gromov norm and uses top dimensional class in Hc4. result Explicit upper bound for simplicial volume.
The paper finds Chern-Simons forms for specific classes in simplicial de Rham complex.
problem None explicitly stated; focuses on finding forms.
method Exhibiting Chern-Simons forms of characteristic classes in simplicial de Rham complex.
result Chern-Simons forms for specific characteristic classes identified.
Extends circle pattern theorem to quasi-simplicial triangulations.
problem Characterize circle patterns on quasi-simplicial triangulated surfaces.
method Use finite covering technique to reduce problem to simplicial case, prove characterization by KAT inequalities.
result Curvature image is characterized by KAT inequalities.
Study the boundary operator property on simplicial complexes, proving essential properties for Hodge theory.
problem Characterize the boundary operator property ∂∂=0 on simplicial complexes. method Characterization in ℓ2 terms of recurrence of links, defining relative cohomology, and proving harmonic eigenforms. result Essential properties for Hodge theory, including weak decomposition and existence of harmonic eigenforms.
New f-vectors reveal geometric Lefschetz-like decompositions of flag spheres.
problem Understanding f-vectors of balanced simplicial complexes and flag spheres. method Analyzing h-vectors and f-vectors of flag spheres and balanced simplicial complexes. result Found f-vectors leading to geometric Lefschetz-like decompositions. Simplicial persistence measures financial market dynamics, revealing long-term structure evolution.
problem Understanding the long-term structure evolution of financial markets.
method Simplicial persistence, null models, TMFG filtering, thresholding, generative process analysis.
result More liquid markets exhibit slower persistence decay, suggesting higher fragility to systemic shocks.
We introduce new simplicial complexes by using various invariants and local moves for knots, which give generalizations of the Gordian complex defined by Hirasawa and Uchida. In particular, we focus on the simplicial complex defined by using the Alexander-Conway polynomial and the Delta-move, and show that the simplici…