Skip to main content
Notice removed Authoritative reference needed by CommunityBot
Bounty Ended with no winning answer by CommunityBot
Notice added Authoritative reference needed by user7060
Bounty Started worth 50 reputation by user7060
deleted 15 characters in body
Source Link
user7060
  • 475
  • 5
  • 12

Given a distribution over graphs with $n$ nodes having the "scale-free" property, I would like to compute for a pair of vertices $(a,b)$ the probability that they are connected (or more precisely the probability that there is a directed edge from $a$ to $b$).

Is it possible to have such probability distribution ?

Note that the case without the "scale-free" property is not a problem. I can define the probability of having an edge from $a$ to $b$ as $P((a,b))=1/2$ for all $a, b$, $a \neq b$ in the graph.

Thank you.

Given a distribution over graphs with $n$ nodes having the "scale-free" property, I would like to compute for a pair of vertices $(a,b)$ the probability that they are connected (or more precisely the probability that there is a directed edge from $a$ to $b$).

Is it possible to have such probability distribution ?

Thank you.

Given a distribution over graphs with $n$ nodes having the "scale-free" property, I would like to compute for a pair of vertices $(a,b)$ the probability that they are connected (or more precisely the probability that there is a directed edge from $a$ to $b$).

Is it possible to have such probability distribution ?

Note that the case without the "scale-free" property is not a problem. I can define the probability of having an edge from $a$ to $b$ as $P((a,b))=1/2$ for all $a, b$, $a \neq b$ in the graph.

Thank you.

deleted 15 characters in body
Source Link
user7060
  • 475
  • 5
  • 12

Given a networkdistribution over graphs with $n$ nodes having the "scale-free" property, I would like to compute for a pair of vertices $(a,b)$ the probability that they are connected (or more precisely the probability that there is a directed edge from $a$ to $b$). The probability distribution has to take into account that the network is scale-free.

Is it possible to have such probability distribution ?

Thank you.

Given a network with $n$ nodes, I would like to compute for a pair of vertices $(a,b)$ the probability that they are connected (or more precisely the probability that there is a directed edge from $a$ to $b$). The probability distribution has to take into account that the network is scale-free.

Is it possible to have such probability distribution ?

Thank you.

Given a distribution over graphs with $n$ nodes having the "scale-free" property, I would like to compute for a pair of vertices $(a,b)$ the probability that they are connected (or more precisely the probability that there is a directed edge from $a$ to $b$).

Is it possible to have such probability distribution ?

Thank you.

added 117 characters in body
Source Link
user7060
  • 475
  • 5
  • 12

How to generate an adjacency matrix forGiven a scale-free network with ?

$n$ nodes, I would like to be able to generate suchcompute for a matrix only by computingpair of vertices $(a,b)$ the probability to connectthat they are connected (or more precisely the probability that there is a vertexdirected edge from $i$$a$ to a vertex $j$$b$). The probability distribution has to take into account that the network is scale-free.

Is it possible to have such probability distribution ?

Thank you.

How to generate an adjacency matrix for a scale-free network ?

I would like to be able to generate such a matrix only by computing the probability to connect a vertex $i$ to a vertex $j$. Is it possible ?

Thank you.

Given a network with $n$ nodes, I would like to compute for a pair of vertices $(a,b)$ the probability that they are connected (or more precisely the probability that there is a directed edge from $a$ to $b$). The probability distribution has to take into account that the network is scale-free.

Is it possible to have such probability distribution ?

Thank you.

Source Link
user7060
  • 475
  • 5
  • 12
Loading