Related papers: Quantifying the structural stability of simplicial…
The symmetric group on a set acts transitively on its subsets of a given size. We define homomorphisms between the corresponding permutation modules, defined over a field of characteristic two, which generalize the boundary maps from…
Persistent homology has been studied to better understand the structural properties and topology features of weighted networks. It can reveal hidden layers of information about the higher-order structures formed by non-pairwise interactions…
We use Topological Data Analysis tools for studying the inner organization of cells in segmented images of epithelial tissues. More specifically, for each segmented image, we compute different persistence barcodes, which codify lifetime of…
Optimization, a key tool in machine learning and statistics, relies on regularization to reduce overfitting. Traditional regularization methods control a norm of the solution to ensure its smoothness. Recently, topological methods have…
A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…
We study quotients of mapping class groups (\Gamma_{g,1}) of oriented surfaces with one boundary component by terms of their Johnson filtrations, and we show that the homology of these quotients with suitable systems of twisted coefficients…
The structure of interactions in most of animals and human societies can be best represented by complex hierarchical networks. In order to maintain close to optimal functioning both stability and adaptability are necessary. Here we…
We prove a new kind of stabilisation result, "secondary homological stability", for the homology of mapping class groups of orientable surfaces with one boundary component. These results are obtained by constructing CW approximations to the…
The study of the interplay between the structure and dynamics of complex multilevel systems is a pressing challenge nowadays. In this paper, we use a semi-annealed approximation to study the stability properties of Random Boolean Networks…
In this article we study the expanding properties of random perturbations of contracting Lorenz maps satisfying the summability condition of exponent 1. Under general conditions on the maps and perturbation types, we prove stochastic…
We consider heterogeneous coupling problems on an abstract level, establishing fundamental principles of domain decomposition agnostic to the solvers of the local subproblems. Introducing a coupling framework reminiscent of FETI methods,…
We study $\epsilon$-representations of discrete groups by unitary operators on a Hilbert space. We define the notion of Ulam stability of a group which loosely means that finite-dimensional $\epsilon$-represendations are uniformly close to…
Simplicial complexes capture the underlying network topology and geometry of complex systems ranging from the brain to social networks. Here we show that algebraic topology is a fundamental tool to capture the higher-order dynamics of…
We introduce a new map between configuration spaces of points in a background manifold - the replication map - and prove that it is a homology isomorphism in a range with certain coefficients. This is particularly of interest when the…
Biological and physical systems often exhibit distinct structures at different spatial/temporal scales. Persistent homology is an algebraic tool that provides a mathematical framework for analyzing the multi-scale structures frequently…
We study connected components of the Morse boundary and their stabilisers. We introduce the notion of point-convergence and show that if the set of non-singleton connected components of the Morse boundary of a finitely generated group $G$…
We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…
We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homologically connected, meaning that its zero-th and first…
A central problem in data-driven scientific inquiry is how to interpret structure in noisy, high-dimensional data. Topological data analysis (TDA) provides a solution via persistent homology, which encodes features of interest as…
We show that in closed string topology and in open-closed string topology with one $D$-brane, higher genus stable string operations are trivial. This is a consequence of Harer's stability theorem and related stability results on the…