Abstract
Owing to the sheer size of large and complex networks, it is necessary to reduce the information to describe essential properties of vertices and edges, regions, or the whole graph. Usually this is done via network statistics, i.e., a single number, or a series of numbers, catching the relevant and needed information. In this chapter we will give a list of statistics which are not covered in other chapters of this book, like distance-based and clustering statistics. Based on this collection we are going to classify statistics used in the literature by their basic types, and describe ways of converting the different types into each other.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Brinkmeier, M., Schank, T. (2005). Network Statistics. In: Brandes, U., Erlebach, T. (eds) Network Analysis. Lecture Notes in Computer Science, vol 3418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31955-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-31955-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24979-5
Online ISBN: 978-3-540-31955-9
eBook Packages: Computer ScienceComputer Science (R0)