tag:blogger.com,1999:blog-6596883938422625238.post4260372503910630549..comments2008-11-11T07:06:13.915-08:00Comments on Equivocations of the automagically precise.: Why 42?Santhosh Sureshhttp://www.blogger.com/profile/01986754776054664268noreply@blogger.comBlogger4125tag:blogger.com,1999:blog-6596883938422625238.post-31149128801758423152008-11-11T07:06:00.000-08:002008-11-11T07:06:00.000-08:00why stop with 2 posts? The role of tech and math b...why stop with 2 posts? The role of tech and math blogging, unfortunately vacated by KVM desperately needs to be filled!Hetero sapienhttps://www.blogger.com/profile/16966179472719674835noreply@blogger.comtag:blogger.com,1999:blog-6596883938422625238.post-24272246038974709722007-05-28T02:18:00.000-07:002007-05-28T02:18:00.000-07:00Magaa, one hell of an illuminating post. Thank you...Magaa, one hell of an illuminating post. Thank you!<BR/>So I must weed out inessential contacts from my life, unlearn memories of many friends, and taper my circle's strength down to 42. <BR/>H'm..where shall I start? By the way, who are you? ;)Nhttps://www.blogger.com/profile/11885960859965172194noreply@blogger.comtag:blogger.com,1999:blog-6596883938422625238.post-54139830368060758452007-04-08T10:19:00.000-07:002007-04-08T10:19:00.000-07:00Yes, in fact, graph theoretically, speaking it red...Yes, in fact, graph theoretically, speaking it reduces to the assertion that the Diameter of the graph in question ( http://en.wikipedia.org/wiki/Distance_(graph_theory) ) is 6. <BR/> Now, we are required to prove that the average degree is 42. This is a rather specific question, i.e it depends on the nature of the graph, and no generalization can actually give the exact average degree. However, it gives us a range, and that is between 20 - 84. <BR/><BR/>Some exceptions to the hypothesis, include closed loops, say a group of people in Africa, who do not know any one. etc. etc.Vettius Carnaticaehttps://www.blogger.com/profile/01986754776054664268noreply@blogger.comtag:blogger.com,1999:blog-6596883938422625238.post-18723460225027338232007-04-07T00:39:00.000-07:002007-04-07T00:39:00.000-07:00Nice post :-)"On making appropriate calculations a...Nice post :-)<BR/><BR/>"On making appropriate calculations and giving the right equations".. now where have I heard that before ? :-)<BR/><BR/>Seriously now, I had an argument with a prof regarding this, and we realized that the problem formulation could be made more accurate. The problem with the GP, as you know, is that it assumes that _everyone_ that my friend knows is unknown to me. One nicer formulation we came up with was to represent every person as a node in a graph, connect each and every node to every other node, and start removing the edges one by one, randomly. We continue doing this, and at every point we calculate what is the average number of nodes one node is connected with.. but then we gen gave up and moved on :-)Mohan K.Vhttps://www.blogger.com/profile/17506795236780570983noreply@blogger.com