A conjecture concerning a limit of non-Cayley graphs

From MaRDI portal
Publication:5949012

DOI10.1023/A:1011257718029zbMath0985.05020WikidataQ56341040 ScholiaQ56341040MaRDI QIDQ5949012

Reinhard Diestel, Imre Leader

Publication date: 13 May 2002

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)




Related Items

Shannon's theorem for locally compact groupsPresentations for vertex-transitive graphsPerfect matching transitivity of circulant graphs.Gardens of Eden and amenability on cellular automataCompactifications of horospheric productsGeometry of nontransitive graphsMetric properties of Diestel-Leader groups.Percolation on nonunimodular transitive graphsOn the asymmetry of stars at infinityConstructing highly arc transitive digraphs using a direct fibre productBrownian motion on treebolic space: escape to infinityHigher rank lamplighter groups are graph automaticCoarse geometry of the cops and robber gameLimit distributions of branching Markov chainsSimulations and the lamplighter groupGeometry of the conjugacy problem in lamplighter groupsLocally infinite graphs and symmetriesCoarse differentiation of quasi-isometries. I: Spaces not quasi-isometric to Cayley graphsSharply \(k\)-arc-transitive-digraphs: finite and infinite examplesNonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphsSelf-Avoiding Walks and Connective ConstantsHorocyclic products of treesA finitely-presented solvable group with a small quasi-isometry group.Reachability relations in digraphsCounting subgraphs in hyperbolic graphs with symmetryBrownian motion on treebolic space: positive harmonic functionsAnalogues of Cayley graphs for topological groupsQuasiconformal homogeneity after Gehring and PalkaLamplighter graphs do not admit harmonic functions of finite energyPositive harmonic functions for semi-isotropic random walks on trees, lamplighter groups, and DL-graphsRandom walks on Diestel-Leader graphsSelf-avoiding walk on nonunimodular transitive graphsSparse graphs: Metrics and random modelsA finitary structure theorem for vertex-transitive graphs of polynomial growthLocality of connective constantsUniqueness for solutions of the Schrödinger equation on treesCounterexamples for percolation on unimodular random graphsSparse graph limits along ballsEternal Family Trees and dynamics on unimodular random graphsWeights of uniform spanning forests on nonunimodular transitive graphsOn coprime percolation, the visibility graphon, and the local limit of the GCD profileReturn probabilities on nonunimodular transitive graphsCharacterization of perfect matching transitive graphsCoarse distinguishability of graphs with symmetric growthEmbeddings of trees, Cantor sets and solvable Baumslag-Solitar groupsOn infinite, cubic, vertex-transitive graphs with applications to totally disconnected, locally compact groups



Cites Work