Plants are the building blocks of food production on Earth. Their role is crucial in the transformation and use of chemical energy to sustain the energy transfer in food webs and ultimately to feed any animal species. Despite their importance, they are seldom considered in ecological analysis of food webs and more generally they have attracted a relatively small interest for people studying complex networks. Actually, the study of vegetable world is revealing more and more evidence of the fact that different plants have many unexpected ties connecting them with each other. For instance, they are able to interact with the environment and to actively defend themselves from predators. On this respect, we note that the recipe that animal developed for the same purpose was to create an energetically expensive neural and locomotion system. This is mainly due to the fact that single individuals are indeed “in-dividual”, that is they cannot be divided without killing them. Plants “individuals” instead can even propagate by their division and generally tolerate a loss of some of their parts. For this reason, in order to perform defensive tasks, they developed a series of features remarkably different than those of animal species. As a result, plants communicate, or “signal”, with each other, using a complex internal analysis system to find nutrients, spread their species and even defend themselves against predators1,2. Plants have solved all these problems in different ways, shaping the plant growth, adapting to the different environmental constrains, using different kind of vectors in many phase of their life to overcome their immobility. One of the most critical stages in the life of any plant is the dispersal of seeds into a suitable habitat. To do this plants make effective use of many external agents such as wind, water, insects or higher animals. In order to track the many different series of strategies we need a measure to determine how much the same feature (i.e. fruit shape or diaspora mechanism) are different in two distinct species. A similar process is at the basis of taxonomic classification where plants are clustered according for example to properties (number of stamen) of plants, while cladistic classification is instead based on common ancestory.

In this paper we use network analysis3,4,5,6 of some relational data about different plants with the aim of finding classes of “similar” plants. This analysis allows a clustering of species able to reveal and quantify similarity with respect to different species. In network theory, the various elements of an ensemble (i.e. plants in vegetal kingdom) are represented by vertices and they can be joined by considering common features they have. The number of common edges becomes then a quantitative proxy of relationships that are otherwise impossible to measure. In this respect this is similar to what happen in technological systems where the number of e-mails7, likes on Facebook8, or retweet between two persons9, becomes a number assessing the strength of an acquaintance or even friendship. When passing to biology, network theory has been fruitfully used to determine structure and robustness of Food Webs10, as well as the structure of protein interactions in the cell11 with important applications to human diseases12. As previously mentioned, compared to other topics in biology, plants received a minor attention from networks scientists, despite some tentatives of comparing different ecosystems looking for steady (i.e. “universal”) behaviours13. In order to adapt to the environment in which they live, plants have evolved an astonishing number of different mechanisms and structures to disperse their seeds. Typically, plants evolved in time to adapt to the environment in which they lived, so that only the mutations giving a comparative advantage with others were selected. Today, after 500 million years of plant evolution we are witnessing a huge differentiation in the features of plants as seed form and dispersal structure. Of the 250,000 today known flowering plants just a small fraction (5,000) has been classified in available databases on the basis of the variety of seed features.

These features can be represented by a graph of correlation, providing an effective taxonomy of vegetable species. The basic idea is to represent the information on plants, by means of a bipartite graph. A graph G(N, E) is a mathematical object composed by N vertices and E edges. In a bipartite graph, vertices are divided in two sets and the connections are made only from vertices of one set towards vertices of the other set. From one side we have the different plants, on the other side the various features. This information is transformed into two other graphs made by vertices of the same kind (see Fig. 1). In the first case we connect plants with plants on the basis of their common features. In the second case we connect features with features on the basis of how many plants have similar behaviour. Community detection14 in such a graph is a powerful method to classify in a quantitative way the different vertices creating a taxonomic tree15.

Figure 1
figure 1

Bipartite network structure.

From the original graph one can create a graph made by only one of the two sets.

We present here the main results on the analysis conducted on the datasets considered; further detailed analysis is present in the Supplementary Information provided with this paper.


The results presented here are computed on the dataset D3 Dispersal and Diaspore Database16 suitably represented as a network as shown in Fig. 1 and with the details presented in the section “Data”.

Basic network analysis

