The tag has no usage guidance.

learn more… | top users | synonyms

0
votes
0answers
22 views

How would I derive the Hellinger distance from the Hellinger integral?

What function would I integrate to derive the following expression: $d(H_1,H_2) = \sqrt{1 - \frac{1}{\sqrt{\bar{H_1} \bar{H_2} N^2}} \sum_I \sqrt{H_1(I) \cdot H_2(I)}}\\$ I understand that this is ...
0
votes
0answers
32 views

measure of the distance between two joint distributions

I am trying to measure the 'closeness' of two joint distributions. Specifically, I have I have economic supply curves for different time periods. Each curve is made up of a vector of prices and ...
3
votes
0answers
136 views

Edit distance vs. canonical adjacency matrix distance

Let $G$ and $G'$ be two simple random graphs on the same set of nodes. Let $d_{edit}$ be the edit distance between $G$ and $G'$. Let $\mathbf{A}$ and $\mathbf{A'}$ be the adjacency matrices of the ...
1
vote
0answers
78 views

Of the standard distance metrics, which ones can/cannot be embedded in Euclidean space?

Given the discussion from: Representability of finite metric spaces it appears that a 1974 paper by Morgan gives the criteria for when a distance metric can be embedded in Euclidean space. My first ...
1
vote
0answers
312 views

Possible ways to create a graph representation from a distance matrix (through approximation)

Forgive me, Im not math professional, but a computer scientist at the beginning of my base research from my thesis, so bare with me if I miss something blatantly obvious. I have a Euclidean distance ...
2
votes
0answers
64 views

Looking for similar centrality measurement on graph

I'm working on a graph problem somehow related to centrality measurement. Given an undirected, unweighted tree $T$ and a vertex $v$, let $D_i(v)$ be the set of vertices in $T$ that are i hops from $v$,...
3
votes
2answers
502 views

Distance between two networks

Suppose you have networks A and B, each with a set of nodes and edges. You want to measure how similar the networks are to each-other. None of the nodes or edges are labelled. What are the metric(s) ...
0
votes
1answer
137 views

Graphs with circulant distance matrices

The cycle has this property. For instance, the distance matrix for a 6-cycle is: $A=\begin{bmatrix} 0 & 1 & 2 & 3 & 2 & 1 \\\\ 1 & 0 & 1 &...
3
votes
2answers
252 views

Graphs with a unique transmission value

If $G$ is a graph with distance function $d(x,y)$ between vertices, the transmission of a vertex $x \in v(G)$ is defined as $\sigma_{x}=\sum_{y \neq x}{d(x,y)}$. I want to know if there is a known ...