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


Random induced subgraphs of Cayley graphs induced by transpositions
Authors:Emma Yu Jin  Christian M Reidys
Institution:aDepartment of Computer Science, University of Kaiserslautern, 67663 Kaiserslautern, Germany;bDepartment of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark
Abstract:In this paper we study random induced subgraphs of Cayley graphs of the symmetric group induced by an arbitrary minimal generating set of transpositions. A random induced subgraph of this Cayley graph is obtained by selecting permutations with independent probability, λn. Our main result is that for any minimal generating set of transpositions, for probabilities View the MathML source where View the MathML source and δ>0, a random induced subgraph has a.s. a unique largest component of size View the MathML source. Here x(?n) is the survival probability of a Poisson branching process with parameter λ=1+?n.
Keywords:Random graph  Permutation  Transposition  Giant component  Vertex boundary
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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