标题： 使用有向图混合和合并度量空间 显示英文标题

标题： Mixing and Merging Metric Spaces using Directed Graphs

摘要： 设 $(X_1,d_1),\dots, (X_N,d_N)$ 为度量空间，其中 $d_i: X_i \times X_i \rightarrow [0,1]$ 是 $i=1,\dots,N$ 的距离函数。 设 $\mathcal{X}$ 表示集合论乘积 $X_1\times \cdots \times X_N$。 设$\mathcal{G} = \left(\mathcal{V},\mathcal{E}\right)$是一个顶点集为$\mathcal{V} =\{1,\dots, N\}$的有向图，令$\mathcal{P} = \{p_{ij}\}$是一组权重，其中每个$p_{ij}\in (0, 1]$与边$(i,j) \in \mathcal{E}$相关联。 我们引入由\begin{align*} d_{\mathcal{X},\mathcal{G},\mathcal{P}}(\mathbf{g},\mathbf{h}) := \left(1 - \frac{1}{N}\sum_{j=1}^N \prod_{i=1}^N \left[1- d_i(g_i,h_i)\right]^{\frac{1}{p_{ji}}} \right), \end{align*}定义的函数$d_{\mathcal{X},\mathcal{G},\mathcal{P}}: \mathcal{X}\times \mathcal{X} \to [0,1]$，对所有$\mathbf{g},\mathbf{h} \in \mathcal{X}$都成立。 在本文中，我们证明$d_{\mathcal{X},\mathcal{G},\mathcal{P}}$在$\mathcal{X}$上定义了一个度量空间。 然后我们确定这种距离在各种图运算下的行为，包括不相交并集和笛卡尔积。 我们研究了两个极限情况：(a) 当$d_{\mathcal{X},\mathcal{G},\mathcal{P}}$在有限域上定义时，导致了在纠错码理论中常被研究的基于图的距离的广泛推广；以及 (b) 当度量扩展到图子时，使得在连续图极限设置中能够测量距离。 显示英文摘要

摘要： Let $(X_1,d_1),\dots, (X_N,d_N)$ be metric spaces, where $d_i: X_i \times X_i \rightarrow [0,1]$ is a distance function for $i=1,\dots,N$. Let $\mathcal{X}$ denote the set theoretic product $X_1\times \cdots \times X_N$. Let $\mathcal{G} = \left(\mathcal{V},\mathcal{E}\right)$ be a directed graph with vertex set $\mathcal{V} =\{1,\dots, N\}$, and let $\mathcal{P} = \{p_{ij}\}$ be a collection of weights, where each $p_{ij}\in (0, 1]$ is associated with the edge $(i,j) \in \mathcal{E}$. We introduce the function $d_{\mathcal{X},\mathcal{G},\mathcal{P}}: \mathcal{X}\times \mathcal{X} \to [0,1]$ defined by \begin{align*} d_{\mathcal{X},\mathcal{G},\mathcal{P}}(\mathbf{g},\mathbf{h}) := \left(1 - \frac{1}{N}\sum_{j=1}^N \prod_{i=1}^N \left[1- d_i(g_i,h_i)\right]^{\frac{1}{p_{ji}}} \right), \end{align*} for all $\mathbf{g},\mathbf{h} \in \mathcal{X}$. In this paper we show that $d_{\mathcal{X},\mathcal{G},\mathcal{P}}$ defines a metric space over $\mathcal{X}$. Then we determine how this distance behaves under various graph operations, including disjoint unions and Cartesian products. We investigate two limiting cases: (a) when $d_{\mathcal{X},\mathcal{G},\mathcal{P}}$ is defined over a finite field, leading to a broad generalization of graph-based distances commonly studied in error-correcting code theory; and (b) when the metric is extended to graphons, enabling the measurement of distances in a continuous graph limit setting.