Exercise

# Dyadicity of churners

In this exercise, you will compute the dyadicity amongst the churners in the network to see if they share more or fewer edges than expected in a random configuration of the network.

The variables `ChurnNodes`

, `ChurnEdges`

, and `connectance`

are available for you to use.

For expected dyadicity, use the formula \( \frac{n_ C\cdot (n_ C - 1)}{2} \cdot p\), where \(n_C\) is the number of churners, \(N\) is the number of nodes, and \(p\) is the connectance. Dyadicity of the churners is the ratio between the actual churners and the expected churn dyadicity.

Instructions

**100 XP**

- Compute the expected dyadicity of churners and assign it to the variable
`ExpectedDyadChurn`

. - Compute the dyadicity of the churners by dividing
`ChurnEdges`

with`ExpectedDyadChurn`

. Call this value`DyadChurn`

. - Inspect
`DyadChurn`

.