(distill.pub)

354 points misonic | 1 comments | 20 Dec 24 04:10 UTC | HN request time: 0.208s | source

Show context

hi_hi ◴[20 Dec 24 22:17 UTC] No.42475626[source]▶

I feel very dumb. There is an example on that page with 4 nodes (a,b,c,d) and it shows a total of 24 possible combinations.

What is the generalised formula for calculating this, given the number of nodes but also edges need to be considered.

It doesn't appear to be explained in the article. I think it may be a factorial?

replies(1): >>42479890 #

1. throwameme ◴[21 Dec 24 14:29 UTC] No.42479890[source]▶

i think one could use a binomial coefficient to do this or nested binomials

like (n choose 4)

maybe multiply the binomial by 2 because each edge can be present or absence in vertices

A Gentle Introduction to Graph Neural Networks (2021)