Related papers: Integration and measures on the space of countable…
We consider a Random Graph Model on $\mathbb{Z}^{d}$ that incorporates the interplay between the statistics of the graph and the underlying space where the vertices are located. Based on a graphical construction of the model as the…
Let $G = (V,E)$ be a connected graph. A probability measure $\mu$ on $V$ is called "balanced" if it has the following property: if $T_\mu(v)$ denotes the "earth mover's" cost of transporting all the mass of $\mu$ from all over the graph to…
The space of $G$-invariant metrics on a homogeneous space $G/H$ is in one-to-one correspondence with the set of inner products on the tangent space $\fr{m}\cong T_{{\it o}}(G/H)$, which are invariant under the isotropy representation. When…
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…
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…
Let $G=(V(G), E(G))$ be an undirected graph with a measure function $\mu$ assigning non-negative values to subgraphs $H$ so that $\mu(H)$ does not exceed the clique cover number of $H$. When $\mu$ satisfies some additional natural…
One considers Hilbert space valued measures on the Borel sets of a compact metric space. A natural numerical valued integral of vector valued continuous functions with respect to vector valued functions is defined. Using this integral,…
Since its introduction as a computable approximation of the Reeb graph, the Mapper graph has become one of the most popular tools from topological data analysis for performing data visualization and inference. However, finding an…
We study when the integration maps of vector measures can be computed as pointwise limits of their finite rank Radon-Nikod\'ym derivatives. We will show that this can sometimes be done, but there are also principal cases in which this…
We present a framework for embedding graph structured data into a vector space, taking into account node features and topology of a graph into the optimal transport (OT) problem. Then we propose a novel distance between two graphs, named…
In this paper, we use analysis on graphs to study quantitative measures of segregation. We focus on a classical statistic from the geography and urban sociology literature known as Moran's I, which in our language is a score associated to a…
Given a set of vertices $S=\{v_1,v_2,...,v_k\}$ of a connected graph $G$, the metric representation of a vertex $v$ of $G$ with respect to $S$ is the vector $r(v|S)=(d(v,v_1),d(v,v_2),...,d(v,v_k))$, where $d(v,v_i)$, $i\in \{1,...,k\}$…
Geometric graphs appear in many real-world data sets, such as road networks, sensor networks, and molecules. We investigate the notion of distance between embedded graphs and present a metric to measure the distance between two geometric…
We show that a doubling measure on the plane can give positive measure to the graph of a continuous function. This answers a question by Wang, Wen and Wen. Moreover we show that the doubling constant of the measure can be chosen to be…
Motivated by applications in classification of vector valued measures and multispecies PDE, we develop a theory that unifies existing notions of vector valued optimal transport, from dynamic formulations (\`a la Benamou-Brenier) to static…
Building on the author's recent work with Jan Maas and Jan van Neerven, this paper establishes the equivalence of two norms (one using a maximal function, the other a square function) used to define a Hardy space on $\R^{n}$ with the…
To each finite-dimensional representation of a simple Lie algebra is associated a multiplicative graph in the sense of Kerov and Vershik definedfrom the decomposition of its tensor powers into irreducible components. The conditioning of…
(abridged)The achievements of the present work include: a) A clarification of the multiple definition given by Bergmann of the concept of {\it (Bergmann) observable. This clarification leads to the proposal of a {\it main conjecture}…
Dynamic graph embedding has gained great attention recently due to its capability of learning low dimensional graph representations for complex temporal graphs with high accuracy. However, recent advances mostly focus on learning node…
In this paper, replacing `equality' by 'equality almost everywhere' we modify several terms associated with the ring of measurable functions defined on a measure space $(X, \mathcal{A}, \mu)$ and thereby study the graph theoretic features…