[a / b / c / d / e / f / g / gif / h / hr / k / m / o / p / r / s / t / u / v / vg / vm / vmg / vr / vrpg / vst / w / wg] [i / ic] [r9k / s4s / vip / qa] [cm / hm / lgbt / y] [3 / aco / adv / an / bant / biz / cgl / ck / co / diy / fa / fit / gd / hc / his / int / jp / lit / mlp / mu / n / news / out / po / pol / pw / qst / sci / soc / sp / tg / toy / trv / tv / vp / vt / wsg / wsr / x / xs] [Settings] [Search] [Mobile] [Home]
Board
Settings Mobile Home
/sci/ - Science & Math


Thread archived.
You cannot reply anymore.


[Advertise on 4chan]


For large n, what's the threshold for erdos-renyi graphs having diameter 2? a result in terms of either the G(n, p) or G(n, M) model would be welcome.
>>
up
>>
>homework thread
>>
>>15876343
2 what?
>>
>>15876343
I have no idea what the fuck this is, but if it's a normalized distribution, you'd expect a radius of 1 which gives a diameter of 2.
>>
About three fiddy.
>>
>>15878300
Not how graph radii work.
>>
>>15878790
How do they work?
>>
>>15880658
Without looking it up, one is the maximum of the maximum distance and the other is the minimum of the maximum distance. I assume the former is diameter and the latter is radius.
Here's the wiki article, which tells me I'm right
https://en.wikipedia.org/wiki/Distance_(graph_theory)#Related_concepts



[Advertise on 4chan]

Delete Post: [File Only] Style:
[Disable Mobile View / Use Desktop Site]

[Enable Mobile View / Use Mobile Site]

All trademarks and copyrights on this page are owned by their respective parties. Images uploaded are the responsibility of the Poster. Comments are owned by the Poster.