We provide a combinatorial algorithm for constructing the stable Auslander-Reiten component containing a given indecomposable module of a symmetric special biserial algebra using only information from its underlying Brauer graph. We also show that the structure of the Auslander-Reiten quiver is closely related to the distinct Green walks around the Brauer graph and detail the relationship between the precise shape of the stable Auslander-Reiten components for domestic Brauer graph algebras and their underlying graph. Furthermore, we show that the specific component containing a given simple or indecomposable projective module for any Brauer graph algebra is determined by the edge in the Brauer graph associated to the module.

30 pages