Help understanding a formula for implementation

[pallid cliff]

Suppose I am given the formula in the screenshot - which is the formula computing the modularity of a multi-layer graph given a clustering $\gamma$. I am trying to implement it in code and I am facing some technical issues. Does the sum involve summing over unique pairs of graphs (s,r) or does the sum count both (s,r) and (r,s)? Does the normalization by 2 basically imply that we are counting the connections between graphs uniquely or are we double counting? Thanks for your insight

[drowsy cosmos]

Laiika

[weary field]

1. Do not ping the Moderators, unless someone is breaking the rules.
2. Do not ping the Helper Moderators, unless there is a conflict between helpers.
3. Do not ping other members randomly for help.
4. Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
5. Wait patiently for a helper to come along.
6. If the Helper has answered your question, remember to thank them with the Mathematics Ranks bot and close the thread with:

+close
Feel free to nominate the person for helper of the week in #helper-nominations
If you're happy with the help you got here, and the server overall, you can contribute financially as well:

[regal hawk]

@pallid cliff

:HelpIcon:| Help Reminder

Hello laiika_, this is a friendly reminder that your help request has been inactive for more than 24 hours. If you no longer need assistance, please consider closing the thread using the +close command. This thread will be automatically closed in 3 days if it remains inactive.

[pallid cliff]

+close

[regal hawk]

Do you still want to close your help request?

No eligible helpers were found in this thread. You can still close this post if you don't require helper any longer.