相关论文: Harmonic nets in metric spaces

In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…

We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…

This paper concerns models and convergence principles for dealing with stochasticity in a wide range of algorithms arising in nonlinear analysis and optimization in Hilbert spaces. It proposes a flexible geometric framework within which…

We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…

The category of metric spaces is a subcategory of quasi-metric spaces. In this paper the notion of entropy for the continuous maps of a quasi-metric space is extended via spanning and separated sets. Moreover, two metric spaces that are…

Some years ago, the harmonic polynomial was introduced in order to understand better the harmonic topological index; for instance, it allows to obtain bounds of the harmonic index of the main products of graphs. Here, we obtain several…

We prove uniqueness of equivariant harmonic maps into irreducible symmetric spaces of non-compact type and Euclidean buildings associated to isometric actions by Zariski dense subgroups.

In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erd\H{o}s-R\'{e}nyi model or the Barab\'{a}si-Albert model. Unfortunately, most graph generating…

We characterize the smallest finite spaces with the same homotopy groups of the spheres. Similarly, we describe the minimal finite models of any finite graph. We also develop new combinatorial techniques based on finite spaces to study…

We give an alternative proof for the fact that in $n$-dimensional Alexandrov spaces with curvature bounded below there exists a unique optimal transport plan from any purely $(n-1)$-unrectifiable starting measure, and that this plan is…

Given a complete doubling metric measure space $X$ that supports a $2$-Poincar\'e inequality, we approximate harmonic functions on a bounded domain $\Omega$ with a prescribed Newton-Sobolev boundary data. Our approach is based on the…

We study the inertia of distance matrices of weighted graphs. Our novel congruence-based proof of the inertia of weighted trees extends to a proof for the inertia of weighted unicyclic graphs whose cycle is a triangle. Partial results are…

In this work we provide a new technique to design fast approximation algorithms for graph problems where the points of the graph lie in a metric space. Specifically, we present a sampling approach for such metric graphs that, using a…

This manuscript is the first in a series of instalments that investigate spherically symmetric solutions within the effective dynamics program of Loop Quantum Gravity. The choice of lattice is adapted such that it remains invariant under a…

Certain notions of convergence of sequences functions such as pointwise convergence and (uniform) convergence on compact or bounded sets come from suitable topological function spaces; see [1]. Under certain conditions these topologies…

Grouping the nodes of a graph into clusters is a standard technique for studying networks. We study a problem where we are given a directed network and are asked to partition the graph into a sequence of coherent groups. We assume that…

This is primarily a survey of the developments in the theory of harmonic maps of finite uniton number (or unitons) which have taken place since the introduction of extended solutions by Uhlenbeck. Such maps include all harmonic maps from…

We investigate integral-geometric quantities arising from harmonic analysis which measure visibility and transversality. Motivated by their applications in multilinear Kakeya problems and affine-invariant measures on surfaces, we derive…

A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…

Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…