# Modularity, Graphs and Triangulations

Continuing on the previous post, procedures presented here show the comparison between the usual assesment of modularity in the collection of landmarks (same dataset as before) and the depiction of modular structure through graph theory. Usually, modularity in the mammalian cranium is determined a-priori, according to some of the established hypotheses about the developmental origin of cranial elements. One of the most prevalent hypotheses is the two-module organization, one module comprising of elements originating mainly from the neural crest embryonic tissue (anterior cranium) and one comprising of elements with somitomeric origin (posterior cranium). Following code shows the test of this specific hypothesis using geomorph package functions, and additional usage of deldir for visualization of modularity hypotheses.

Figure 1 shows the theoretical distribution of the RV coefficients, calculated for all posible two-module subdivisions of landmarks, as well as the observed RV value from the hypothesis depicted in Figure 2. Since the observed value is lower than most of the hypothetic values, then it could be said that this modularity hypothesis stands. The idea for using graph theory representation and analysis of modularity is based on correlation matrix, same one from the previous post. Correlation matrix was obtained through Delaunay triangulation and every vertex (node) in the graph actually represents the 1/3 of the total area of all Delaunay triangles emanating from the corresponding landmark.

Graph based on the correlation matrix can be created and manipulated with the wonderful igraph package. Vertices of this graph will be abovementioned areas, while the edges will represent correlation (edge weights) between areas around each landmark. According to weights, edges can be colored and the strength of thier lines increased, so that the most correlated landmarks wolud be more obvious.

Modularity, or community structure in the graph theory represents the degree of compartmentalization in the graph structure, based on the spatial relationship or the weights of graph edges. Although, a-priori subdivision of graph vertices is possible, and the evaluation of such graph community can be easily done, the advantage of graph theory for modularity is the availability of algorithms for searching the community structure, so it can derive subdivsion a-posteriori, that can be compared to the hypothesis from Figure 1.

Leading eigenvector community algorithm tries to find community structure in the graph by calculating the eigenvector of the modularity matrix for the largest positive eigenvalue and then separating vertices into two communities based on the sign of the corresponding element in the eigenvector (Newman, 20061). This method was preffered over many others because it is closer to usual multivariate methods, such as PCA, that are commonly used to depict variability patterns. Graph community strucure depicts modularity in the landmark configurations accurately, with the exception of lm16, that is positioned on the posterior basicranium. Higher correlations are, on average, present within modules while between modules, only one connection is higher than 0.5, that between lm2 and lm14. Since these landmarks lay on the opposite sides of the cranium, they may encompass the variability in total anterior-posterior length. i.e. cranial size.

1. Newman, M.E.J. 2006. Modularity and community structure in networks. PNAS 103: 8577-8582.
{"ft_lang_label":"__label__en","ft_lang_prob":0.91523266,"math_prob":0.9229127,"size":3578,"snap":"2019-26-2019-30","text_gpt3_token_len":767,"char_repetition_ratio":0.13150531,"word_repetition_ratio":0.032608695,"special_character_ratio":0.20095025,"punctuation_ratio":0.094249204,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9591616,"pos_list":[0,1,2,3,4,5,6],"im_url_duplicate_count":[null,4,null,4,null,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-07-23T02:55:56Z\",\"WARC-Record-ID\":\"<urn:uuid:493c620a-8704-46ce-9de9-56dc5d1d4a2d>\",\"Content-Length\":\"24332\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:05e2df7f-eb45-4e38-b6fc-6c4c51f57aaa>\",\"WARC-Concurrent-To\":\"<urn:uuid:c12ed9b6-1ac0-46ba-8fd3-d39f1c5f3e77>\",\"WARC-IP-Address\":\"185.199.110.153\",\"WARC-Target-URI\":\"http://creativemorphometrics.co.vu/blog/2014/05/03/modularity-graphs-and-triangulations/\",\"WARC-Payload-Digest\":\"sha1:B3AR432LHKUGAMN3XETPPCTY6JJQPUAL\",\"WARC-Block-Digest\":\"sha1:WBTSG4Z23LWLDUMMCE3XWUTUI567DCWH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-30/CC-MAIN-2019-30_segments_1563195528687.63_warc_CC-MAIN-20190723022935-20190723044935-00243.warc.gz\"}"}