---- > [!definition] Definition. ([[assortative mixing]]) > Let $G$ be a [[network]] whose nodes $i$ each belong to a class $g_{i}$, $i \in [N]$. We say **$G$ is assortative** if the difference between the fraction of edges that run between nodes of the same type and the expected fraction of edges if edges were randomly positioned is significant. Mathematically, a **high [[modularity]] value $Q$ indicates this assortative mixing**. A **low [[modularity]] value $Q$ indicates disassortative mixing.** ^definition ---- #### ---- #### References > [!backlink] > ```dataview > TABLE rows.file.link as "Further Reading" > FROM [[]] > FLATTEN file.tags as Tag > WHERE Tag = "#definition" OR Tag = "#theorem" OR Tag = "#MOC" OR Tag = "#proposition" OR Tag = "#axiom" > GROUP BY Tag > ``` > [!frontlink] > ```dataview > TABLE rows.file.link as "Further Reading" > FROM outgoing([[]]) > FLATTEN file.tags as Tag > WHERE Tag = "#definition" OR Tag = "#theorem" OR Tag = "#MOC" OR Tag = "#proposition" OR Tag = "#axiom" > GROUP BY Tag > ```