More on detecting links
Trying to understand what this is all about. This graph flow stuff is new to me.
I think the idea is that you treat the web like a wireframe model; if you think of it as a whole lot of marbles (sites), connected by bits of string (links), you should be able to take two sites and pull them away from each other. If the links are elastic enough (and can pass through each other!), all the other sites will rearrange themselves by 'distance' from the two sites.
To figure out how sites are clustered together, you pick one (the 'seed'), then make up an imaginary site (the 'sink') that connects to all the sites in your set, then try to pull the seed and the sink away from each other. Finally you cut the links in the middle somewhere; everything still connected to the seed is considered to be inside its community.
Or maybe not.
We try to work out the 'maximum flow' - if the links are pipes containing water, and each pipe can only carry so much water, we have to try to rearrange things to get the maximum flow from the seed to the sink. One way of doing this is with the max flow min cut algorithm, which says that the maximum flow is equal to the capacity of the smallest bottleneck.
More on this later!
... more like this: [Blogging Ecosystem]
I think the idea is that you treat the web like a wireframe model; if you think of it as a whole lot of marbles (sites), connected by bits of string (links), you should be able to take two sites and pull them away from each other. If the links are elastic enough (and can pass through each other!), all the other sites will rearrange themselves by 'distance' from the two sites.
To figure out how sites are clustered together, you pick one (the 'seed'), then make up an imaginary site (the 'sink') that connects to all the sites in your set, then try to pull the seed and the sink away from each other. Finally you cut the links in the middle somewhere; everything still connected to the seed is considered to be inside its community.
Or maybe not.
We try to work out the 'maximum flow' - if the links are pipes containing water, and each pipe can only carry so much water, we have to try to rearrange things to get the maximum flow from the seed to the sink. One way of doing this is with the max flow min cut algorithm, which says that the maximum flow is equal to the capacity of the smallest bottleneck.