首页 | 本学科首页   官方微博 | 高级检索  
     检索      

随机置换图与马氏链的联系
引用本文:曾平安.随机置换图与马氏链的联系[J].浙江大学学报(理学版),2007,34(3):268-273.
作者姓名:曾平安
作者单位:浙江大学,数学系,浙江,杭州,310027;浙江工业大学,之江学院,浙江,杭州,310024
摘    要:研究n个顶点的随机置换图的一些性质,利用已有的一个确定划分的概率(使得顶点都被记录在不同的连通分支当中),去构造一个放球模型,并可以证明这个放球模型是马氏链,还可以证明随机置换的某些性质是包含在这个放球模型当中,最后得到随机置换连通分支的极限联合分布.

关 键 词:随机置换  连通  分支  放球模型  马氏链
文章编号:1008-9497(2007)03-268-06
修稿时间:2005-10-13

Random permutation graphs and related Markov chains
ZENG Ping-an.Random permutation graphs and related Markov chains[J].Journal of Zhejiang University(Sciences Edition),2007,34(3):268-273.
Authors:ZENG Ping-an
Institution:1. Department of Mathematics, Zhejiang University, Hangzhou 310027, China; 2. Zhijiang College of Zhejiang University of Technology, Hangzhou 310024, China
Abstract:The property of random permutation with n nodes is investigated. By using the probability that fixed classes of finite non intersected subsets of nodes are located in different components to construct a scheme of allocating particles and prove this scheme is a Markov chain. Some behaviors of random permutation may be represented in the Markov chain in certain sense are proved. Finally, the limit associated distributing about the connection component of random permutation is found.
Keywords:random permutation  connection  component  scheme of allocating particles  Markov chain
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《浙江大学学报(理学版)》浏览原始摘要信息
点击此处可从《浙江大学学报(理学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号