Defining a historic football team: Using Network Science to analyze Guardiola’s F.C. Barcelona

Abstract

The application of Network Science to social systems has introduced new methodologies to analyze classical problems such as the emergence of epidemics, the arousal of cooperation between individuals or the propagation of information along social networks. More recently, the organization of football teams and their performance have been unveiled using metrics coming from Network Science, where a team is considered as a complex network whose nodes (i.e., players) interact with the aim of overcoming the opponent network. Here, we combine the use of different network metrics to extract the particular signature of the F.C. Barcelona coached by Guardiola, which has been considered one of the best teams along football history. We have first compared the network organization of Guardiola’s team with their opponents along one season of the Spanish national league, identifying those metrics with statistically significant differences and relating them with the Guardiola’s game. Next, we have focused on the temporal nature of football passing networks and calculated the evolution of all network properties along a match, instead of considering their average. In this way, we are able to identify those network metrics that enhance the probability of scoring/receiving a goal, showing that not all teams behave in the same way and how the organization Guardiola’s F.C. Barcelona is different from the rest, including its clustering coefficient, shortest-path length, largest eigenvalue of the adjacency matrix, algebraic connectivity and centrality distribution.

Introduction

Social systems have been one of the fields that has benefited the most from the wide variety of methodologies comprised under the umbrella of Network Science1,2,3,4,5. Using such an approach, it is possible (i) to identify the most influential individuals of a social network6,7,8,9,10,11, (ii) to detect the existence of communities of people and the common interests that tie them more tightly than individuals in other communities12,13,14, (iii) to explain the propagation of rumors/diseases15,16,17,18 or (iv) to analyze the bursting activity of individuals when communicating with others19, just to cite a few examples. Furthermore, the areas of application and systems under study are as diverse as (i) on-line social networks (e.g., Facebook or Twitter)20,21,22,23,24,25, (ii) interactions between companies and shareholders26,27, (iii) crime networks28, (iv) collaborations between scientists1,11, or (v) scaling laws in cities29.

From the diversity of applications of Network Science, here we are concerned about the analysis of football matches and, specifically, the way players interact with each other by passing the ball, ultimately creating what is known as a football passing network. Passing networks are constructed from the observation of the ball exchange between players, where network nodes (or vertices) are football players and links (or edges) account for the number of passes between any two players of a team. This way, we can construct football passing networks, weighted and unidirectional, which in turn are spatially embedded30,31,32 (see Methods for an example about how passing networks are built). The seminal paper by Gould and Gatrell33, published in the late seventies, introduced the concept of passing networks associated to a football match. However, it did not obtain the relevance it deserved, both in the scientific and sports communities. More than thirty years later, the work of Duch and collaborators34 marked the start of a decade that is witnessing how the analysis of passing networks (by means of Network Science) is unveiling crucial information about the organization, evolution and performance of football teams and players30.

For example, inspecting the organization of passing networks, it is possible to detect recurring pass sequences and relate them to the playing style of a team35. Passing networks, taken as whole, exhibit a small-world topology36, typically with high clustering coefficient (i.e., a tendency to create triangles of passes between three players) when compared to a random null model37, and where the number of steps to go from one node to any other is much lower than the number of nodes of the network38. It is also possible to detect the existence of motifs39, consisting in the overabundance of certain kinds of passes between groups of three/four players40 or even communities of players tightly connected between them41. When the focus is placed at the player level, we can use network motifs to characterize the role of a player in a team or even to find players (in other teams) with similar features42. Furthermore, importance of players in a passing network can be quantified using the betweenness or closeness parameters, which show that passing networks are prone to find a balance between all players43.

Taking advantage of this new point of view that Network Science can give to the analysis of football datasets, we are going to analyze the particular organization of F.C. Barcelona (FCB) during the supervision of Pep Guardiola, considered as the referent team during the last decade44. Going back in time, modern football was invented in England and we can trace its rules back to 1863. In the beginning, team strategy consisted in moving forward the fastest and getting rid of the ball as soon as possible: having the ball, specially close to your goal, was seen as something “dangerous”. Teams were originally organized in a “static” manner with clear and specialized roles of defenders, midfielders and forwards. In the 1950s, the Hungarian national team started to consider the ball as ‘not dangerous’ and organized the game around it. This led to a more dynamic approach in the 1970s, giving birth to a new game system played by AFC Ajax, and the Dutch national team, which was called “total football” (totaalvoetbal in Dutch). Rinus Michels and Johan Cruyff were responsible for this new style. Its development in F.C. Barcelona gradually appeared when Michels served as the club’s manager/coach (1971–1975 and 1976–1978) followed by others such as Johan Cruyff (1988–1996) and, definitively, Frank Rijkaard (2003–2008) and Pep Guardiola (2008–2012)45,46. The style of the Spanish national team (2008–2012) was also similarly influenced.

The tactical ability of Guardiola, which relied on a sophisticated combination of possession and pressing that, in turn, were synchronized to the positional play of the team, leaded to the most fruitful period of F.C. Barcelona, both in reputation and in the number of titles achieved, including \(14\) titles during \(4\) seasons. In a more general framework, Guardiola was not the first coach who focused on pressing and possession or any of the other principles that, as he admitted, were extracted from the philosophy of his former coach Johan Cruyff46.

Despite there exists a vast literature about the particular features of Guardiola’s teams47,48,49, quantitative analyses of their game style are still scarce. With the aim of supporting the evidence with numbers, we are going to use Network Science to provide a different perspective of FCB style of playing, a perspective focused on the organization of FCB passing networks and their differences with the rest of the teams paying in the Spanish national league. We are going to focus on the season 2009/2010, probably the most fruitful season of Guardiola’s period, achieving the titles of six major competitions (Spain’s Super Cup, UEFA Super Cup, FIFA Club World Cup, King’s Cup, La Liga, and the UEFA Champions League). First, we will obtain the passing networks corresponding to the \(380\) matches of “La Liga” national league during the 2009/2010 season. Next, we will analyze the differences between Guardiola’s team and the rest of Spanish teams, identifying similarities and differences at the network parameters and linking them with the particularities of Guardiola’s principles. At this point, we will discuss the influence of the temporal fluctuations of the network parameters along a match and will propose a temporal analysis of passing networks. With this aim, we will introduce the concept of 50-pass networks and recalculate all network parameters at different moments of the match, giving special attention to scored/received goals. When time is taken into account, our results show that (i) passing networks unveil additional information not contained in the average network and, in addition, (ii) temporal analysis highlights some of the particular features of Guardiola’s game.

Results

Average passing networks

Figure 1 shows an example of a football passing network, in this case the average network of FCB against Real Madrid in the season 2009/2010. Note that links are unidirectional (from player A to player B) and weighted according to the number of passes between players. In the figure, nodes (i.e., players) are placed in the average position from where their passes were made and the width of the links is proportional to the number of passes between players. Also note that both the \(x\) and \(y\) coordinates of the field are bounded between [0,100] and are measured in “field units” (f.u.), since not all fields have exactly the same dimensions. Finally, the radius of the nodes is proportional to their importance in the passing network, quantified by means of the eigenvector centrality (see Methods).

Figure 1
figure1

Schematic illustration of a football passing network. In the plot, players are represented by circular nodes, whose size is proportional to their eigenvector centrality, a mesure of importance in the network structure. The position of each player is given by the average of the positions of all passes made by the player along the match. The width of the links is proportional to their weights, which account for the number of passes between players. Note that links are unidirectional. In this example, we plot the average passing network of the match between F.C. Barcelona and Real Madrid, played during the season 2009/2010 at Santiago Bernabeu Stadium. Datasets leading to the passing network were provided by Opta.

