【作者】 李志民；

【导师】 韩东；

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

【摘要】 本文主要用对偶、鞅、矩母函数等方法对排它过程和随机树进行研究.首先,我们用对偶的方法,利用随机游动和Fourier变换等方法研究了排它过程中的占位时函数的方差的上界问题；其次,我们研究了排它过程在随机图上的存在性,利用鞅方法,我们将所研究的问题转化为证明对应于生成元鞅解的存在唯一性问题,从而解决了排它过程在随机图上的存在性问题；再次,我们利用矩母函数研究了去点的树过程的对应的子树的顶点数问题；最后,我们利用矩函数和鞅方法研究了推广的树的度分布,分枝结构,给定顶点的度和最大度问题.本文主要分成以下七个章节.在第一章,我们主要介绍了所研究问题的历史,现状和本文所做的工作；在第二章中,我们研究了一个变分公式和两类由生成元和准生成元所诱导出的范数的等价关系；在第三章中,利用第二章中的变分公式,我们给出了排它过程的占位时函数的方差的一个上界；第四章,我们主要讨论了图上排它过程的生成元对应的鞅问题的解的存在唯一性；在第五章,我们主要讨论了对于均匀递归树,随机删除一个顶点后,剩余子树的顶点数问题；在第六章中,我们对于均匀递归树和有偏好加点树进行了推广,并研究了在推广的随机树中的度分布,分枝结构和最大度问题.在第七章,我们继续讨论随机递归树,我们考虑一类树,其生成是在偶数时间,有偏好加点,在奇数时间均匀加点或以m为时间间隔,在m的倍数时间我们有偏好加点,在其它时间均匀加点,对于这样的树过程,我们考虑它们的度分布问题.更多还原

【Abstract】 In this paper, we study the exclusion process and random tree by the methods of dualty, martingale, moment generating function, etc.Firstly, we study the upper bound of the occupation time variance by some knowledge of random walk and Fourier transform; Secondly, we prove the existence of exclusion process on random graph, we transform the problem into the solution of the martingale problem corresponding to the generator of the exclusion, so the problem of existenc is settled; Thirdly, we study the problem of number of vertices in nodes deletion tree process by the means of moment generating function; Finally, by the means of moment generating function and martingale methods, we study some properties of genralized random tree, including degree distribution, branching structure, degree of given vertices, maximum degree,etc.The paper contains seven chapters:In the first chapter, we mainly introduce the history of the topic we will discuss and the work we have done; In the second chapter, we mainly study an invariant formula and the equivalence of two kinds of norms induced by generator of exclusion process and its pregenerator; In the third chapter, we give an upper bound of occupation time variance by use of the invariant formula in chapter 2; In the fourth chapter, we prove the existence and uniqueness of the martingale problem corresponding to the generator of exclusion on graph; In the fifth chapter, we discuss the problem of the number of vertices of subtree when we delete a node randomly; In the sixth chapter, we generalize the random uniform recursive tree and preferential attachment tree and study the degree distribution,更多还原