Related papers: On Divergence-based Distance Functions for Multipl…
Distance distributions are a key building block in stochastic geometry modelling of wireless networks and in many other fields in mathematics and science. In this paper, we propose a novel framework for analytically computing the closed…
This work proposes a tentative model for the calculation of dimensionless distances between phonemes; sounds are described with binary distinctive features and distances show linear consistency in terms of such features. The model can be…
We study several quantities associated to the Green's function of a multiply connected domain in the complex plane. Among them are some intrinsic properties such as geodesics, curvature, and $L^2$-cohomology of the capacity metric and…
Given positive measures $\nu,\mu$ on an arbitrary measurable space $(\Omega, \mathcal F)$, we construct a sequence of finite partitions $(\pi_n)_n$ of $(\Omega, \mathcal F)$ s.t. $$ \sum_{A\in \pi_n: \mu(A)>0} 1_{A} \frac{\nu(A)}{\mu(A)}…
Distances in a network capture relations between nodes and are the basis of centrality, similarity, and influence measures. Often, however, the relevance of a node $u$ to a node $v$ is more precisely measured not by the magnitude of the…
The "separation dimension" of a graph $G$ is the minimum positive integer $d$ for which there is an embedding of $G$ into $\mathbb{R}^d$, such that every pair of disjoint edges are separated by some axis-parallel hyperplane. We prove a…
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…
Recently, Differentiable Ray Tracing has been successfully applied in the field of wireless communications for learning radio materials or optimizing the transmitter orientation. However, in the frame of gradient based optimization,…
Given a continuous function $f:[a,b]\to\mathbb{R}$ such that $f(a)=f(b)$, we investigate the set of distances $|x-y|$ where $f(x)=f(y)$. In particular, we show that the only distances this set must contain are ones which evenly divide…
Phylogenetic inference-the derivation of a hypothesis for the common evolutionary history of a group of species- is an active area of research at the intersection of biology, computer science, mathematics, and statistics. One assumes the…
Let $L$ be a second-order, homogeneous, constant (complex) coefficient elliptic system in ${\mathbb{R}}^n$. The goal of this article is provide a qualitative and quantitative study of the nature of the Green function associated with the…
We investigate the location of the maximal gradient of the torsion function on certain non-symmetric planar domains. First, by establishing uniform estimates for convex narrow domains, we show that as a planar domain bounded by two graphs…
Starting with a similarity function between objects, it is possible to define a distance metric on pairs of objects, and more generally on probability distributions over them. These distance metrics have a deep basis in functional analysis,…
Finding minima of a real valued non-convex function over a high dimensional space is a major challenge in science. We provide evidence that some such functions that are defined on high dimensional domains have a narrow band of values whose…
We prove that any weakly differentiable function with square integrable gradient can be extended to a capacitary boundary of any simply connected plane domain $\Omega\ne\mathbb R^2$ except a set of a conformal capacity zero. For locally…
Let $\overline{\mathbb{D}}$ be the closure of the unit disk $\mathbb{D}$ in the complex plane $\mathbb{C}$ and $g$ be a continuous function in $\overline{\mathbb{D}}$. In this paper, we discuss some characterizations of elliptic mappings…
Data consisting of a graph with a function mapping into $\mathbb{R}^d$ arise in many data applications, encompassing structures such as Reeb graphs, geometric graphs, and knot embeddings. As such, the ability to compare and cluster such…
Distance well-defined graphs consist of connected undirected graphs, strongly connected directed graphs and strongly connected mixed graphs. Let $G$ be a distance well-defined graph, and let ${\sf D}(G)$ be the distance matrix of $G$.…
We consider structured optimisation problems defined in terms of the sum of a smooth and convex function, and a proper, l.s.c., convex (typically non-smooth) one in reflexive variable exponent Lebesgue spaces $L_{p(\cdot)}(\Omega)$. Due to…
The problem of how to estimate diffusion on a graph effectively is of importance both theoretically and practically. In this paper, we make use of two widely studied indices, geodesic distance and mean first-passage time ($MFPT$) for random…