First, we analyzed the average passing networks of all matches played by FCB during season 2009/2010 (\(38\) in total), obtaining the networks of FCB and their rivals. Specifically, we obtain 2 average passing networks for each match (1 per team), both of them including all passes and positions along the match and projecting them into a single network for each team. See the Methods section for details about the construction of average passing networks. Previous literature about average passing networks has shown that they reveal information about the way a team is organized50 and are also related with team performance51.

Figure 2 shows the comparison between 8 different parameters obtained for FCB and its rivals. Four of them, (a) the number of passes \(L\), (b) the number of shots to goal \({M}_{{shots}}\), (c) the number of goals \({M}_{{goals}}\) and (d) the number of points \({M}_{{points}}\) (at the end of the season) are classical metrics of the team performance. Note that, in order to compute these 4 variables, there is no need to obtain and analyze the network structure of each team, despite some of them (i.e., the number of passes) can affect the organization of the passing networks. The other 4 parameters of Fig. 2 are related to the spatial properties of the networks: (e) \(x\)-coordinate of the network centroid 〈X〉, (f) y-coordinate of the network centroid 〈Y〉, (g) dispersion of the position of the players around the network centroid NCdisp and (h) average ratio between the passing distance parallel and perpendicular to the opponent’s goal 〈Δy〉/〈Δx〉 (see Methods for details). Left bars in all plots correspond to the average values of these metrics for all matches of FCB along the season, while right bars are the same metrics obtained for the rivals at the same matches. FCB is always averaged with itself, while all other teams are averaged together, the reason being that we are only interested in observing differences between the FCB and all other teams. Error bars account for the standard deviations of each metric. Plots in yellow highlight statistically significant differences (see Methods for details about the statistical analysis).

Figure 2
figure2

Comparison of 8 classical football metrics. In all plots, left bars are the average (during the whole season) of a given metric for FCB, while right bars correspond to the average of the rivals in the matches played against FCB. Metrics are, specifically: (A) number of passes, (B) number of shots, (C) number of goals, (D) number of points at the end of the season, (E) x-coordinate of the network centroid 〈X〉, (F) y-coordinate of the network centroid 〈Y〉, (G) the spatial dispersion (in field units) of the players around the network centroid and (H) the advance ratio 〈Δy〉/〈Δx〉, obtained as the ratio between the total length 〈Δy〉 of the y-coordinate of all passes divided by the total length 〈Δx〉 of the x-coordinate, both distances in field units. Direction x is towards the goal, while direction y is parallel to the opponents goal (see axis of Fig. 1). Parameters having statistically significant differences between FCB and their rivals are plotted in yellow.

As we can see in Fig. 2A, the number of passes made by FCB is much higher than the average of their rivals. This fact is a consequence of Guardiola’s playing style, focused on keeping the ball as much as possible (“In football, I am very selfish: I want the ball for me”, “take the ball, pass the ball”52). The high number of passes unavoidably leads to passing networks with links that have higher weights and, as we will see, this fact will have consequences on the network parameters. The number of shots to goal is also higher in FCB (Fig. 2B), leading to a higher number of goals (Fig. 2C) and, ultimately to a high number of points accumulated during the analyzed matches (Fig. 2D). In fact, FCB won the league with 99 points (31 wins, 6 ties and only 1 loss). Note that these four metrics (passes, shots, goals and points), specially the last three, are traditionally considered as indicators of the team performance, thus revealing that FCB was the best team during season 2009/2010.

Bottom plots of Fig. 2 are related with the spatial features of Guardiola’s team. The 〈X〉 and 〈Y〉 average coordinates of all passes made during the match define the network centroid (or the network center of mass). We can observe in Fig. 2E how FCB played closer to the opponents goal (〈XFCB > 〈Xrivals), while no differences are found at the 〈Y〉 coordinate (Fig. 2F), indicating no preference for any of the sides of the pitch. Interestingly, the dispersion of the position of the players around the centroid (see Methods) is slightly higher for FCB, which indicates that the area covered by the initial position of the passes made by all players is wider (Fig. 2G). Finally, it is worth analyzing the ratio of advance 〈Δy〉/〈Δx〉, which is an indicator of the direction of the passes of a team, since the Δy = y2 − y1 of a pass is the difference between the y-coordinates at the final (y2) and initial points (y1) of a pass, while Δx is defined, accordingly, for the x-coordinate. In Fig. 2H, we can observe how FCB has a ratio of advance much higher than the rivals, which reveals that passes are more parallel to the opponent’s goal than the rest of the teams. Note that this metric is independent from the number of passes, and it is an indicator of how “direct” the game of a team is. Clearly, FCB is not concerned about advancing directly towards the goal, but on moving the ball in parallel, probably to find the most adequate moment to advance.

But, how is the structure of the average passing networks? And, more importantly, are there differences between FCB and the rest of the teams? Figure 3 shows the comparison of 6 parameters directly related with the topological organization of the average passing networks (see Methods for a detailed description of all these network parameters). In Fig. 3A, we plot the clustering coefficient C, which is related to the amount of triangles created between any triplet of players. Clustering coefficient is an indicator of the local robustness of networks31, since when a triangle connecting three nodes (i.e. players) exists, and a link (i.e., pass) between two nodes is lost (i.e., not possible to make the pass), there is an alternative way of reaching the other node passing through the other two edges of the triangle. In football, the clustering coefficient mesures the triangulation between three players. As we can observe in Fig. 3A the value of C is much higher in FCB, which reveals that connections between three players are more abundant than at their rivals. The average shortest path d is an indicator about how well connected are players inside a team. It measures the “topological distance” that the ball must go through to connect any two players of the team. Since the links of the passing networks are weighted with the number of passes, the topological distance of a given link is defined as the inverse of the number of passes. The higher the number of passes between two players, the closer (i.e., lower) the topological distance between them is. Furthermore, since it is the ball that travels from one player to any other, it is possible to find the shortest path between any pair of players by computing the shortest topological distance between them, no matter if it is a direct connection or if it involves passing through other players of the team. Finally, the average shortest path d of a team is just the average of the shortest path between all pairs of players. As we can observe in Fig. 3B, the shortest path of FCB is much lower than their rivals, which reveals that players are better connected between them. As we will discuss later, note that this fact could be produced by the network organization or just being a consequence of having a higher number of passes, which reduces the overall topological distance of the links and, consequently, the value of d.

Figure 3
figure3

Comparison of 6 network parameters. In all plots, left bars are the average (during the whole season) of a given parameter for FCB, while right bars correspond to the average of the rivals in the matches played against FCB. Parameters are, specifically: (A) clustering coefficient C, (B) shortest-path length d, (C) largest eigenvalue λ1 of the connectivity matrix A, (D) algebraic connectivity \({\tilde{\lambda }}_{2}\) of the Laplacian matrix \(\tilde{L}\), (E) dispersion of the players’ centrality and (F) maximum player centrality. See Methods section for details about the explanation (and calculation) of all network parameters. Parameters having statistically significant differences between FCB and their rivals are plotted in yellow.

Figure 3C shows the comparison between the largest eigenvalue λ1 of the connectivity matrix A (also known as the weighted adjacency matrix), whose elements aij contain the number of passes between players i and j31. The largest eigenvalue has been used as a quantifier of the network strength53, since it increases with the number of nodes and links (see Methods). As expected (due to the high number of passes), the largest eigenvalue λ1 of FCB is much higher than the corresponding values of its rivals. This metric reveals the higher robustness of the passing network of Guardiola’s team, which indicates that an eventual loss of passes would have less consequences in F.C. Barcelona than in the rest of the teams.

