在$\mathbb{Z}$上生成具有指定i.i.d.的平稳随机图度
Generating stationary random graphs on $\mathbb{Z}$ with prescribed i.i.d.\ degrees
摘要:
设$F$是支持非负整数的概率分布。本文给出了两个生成顶点集为$\mathbb{Z}$的平稳随机图的算法,使得顶点的度是独立同分布的。分布为$F$的随机变量。重点是一个算法,其中,最初,一个随机数的“存根”与分布$F$是附加到每个顶点。每个短截线被随机分配一个方向,左或右,边的配置是通过配对短截线指向对方,首先耗尽所有可能的连接最近的邻居,然后连接第二最近的邻居,等等.假设$F$有有限的平均值,它表明,这种算法导致一个定义良好的配置,但是顶点的最短边的期望长度是无限的。它还表明,任何固定的算法配对存根随机,独立的方向给出了无限的平均值的总长度的边缘的一个给定的顶点。连接到问题的建设有限同构之间的伯努利移位进行了讨论。
英文摘要:
Let $F$ be a probability distribution with support on the non-negative integers. Two algorithms are described for generating a stationary random graph, with vertex set $\mathbb{Z}$, so that the degrees of the vertices are i.i.d.\ random variables with distribution $F$. Focus is on an algorithm where, initially, a random number of "stubs" with distribution $F$ is attached to each vertex. Each stub is then randomly assigned a direction, left or right, and the edge configuration is obtained by pairing stubs pointing to each other, first exhausting all possible connections between nearest neighbors, then linking second nearest neighbors, and so on. Under the assumption that $F$ has finite mean, it is shown that this algorithm leads to a well-defined configuration, but that the expected length of the shortest edge of a vertex is infinite. It is also shown that any stationary algorithm for pairing stubs with random, independent directions gives infinite mean for the total length of the edges of a given vertex. Connections to the problem of constructing finitary isomorphisms between Bernoulli shifts are discussed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。