Book contents
- Frontmatter
- Contents
- Preface
- Conference Photographs
- 1 Growth of Groups and Wreath Products
- 2 Random Walks on Some Countable Groups
- 3 The Cost of Distinguishing Graphs
- 4 A Construction of the Measurable Poisson Boundary: From Discrete to Continuous Groups
- 5 Structure Trees, Networks and Almost Invariant Sets
- 6 Amenability of Trees
- 7 Group-Walk Random Graphs
- 8 Ends of Branching Random Walks on Planar Hyperbolic Cayley Graphs
- 9 Amenability and Ergodic Properties of Topological Groups: From Bogolyubov Onwards
- 10 Schreier Graphs of Grigorchuk's Group and a Subshift Associated to a Nonprimitive Substitution
- 11 Thompson's Group F is Not Liouville
- 12 A Proof of the Subadditive Ergodic Theorem
- 13 Boundaries of Zn-Free Groups
- 14 Buildings, Groups of Lie Type and Random Walks
- 15 On Some Random Walks Driven by Spread-Out Measures
- 16 Topics on Mathematical Crystallography
- References
5 - Structure Trees, Networks and Almost Invariant Sets
Published online by Cambridge University Press: 20 July 2017
Book contents
- Frontmatter
- Contents
- Preface
- Conference Photographs
- 1 Growth of Groups and Wreath Products
- 2 Random Walks on Some Countable Groups
- 3 The Cost of Distinguishing Graphs
- 4 A Construction of the Measurable Poisson Boundary: From Discrete to Continuous Groups
- 5 Structure Trees, Networks and Almost Invariant Sets
- 6 Amenability of Trees
- 7 Group-Walk Random Graphs
- 8 Ends of Branching Random Walks on Planar Hyperbolic Cayley Graphs
- 9 Amenability and Ergodic Properties of Topological Groups: From Bogolyubov Onwards
- 10 Schreier Graphs of Grigorchuk's Group and a Subshift Associated to a Nonprimitive Substitution
- 11 Thompson's Group F is Not Liouville
- 12 A Proof of the Subadditive Ergodic Theorem
- 13 Boundaries of Zn-Free Groups
- 14 Buildings, Groups of Lie Type and Random Walks
- 15 On Some Random Walks Driven by Spread-Out Measures
- 16 Topics on Mathematical Crystallography
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Groups, Graphs and Random Walks , pp. 137 - 175Publisher: Cambridge University PressPrint publication year: 2017
References
[1] , Introduction to Ʌ-trees, World Scientific, 2001.
[3] and , Groups acting on graphs, Cambridge University Press, 1989. Errata http://mat.uab.es/∼dicks/
[4] and , Context free groups and their structure trees, arXiv:1202.3276.
[5] , and , On the structure of a family of minimal weighted cuts in a graph. Studies in Discrete Optimization [Russian], [290–306, Nanka, Moscow (1976).
[7] , Accessibility and groups of cohomological dimension one, Proc. London Math. Soc. 38 (1979) 193–215.Google Scholar
[8] , The accessibility of finitely presented group, Invent. Math. 81 (1985) 449–57. 193–215.Google Scholar
[11] , Planar graphs and covers, arXiv 193–215.
[12] , Structure trees and networks, arXiv:1311.3929.
[13] , Almost invariant sets, arXiv 1409–6782.
[14] and ,Vertex Cuts, J. Graph Theory (published on line 2014).
[15] and , Splitting groups over polycyclic-by-finite subgroups, Bull. London Math. Soc. 23 (1989) 29–36.Google Scholar
[16] and , Aquick proof for the cactus representation of mincuts, EGRES Quick-Proof No. 2009–03.
[17] , Jr. and , Maximal flow through a network, Canadian Journal of Mathematics 8 (1956) 399–404.Google Scholar
[18] and Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics, 9, (1961) 551–70.Google Scholar
[19] and , A cactus theorem for edge cuts, International J. of Algebra and Computation 24 (2014) 95–107.Google Scholar
[20] and , Relative ends ℓ2-invariants and property T, arXiv:1003.2370.
[22] , An analogue of the torus decomposition theorem for certain Poincaré groups, Proc. London Math. Soc. (3) 60 (1990) 503–29.Google Scholar
[23] , A group theoretic proof of the torus theorem, London Math. Soc. Lecture Note Series 181 (1991) 138–58.Google Scholar
[24] , Infinite distance transitive graphs of finite valency Combinatorica 2 (1982) 62–9.Google Scholar
[26] , A geometric proof of Stallings theorem on groups with more than one end, Geometriae Dedicata 105, 61–76 (2004).Google Scholar
[27] and , 3-connected planar spaces uniquely embed in the sphere, Trans. Amer. Math. Soc. 354 (2002) 4585–95.Google Scholar
[28] and , The Kropholler conjecture. In Guido's Book of Conjectures, Monographies de L'Enseignement Mathématique, 40. L'Enseignement Mathématique, Geneva, 2008.
[29] , Ends of group pairs and non-positively curved cube complexes, Proc. London Math. Soc. (3) 71 (1995) 585–617.Google Scholar
[30] , Trees. Translated from the French by . Springer- Verlag, Berlin-New York, 1980.
[31] , Group theory and three-dimensional manifolds. Yale Mathematical Monographs, 4. Yale University Press, New Haven, Conn.- London, 1971.
[32] and , Vertex-transitive graphs and accessibility, J. Combin. Theory Ser. B 58 (1993) 248–68.Google Scholar
[33] , Graph Theory. Cambridge University Press, 1984.
[34] . Pairs of relative cohomological dimension one, J. Pure Appl. Algebra 1 (1971) 141–54.Google Scholar
- 1
- Cited by