相关论文: Harmonic nets in metric spaces

In this survey, we explore recent literature on finding the cores of higher graphs using geometric and topological means. We study graphs, hypergraphs, and simplicial complexes, all of which are models of higher graphs. We study the notion…

We construct the differential geometry of smooth manifolds equipped with an algebraic curvature map acting as an area measure. Area metric geometry provides a spacetime structure suitable for the discussion of gauge theories and strings,…

Another connection of harmonic maps to gravity is presented. Using 1-soliton and anti-soliton solutions of the sine-Gordon equation, we construct a pair of harmonic maps that we express in terms of a particular dilaton field in…

Geometric graphs are a special kind of graph with geometric features, which are vital to model many scientific problems. Unlike generic graphs, geometric graphs often exhibit physical symmetries of translations, rotations, and reflections,…

In this paper we relate a well-known in symplectic geometry compactification of the space of symmetric bilinear forms considered as a chart of the Lagrangian Grassmannian to the specific compactifications of the space of electrical networks…

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…

This paper addresses the approximation of fractional harmonic maps. Besides a unit-length constraint, one has to tackle the difficulty of nonlocality. We establish weak compactness results for critical points of the fractional Dirichlet…

Let $S$ be a surface with a metric $d$ satisfying an upper curvature bound in the sense of Alexandrov (i.e. via triangle comparison). We show that an almost conformal harmonic map from a surface into $(S,d)$ is a branched covering. As a…

Analog layout synthesis requires some elements in the circuit netlist to be matched and placed symmetrically. However, the set of symmetries is very circuit-specific and a versatile algorithm, applicable to a broad variety of circuits, has…

We present a simple iterative strategy for measuring the connection strength between a pair of vertices in a graph. The method is attractive in that it has a linear complexity and can be easily parallelized. Based on an analysis of the…

Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…

We construct examples of centrally harmonic spaces by generalizing work of Copson and Ruse. We show that these examples are generically not centrally harmonic at other points. We use this construction to exhibit manifolds which are not…

We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…

We define a class of spaces on which one may generalise the notion of compactness following motivating examples from higher-dimensional number theory. We establish analogues of several well-known topological results (such as Tychonoff's…

The aim of this study is to analyze the properties of harmonic fields in the vicinity of rough boundaries where either a constant potential or a zero flux is imposed, while a constant field is prescribed at an infinite distance from this…

Spaces of quasi-invariant measures supplied with different topologies are studied. Their embeddings, projective decompositions, conditions for their metrizability are investigated. Theorems about convergence of nets of quasi-invariant…

A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative…

We study the properties of several proximity measures for the vertices of weighted multigraphs and multidigraphs. Unlike the classical distance for the vertices of connected graphs, these proximity measures are applicable to weighted…

We study hierarchical clusterings of metric spaces that change over time. This is a natural geometric primitive for the analysis of dynamic data sets. Specifically, we introduce and study the problem of finding a temporally coherent…

We propose the concepts of vicinal mappings and firmly vicinal mappings in metric spaces. We obtain fixed point and convergence theorems for these mappings in complete geodesic spaces with curvature bounded above by one and apply our…