局部大偏差:着色随机图过程的一个McMillian定理
Local Large deviation: A McMillian Theorem for Coloured Random Graph Processes
摘要:
对于$n$节点上的有限类型图,利用类型律$μ,$,定义了图的谱势$ρ_λ(\,\cdot,\,μ),$,由谱势$ρ_λ(\,\cdot,\,μ)$得到了Kullback作用量或偏差函数$\mathcal{H}_λ(π\,\|\,ν),$关于经验对测度,$π,$作为Legendre对偶.对于具有经验连接测度$π$和经验类型测度$μ$的有限型随机图,我们证明了一个局部大偏差原理(LLDP),它具有率函数$\mathcal{H}_λ(π\,\|\,ν)$和速度函数$n.$.由此LLDP导出了有限型随机图的一个完全条件大偏差原理和经典McMillian定理的一个弱变体.给定典型的经验链接测度$λμ\otimesμ,$,类型化随机图的数量近似等于$e^{n\|λμ\otimesμ\|H\big(λμ\otimesμ/\|λμ\otimesμ\|\big)}.$注意,对于这些LLDP,我们不需要对有限图的空间进行任何拓扑限制。
英文摘要:
For a finite typed graph on $n$ nodes and with type law $μ,$ we define the so-called spectral potential $ρ_λ(\,\cdot,\,μ),$ of the graph.From the $ρ_λ(\,\cdot,\,μ)$ we obtain Kullback action or the deviation function, $\mathcal{H}_λ(π\,\|\,ν),$ with respect to an empirical pair measure, $π,$ as the Legendre dual. For the finite typed random graph conditioned to have an empirical link measure $π$ and empirical type measure $μ$, we prove a Local large deviation principle (LLDP), with rate function $\mathcal{H}_λ(π\,\|\,ν)$ and speed $n.$ We deduce from this LLDP, a full conditional large deviation principle and a weak variant of the classical McMillian Theorem for the typed random graphs. Given the typical empirical link measure, $λμ\otimesμ,$ the number of typed random graphs is approximately equal $e^{n\|λμ\otimesμ\|H\big(λμ\otimesμ/\|λμ\otimesμ\|\big)}.$ Note that we do not require any topological restrictions on the space of finite graphs for these LLDPs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。