It is also worth analyzing the behavior of the second smallest eigenvalue \({\tilde{\lambda }}_{2}\) of the Laplacian matrix \(\tilde{L}\), also known as the algebraic connectivity (see Methods). The value of \({\tilde{\lambda }}_{2}\) is related to several network properties. In synchronization, networks with higher \({\tilde{\lambda }}_{2}\) require less time to synchronize54 and in diffusion processes, the time to reach equilibrium also goes with the inverse of \({\tilde{\lambda }}_{2}\). In the context of football passing networks, \({\tilde{\lambda }}_{2}\) can be interpreted as a metric for quantifying the division of a team. The reason is that low values of \({\tilde{\lambda }}_{2}\) indicate that a network is close to be split into two groups, eventually breaking for \({\tilde{\lambda }}_{2}=0\). In this way, the higher the value of \({\tilde{\lambda }}_{2}\) the more interconnected the team is, being a measure of structural cohesion. In Fig. 3D, we have plot the comparison of \({\tilde{\lambda }}_{2}\), which reveals that FCB attacking and defensive lines are more intermingled, leading to a \({\tilde{\lambda }}_{2}\) higher than its rivals.

Finally, Fig. 3E-F show how centrality (i.e., the importance of the players inside the passing network) is distributed along the team, a metric calculated by means of the eigenvector related to the largest eigenvalue of the connectivity matrix (see Methods). Figure 3E contains the average dispersion of centrality and Fig. 3F shows the highest value of a single player. In both cases, differences are not statistically significant to support evidences of a different centrality distribution between FCB and the rest of the teams.

Temporal evolution of the network metrics

As we have seen in the previous Section, average passing networks show differences between the organization of FCB and its rivals. However, these difference may be interpreted as a consequence of the higher number of passes between Barcelona players, which could lead to statistically significant differences in a diversity of network metrics, namely, a reduction of the average shortest path d and an increase of the clustering coefficient C, largest eigenvalue λ1 and algebraic connectivity \({\tilde{\lambda }}_{2}\).

In view of these results, two questions must be addressed before any interpretation: (i) Is just the number of passes behind the differences of the network parameters? and (ii) is it enough to look at the average values of the network metrics? To address both issues, we have conducted a complementary study where passing networks are constructed in a different way. On the one hand, we are going to define passing networks as non-static entities, thus evolving in time, and we will track the evolution of their parameters. On the other hand, we are going to exclude the importance of the number of passes, in order to just focus on the topological organization of the networks. With these two objectives in mind, we construct the lpass networks of a team as the networks containing l consecutive passes, with lL, being L the total number of passes during the match. In our study, we set l = 50, since it is a value low enough to allow a tracking of the network evolution along the match and, at the same time, high enough to guarantee the creation of a network between players (too low values of l would lead to networks with disconnected components). Therefore, we obtain the 50-pass networks in the following way: (i) we construct the network of the first 50 passes of a team since the beginning of the match, (ii) we calculate its parameters, (iii) we dismiss the oldest pass and include (sequentially) a new one, (iv) we recalculate the network parameters and (v) we repeat the procedure until the last pass of the match is included.

Note that 50-pass networks contain exactly the same number of passes for both teams and, thus, any difference between network metrics can not be attributed to the total number of passes. In addition, also note that metrics evolve in time and their values can be related to a certain moment of the match. However, it is also important to remark that the time required to construct a 50-pass network can differ from team to team.

Figure 4 shows an example of the evolution of 3 parameters of the 50-pass networks of two teams along a match, specifically, the 〈X〉 coordinate of the centroid (A), the ratio of advance 〈Δy〉/〈Δx〉 (B), and the dispersion of the network centrality (C). Parameters are calculated, for both teams, during the match between Real Madrid (red lines) and FCB (green lines), whose final score was 0–2. Vertical lines indicate the moment at which a goal was scored. Figure 4A shows how the position of the team moves forward and backward during the match. In this particular case, Real Madrid plays, most of the time, more advanced than FCB, which did not lead to an advantage in the result. Note how the centroid of FCB seems to be more stable, while Real Madrid has higher fluctuations, arriving to its maximum value around minute 63. Also note how FCB is the first team to construct the 50-pass network around minute 9, while Real Madrid required 20 minutes.

Figure 4
figure4

Real Madrid (red lines) vs. F.C. Barcelona (green lines), season 2009/2010 (final result: 0−2).Temporal evolution of the network parameters: (A) 〈X〉 coordinate of the networks’ centroid, (B) ratio of advance 〈Δy〉/〈Δx〉 and (C) the centrality dispersion ECdisp. Vertical dashed lines indicate the two moments at which FCB scored a goal (Real Madrid did not score).

In Fig. 4B, we plot the ratio of advance of the 50-pass networks of both teams. Again we can see fluctuations of the parameter during the match. Specifically, FCB has a highest value during the first part of the match. However, we can observe how Real Madrid increases its advance ratio as time goes by, eventually overcoming FCB during the second half.

Finally, Fig. 4C shows the fluctuations of the centrality dispersion of the players of both teams. We can observe how Real Madrid has a strong increase of the centrality dispersion between minutes 50 and 70, which seems to be related with the period where the centroid of the team advances towards FCB’s goal (see Fig. 4A). This change of the centrality distribution could be related to a change of the style of playing. Since centrality dispersion increases, there is a higher heterogeneity in the importance of the players in the passing networks, which could be related to the fact that a few players are taking the lead of the team. However, this change in the organization of the passing network does not seem to be effective, since the second goal of FCB comes around to the maximum of centrality dispersion.

The fact that network metrics change during the match increases the complexity of the study. It is expected that several factors may influence the fluctuations of the network parameters (a goal, a substitution, physical condition, etc…) and, furthermore, not all teams may behave in the same way. From the diversity of factors, here we are going to focus on the particular organization of each team before a goal. With this aim, we have analyzed the value of the network parameters, for all teams, before scoring/receiving a goal. Our purpose is to detect the existence of differences in the network metrics and identify those parameters that change before scoring or receiving a goal.

Figure 5 shows the average values of 4 temporal and spatial metrics obtained before scoring/receiving a goal (during season 2009/2010). The diagonal line (y = x) helps to identify those metrics that behave differently when scoring or receiving a goal. In Fig. 5A we can observe how FCB is the team requiring less time to construct the 50-pass network, both when scoring or receiving a goal. In fact, as indicated by the diagonal line, it takes approximately the same time in both cases. On the opposite side, we find Athletic Club and Osasuna, both teams characterized by a direct game towards the opponents’s goal. Concerning the 〈X〉 position of the centroid, we can observe in Fig. 5B that, despite having a high value, FCB is not the team that constructs its network closest to the opponent’s goal, since it is overcome by Real Madrid and Tenerife. Note that Tenerife ended up the season in the last position, which indicates that playing forward it is not a sufficient condition to achieve good results. However, it is also worth noting that all teams, with the only exception of Osasuna, are placed above the line given by the function 〈Xscored = 〈Xreceived. This fact reveals that when a team scores a goal is, in average, playing more advanced than when it receives it. In Fig. 5C we have compared the ratio of advance 〈Δy〉/〈Δx〉 of all teams, showing that Barcelona is not only the team with the highest value (both when scoring and receiving a goal) but also the one deviated the most from the the diagonal line. In this way, FCB is the team that increases the most its probability of scoring a goal when increasing the ratio of advance. Finally, Fig. 5D shows the average dispersion of the position of the players around the centroid coordinates of the 50-pass network. Interestingly, we can observe how FCB is one of the teams with lower dispersion of La Liga and, furthermore, the dispersion increases before a goal is received, indicating that FCB performs better when players are closer to the network centroid.

