相关论文: Harmonic nets in metric spaces

In the present paper, we apply Alexandrov geometry methods to study geometric analysis aspects of infinite semiplanar graphs with nonnegative combinatorial curvature in the sense of Higuchi. We obtain the metric classification of these…

Knowing which parts of a complex system have identical roles simplifies computations and reveals patterns in its network structure. Group theory has been applied to study symmetries in unweighted networks. However, in real-world weighted…

Motivated by geometry processing for surfaces with non-trivial topology, we study discrete harmonic maps between closed surfaces of genus at least two. Harmonic maps provide a natural framework for comparing surfaces by minimizing…

$\infty$-Harmonic maps are a generalization of $\infty$-harmonic functions. They can be viewed as the limiting cases of p-harmonic maps as p goes to infinity. In this paper, we give complete classifications of linear and quadratic…

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 consider infinite weighted graphs $G$, i.e., sets of vertices $V$, and edges $E$ assumed countable infinite. An assignment of weights is a positive symmetric function $c$ on $E$ (the edge-set), conductance. From this, one naturally…

A new Hardy space Hardy space approach of Dirichlet type problem based on Tikhonov regularization and Reproducing Hilbert kernel space is discussed in this paper, which turns out to be a typical extremal problem located on the upper…

Harmonic centrality calculates the importance of a node in a network by adding the inverse of the geodesic distances of this node to all the other nodes. Harmonic centralization, on the other hand, is the graph-level centrality score based…

Recently, the influence of potentially present symmetries has begun to be studied in complex networks. A typical way of studying symmetries is via the automorphism group of the corresponding graph. Since complex networks are often subject…

We determine the local geometric structure of two-dimensional metric spaces with curvature bounded above as the union of finitely many properly embedded/branched immersed Lipschitz disks. As a result, we obtain a graph structure of the…

Metric networks are network-shaped, one-dimensional structures on which one can solve differential equations to simulate a wide range of physical systems including conjugated molecules, photonic crystals, quantum mechanics in waveguide…

We describe recent achievements in the theory of weight systems, which are functions on chord diagrams satisfying so-called $4$-term relations. Our main attention is devoted to constructions of weight systems. The two main sources of these…

We study independent and identically distributed random iterations of continuous maps defined on a connected closed subset $S$ of the Euclidean space $\mathbb{R}^{k}$. We assume the maps are monotone (with respect to a suitable partial…

Topological conjugateness of one dimensional unimodal dynamical systems, which are generated by interval [0, 1] into itself maps are studied. We study the smoothness and differentiability of the conjugacy of symmetrical and non-symmetrical…

In the paper we are dealing with metric measure spaces of diameter at most one and of total measure one. Gromov introduced the sampling compactification of the set of these spaces. He asked whether the metric measure space invariants extend…

We suggest a new method of describing invariant measures on Markov compacta and path spaces of graphs, and thus of describing characters of some groups and traces of AF-algebras. The method relies on properties of filtrations associated…

Quantification of symmetries in complex networks is typically done globally in terms of automorphisms. Extending previous methods to locally assess the symmetry of nodes is not straightforward. Here we present a new framework to quantify…

We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…

A geometric entropy is defined as the Riemannian volume of the parameter space of a statistical manifold associated with a given network. As such it can be a good candidate for measuring networks complexity. Here we investigate its ability…

We apply the topological quantization method to some gravitational fields which can be represented as generalized harmonic maps. This representation extends the well-known concept of harmonic maps and allows us to describe some solutions to…