Plants species networks GP are defined by considering as vertices the plant species i and j in the database; two vertices are linked if they share at least one common property. The 2,662 plants species analysed are representative of 111 families, but the dataset is not homogeneous in terms of families percentages, being dominated by Asteraceae (12.81%), Poaceae (8.72%), Cyperaceae (5.63%), Brassicaceae (5.41%), Rosaceae (5.33%) and Fabaceae (4.58%). In the following we consider both properties related to diaspora morphology () as well as fruit typology (). For the various networks, we considered size (number of edges), order (number of vertices), degree (average and its distribution), density (the ratio of actual vertices against the possible ones), clustering and finally (in the next section) the community structure.

Diaspora-based graph

A weight wij of each link eij can be defined by the total number of shared properties between plant i and plant j. The order of is given by N = 2,662 vertices (plants species) and the size by E = 1,176,968 edges. The maximum and minimum number of properties shared by two plants are equal to 1 and 4, respectively. The 69.84% of plants share one property, only and the proportion of edges with weight wij = 1 represents the 89.47% of E. On the contrary, just the 3.2% of the species share four properties and wij = 4 links accounts for the 0.1% of the graph total number of edges E.

As regards the basic metrics, we can describe as a weakly connected graph, whose density is equal to 0.332, the global weighted clustering coefficient is 0.84 and the nodes mean degree is . The network degree distribution P(k), representing the fraction of vertices with degree K > k, is shown in Fig. 2 (panel A, black crosses). More in details, the log-line plot displays degree complementary cumulative distribution function (CCDF). Analogously, panel B (black crosses) displays the graph strength distribution, where the vertices strength s takes into account their connections total weight. Besides, panel C shows local clustering coefficient, defined as the tendency among two vertices to be connected if they share a mutual neighbour. Taken as a whole, Fig. 2 suggests that plants network is not dominated by some central nodes with a huge amount of connections linking them to all the other minor vertices.

Figure 2
figure 2

Basic network analysis.

Complementary cumulative distribution functions (CCDF) of degree and strength are reported in log-line scale in panel A and B, respectively, for both diaspora-based network (black crosses) and fruit-based network (red crosses). Panel C, moreover, shows weighted clustering coefficient distribution. More precisely, CCDF (on y-axis) is plotted versus the weighted clustering parameter (x-axis) on linear scale.

Fruit-based graph

We extended our analysis to the ecological properties of the fruit related to seed dispersal. Following the same approach, we created as a projection of the bipartite graph where the plants are associated to fruit features. This creates a graph made up of N = 2,662 vertices (plants species) connected by E = 1,265,831 edges.

Also this graph is sparse with a density 0.357 and an average degree equal to . The weight wij of each link eij is given by the total number of shared properties between plant i and plant j. The maximum number of properties shared by two plants is one, thus suggesting how fruit typology is a more strict parameter to classify plants behaviour related to diaspores, since plants cannot share more than a single trait. Moreover the properties are mutually exclusive, i.e. each species possesses just one of the eight properties analysed. That can be easily verified by building the bipartite projection of the fruit typology graph (not shown) made up by eight vertices, each one equal to a fruit typological property. The number of links of such a network is zero, meaning that two different properties do not share any species between them. Figure 2 (panel A, red crosses) shows the fruit-based graph degree CCDF by log-line scale, while strength CCDF is displayed in panel B (red crosses). The weighted clustering coefficient distribution is not shown for that second graph since is made up by fully connected isolated subgraphs, apart for a couple of nodes. Thus the local clustering coefficient is equal to 1 for all the vertices, while it is undefined for the two interconnected nodes (for a more deep description of the analysed network metrics, refer to Methods section).

Community detection analysis

Diaspora-based graph

