随机超图的基本理论完备空间与收敛律
Spaces of completions of elementary theories and convergence laws for random hypergraphs
摘要:
考虑随机$(d+1)$ -均匀超图在$n$顶点上的二项式模型$G^{d+1}(n,p)$,其中每条边以概率$p:\mathbb{N}\to[0,1]$彼此独立地存在.我们证明了,对于所有的双指数$p\ll n^{-d+ε}$,超图的所有基本属性的概率收敛,特别强调的范围$p(n)\sim C/n^d$和$p(n) \sim C\log(n)/n^d$。论述是统一的建设,为每个这样的功能$p$,拓扑空间的所有完成其几乎必然的理论。这个空间原来是紧的,可度量化和全不连通的的,但进一步的性质取决于$p$的范围。初等性质的概率的收敛与空间上的Borelian概率测度有关。
英文摘要:
Consider the binomial model $G^{d+1}(n,p)$ of the random $(d+1)$-uniform hypergraph on $n$ vertices, where each edge is present, independently of one another, with probability $p:\mathbb{N}\to[0,1]$. We prove that, for all logarithmo-exponential $p\ll n^{-d+ε}$, the probabilities of all elementary properties of hypergraphs converge, with particular emphasis in the ranges $p(n)\sim C/n^d$ and $p(n) \sim C\log(n)/n^d$. The exposition is unified by constructing, for each such function $p$, the topological space of all completions of its almost sure theory. This space turns out to be compact, metrizable and totally disconnected, but further properties depend on the range of $p$. The convergence of the probabilities of elementary properties is associated with a borelian probability measure on the space.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。