Figure 5
figure5

Temporal and spatial metrics change before scoring/receiving a goal: (A) time required to construct a 50-pass network tnet, (B) position of the X coordinate of the 50-pass network centroid, (C) 〈Δy〉/〈Δx〉 advance ratio and (D) dispersion of the distance of the players with regard to the centroid. Metrics are obtained for all teams and are shown in a two-dimensional plot, where the horizontal axis corresponds to the value of a metric when the team receives a goal and the vertical axis is the same metric obtained when the team scores a goal. Solid lines correspond to the function y = x, helping to identify wether a given parameter increases or decreases when a goal is scored/received. Each point represents the average along the whole season.

Figure 6 shows, in a similar way, the values of 6 different network parameters obtained for all teams (during the whole season). Interestingly, FCB has the highest values of the league at 4 of them: The clustering coefficient (Fig. 6A), the largest eigenvalue of the connectivity matrix (Fig. 6C), the centrality dispersion (Fig. 6E) and the highest centrality of a player (Fig. 6F). High values of these four metrics are related to strong and robust networks: (i) a high clustering coefficient is an indicator of local robustness31,38, (ii) the largest eigenvalue λ1 is also an indicator of global robustness53; when the number of nodes and links are the same, λ1 increases when important players are, in turn, connected between them, (iii) a high centrality dispersion together with a high value of maximum centrality are indicators of heterogeneity in the network structure, and heterogeneous networks are know to have strong resilience against random failures55 (i.e., the loss of weight of the links, due to lost passes, would have less impact on the overall structure).

Figure 6
figure6

Network parameters depend on scoring/receiving a goal. (A) clustering coefficient C, (B) average shortest-path d, (C) largest eigenvalue λ1 of the connectivity matrix, (D) algebraic connectivity \({\tilde{\lambda }}_{2}\), (E) centrality dispersion ECdisp and (f) highest eigenvector centrality ECmax. Parameters are obtained for all teams and are shown in a two-dimensional plot, where the horizontal axis corresponds to the value of a metric when the team receives a goal and the vertical axis is the same metric obtained when the team scores a goal. Solid lines correspond to the function y = x, helping to identify wether a given parameter increases or decreases when a goal is scored/received. Each point represents the average along the whole season.

At the same time, the analysis shows low values at other 2 metrics: the shortest-path length d (Fig. 6B) and the algebraic connectivity \({\tilde{\lambda }}_{2}\) (Fig. 6D). In this case, having a low shortest-path length is an indicator of a better connection between players, since the ball can travel from a player to any other in a lower number of steps. Finally, it is interesting to note that FCB has one of the lowest algebraic connectivities, which is an indicator of structural integration. Low values of \({\tilde{\lambda }}_{2}\) reflect that the team is more split into two different groups. Note that, when the algebraic connectivity \({\tilde{\lambda }}_{2}\) is calculated from the average connectivity matrix (Fig. 3D), FCB has a value higher than their rivals, reflecting a higher cohesion of the whole team. However, when it is computed from the 50-pass networks, FCB algebraic connectivity is one of the lowest. A possible explanation is that cohesion of the team may be grounded on a higher number of passes between players, and not on the topological organization of the network.

Discussion

What passing networks tell us about FCB

As we have seen, using Network Science to analyze football passing networks gives a new perspective that allows distinguishing between different teams and relating network properties to the teams particular style of playing. Here, we have made use of these metrics to characterize the passing networks of Guardiola’s Barcelona, focusing on the season 2009/2010 of the Spanish national league, one of the years where FCB was considered to reach its top in terms of playing style and trophies. When passing networks are constructed as a simple addition of all passes made between players during the match, statistically significant differences between the passing networks of FCB and its rivals arise. Specifically, the clustering coefficient, the shortest-path, the largest eigenvalue of the connectivity matrix and the algebraic connectivity, always have “better” values in the Catalan team. The term “better” refers to the fact that differences in these network properties are related with a higher local resilience against the loss of passes (due to a higher clustering), a lower number of steps to connect any two players of the teams (due to a lower shortest-path length) and a higher connectedness between the whole team, as indicated by a higher largest eigenvalue of the connectivity matrix and a higher algebraic connectivity.

However, it is worth looking beyond the differences in the network metrics and trying to find the reasons behind them. When focusing on the number of passes made by FCB we can, first, observe that it is much higher than their rivals and, second, that the advance ratio, measuring the percentage of distance that the ball advances parallel to the opponent’s goal is also much higher. Concerning the latter, note that the advance ratio is not related to the number of passes and, therefore, there is not an obvious reason why it should influence network parameters. However, the number of passes has, indeed, crucial consequences on any quantitative analysis using Network Science. The fact that we are comparing networks with the same number of nodes (eleven) but links with different weights (number of passes) has unavoidable consequences on the network parameters. For example, since the “topological” distance between two directly connected players is given by the inverse of the number of passes between them, the higher the average number of passes of a team, the lower topological distance between their players. Despite being obvious, a reasonable conclusion of the study is that increasing the number of passes benefits the general properties of passing networks. However, comparing the properties of two networks with different number of passes hinders the role played by the network topology itself, i.e., we can not say that a network is better organized, since we can not separate the effect of the number of passes (“quantity”) from that of the topology of the network (“quality”).

A second issue related to the number of passes is possession. Note that the number of passes is intimately related to the possession a team has. A team with higher possession will unavoidably have more passes and that is exactly what FCB, under the guidance of Guardiola, is doing. But to what extend can we relate possession to the particular organization of FCB passing networks? Are the reported values of its network parameters just a consequence of having the ball more time?

A third issue arises when trying to interpret the results of the averaged passing networks. Since, as we have seen, network organization and, consequently, network parameters, are continuously evolving during the match, considering the sum of all passes may hide interesting information about how different crucial events influence a team’s style of playing, such as a scored/received goal, a substitution or, simply, the fatigue of the players as time goes by.

In order to overcome these three issues and, particularly, to exclude the influence of the number of passes (or possession) and, at the same time, accounting for the evolution of the network topology we studied the properties of the 50-pass networks. A part from the benefits of tracking their temporal evolution, 50-pass networks contain exactly the same number of nodes and links for the two teams playing a match, which allows a direct comparison of the network organization, no matter what the final number of passes of each team is. However, the tracking of the parameters of the 50-pass network shows that network parameters are in continuous evolution, which increases the complexity of the analysis. Here, we focused on the state of the passing network just before scoring/receiving a goal, which allows to extract information about what are the network properties associated to the ability of a team to score/receive a goal. With such an approach we were able to complement the information extracted from the averaged passing networks, obtaining a more detailed profile of Guardiola’s team. These results reinforced all the conclusions drawn by analyzing average passing networks and included the following additional information about FCB:

  1. 1.

    It is the team that requires the shortest time to construct 50-pass networks, and this time remains unaltered when scoring/receiving a goal,

  2. 2.

    It is the team with the highest advance ratio (i.e., the team that plays the most horizontal to the opponent’s goal) and this metric is specially high before scoring a goal,

  3. 3.

    The dispersion of the players around the network centroid is the lowest but significantly increases before receiving a goal,

  4. 4.

    The clustering coefficient is higher when receiving goal than when a goal is scored,

  5. 5.

    The shortest-path is one of the lowest and does not depend on scoring/receiving a goal,

  6. 6.

    The largest eigenvalue of the adjacency matrix, measuring the strength of the network is the largest, and significantly increases before receiving a goal,

  7. 7.

    The algebraic connectivity, measuring the cohesion between groups of players, decreases before receiving a goal (i.e., the interplay between groups is reduced),

  8. 8.

    The highest centrality acquired by a single player and the centrality dispersion are the highest, which indicates that the importance of players in the FCB network is not evenly distributed, with one player, Xavi, being the hub of the passing networks.