We show the result of the community detection on the first graph in Table 1. The communities detection results are obtained by using different algorithms: (i) fastgreedy (FG), (ii) walktrap (WT), (iii) Blondel’s modularity optimisation algorithm (BL) and (iv) label propagation (LP) (see Methods). Each line corresponds to a different subgraph, i.e. a filtered-by-edges-weight version of , with wij [1, 2, 3, 4]. Figure 3 shows the six communities detected by modularity algorithm (BL) in graph . Colours refer both to cluster (panel A) and to families (panel B) membership. Looking to panel A, clusters 3 (cyan), 5 (red) and 6 (blue) are isolated components. The three bigger clusters and the corresponding families they embed are reported in Supplementary Information. Such communities are not homogeneous in terms of family composition (see panel B). Hereafter, the composition of every cluster is summarised, together with the morphological properties that the element families share each other. Notice that one property can be shared by more than a single species in the same cluster, since diaspore morphological features are not mutually exclusive.

  • cluster 1: 884 species (33.21% of database D3 total species); prevailing families: Poaceae, Fabaceae, Rosaceae, Plantaginaceae, Polygonaceae. 709 species have nutrient diaspores, followed by 447 showing flat/wings diaspore morphology; 204 times is encountered the elongated feature;

  • cluster 2: 858 species (32.23%) dominant families: Asteraceae, Cyperaceae, Ranunculaceae, Rosaceae, Apiaceae, Amaranthaceae, Salicaceae, Caprifoliaceae, Potamogetonaceae. The vast majority of the species (782) show elongated diaspore trait; other common observed properties are: hooked (220), ballo/aerenchym (224) and flat/wings (140);

  • cluster 3: 753 species (28.29%), sharing property no specialization. Notwithstanding its big dimensions, that cluster is a completely isolated component robust to changes in clustering algorithms. The leading families belonging to this cluster are summarized in Supplementary Information. They all share the same no specialization property concerning diaspore morphology. That category refers to species whose diaspores can have either a structured surface and no further appendages or specializations (e.g. many Caryophyllaceae), or a smooth surface and no further appendages or specializations (e.g. many Brassicaceae). Caryophyllaceae and Brassicaceae are two of the most numerous families with 86 and 43 species each respectively, besides Orchidaceae (61) and Orobanchaceae (48). Many species found in this cluster are characterized by very small, dust-like seeds, whose dispersal is easily achieved through the wind movements, even without specialized structures;

  • cluster 4: 157 species (5.9%); prevailing families: Brassicaceae, Juncaceae, Plantaginaceae, Asteraceae, Lamiaceae. All these species share mucilaginous diaspore property;

  • cluster 5: 9 plants species belonging to Hydrocharitaceae, Brassicaceae, Polygonaceae and Araceae families. They all show other specialization concerning diaspore morphology. More in detail, 7 out of 9 are aquatic plants (5 species of Hydrocharitaceae and 2 of Araceae family); 1 species belongs to Brassicaceae and 1 to Polygonaceae. The 5 species of Hydrocharitaceae are strictly related: like other Hydrocharitaceae, they are aquatic plants that release their diaspore in water and that, conversely to other plants of the same family, have seeds with very low nutrients content; more, they do not set seeds regularly, preferring asexual reproduction; in both cases (sexual or asexual reproduction) water movements allow the dispersal; the 2 other aquatic (Araceae) also prefer asexual reproduction; having no or little roots, the whole plants can float and disperse; the species belonging to the family of Brassicaceae has dehishent fruits; finally, the species of Polygonaceae rarely produces viable seeds and reproduction is normally asexual (by bulbils);

  • cluster 6: 1 isolated plant, X Calammophila baltica Brand (Poaceae) which doesn’t show any of the used morphological properties with the other species.

Table 1 Plant species in diaspora-based plant graph are grouped on the basis of the common diaspore morphological properties.
Figure 3
figure 3

Communities detection based on diaspore morphology.

The graphs refers to communities detection by modularity method. Panel A shows the six communities which are detected: green, yellow and fuchsia communities are highly connected components. On the contrary, red, blue and cyan clusters are isolated components. While cluster blue just embeds a single species (X Calammophila baltica Brand), cluster cyan is quite big, being composed by the 28.29% of total species present in the database D3, for a total of 12 different families. Panel B shows the families belonging to each cluster. Asteraceae (blue, 12.81%), Poaceae (white, 8.72%), Cyperaceae (dark green, 5.63%), Brassicaceae (yellow, 5.41%), Rosaceae (cerise, 5.33%) are some of the most numerous. The heterogeneous distribution of families inside each clusters is evident.

The total number of species which are part of each cluster and the corresponding total number of families to which they belong are shown in Table 2. Notice the persistent heterogeneity of each cluster. The percentage reported in the third column of Table 2 refers to the relative number of species inside each cluster with respect to the total number of species present in D3 database (2,662). Analogously, the relative number of families inside each cluster (last column, Table 2) is referred to the total amount of families inside the dataset, i.e. 111. Each plant belongs to a single cluster, while different families can characterize different clusters. The results are generally robust to changes in the detection algorithm and to sizes of the filters employed over edges weights. In general we note that the network is made up of a small number of clusters. Some of them behave like weakly-connected components that can be split into a different number of sub-clusters, depending on the applied methodology. For this reason we also made the same analysis on filtered versions of to better focus on the largest components.

