Abstract
Imagine the following discrete process: You are starting at a vertex of a given undirected graph. In every step you can choose any edge leaving the current vertex and follow this edge to a new vertex. The only rule is that you must not return to any vertex already visited during the process.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer Fachmedien Wiesbaden GmbH, part of Springer Nature
About this chapter
Cite this chapter
Lindorfer, C. (2018). Introduction. In: The Language of Self-Avoiding Walks. BestMasters. Springer Spektrum, Wiesbaden. https://doi.org/10.1007/978-3-658-24764-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-658-24764-5_1
Published:
Publisher Name: Springer Spektrum, Wiesbaden
Print ISBN: 978-3-658-24763-8
Online ISBN: 978-3-658-24764-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)