节点文献

关于随机场及复杂网络的极限定理

Limit Theorems Based on Random Elds and Complex Networks

【作者】 黄辉林

【导师】 韩东;

【作者基本信息】 上海交通大学 , 应用数学, 2010, 博士

【摘要】 本学位论文主要研究了树指标随机场及非齐次增长网络的极限定理。全文主要内容分为六章。第一章,我们着重介绍了树指标随机场及复杂网络的基本知识、研究背景与发展现状,同时给出本学位论文所获得的主要结论以及使用的方法。第二章我们给出树指标中心化随机场的定义并研究树指标中心化随机场的中心极限定理。第三章给出树指标准相伴随机场的定义,利用Stein方法证明相应的中心极限定理。第四章,首先研究一致有界树上齐次马氏链场的强大数定律及熵定理,然后用类似的方法得到一致有界树上非齐次马氏链场的强大数定律及熵定理。利用鞅序列的中心极限定理证明了一致有界树图上平稳马氏链场的中心极限定理,最后给出了一致有界树上齐次马氏链场序偶经验测度的弱大偏差原理。第五章,我们将提出一个非齐次增长网络,当网络节点数目趋于无穷大时,考察与网络拓扑相关的极限性质,如度分布、度相关性等。第六章,我们利用效用函数描述偏好效应,在考虑效用函数随机演化机制和偏好连接效应作用下,建立并研究一个非对称演化增长模型。

【Abstract】 In this thesis, we mainly study the limit theorems based on random fields indexed by trees and complex networks. There are six chapters in this doctoral dissertation.In chapter 1, we will present the basic theory and the background of random fields indexed by trees and complex networks. The main results obtained and the main methods we used in this thesis are stated.In chapter 2, we give the definition of centered random field indexed by trees and study the central limit theorem of such case.In chapter 3, we give the definition of quasi-associated random fields indexed by trees and study the central limit theorem of it.In chapter 4, at first we study the strong law of large numbers and Shannon theo-rem on homogeneous Markov chain fields indexed by uniformly bounded trees, then we obtain the similar results of non-homogeneous Markov chain fields indexed by uniformly bounded trees by using the similar method as homogeneous case. By using the central limit theorem of martingale sequence, we also get the central limit theorem of stationary Markov chain fields indexed by uniformly bounded trees. At last, we give the weak large deviation principle of empirical pair measures of homogeneous Markov chain fields indexed by uniformly bounded trees.In chapter 5, we put forward a model of non-homogeneous growing network, then we consider the limit properties in connection with the topology of the network such as the degree distributions and the degree correlations, when the number of nodes of our network tends to infinity.In chapter 6, we use utility to describe the attractive effect and then study a simple asymmetrical evolving model, considering both preferential attachment and the random-ness of the utility.

节点文献中: 

本文链接的文献网络图示:

本文的引文网络