Table 2 G1,P(N, E) clusters composition on the basis of diaspore morphological properties.
Communities after pruning of Diaspora-based graph

The same modularity analysis was performed on three filtered-by-edges-weight versions of the seeds features graph. Figure 4 shows the four communities detected by BL algorithm, after filtering by edges weight wij > 1, thus retaining plants connected by more that a single property. In that way only N = 803 vertices/plants species organized into 46 families and 123,939 links survive the pruning. Colors here keep the same meaning of Fig. 3, so that each color in the right panel corresponds to one of the 46 families present in the filtered dataset.

Figure 4
figure 4

Communities detection on a filtered version of graph.

In that case, edges with weight wij = 1 are removed from the original graph. Four clusters are detected (panel A). Clearly each cluster is highly heterogeneous in terms of families composition, but more correspondences are found and some families begin to dominate some cluster (especially red and cyan clusters of left panel). Prevailing families are visible in panel B: Poaceae (white), Cyperaceae (red), Rosaceae (cerise).

Again, detected communities are not homogeneous in terms of family composition. Anyway, more correspondences can be observed between the two panels of Fig. 4. Cluster 1 (red) and clusters 3 (cyan), for example, are less heterogeneous, being composed by Poaceae and Rosaceae families, respectively (white and cerise dots in the right panel). Table 3 reports species and families amount and the corresponding percentage present in each cluster. A brief description of the four clusters identified by BL method is the following.

  • cluster 1: 352 species (43.84% of database D3 total species); Poaceae with 228 species are clearly the prevailing family: see white nodes in panel B of Fig. 4. They are followed by Juncaceae (14 plants), Fabaceae, Santalaceae, Caprifoliaceae, Pinaceae. All these species share that common properties: nutrients (315), flat/wings (312), elongated (240). They do not show (almost most of them) ballo/aerenchyms and mucilaginous surfaces;

  • cluster 2: 345 species (42.96%); dominant families: Cyperaceae (89), Rosaceae (48), Ranunculaceae (42), Asteraceae (29). Cyperaceae are visible as red dots in Fig. 4 (panel B) in the position corresponding to violet cluster of panel A. That cluster embeds species joined by elongated (317) and hooked (211) diaspores shape. Ballo/aerenchyms and flat/wings are shared by 175 and 112 species, respectively. Just 4 species shows mucilaginous surfaces;

  • cluster 3: 37 species (8.95%); Rosaceae family dominates with 23 species, visible as cerise vertices in Fig. 4 (panel B) in the position corresponding to cyan cluster in panel A. Almost all of them share clearly two properties: nutrients and ballo/aerenchyms surfaces;

  • cluster 4: 69 species (4.61%), dominated by those belonging to Potamogetonaceae (20), Plantaginaceae (19) and Amaranthaceae (12) families. All the species have mucilaginous surfaces, some of them show flat diaspores (39), in particular species belonging to Plantaginaceae and Juncaceae families; other individuals show elongated diaspore (41), especially Amaranthaceae, Asteraceae, Potamogetonaceae.

Table 3 Families and species composition for each cluster detected by BL method on a filtered version of graph (wij > 1).

Notice that after pruning , the species dataset reduces to 803 species/vertices and it is made up especially of Poaceae (28.39%), Cyperaceae (11.96%) and Rosaceae (9.09%). Different clusters are dominated by different families: Poaceae (cluster 1), Cyperaceae (cluster 2) and Rosaceae (dominant family in cluster 3 and second dominant family in cluster 2).

In any case, some general conclusions can be drawn after pruning . Poaceae family dominates cluster 1 with 228 species. This is a robust result, since before filtering out plants sharing a single property, Poaceae were rather well grouped into a single cluster. Cyperaceae family is present in cluster 4 with 89 species. Before pruning, that family was already one of the most copious in cluster 2 with 134 species, after Asteraceae. On the contrary, Asteraceae, which previously were copious (dominant family with 279 species in cluster 2, i.e. the magenta cluster in Fig. 3 (panel A)), now are quite disappearing and just a thirty of them survives. The same happens for Caryophyllaceae, which go from a hundred of species to no one taxa surviving the pruning. Rosaceae family is present in cluster 2 with 48 species and in cluster 3 with 23 species. Two single species belong to cluster 1, i.e. Aremonia agrimonoides (L.) DC. and Potentilla alba L. In the previous clustering related to the original graph , Rosaceae were already split into two different clusters (cluster 1 with 66 species and cluster 2 with 54 species).

