I am a newbie tinkering around with graph theory. Please pardon me for asking something very basic.
Let us say I have a graph with n number of nodes. I have a binary adjacency matrix that specifies how these nodes are connected to each other (a 1 if node i is connected to node j and 0 if the connection does not exist).
Now, I would like to calculate the probability of a node being connected to another. What do we exactly mean when we say the probability of a node being connected to another and how can I calculate the same? How can we say that an edge connecting i and j nodes has a probability p?
The question came when I was trying to generate a random graph. Given a number of nodes n, I was supposed to also specify the "wiring probability", which I could not make sense of.