相关论文: Borel Liftings of Graph Limits

We study the class of Borel equivalence relations under continuous reducibility. In particular , we characterize when a Borel equivalence relation with countable equivalence classes is $\Sigma$ 0 $\xi$ (or $\Pi$ 0 $\xi$). We characterize…

We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…

A new method of hierarchical clustering of graph vertexes is suggested. In the method, the graph partition is determined with an equivalence relation satisfying a recursive definition stating that vertexes are equivalent if the vertexes…

In this note, I study a comparison map between a motivic and \'{e}tale cohomology group of an elliptic curve over $\mathbb{Q}$ just outside the range of Voevodsky's isomorphism theorem. I show that the property of an appropriate version of…

We systematically investigate three different equivalence relations of connectedness: being connected by arcs, being connected by continua and being connected by chains of continua of decreasing diameter. The investigation is conducted from…

We generalize subgraph densities, arising in dense graph limit theory, to Markov spaces (symmetric measures on the square of a standard Borel space). More generally, we define an analogue of the set of homomorphisms in the form of a measure…

A topological space is almost locally compact if it contains a dense locally compact subspace. We generalize a result from \cite{Ma}, showing that isomorphism on Borel classes of almost locally compact Polish metric structures is always…

A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel.…

In this paper we prove several lifting theorems for morphisms of tropical curves. We interpret the obstruction to lifting a finite harmonic morphism of augmented metric graphs to a morphism of algebraic curves as the non-vanishing of…

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

The Borel map takes a smooth function to its infinite jet of derivatives (at zero). We study the restriction of this map to ultradifferentiable classes of Beurling type in a very general setting which encompasses the classical…

Most graph query languages are rooted in logic. By contrast, in this paper we consider graph query languages rooted in linear algebra. More specifically, we consider MATLANG, a matrix query language recently introduced, in which some basic…

Recent work of the author established dual representation theorems for certain vector spaces that arise in an important article of Allcock and Vaaler. These results constructed an object called a consistent map which acts like a measure on…

We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…

The set theory relations \in, \backslash, \Delta, \cap, and \cup have corollaries in subspace relations. Geometric Algebra is introduced as the ideal framework to explore these subspace operations. The relations \in, \backslash, and \Delta…

In this paper, we develop the theory of Sobolev spaces on locally finite graphs, including completeness, reflexivity, separability, and Sobolev inequalities. Since there is no exact concept of dimension on graphs, classical methods that…

We provide a characterization of when a coarse equivalence between coarse disjoint unions of expander graphs is close to a bijective coarse equivalence. We use this to show that if the uniform Roe algebras of coarse disjoint unions of…

We generalize the notion of quasirandom which concerns a class of equivalent properties that random graphs satisfy. We show that the convergence of a graph sequence under the spectral distance is equivalent to the convergence using the…

We develop the theory of halving spaces to obtain lower bounds in real enumerative geometry. Halving spaces are topological spaces with an action of a Lie group $\Gamma$ with additional cohomological properties. For $\Gamma=\mathbb{Z}_2$ we…

We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…