Estrada, Ernesto (2011) *Combinatorial study of degree assortativity in networks.* Physical Review E, 84. 047101. ISSN 1539-3755

Official URL: http://dx.doi.org/10.1103/PhysRevE.84.047101

## Abstract

Why are some networks degree-degree correlated (assortative), while most of the real-world ones are anticorrelated (disassortative)? Here, we prove, by combinatorial methods, that the assortativity of a network depends only on three structural factors: transitivity (clustering coefficient), intermodular connectivity, and branching. Then, a network is assortative if the contributions of the first two factors are larger than that of the third. Highly branched networks are likely to be disassortative.

Item type: | Article |
---|---|

ID code: | 35036 |

Keywords: | networks, degree assortativity , disassortive, combinatorial, Probabilities. Mathematical statistics, Statistical and Nonlinear Physics, Statistics and Probability, Condensed Matter Physics |

Subjects: | Science > Mathematics > Probabilities. Mathematical statistics |

Department: | Faculty of Science > Mathematics and Statistics |

Related URLs: | |

Depositing user: | Pure Administrator |

Date Deposited: | 22 Oct 2011 05:20 |

Last modified: | 27 Mar 2014 09:45 |

URI: | http://strathprints.strath.ac.uk/id/eprint/35036 |

### Actions (login required)

View Item |