Note that all these patterns refer exclusively to FCB, while passing networks corresponding to other teams behave in its own way. Therefore, one of the conclusions we can draw from Figs 5 and 6 is that variables of each team before scoring/receiving a goal behave in a particular way. For example, as we can see in Fig. 5D, the dispersion of FCB’s players around the position of the network’s centroid is higher when a goal is received, indicating that when players are more separated from the centroid, the risk of receiving a goal increases. However, if we look at the same parameter for Valencia CF, we can observe that the behaviour is just the opposite, and higher dispersions around the team’s centroid (note that in this case players are occupying more field) are reported when scoring a goal.

Finally, it is worth mentioning the limitations and risks of our study. As we have seen, computing the parameters related to the average passing networks gives interesting, but limited, information about the way a team is organized. As shown in Fig. 4, there exist strong fluctuations on the network parameters during a match and defining 50-pass networks is a reasonable option to capture the evolution of the structure of passing networks. However, there are associated issues and alternatives that may be explored in further studies. For example, the length of the 50-pass networks could be adapted to capture the “momentum” of the match, which may change from team to team or just due to the events occurring during the match. Therefore, it would be interesting to find a way of defining the most adequate time windows and how the length of these windows are related to the particular style of playing a team has. Another limitation is related to the causes of the parameter fluctuations, since they can have different origins (a goal, a substitution, fatigue, etc…). It would be extremely useful to identify all possible variables affecting the network organization and compute the network parameters after these particular events occur, trying to identify what are those variables that crucially change the style of playing of a given team.

An interpretation within a football framework

Going beyond passing networks, the strategy of having the ball most of the time leads, in general, to controlling the game by creating a dynamical context to which the opposing team needs to adapt and, in particular, gave FCB a systematic superiority that led to an increase of the scoring opportunities.

Firstly, FCB defense can lengthen or shorten the space by moving the line of defenders forwards or backwards. In other words, it can play with the occupied length of the field and use the off-side area in its favor. The fact that FCB network centroid was advanced (in average) compared to its rivals (see Fig. 2E), left the opponents a smaller area of the pitch and fewer playing options.

Furthermore, Barcelona organized the team into “situational areas” around the ball, which comprised the commitment of five or six players. Inside these areas, the team must overcome a challenge, i.e., either play the ball or recover it, leading to a division of the game into two phases. Players organized spontaneously inside these situational areas (and, as we will discuss, after training these situations), communicating with each other and exchanging physical, verbal, and motor-related signals. This way of modulating the playing field into building blocks leads to more playing patterns, resulting in more different options to overcome the rival.

Specifically, during the attacking phase (see Fig. 7), the player with the ball had a helping area #1 (also known as the helping zone) with two players forming possible triangles within a distance d1 of 10 to 15 meters. At the same time, there was a co-operation area (#2) with two more players (one slightly forward and the other covering the back) occupying a wider radius d2 (around 20 meters). During this phase, passes were promoted between players inside the situational area, which, from the network perspective, resulted in a higher clustering coefficient (Fig. 3A) and a lower shortest-path distance between them (Fig. 3B). In addition, trying to keep the game inside a situational area promoted the creation of short passes, reducing the risks of losing the ball, as opposed to long passes.

Figure 7
figure7

F.C. Barcelona organization during “attacking phases”. Four players organize around a fifth player who is having the ball. Two concentric circles around the ball define the helping zone (radius d1) and the cooperation zone (radius d2). Passes between players in the helping zone are promoted. The defensive phase is organized in a similar way, but in this case, pressing the opponent who has the ball.

On the other hand, the defensive phase started as soon as the opponent had the ball and was based on the creation of a large “interception space” to increase the chance of recovery. Similarly to the attacking phase, two regions were organized and coordinated over a radius of 20 meters. The fact that FCB played more advanced towards the opponent’s goal than their rivals, (see Fig. 2A) together with the coordinated pressure, made any eventual recovery more dangerous, increasing the probability of subsequent shooting actions.

In addition to dividing the field into various areas, a distinctive factor of FCB was the role players adopted and their area of specialization. The fact that FCB promoted generalist players is linked to what is known as “total football”46. In effect, with the FCB’s playing style, all players could play the ball, recover it, and score. As a consequence, a possible interpretation could be that more generalist profiles tend to generate more connections, take more advantage of the space, and generate different game options, leading to more complex passing networks. In addition, a team based on generalist players forces opponents to spend more energy and work harder at coordination. For example, a team without an obvious centre-forward player generates ambiguity and uncertainty for the three or four opposing defenders. One consequence of the promotion of generalist players is the the fact that, from the 18 field players that played more than 1000 minutes during the season, only 3 of them did not score a goal (Milito, Maxwell and Abidal).

Furthermore, a number of generalist players promoted the arousal of spontaneous playing patterns, that is, different ball flows and/or positions for players who are successfully scoring goals, passing, or recovering the ball. By managing the right trajectories and the right supporting positions, the opponent was forced to cover more ground running and increasing his fatigue. Controlling the ball while the opponent run out of energy leaded to much better positions for gaining superiority, creating surprises, and obtaining opportunities to score.

At the same time, it is worth noting the existence of a core group of players whose participation in the passing networks was higher than the rest. This fact is indicated by the high eigenvalue λ1 (Fig. 6C), the high heterogeneity in the centrality of the players (Fig. 6E) and the existence of a player with the maximum centrality higher than the other teams (Xavi) (see Fig. 6F). In addition, the existence of this core could be related to the fact that the algebraic connectivity is reduced when analyzing 50-pass networks (an indicator of the existence of groups), since an underlying core-periphery structure, combining “leading” players with “follower” players, may lead to the existence of two identifiable communities. In this way, the existence of 4–5 players that carried and passed the ball most often could be translated into the existence of a certain distributed leadership in the different situational areas and phases of the game — while the other players followed, coordinately, the game carried out by these leaders.

Finally, we have to remark that the tactical organization was carefully planned and trained by Guardiola and his technical staff, and it was not a matter of serendipity46. In fact, this style of playing was one of the FCB’s signatures and it was promoted at lower categories of the team. In this way, seven out of the ten players that played more than 1000 minutes during the 2009/2010 were raised up at La Masia, the FCB youth academy. In addition, three of them (Xavi, Iniesta and Messi) were designed as the three finalists of the Ballon DOr at the end of that season, which is given to the best football player along the whole season.

Summarizing, we have identified a series of particular network properties that make Guardiola’s Barcelona a team different from the rest, allowing the interpretation of the reported network parameters. We believe that further studies taking into account the spatiotemporal evolution of football passing networks, together with recent approaches including the construction of network-of-networks53,56, multilayer networks57,58 or hypernetworks59 could further enhance the understanding of how football teams, in particular, and sport teams in general, organize and evolve along a match and what are the key factors that determine their performance. Furthermore, despite our results are focused on team performance, they can be adapted to evaluate single players and their contribution to the team. This change of “scale”, would imply some collateral issues, such as the difference in the number of matches played by each player or the fact that the position a player has in the team unavoidably affects his/her network properties. However, we believe that this kind of new approaches will be incorporated, in the years to come, to complement classical metrics of player performance.

