相关论文: Persistent Combinatorial Model of the Restricted S…

We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles' control parameters relative to the number of…

In this paper, we consider the approximate weighted graph matching problem and introduce stable and informative first and second order compatibility terms suitable for inclusion into the popular integer quadratic program formulation. Our…

We relate star colouring of even-degree regular graphs to the notions of locally constrained graph homomorphisms to the oriented line graph $ \vec{L}(K_q) $ of the complete graph $ K_q $ and to its underlying undirected graph $ L^*(K_q) $.…

Separating multiple graph signals from a single observed mixture is an inherently ill-posed problem that traditionally relies on restrictive and handcrafted priors. This letter addresses this challenge by proposing an unsupervised learnable…

Persistence diagrams play a fundamental role in Topological Data Analysis where they are used as topological descriptors of filtrations built on top of data. They consist in discrete multisets of points in the plane $\mathbb{R}^2$ that can…

We introduce the concept of weighted persistence diagrams and develop a functorial pipeline for constructing them from finite metric measure spaces. This builds upon an existing functorial framework for generating classical persistence…

We propose an extension of the classical union-of-balls filtration of persistent homology: fixing a point $q$, we focus our attention to a ball centered at $q$ whose radius is controlled by a second scale parameter. We discuss an absolute…

Bifiltered graphs are a versatile tool for modelling relations between data points across multiple grades of a two-dimensional scale. They are especially popular in topological data analysis, where the homological properties of the induced…

Given two weighted graphs $(X,b_k,m_k)$, $k=1,2$ with $b_1\sim b_2$ and $m_1\sim m_2$, we prove a weighted $L^1$-criterion for the existence and completeness of the wave operators $ W_{\pm}(H_{2},H_1, I_{1,2})$, where $H_k$ denotes the…

Persistent homology has become an important tool for extracting geometric and topological features from data, whose multi-scale features are summarized in a persistence diagram. From a statistical perspective, however, persistence diagrams…

This paper studies the relationship between a graph neural network (GNN) and a manifold neural network (MNN) when the graph is constructed from a set of points sampled from the manifold, thus encoding geometric information. We consider…

The Singer algebraic transfer is a fundamental homomorphism in algebraic topology, providing a bridge between the homology of classifying spaces and the cohomology of the Steenrod algebra $\mathcal{A}$, which forms the $E_2$-term of the…

A multifiltration is a functor indexed by $\mathbb{N}^r$ that maps any morphism to a monomorphism. The goal of this paper is to describe in an explicit and combinatorial way the natural $\mathbb{N}^r$-graded $R[x_1,\ldots, x_r]$-module…

We develop a general formalism for the parameter-space metric of the multi-detector F-statistic, which is a matched-filtering detection statistic for continuous gravitational waves. We find that there exists a whole family of F-statistic…

We develop the first algorithms for computing the Skyscraper Invariant [FJNT24]. This is a filtration of the classical rank invariant for multiparameter persistence modules defined by the Harder-Narasimhan filtrations along every central…

Swarm and constellation reconfiguration can be viewed as motion of an unordered point configuration in an ambient space. Here, we provide persistence-stable, symmetry-invariant geometric representations for comparing and monitoring…

For many random Constraint Satisfaction Problems, by now, we have asymptotically tight estimates of the largest constraint density for which they have solutions. At the same time, all known polynomial-time algorithms for many of these…

The NP-hard 2-Club problem is, given an undirected graph G=(V,E) and l\in N, to decide whether there is a vertex set S\subseteq V of size at least l such that the induced subgraph G[S] has diameter at most two. We make progress towards a…

The \textsc{Bipartite Contraction} problem is to decide, given a graph $G$ and a parameter $k$, whether we can can obtain a bipartite graph from $G$ by at most $k$ edge contractions. The fixed-parameter tractability of the problem was shown…

Given a graph $G$ and a positive integer $k$, the 2-Load coloring problem is to check whether there is a $2$-coloring $f:V(G) \rightarrow \{r,b\}$ of $G$ such that for every $i \in \{r,b\}$, there are at least $k$ edges with both end…