Related papers: On Completion of Metric Mappings
We consider the problem of finding embedded closed geodesics on the two-sphere with an incomplete metric defined outside a point. Various techniques including curve shortening methods are used.
The goal of this article is to survey various results concerning stochastic completeness of graphs. In particular, we present a variety of formulations of stochastic completeness and discuss how a discrepancy between uniqueness class and…
The first aim of this paper is to examine some important properties of soft metric spaces. Second is to introduce soft continuous mappings and investigate properties of soft continuous mappings. Third is to prove some fixed point theorems…
A natural metric on the space of all almost hermitian structures on a given manifold is investigated.
Mining for trees in a graph is shown to be NP-complete.
We study online robust matrix completion on graphs. At each iteration a vector with some entries missing is revealed and our goal is to reconstruct it by identifying the underlying low-dimensional subspace from which the vectors are drawn.…
We prove that a conformal mapping defined on the unit disk belongs to a weighted Bergman space if and only if certain integrals involving the harmonic measure converge. With the aid of this theorem, we give a geometric characterization of…
In this paper we prove some new fixed point theorems for multivalued mappings on orbitally complete uniform spaces.
In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…
The complexity of highly interconnected systems is rooted in the interwoven architecture defined by its connectivity structure. In this paper, we develop matrix energy of the underlying connectivity structure as a measure of topological…
We introduce a new type of mappings in metric space which are three-point analogue of the well-known Chatterjea type mappings, and call them generalized Chatterjea type mappings. It is shown that such mappings can be discontinuous as is the…
We derive an algorithm of optimal complexity which determines whether a given matrix is a Cauchy matrix, and which exactly recovers the Cauchy points defining a Cauchy matrix from the matrix entries. Moreover, we study how to approximate a…
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…
A contractive condition is addressed for extended 2-cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same subsets of its domain. It is…
In this paper we investigate Cauchy completeness and exponentiablity for quantale enriched categories, paying particular attention to probabilistic metric spaces.
This paper is concerned with the taxonomy of finitely complete categories, based on 'matrix properties' - these are a particular type of exactness properties that can be represented by integer matrices. In particular, the main result of the…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
We consider the Cauchy problem for the wave equation in the whole space, R^n, with initial data which are distributions supported on finite sets. The main result is a precise description of the geometry of the sets of stationary points of…
We survey some aspects of the perfect matching problem in hypergraphs, with particular emphasis on structural characterisation of the existence problem in dense hypergraphs and the existence of designs.
A new metric for quantifying pairwise vertex connectivity in graphs is defined and an implementation presented. While general in nature, it features a combination of input features well-suited for social networks, including applicability to…