Study of Connection between articulation Points and Network motifs in Complex Networks

Complex networks are powerful mechanisms one can use to model real-world networks as topological spaces. The beauty of these structures is provided by the infinite degree of analysis one is allowed to do using them. Biologically it is almost impossible for the human mind to comprehend the behaviour of these systems, but when modelled as complex networks different properties of the network topology can reveal precious information. Starting from the two key properties of the participants n a complex network and the relations between them, one can derive further properties that reflect specific behaviours for entities or groups of entities. Examples of these further remarkable properties include entities which create unique bridges between two or more communities (known as Articulation Points) or the appearance of patterns of interconnections between entities (known as Network Motifs). Our paper performs a study on the co-existence of these two properties, Articulation Points and Network Motifs, and how their appearance is correlated, by using results obtained in analysing a variety of real-world networks.

[1]  D. Gamermann,et al.  A comprehensive statistical study of metabolic and protein–protein interaction network properties , 2017, Physica A: Statistical Mechanics and its Applications.

[2]  Amir Bashan,et al.  Articulation points in complex networks , 2016, Nature Communications.

[3]  Albert-László Barabási,et al.  Scale-Free Networks: A Decade and Beyond , 2009, Science.

[4]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[5]  Pontus Svenson,et al.  Complex networks and social network analysis in information fusion , 2006, 2006 9th International Conference on Information Fusion.

[6]  S. Shen-Orr,et al.  Network motifs in the transcriptional regulation network of Escherichia coli , 2002, Nature Genetics.

[7]  Brendan D. McKay,et al.  Practical graph isomorphism, II , 2013, J. Symb. Comput..

[8]  Michael Golosovsky,et al.  Power-law citation distributions are not scale-free , 2017, Physical review. E.

[9]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[10]  Aaron Clauset,et al.  Scale-free networks are rare , 2018, Nature Communications.

[11]  Uri Alon,et al.  Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs , 2004, Bioinform..

[12]  F. Schreiber,et al.  MODA: an efficient algorithm for network motif discovery in biological networks. , 2009, Genes & genetic systems.

[13]  Joshua A. Grochow,et al.  Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking , 2007, RECOMB.

[14]  Sahar Asadi,et al.  Kavosh: a new algorithm for finding network motifs , 2009, BMC Bioinformatics.

[15]  P. Erdos,et al.  On the evolution of random graphs , 1984 .