相关论文: Borel Liftings of Graph Limits
We give a cohomological criterion for certain decomposition of Borel graphs, which is an analog of Dunwoody's work on accessibility of groups. As an application, we prove that a Borel graph $(X,G)$ with uniformly bounded degrees of…
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
We geometrically describe the relation induced on a set of graphs by isomorphism of their associated graph C*-algebras as the smallest equivalence relation generated by five types of moves. The graphs studied have finitely many vertices and…
In this note we present some abstract ideas how one can construct spaces from building blocks according to a graph. The coupling is expressed via boundary pairs, and can be applied to very different spaces such as discrete graphs, quantum…
Metrizable spaces are studied in which every closed set is an $\alpha$-limit set for some continuous map and some point. It is shown that this property is enjoyed by every space containing sufficiently many arcs (formalized in the notion of…
We determine the exact complexity of classifying compact metric spaces up to homeomorphism. More precisely, the homeomorphism relation on compact metric spaces is Borel bi-reducible with the complete orbit equivalence relation of Polish…
Consider the semialgebraic structure over the real field. More generally, let an ominimal structure be over a real closed field. We show that a definable metric space X with a definable metric d is embedded into a Euclidean space so that…
This paper is devoted to introduce a topology on BL-algebras, makes them semitopological algebras. For any BL-algebra $\mathcal{L}=(L, \wedge, \vee, *, \to , 0, 1)$, the introduced topology is defined by a distance-like function between…
We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially…
We analytically study proximity and distance properties of various kernels and similarity measures on graphs. This helps to understand the mathematical nature of such measures and can potentially be useful for recommending the adoption of…
In this article, we study an analogue of $tt$-reducibility for points in computable metric spaces. We characterize the notion of the metric $tt$-degree in the context of first-level Borel isomorphism. Then, we study this concept from the…
We provide an algorithm to check whether two rational space curves are related by a similarity. The algorithm exploits the relationship between the curvatures and torsions of two similar curves, which is formulated in a computer algebra…
Let $G$ be a graph each edge $e$ of which is given a length $\ell(e)$. This naturally induces a distance $d_\ell(x,y)$ between any two vertices $x,y$, and we let $\ell-TOP$ denote the completion of the corresponding metric space. It turns…
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver and Harrington-Kechris-Louveau show that with respect to Borel reducibility, any…
The author has recently introduced abstract algebraic frameworks of analogical proportions and similarity within the general setting of universal algebra. The purpose of this paper is to build a bridge from similarity to analogical…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
We prove a Borel version of the local lemma, i.e. we show that, under suitable assumptions, if the set of variables in the local lemma has a structure of a Borel space, then there exists a satisfying assignment which is a Borel function.…
We study the relationship between two key concepts in the theory of (di)graphs: the quotient digraph, and the lift $\Gamma^{\alpha}$ of a base (voltage) digraph. These techniques contract or expand a given digraph in order to study its…
We prove that for any countable finite dimensional CAT(0) cube complex, the Borel median graph on its Roller compactification has the Borel asymptotic dimension bounded from above by its dimension.