ویراساینس.
سند علمی

Critical percolation on Cayley graphs of groups acting on trees

Iva Kozáková

چکیده

This article presents a method for finding the critical probability pc for the Bernoulli bond percolation on graphs with the so called tree-like structure. Such graphs can be decomposed into a tree of pieces which have finitely many isomorphism classes. This class of graphs includes the Cayley graphs of amalgamated products, HNN extensions or general groups acting on trees. It also includes all transitive graphs with more than one end. The idea of the method is to find a multi-type Galton-Watson branching process (with a parameter p) which has finite expected population size if and only if the expected percolation cluster size is finite. This provides a sufficient information about pc. In particular if the pairwise intersections of pieces are finite, then pc is the smallest positive p for which det(M − 1) = 0, where M is the first-moment matrix of the branching process. If the pieces of the tree-like structure are finite, then pc is an algebraic number, and we give an algorithm computing pc as a root of some algebraic function. We show that any Cayley graph of a group acting on a tree with finite vertex stabilizers with respect to any finite generating set has a tree-like structure with finite pieces. In particular we show how to compute pc of the Cayley graph of a free group with respect to any finite generating set.

اسناد مشابه

  • On the decomposition of Cayley graphs into isomorphic trees

    سند علمی۲۰۰۰Australasian J. CombinatoricsSaad El-Zanati, Charles Vanden Eynden, Sidney Stubbs

    We prove a theorem about the decomposition of certain n-regular Cayley graphs into any tree with n edges. This result implies that the product of any r cycles of even length and the cube Qs decomposes into copies of any tree with 2r + sedges.

  • Critical Percolation and the Minimal Spanning Tree in Slabs

    مقاله‌ی دسترسی آزاد۲۰۱۷Communications on Pure and Applied MathematicsCharlesNewman, VincentTassion, WeiWu

  • Percolation on Finite Cayley Graphs

    سند علمی۲۰۰۲Combinatorics, Probability & ComputingChristopher Malon, Igor Pak

    In this paper, we study percolation on finite Cayley graphs. A conjecture of Benjamini says that the critical percolation pc of any vertex–transitive graph satisfying a certain diameter condition can be bounded away from one. We prove Benjamini’s conjecture for some special class

  • One-matching bi-Cayley graphs over abelian groups

    سند علمی۲۰۰۹Eur. J. Comb.István Kovács, Aleksander Malnic, Dragan Marusic, Stefko Miklavic

    A bi-Cayley graph is a graph which admits a semiregular group of automorphisms with two orbits (of equal size), and is a onematching bi-Cayley graph if the bipartite graph induced by the edges joining these two orbits is a perfect matching. Typical examples of such graphs are the

  • Diameter of Cayley graphs of permutation groups generated by transposition trees

    سند علمی۲۰۱۱Ashwin Ganesan

    Let Γ be a Cayley graph of the permutation group generated by a transposition tree T on n vertices. In an oft-cited paper [2] (see also [14]), it is shown that the diameter of the Cayley graph Γ is bounded as diam(Γ) ≤ max π∈Sn {

  • Spectral asymptotics of percolation Hamiltoni- ans on amenable Cayley graphs

    سند علمی۲۰۰۶Tonći Antunović, Ivan Veselić

    In this paper we study spectral properties of adjacency and Laplace operators on percolation subgraphs of Cayley graphs of amenable, finitely generated groups. In particular we describe the asymptotic behaviour of the integrated density of states (spectral distribution function)