Skip to main content
14 events
when toggle format what by license comment
May 26, 2018 at 17:59 answer added Mike timeline score: 0
Feb 20, 2012 at 23:30 vote accept ght
Feb 20, 2012 at 23:30 history bounty ended ght
Feb 19, 2012 at 1:58 answer added Louigi Addario-Berry timeline score: 3
Feb 19, 2012 at 0:26 history bounty started ght
Dec 12, 2011 at 19:50 history edited ght CC BY-SA 3.0
rephrased the question and modified the title
Dec 12, 2011 at 8:46 answer added kassabov timeline score: 1
Dec 12, 2011 at 0:05 comment added Łukasz Grabowski maybe you could also change the title to something more specific, like "number of geodesics passing through a vertex in an expander"
Dec 12, 2011 at 0:00 comment added Łukasz Grabowski I don't; I can only suggest you might try to reformulate the question in the way I suggested because then it sounds - to me - like a fairly natural question to ask, and there are quite a few people on mathoverflow who should know if such a question about expanders has or hasn't been asked before.
Dec 11, 2011 at 16:00 comment added ght Lukasz: Yes you could also define the problem in the way you are saying. Do you know if somebody has worked in this question?
Dec 11, 2011 at 14:30 comment added Łukasz Grabowski Are the loads and traffic actually necessary to formulate the problem? Could you not say that for each two vertices you choose a geodesic which connects them and then you define $T_n(v)$ as the number of geodesics which pass through $v$? Also, to make the questions more focused, maybe you could define $T(G_n)$ as the minimum over (choices of geodesics) of the maximum over (vertices of $G_n$) of $T_n(v)$?
Dec 11, 2011 at 1:39 history edited ght CC BY-SA 3.0
added some hypothesis
Dec 11, 2011 at 1:30 history edited ght CC BY-SA 3.0
deleted 13 characters in body
Dec 11, 2011 at 1:21 history asked ght CC BY-SA 3.0