arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.08333math.CO
收藏

演化的Shelah-Spencer图

Evolving Shelah-Spencer Graphs

Richard Elwes

摘要:

一个\emph{evolving Shelah-Spencer process}是一个随机图增长,在每一个时间$τ\in {\bf N}$一个新的节点合并和附加到每个先前的节点概率$τ^{-α}$,其中$α\in (0,1) \setminus {\bf Q}$是固定的。我们分析了从这个过程中产生的图形,包括无限极限,与[Spencer,J.,2013.随机图的奇怪逻辑(第22卷)。Springer Science & Business Media.]和整个模型理论文献中。经典的Shelah-Spencer图的一阶公理化包括一个“类属扩张”公理和一个“无稠密子图”公理。我们表明,在我们的上下文中“通用扩展”继续举行。虽然“没有稠密子图”失败,但较弱的“很少刚性子图”属性成立。

英文摘要:

An \emph{evolving Shelah-Spencer process} is one by which a random graph grows, with at each time $τ\in {\bf N}$ a new node incorporated and attached to each previous node with probability $τ^{-α}$, where $α\in (0,1) \setminus {\bf Q}$ is fixed. We analyse the graphs that result from this process, including the infinite limit, in comparison to Shelah-Spencer sparse random graphs discussed in [Spencer, J., 2013. The strange logic of random graphs (Vol. 22). Springer Science & Business Media.] and throughout the model-theoretic literature. The first order axiomatisation for classical Shelah-Spencer graphs comprises a 'Generic Extension' axiom and a 'No Dense Subgraphs' axiom. We show that in our context 'Generic Extension' continues to hold. While 'No Dense Subgraphs' fails, a weaker 'Few Rigid Subgraphs' property holds.

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

↑