The same approach was followed for the other two subgraphs corresponding to filtered version by wij > 2 and wij > 3 (not shown). The species sharing 3 or 4 morphological properties were retained as vertices in the network. In this case, the number of analysed species drastically reduced to the 13% and 3.2% of the D3 total amount of species. Thus, communities detection on such a highly reduced dataset had to be intended as a merely quantitative investigation. The most relevant insight confirmed previous result: Poaceae family survived severe filtering and they gathered in two different ways. Some Poaceae species were grouped on the basis of three morphological properties, mainly: nutrient, elongated and flat diaspore type. Some other species, usually found in the same community embedding Rosaceae species, also showed mucilaginous diaspore surfaces.

We can conclude that the high family heterogeneity in each cluster survives the edges-weight based filtering: diaspore morphology seems not to be a good classifier and further analyses on different datasets are required.

Fruit-based graph

Communities detection results are summarized in Table 4 while a graphical view is provided in Fig. 5 where eight giant components are revealed. The detected clusters are clearly separated one from each other and the vertices (plants species) are fully-connected inside each community. In other terms, the plants belonging to a cluster all share a single precise property. As for previous cases, no particular homogeneity in terms of family composition is observed (more information in the Supplementary Information).

Table 4 (N, E) clusters composition on the basis of fruit typology categorical traits.
Figure 5
figure 5

Fruit typology graph communities.

communities detection by modularity method (BL). Only edges with weight wij = 1 are present. Eight isolated communities are detected (panel A) and the corresponding families composition is displayed (panel B). Clearly each cluster is highly heterogeneous in terms of families composition, but not in terms of shared properties between the species belonging to each cluster. A single fruit topological property, in fact, is associated to each cluster and species. Main families are visible: Poaceae (white), Asteraceae (blue), Cyperaceae (red), Rosaceae (cerise), Fabaceae (cyan), Caryophyllaceae (fuchsia).

Graph of properties, GF from diaspore morphology

Similarly to what has been done so far we also considered the second projection giving the graph of features shown in Fig. 6. Such graph GF is composed by N = 8 vertices and E = 15 edges. Two nodes are completely isolated and they correspond to properties other specialization and no specialization, in agreement with the previous findings (see Fig. 3 (panel A), clusters 3 (cyan) and 5 (red)), looking like isolated components of the graph, that is to say, that those species showing properties that do not share any other property with the other species. The dispersal of plants characterized by such properties, also not sharing any other properties with other species, may be not crucially linked to seed or fruit morphology (and typology). Edges thickness is proportional to the number of common plants sharing the two properties connected by that link. In that sense, the elongated and flat appendages properties are common to a huge number of species. More in detail, the properties flat-elongated, flat-nutrient, hooked-elongated, elongated-nutrient share several species between them, respectively 323, 277, 272 and 219 and they have to be considered aggregative properties over the set of morphological seeds properties.

Figure 6
figure 6

Morphological properties network.

The following figure shows the second bipartite projection obtained by connecting features between them (GF(N, E)) on the basis of how many plants share a given property. N = 8 vertices (blue circles) and E = 15 edges (red lines). Two nodes are isolated: they correspond to properties other specializations and no specialization. Thicker edges correspond to edges with higher weights (whose values are reported near each node), while nodes dimensions are proportional to the node degree (larger for higher degrees). It follows that properties flat-elongated, flat-nutrient, hooked-elongated, elongated-nutrient share more species between them, respectively 323, 277, 272 and 219.


Plants diaspore morphological features have been analysed in order to classify the various species. Data have been extracted from the D3 Dispersal and Diaspore Database16, developed as a partial solution to the gap about dispersal-related traits of plant species. In this paper we applied various quantitative measures, based on Complex Network Theory17,18,19, in order to measure effective similarities between various species20.