Methods

Construction of the passing networks

Datasets, provided by Opta, consists of all passes completed along a football match by each team of the Spanish national league (“La Liga”) for the season 2009/2010. Specifically, consists of a set of 380 matches, 38 per team. For each pass, we have the information about: (i) the player who passes the ball, (ii) the player who receives the ball, (iii) the position (x and y coordinates) of the sender/receiver players and (iv) the time at which the pass was made (see Table 1 for details). Since we are concerned about the game of FCB, we focused on all matches played by this team, and analyze the passing networks of FCB and its rivals. We construct networks in two different ways. On one hand, we obtain the match average passing networks, where nodes are players and links represent the number of passes between them. Note that links are unidirectional and weighted according to the number of passes between players. To ease comparison between networks, each titular player is assigned a node at the beginning of the match. If a player is changed, the new player occupies the node of the previous player. In this way, we assure that all networks have eleven players, focusing on the structure of the network as a whole instead of the performance of isolated players.

Table 1 Example of the dataset structure.

On the other hand, we construct the “50-pass networks” with the aim of accounting for the temporal evolution of the game. 50-pass networks contain only 50 consecutive passes and are assigned the time of the last of these passes. This way, when the match begins, we wait for the first l = 50 passes to occur and, at this moment called t0, we construct and analyze the 50-pass network Gt0. Next, each time a new pass is made, we disregard the oldest of the passes of the network and include the new one, assigning the time of the last pass t to the new network Gt. This kind of networks has two advantages compared to the averaged ones: (i) it accounts for the fluctuations of the network parameters along the match and (ii) it has exactly the same number of nodes and links for both teams, which detaches the influence of the absolute number of passes and focuses only on the structural differences between networks. It is worth noting that the number of passes to construct the network could be modified to another quantity, however it should be low enough to account to the fluctuations occurring during the match (i.e., avoiding averages) but long enough to guarantee the connectivity between all nodes of the network. In our case, we analyzed the effects of using different number l of passes and chose l = 50 as a trade-off value.

Definition of network metrics

Centroid coordinates and dispersion

X〉 and 〈Ycentroid coordinates correspond to the average position of all pases of the network, i.e., all passes of the match in the average network and only 50 of them in the 50-pass passing networks. Specifically, we only consider the position from where the pass is sent. Values are given in field coordinates, which, in both axis, range from 0.00 to 100.00. In this way, the center of the field corresponds to coordinates [50.00,50.00] and the center of the opponent’s goal is [100.00, 50.00] (being [0.00,50.00] the center of the own team’s goal). The centroid dispersion Centdisp corresponds to the standard deviation of the distances of the players with regard to the position of the network centroid.

Clustering coefficient

In general, the local clustering coefficient of a node i is obtained as the percentage of the nodes directly connected to it that, in turn, are connected between them. This measure can be averaged along the N nodes of the network to obtain the average clustering coefficient. However, when the network is weighted, we can not simply account for the number of nodes connected between them but, also, how the link weights are distributed. This is the case of passing networks, where the number of passes between pairs of players is not constant. In this way, we use the weighted clustering coefficient Cw(i) to measure the likelihood that neighbours of a given player i will also be connected between them60:

$${C}_{w}(i)=\frac{{\sum }_{j,k}{w}_{ij}{w}_{jk}{w}_{ik}}{{\sum }_{j,k}{w}_{ij}{w}_{ik}}$$
(1)

where j and k are any two players of the team and wij and wik the number of passes between a third player i and both them. Finally, the clustering coefficient of the whole network is obtained by averaging Cw(i) over all players, i.e., \(C=\frac{1}{N}{\sum }_{i=1}^{N}{C}_{w}(i)\). Note that, the weighted version of the clustering coefficient characterizes the tendency of the team to form balanced triangles between players and it is a measure of local robustness.

Shortest-path length

In a passing network, the shortest path length d is the minimum number of players that must be traversed by the ball to go from one player to any other. Since passing networks are weighted (i.e., the number of passes between players is different), we have to take into account the different weights of the links, considering that, the higher the weight, the shorter the topological distance between two nodes. The topological length lij of the link between two players i and j is defined as the inverse of the link weight, lij = 1/wij. However, when computing d for weighted networks, the shortest-path length between a pair of players may not be a direct link, since there could exist a shorter path by combining two (or more) alternative links. Therefore, we compute the minimal shortest-path pij between all pairs of players using the Dijkstra’s algorithm61. Next, we define the average shortest path d of the whole team as:

$$d=\frac{1}{N(N-1)}\sum _{i,{j}_{i\ne j}}{p}_{ij}$$
(2)

where N = 11 is the total number of players of the team.

Largest eigenvalue of the adjacency matrix

The largest eigenvalue λ1 of the weighted adjacency matrix A of a network is a measure of the network strength53. The weighted adjacency matrix A is a N × N matrix whose elements aij contain the number of passes going from player i to player j. The largest eigenvalue of A is bounded by the average number of passes between players 〈S〉, as λ1 ≥ 〈S〉, and also by \({s}_{max}\ge {\lambda }_{1}\ge max(\langle S\rangle ,\sqrt{{s}_{max}})\)62, where smax is the maximum number of passes that a player has made to any other player of his team. As a rule of thumb, networks with higher number of links (passes) will have a higher λ1 and networks with the important nodes connected between them (known as assortative networks) will also have higher λ1 than networks where the hubs (i.e., important players) are not directly connected between them.

Algebraic connectivity

The algebraic connectivity \({\tilde{\lambda }}_{2}\) corresponds to the second smallest eigenvalue of the Laplacian matrix \(\tilde{L}\), which is defined as \(\tilde{L}=S-A\), with A being the weighted adjacency matrix and S a diagonal matrix whose i-elements are the sum of the passes made by player i. The algebraic connectivity is closely related to both structural and dynamical properties of networks31,62,63. On one hand, algebraic connectivity is an indicator of the modular structure of a network13: The lower the \({\tilde{\lambda }}_{2}\), the clearer the existence of independent groups inside the network, with the limit value of \({\tilde{\lambda }}_{2}=0\) indicating the existence of, at least, two disconnected groups in the network. In the framework of multilayer networks, one can interpret the value of \({\tilde{\lambda }}_{2}\) as a way to quantify structural integration and segregation of different network layers64. On the other hand, \(1/{\tilde{\lambda }}_{2}\) is proportional to the time required to reach equilibrium in a linear diffusion process65. Additionally, the time tsync to reach synchronization of an ensemble of phase oscillators that are linearly and diffusively coupled is also proportional to \(1/{\tilde{\lambda }}_{2}\)54.

Eigenvector centrality: Maximum value and dispersion

The eigenvector centrality ec(i) of a player i is a measure of node importance that is obtained by calculating the eigenvector v1 associated to the largest eigenvalue λ1 of the weighted adjacency matrix A. The eigenvector centrality is a measure of node importance that takes into account the number of all directed connections a player (node) has. Furthermore, two factors contribute to increase the value of eigenvector centrality: (i) a higher number of direct connections to other players (note that connections are weighted) and (ii) to be connected to other nodes that, in turn, also have a high centrality. In this way, important players are those that are (highly) connected to other important players of the team.

50-pass network time

The 50-pass network time tdiff is the time required to construct a 50-pass network. It is obtained subtracting the time of the first pass of the network from the time of the last pass. Teams with shorter tdiff are those that generate more passes in less time.

