Venkatesh Rao@vgr·Sep 3, 2016Is there a recursive-cuts generalization of min cut/max flow for scale free graphs?31
Venkatesh Rao@vgrReplying to @niketeI don't know yet. If I did I'd have the result I want.10:16 PM · Sep 3, 20161 Like
nikete@nikete·Sep 3, 2016Replying to @vgrmin cut/max flow are both well defined for scale free graphs...11
Venkatesh Rao@vgr·Sep 3, 2016Replying to @niketeintuition is that you will get a property that degrades gracefully as you prune graph from higher to lower res.1
nikete@nikete·Sep 3, 2016Replying to @vgrthat is, scale freeness is a property of the degree distribution, while max flow/min cuts is well defined for a directed graph1
nikete@nikete·Sep 3, 2016Replying to @vgryou might have some intuitions you can expand, was the hope.