In particular we applied different communities detection algorithms

  • to inspect plants species with the final goal to underline salient structures characterising our data;

  • to identify the degree of similarity among the different species;

  • to organise data in smaller structures and to gain insight into general hypothesis and properties of the whole dataset.

At a first glance, diaspores morphology did not turn out to be a good classification parameter for species. Indeed, different species share more than one common property and each community shows a huge heterogeneity in terms of family composition. An explanation of this fact is that during their evolution plants were subjected to a strong selective pressure in order to colonise suitable habitats, mostly throughout the dispersal of seeds. To solve this problem, plants converged in the production of secondary structures such as plumes, samaras, hooks, wings, aerenchimas and mucilagines. Such convergent evolution determines that very similar solutions are found in species belonging to distant families. This is in accord to our results, where very different and genetically unrelated plants cluster in stable groups. We observed the same behaviour also after a severe filtering that was applied on plants graph. Complex networks analysis main results in terms of basic quantities have been confirmed after pruning by edges weight, that is by removing species which shared a small number of properties.

On the other hand, species can be classified by their fruit topology, which prove to be a good categorical trait. A first explanation is that probably the selection did not push enough plants to provide convergent solutions for the environment where they lived. In the same spirit we intend in the future to do further analysis on the other features provided by D3 Dispersal and Diaspore Database, such as diaspore typology, exposure of diaspores, heterodiaspory to improve the present findings. In conclusion, complex networks analysis seems to be an advantageous tool to investigate plants relationships related to morphological features. We believe that a similar approach may be applied with success to the study of many other fields of plant science, such as plant ecology, phytosociology and plant communication.

Materials and Methods


Data are collected in the D3 Dispersal and Diaspore Database16 available at website D3 database is developed as a partial solution to the lack of knowledge about dispersal/related traits of plant species, with the aim to simplify traditional ecological and evolutionary analysis. Currently the database provides several information related to seed dispersal of plant species, such as empirical studies, functional and heritable traits, dispersal units image analysis and ranking indices (i.e. parameters which quantify the adaptation of a species to certain seed dispersal mode, in relation to a larger species set). More than 5,000 plant species are reported. Available raw data are mainly provided by DIASPORUS21, BIOPOP22 and LEDA23 databases of plants traits. Here we focused on the well documented 2,662 Central European taxa, by exploiting the detailed ecomorphological categorizations of the diaspore and fruit, as well as information on prevailing dispersal modes. For every species we took into account diaspore morphology and fruit topology.

Diaspore Morphology

Morphology was treated technically as a set of binary traits. During the first test, eight features were taken into account for the categorization of diaspore morphology (see Supplementary information for more details): (1) nutrients: (2) elongated body; (3) hooked body; (4) flat/wings; (5) ballo/aerenchym; (6) mucilaginous; (7) none of the above: diaspores without any of the above mentioned specializations; (8) vegetative specialization. Such categorization scheme was inspired by the LEDA approach23. However, diaspore morphology represents an original dataset, which was derived either from visual inspection of the diaspores and respective images, or from an intensive and web research.

Fruit Typology

Fruit typology is a categorical trait which describes those ecological characteristics of the fruit which are related to seed dispersal. In the following analysis five categorization of ecological fruit types were taken into account. Fruit typology was categorized by visual inspection of fruits or respective images in addition to an intensive literature and web research24. Schematically (more detail on the Supplementary Information) they are divided into (1) indehiscent fruit: the pericarp is not opening during ripening; the above is further divided in (1a) non-fleshy; (1b) fleshy fruit; (1c) pepo. (2) dehiscent fruit: the pericarp opens during ripening; further divided in (2a) fruit with upright aperture; (2b) fruit with lateral aperture. (3) explosive release. (4) Gymnospermae type. (5) not applicable: reserved for the following species (5a) sterile hybrid (e.g. Betula x aurata); (5b) for vegetative diaspore types.

Building the graph: projection in the space of plants/features