Statistical analysis

All parameters of Figs 2 and 3 have been compared pairwise with the Wilcoxon ranksum test, as the number of observations to compare was small enough to prevent us from safely assuming normality (<40 in most of the cases). However, the t-statistics yielded the same rejections of the null hypothesis (central tendency equality, median or mean) in all parameters. As the number of comparisons (20) would raise type I errors, p-values have been corrected for multiple comparisons with non parametric false discovery rate (FDR)66 for α = 0.01, which changed some results on the verge on significance. After FDR correction, α = 2.7132e−04 (0.004 if we originally set alpha at 0.01). <Y> was not statistically significant for any threshold, which is expected, and should not change with the number of observations. On the contrary, eigenvector centrality dispersion (p = 0.0042) should be considered significantly different only if we keep alpha unaltered. After FDR correction we cannot state any difference confidently. The centroid dispersion remains significant in any case, although just barely (p = 2.6e−4). In both cases, conclusions must be taken with caution, and we would need more statistical power (i.e., more data) to assert confidently that there are statistically significant differences in those parameters.

References

  1. 1.

    Barabási, A. L. et al. Evolution of the social network of scientific collaborations. Physica A 311, 590–614 (2002).

    ADS  MathSciNet  Article  Google Scholar 

  2. 2.

    Girvan, M. & Newman, M. E. Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99, 7821–7826 (2002).

    ADS  MathSciNet  CAS  Article  Google Scholar 

  3. 3.

    Eubank, S. et al. Modelling disease outbreaks in realistic urban social networks. Nature 429, 180 (2004).

    ADS  CAS  Article  Google Scholar 

  4. 4.

    Vega-Redondo, F. Complex social networks. (Cambridge University Press, 2007).

  5. 5.

    Centola, D. The spread of behavior in an online social network experiment. Science 329, 1194–1197 (2010).

    ADS  CAS  Article  Google Scholar 

  6. 6.

    Katz, L. A new status index derived from sociometric analysis. Psychometrika 18, 39–43 (1953).

    Article  Google Scholar 

  7. 7.

    Wasserman, S. & Faust, K. Social Network Analysis: Methods and Applications, (Cambridge University Press, 1994).

  8. 8.

    Borgatti, S. Centrality and network flow. Social Networks 27, 55–71 (2005).

    ADS  Article  Google Scholar 

  9. 9.

    Newman, M. E. A measure of betweenness centrality based on random walks. Social Networks 27, 39–54 (2005).

    ADS  Article  Google Scholar 

  10. 10.

    Goldenberg, J., Han, S., Lehmann, D. R. & Hong, J. W. The role of hubs in the adoption process. Journal of Marketing 73, 1–13 (2009).

    Article  Google Scholar 

  11. 11.

    Newman, M. E. The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. 98, 404–409 (2001).

    ADS  MathSciNet  CAS  Article  Google Scholar 

  12. 12.

    Fortunato, S. Community detection in graphs. Phys. Rep. 486, 75–174 (2010).

    ADS  MathSciNet  Article  Google Scholar 

  13. 13.

    Fortunato, S. & Hric, D. Community detection in networks: A user guide. Phys. Rep. 659, 1–44 (2016).

    ADS  MathSciNet  Article  Google Scholar 

  14. 14.

    Teitelbaum, T., Balenzuela, P., Cano, P. & Buldú, J. M. Community structures and role detection in music networks. Chaos 18, 043105 (2008).

    ADS  CAS  Article  Google Scholar 

  15. 15.

    Pastor-Satorras, R. & Vespignani, A. Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86, 3200 (2001).

    ADS  CAS  Article  Google Scholar 

  16. 16.

    Newman, M. E. Spread of epidemic disease on networks. Phys. Rev. E 66, 016128 (2002).

    ADS  MathSciNet  CAS  Article  Google Scholar 

  17. 17.

    Nekovee, M., Moreno, Y., Bianconi, G. & Marsili, M. Theory of rumour spreading in complex social networks. Physica A 374, 457–470 (2007).

    ADS  Article  Google Scholar 

  18. 18.

    Balcan, D. et al. Multiscale mobility networks and the spatial spreading of infectious diseases. Proc. Natl. Acad. Sci. 106, 21484–21489 (2009).

    ADS  CAS  Article  Google Scholar 

  19. 19.

    Barabási, A. L. The origin of bursts and heavy tails in human dynamics. Nature 435, 207 (2005).

    ADS  Article  Google Scholar 

  20. 20.

    Ugander, J., Karrer, B., Backstrom, L. & Marlow, C. The anatomy of the facebook social graph. arXiv:1111.4503 (2011).

  21. 21.

    Gonc¸alves, B., Perra, N. & Vespignani, A. Modeling users’ activity on twitter networks: Validation of Dunbar’s number. PloS ONE 6, e22656 (2011).

    ADS  Article  Google Scholar 

  22. 22.

    González-Bailón, S., Borge-Holthoefer, J., Rivero, A. & Moreno, Y. The dynamics of protest recruitment through an online network. Sci. Rep. 1, 197 (2011).

    ADS  Article  Google Scholar 

  23. 23.

    Grabowicz, P. A., Ramasco, J. J., Moro, E., Pujol, J. M. & Eguiluz, V. M. Social features of online networks: The strength of intermediary ties in online social media. PloS ONE 7, e29358 (2012).

    ADS  CAS  Article  Google Scholar 

  24. 24.

    Weng, L., Menczer, F. & Ahn, Y. Y. Virality prediction and community structure in social networks. Sci. Rep. 3, 2522 (2013).

    ADS  Article  Google Scholar 

  25. 25.

    Cheng, J., Adamic, L., Dow, P. A., Kleinberg, J. M. & Leskovec, J. Can cascades be predicted?. In Proceedings of the 23rd international conference on World Wide Web 925–936. ACM (2014).

  26. 26.

    Koenig, M. D. & Battiston, S. From Graph Theory to Models of Economic Networks. A Tutorial. Eds. Naimzada, A. K., Stefani, S. & Torriero, A. (Springer Berlin Heidelberg, Berlin, Heidelberg), 23–63 (2009).

  27. 27.

    Vitali, S., Glattfelder, J. B. & Battiston, S. The network of global corporate control. PloS ONE 6, e25995 (2011).

    ADS  CAS  Article  Google Scholar 

  28. 28.

    Ferrara, E., De Meo, P., Catanese, S. & Fiumara, G. Detecting criminal organizations in mobile phone networks. Expert Systems with Applications 41, 5733–5750 (2014).

    Article  Google Scholar 

  29. 29.

    Li, R. et al. Simple spatial scaling rules behind complex cities. Nature. Comm. 8, 1841 (2017).

    ADS  Article  Google Scholar 

  30. 30.

    Buldú, J. M. et al. Using network science to analyse football passing networks: Dynamics, space, time, and the multilayer nature of the game. Front. Psychol. 9, 1900 (2018).

    Article  Google Scholar 

  31. 31.

    Newman, M. E. J. Networks: An introduction. (Oxford University Press, New York, 2010).

  32. 32.

    Ramos, J., Lopes, R. J. & Araújo, D. What’s Next in Complex Networks? Capturing the Concept of Attacking Play in Invasive Team Sports. Sports Med. 48, 17–28 (2018).

    Article  Google Scholar 

  33. 33.

    Gould, P. & Gatrell, A. A structural analysis of a game: The Liverpool vs manchester united cup final of 1977. Soc. Netw. 2, 253–273 (1979).

    Article  Google Scholar 

  34. 34.

    Duch, J., Waitzman, J. S. & Amaral, L. A. N. Quantifying the Performance of Individual Players in a Team Activity. PLoS ONE 5, e10937 (2010).

    ADS  Article  Google Scholar 

  35. 35.

    Gyarmati, L. & Anguera, X. Automatic Extraction of the Passing Strategies of Soccer Teams. arXiv:1508.02171 (2015).

  36. 36.

    Narizuka, T., Yamamoto, K. & Yamazaki, Y. Statistical properties of position-dependent ball-passing networks in football games. Physica A 412, 157–168 (2014).

    ADS  MathSciNet  Article  Google Scholar 

  37. 37.

    Cotta, C., Mora, A. M., Merelo, J. J. & Merelo-Molina, C. A network analysis of the 2010 FIFA world cup champion team play. J. Syst. Sci. Complex. 26, 21 (2013).

    Article  Google Scholar 

  38. 38.

    Watts, D. J. & Strogatz, S. H. Collective dynamics of small-world networks. Nature 393, 440–442 (1998).

    ADS  CAS  Article  Google Scholar 

  39. 39.

    Milo, R. et al. Network motifs: simple building blocks of complex networks. Science 29, 824–827 (2002).

    ADS  Article  Google Scholar 

  40. 40.

    Gyarmati, L., Kwak, H. & Rodríguez, P. Searching for a Unique Style in Soccer. In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (KDD) Workshop on Large-Scale Sports Analytics (2104).

  41. 41.

    Clemente, F. M., Santos Couceiro, M., Lourenço Martins, F. M. & Sousa Mendes, R. Using Network Metrics in Soccer: A Macro-Analysis. J. Hum. Kinet. 45, 123–134 (2015).

    Article  Google Scholar 

  42. 42.

    López Peña, J. & Sánchez Navarro, R. Who can replace Xavi? A passing motif analysis of football players. arXiv:1506.07768 (2015).

  43. 43.

    Gonçalves, B. et al. Exploring team passing networks and player movement dynamics in youth association football. PLoS ONE 12, e0171156 (2017).

    Article  Google Scholar 

  44. 44.

    Whitehouse, M. Universality: The Blueprint for Soccer’s New Era. Bennion Kearny Limited (2014).

  45. 45.

    Caruncho, D. R. FC Barcelona: The Complete History of the Club. Dosde Publishing. Barcelona (2017).

  46. 46.

    Wilson, J. The Barcelona Inheritance: The Evolution of Winning Soccer Tactics from Cruyff to Guardiola. Nation Books. New York (2018).

  47. 47.

    Balague, G. Pep Guardiola: Another way of winning: The biography. Orion (2012).

  48. 48.

    Violan, M. A. Pep Guardiola: The Philosophy that Changed the Game. Meyer & Meyer Verlag (2014).

  49. 49.

    Perarnau, M. Pep Guardiola: The Evolution. Birlinn Ltd. (2016).

  50. 50.

    López-Peña, J. & Touchette, H. A network theory analysis of football strategies. In C. Clanet (ed.), Sports Physics: Proc. 2012 Euromech Physics of Sports Conference, p. 517–528, Éditions de l’École Polytechnique, Palaiseau, (ISBN 978-2-7302-1615-9) (2012).

  51. 51.

    Cintia, P., Rinzivillo, S. & Pappalardo, L. A network-based approach to evaluate the performance of football teams. In Machine Learning and Data Mining for Sports Analytics Workshop, Porto, Portugal (2015).

  52. 52.

    McMath, D. Take the Ball Pass the Ball: The Making of the Greatest Team in the World. Documentary, 1h. 47 min (2018).

  53. 53.

    Aguirre, J., Papo, D. & Buldú, J. M. Successful strategies for competing networks. Nat. Phys. 9, 230 (2013).

    CAS  Article  Google Scholar 

  54. 54.

    Almendral, J. A. & Díaz-Guilera, A. Dynamical and spectral properties of complex networks. New Journal of Physics 9, 187 (2007).

    ADS  Article  Google Scholar 

  55. 55.

    Albert, R., Jeong, H. & Barabási, A. L. Error and attack tolerance of complex networks. Nature 40, 378 (2000).

    ADS  Article  Google Scholar 

  56. 56.

    Gao, J., Buldyrev, S. V., Havlin, S. & Stanley, H. E. Robustness of a network of networks. Phys. Rev. Lett. 107, 195701 (2011).

    ADS  Article  Google Scholar 

  57. 57.

    Kivelä, M. et al. Multilayer networks. J. Cplx. Netw. 2, 203–271 (2014).

    Google Scholar 

  58. 58.

    Boccaletti, S. et al. The structure and dynamics of multilayer networks. Phys. Rep. 544, 1–122 (2014).

    ADS  MathSciNet  Article  Google Scholar 

  59. 59.

    Ramos, J., Lopes, R. J., Marques, P. & Araújo, D. Hypernetworks Reveal Compound Variables That Capture Cooperative and Competitive Interactions in a Soccer Match. Front. Psychol. 8, 1379 (2017).

    Article  Google Scholar 

  60. 60.

    Ahnert, S. E., Garlaschelli, D., Fink, T. M. A. & Caldarelli, G. Ensemble approach to the analysis of weighted networks. Phys. Rev. E 76, 016101 (2007).

    ADS  CAS  Article  Google Scholar 

  61. 61.

    Dijkstra, E. W. A note on two problems in connection with graphs. Numer. Math. 1, 269–271 (1959).

    MathSciNet  Article  Google Scholar 

  62. 62.

    Van Mieghem, P. Graph spectra for complex networks. (Cambridge, UK: Cambridge University Press, 2011).

  63. 63.

    Masuda, N., Porter, M. A. & Lambiotte, R. Random walks and diffusion on networks. Phys. Rep. 716–717, 1–58 (2017).

    ADS  MathSciNet  Article  Google Scholar 

  64. 64.

    Radicchi, F. & Arenas, A. Abrupt transition in the structural formation of interconnected networks. Nat. Phys. 9, 717–720 (2013).

    CAS  Article  Google Scholar 

  65. 65.

    Gómez, S. et al. Diffusion dynamics on multiplex networks. Phys. Rev. Lett. 110, 028701 (2013).

    ADS  Article  Google Scholar 

  66. 66.

    Benjamini, Y. & Yekutieli, D. The control of the false discovery rate in multiple testing under dependency. Annals of Statistics 29, 1165–1188 (2001).

    MathSciNet  Article  Google Scholar 

Download references

Acknowledgements

Authors acknowledge Johann Martínez, José Luis Herrera Diestra, Roberto López, Esteban Granero, Chechu Fernández Conde and Joan Bennassar for fruitful conversations. J.M.B. is founded by MINECO, Spain (FIS2017-84151-P). Datasets were provided by Opta.

Author information

Affiliations

Authors

Contributions

J.M.B., J.B. and F.S. conceived the ideas behind the paper. J.M.B. conducted the analysis of the datasets. I.E. carried out the statistical analysis. J.M.B., J.B., I.E. and F.S. analyzed the results. All authors wrote and reviewed the manuscript.

Corresponding author

Correspondence to J. M. Buldú.

Ethics declarations

Competing Interests

The authors declare no competing interests.

Additional information

Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Buldú, J.M., Busquets, J., Echegoyen, I. et al. Defining a historic football team: Using Network Science to analyze Guardiola’s F.C. Barcelona. Sci Rep 9, 13602 (2019). https://doi.org/10.1038/s41598-019-49969-2

Download citation

Further reading

Comments

By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.