News for hackers. Stuff that matters.
Re:No Paper Is That Good by mattkrause on Friday July 13, 2018 @10:19AM (#17523160)
In my experience, the vast majority of scientists would love to have that Ramsey’s Theory conversation with you. Some people might get prickly if you lead with “This is trivial and I can’t believe you don’t know that....” but I suspect the vast majority of my colleagues would hear you out.

On the other hand....Ramsey’s theorem applies to compelete (undirected) graphs. Friendship is not necessarily symmetric: Alice could consider Bob a friend, but not vice versa. It could also be context-dependent, especially with kids: Alice and Charlie get along, but not when Bob is around.

The thousands of pages that you don’t want to read probably address some of these “details” that your spherical cow model totally ignores. I think it’s totally fair for someone to say “That’s interesting, but have you read X,Y, and Z? They show that your model doesn’t apply because....”

Re:No Paper Is That Good by xamuel on Friday July 13, 2018 @02:41PM (#17525588)
This kind of proves the point. You're misunderstanding the mathematics. Asymmetry of friendship is irrelevant. Whether the friendships have non-local dependency is irrelevant. The kids' friendship and non-friendship IS a colored complete graph: between any two nodes (kids), there is either a red edge (if those two are friends--in the context of the group, if you want), or there is a blue edge (if those two are not friends--in the context of the group, if you want).
Re:No Paper Is That Good by mattkrause on Friday July 13, 2018 @03:50PM (#17526116)
Asymmetry is relevant because your bound comes from undirected graphs. The number for a complete digraph is different.
Re:No Paper Is That Good by xamuel on Friday July 13, 2018 @03:56PM (#17526167)
Oh, now I see what you're saying. Ok, you're right, to be pedantic, the original phenomenon should be reworded: Whenever 6+ kids get together, either there are 3 mutual friends, or there are 3 kids K1,K2,K3 such that for any two K_i, K_j, either K_i is not K_j's friend, or K_j is not K_i's friend. I was implicitly using "A and B are friends" to mean "A is B's friend, and B is A's friend". Thanks for pointing that out :)
Re:No Paper Is That Good by mattkrause on Friday July 13, 2018 @08:23PM (#17527954)
No problem!

My bigger point was that the literature on any given topic is chock full of discussions like this. Is friendship directional? Is it binary, or does it make more sense to consider weights on these edges (casual acquaintance/best friend)? Can an outside observer infer friendship, or do you need to rely on self-reports? If so, how consistent are they? And so on.

The more patient researchers are happy to walk you through these sorts of considerations, especially when you're introducing them to a new tool or something. However, if you catch someone who's busy—or grumpy—you might get blown off with "That won't work. Haven't you read the literature?" Personally, I think this happens too often, but you can sorta see how people might get sick of regurgitating the same arguments over and over.

This is not to say that "read it and come back" can't be used as a moat, or that ideas "from the literature" shouldn't be revisited and questioned, but I think insisting that people do a bit of reading is not usually meant in bad faith.