arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1702.07832cs.DScs.DMmath.CO
收藏

由关联数组构造邻接数组

Constructing Adjacency Arrays from Incidence Arrays

Hayden Jananthan, Karia Dibert, Jeremy Kepner

摘要:

图构造是数据处理流水线中的基本操作,通常通过将图的关联阵列表示$\mathbf{E}_\mathrm{in}$和$\mathbf{E}_\mathrm{out}$相乘以产生可以用各种算法处理的图的邻接阵列$\mathbf{A}$来完成。本文给出了判定乘积$\mathbf{A} = \mathbf{E}^{\sf T}_\mathrm{out}\mathbf{E}_\mathrm{in}$是否具有图的邻接数组所需结构的数学判据。结果邻接数组中的值由用于执行数组乘法的相应加法$\oplus$和乘法$\otimes$操作确定。使用流行音乐元数据的小集合来提供来自不同$\oplus$和$\otimes$操作的可能的各种结果的图示。

英文摘要:

Graph construction, a fundamental operation in a data processing pipeline, is typically done by multiplying the incidence array representations of a graph, $\mathbf{E}_\mathrm{in}$ and $\mathbf{E}_\mathrm{out}$, to produce an adjacency array of the graph, $\mathbf{A}$, that can be processed with a variety of algorithms. This paper provides the mathematical criteria to determine if the product $\mathbf{A} = \mathbf{E}^{\sf T}_\mathrm{out}\mathbf{E}_\mathrm{in}$ will have the required structure of the adjacency array of the graph. The values in the resulting adjacency array are determined by the corresponding addition $\oplus$ and multiplication $\otimes$ operations used to perform the array multiplication. Illustrations of the various results possible from different $\oplus$ and $\otimes$ operations are provided using a small collection of popular music metadata.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