From the data written in the form of a bipartite graph (where every species N is connected to its features) we obtain two different projection graphs with the procedure shown in Fig. 1. Once a bipartite graph is built, it can also be described by a matrix A(p, f) whose element aij is 1 if plant p has the feature f. The most immediate way to measure correlation between species is counting how many seeds features a couple of species share and similarly how many plants share the same couple of seeds features. In formulas, this corresponds to consider the matrix of species P(p, p) = AAT and the matrix of seeds features F(f, f) = ATA. In detail we focused on the graph having as nodes the different plants, i.e. on the Plants graph GP(N, E) where edges weights were proportional to the number of common features shared by a couple of plants (this could be diaspora-based or fruit-based). Second, in order to catch the predominant properties in terms of seeds dispersal, we analysed the second bipartite projection, i.e. the Features graph, GF(N, E), whose nodes represented the different diaspore morphological traits taken into account. In that case edges weights were proportional to the number of plants sharing the same feature. Both a network metrics analysis and a basic cluster analysis were performed to obtain an alternative classification of plants.

Basic network analysis

As regards network analysis, we computed some global and local basic metrics, described hereafter.

Graph density is defined as the ratio between the numbers of existing edges and the possible number of edges, in a N-size network it is given by .

Network clustering coefficient is the overall measure of clustering in a undirected graph in terms of probability that the adjacent vertices of a vertex are connected. More intuitively, global clustering coefficient is simply the ratio of the triangles and the connected triples in the graph. The corresponding local metric is the local clustering coefficient, which is the tendency among two vertices to be connected if they share a mutual neighbour. In this analysis we used a local vertex-level quantity5 defined in Eq. (1):

• The normalization factor accounts for the weight of each edge times the maximum possible number of triplets in which it may participate and it ensures that . That metric combines the topological information with the weight distribution of the network and it is a measure of the local cohesiveness grounding on the importance of the clustered structure on the basis of the amount of interaction intensity actually found on the local triplets5.

Network strength (s) is obtained by summing up the edge weights of the adjacent edges for each vertex5. That metric is a more significant measure of the network properties in terms of the actual weights and it is obtained by extending the definition of vertex degree ki = ∑jaij, with aij elements of the network adjacent matrix A. In formulas .

Grouping plants from graph: communities detection analysis

Communities detection aims essentially at determine a finite set of categories (clusters or communities) able to describe a data set, according to similarities among its objects25. More in general, hierarchy is a central organising principle of complex networks, able to offer insight into many complex network phenomena26.

In the present work we adopted the following method:

• Fast greedy (FG) hierarchical agglomeration algorithm27 is a faster version of the preceding greedy optimisation of modularity15. FG gives identical results in terms of found communities. However, by exploiting some shortcuts in the optimisation problem and using more sophisticated data structures, it runs far more quickly, in time O (md log n), where d is the depth of the “dendrogram” describing the network community structure.

• Walktrap community finding algorithm (WT) finds densely connected subgraphs from a undirected locally dense graph via random walks. The basic idea is that short random walks tend to stay in the same community28. Starting from this point, WT is a measure of similarities between vertices based on random walks, which captures well the community structure in a network, working at various scales. Computation is efficient and the method can be used in an agglomerative algorithm to compute efficiently the community structure of a network.

• Louvain or Blondel method (BL)29 to uncover modular communities in large networks requiring a coarse-grained description. Louvain method (BL) is an heuristic approach based on the optimisation of the modularity parameter (Q) to infer hierarchical organization. Modularity (Eq. (2)) measures the strength of a network division into modules15,30, as it follows:

where, eii is the fraction of edges which connect vertices both lying in the same community i and ai is the fraction of ends of edges that connect vertices in community i, in formulas: and ; A is the adjacent matrix for the network; c the number of communities; ki = ∑wA{i,w} the degree of the vertex-i, n and the number of graph vertices and edges, respectively. Delta function, δ(i, j), is 1 if i = j and 0 otherwise.

• Label propagation (LP) community detection method is a fast, nearly linear time algorithm for detecting community structure in networks14. Vertices are initialised with a unique label and, at every step, each node adopts the label that most of its neighbours currently have, that is by a process similar to an ‘updating by majority voting’ in the neighbourhood of the vertex. Moreover, LP uses the network structure alone to run, without requiring neither optimisation of a predefined objective function nor a-priori information about the communities, thus overcoming the usual big limitation of having communities which are implicitly defined by the specific algorithm adopted, without an explicit definition. In this iterative process densely connected groups of nodes form a consensus on a unique label to form communities.

Additional Information

How to cite this article: Vivaldo, G. et al. Networks of plants: how to measure similarity in vegetable species. Sci. Rep. 6, 27077; doi: 10.1038/srep27077 (2016).