Network local structure in the urban bus system of Madrid

This paper studies the local network structure of the urban bus system of Madrid applying different mathematical procedures (specifically: Fag-Ec, Mcode, Blondel and Walktrap algorithms). Relevant characteristics of the network communities such as total number, modular relevance, average size and distribution by size, are compared. We also describe the mapping of these communities on the geographical shape of Madrid, and different approaches for the detection of singularites.