Closed kristinmg closed 9 years ago
Further, we could define a distribution on the number of edges. So maybe a graph with N nodes and 1 total edge is just as likely as a graph with N edges. This would be a uniform distribution. But we could also have Gaussian distribution centered on some N that is close to a model that we would like to represent.
Or we could define a distribution on the degree of each node, which would mean that every node's degree will be a random variable according to a statistical distribution. (I think in this case, given a large enough amount of nodes whose degree follows any distribution, we can apply the Central Limit Theorem to show that the graph will have its total number of edges following a normal distribution that is related to the distribution of the degree of each node.)
Thank you!
that's not exactly right. remind me in the beginning of class tomorrow, and I will try to clarify...
On Wednesday, February 4, 2015, Greg Kiar notifications@github.com wrote:
Closed #48 https://github.com/Statistical-Connectomics-Sp15/intro/issues/48.
— Reply to this email directly or view it on GitHub https://github.com/Statistical-Connectomics-Sp15/intro/issues/48#event-230222515 .
the glass is all full: half water, half air. openconnecto.me, we're hiring! https://docs.google.com/document/d/14SApYAzxF0Ddqg2ZCEwjmz3ht2TDhDmxyZI2ZP82_0U/edit?usp=sharing , jovo.me, my calendar https://www.google.com/calendar/embed?src=joshuav%40gmail.com&ctz=America/New_York
Does graph valued random variable mean that it is just one possible graph out of a set of graphs? Are the number of nodes and edges fixed?