图子的一致线性嵌入
Uniform linear embeddings of graphons
摘要:
设$w:[0,1]^2\rightarrow [0,1]$为对称函数,考虑随机过程$G(n,w)$,其中顶点从$[0,1]$中随机均匀选择,并且$w$控制边形成概率。如果链接到特定顶点$v$的概率随距离而减小,则这样的随机图被称为具有线性嵌入。通常,减小速率取决于特定顶点$v$。如果两个顶点之间链接的概率仅取决于它们之间的距离,则线性嵌入被称为均匀嵌入。在这篇文章中,我们考虑的问题是,是否有可能“转换”的线性嵌入到一个均匀的,通过替换均匀的概率空间$[0,1]$与一个合适的概率空间${\mathbb R}$。本文给出了随机图存在一致线性嵌入的充要条件,其中$w$只具有有限个值。我们的研究结果表明,对于一般的$w$的答案是否定的,在大多数情况下。
英文摘要:
Let $w:[0,1]^2\rightarrow [0,1]$ be a symmetric function, and consider the random process $G(n,w)$, where vertices are chosen from $[0,1]$ uniformly at random, and $w$ governs the edge formation probability. Such a random graph is said to have a linear embedding, if the probability of linking to a particular vertex $v$ decreases with distance. The rate of decrease, in general, depends on the particular vertex $v$. A linear embedding is called uniform if the probability of a link between two vertices depends only on the distance between them. In this article, we consider the question whether it is possible to "transform" a linear embedding to a uniform one, through replacing the uniform probability space $[0,1]$ with a suitable probability space on ${\mathbb R}$. We give necessary and sufficient conditions for the existence of a uniform linear embedding for random graphs where $w$ attains only a finite number of values. Our findings show that for a general $w$ the answer is negative in most cases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。