My intial aim is to satisfy an academic curiosity about the structure of the Perlmonks. jcwren's site computes statistcs associated each monk. From a graph-theoretic point of view, the set of monks can be associated with the set of home pages, a special set of vertices in the Perlmonks graph, a set that can generate other vertices. While jcwren's site is a fun community resource that satisfies curiosity, ego, or competitive drive, it also computes some vertex structure of the Perlmonks network.
If jcwren computes vertex statistics, I'd like to look at the relationships between the vertices. Those relationships would include the population statistics mentioned previously and would also include quantities such as average number of replies to a question, whether reputation was dependent on position in the list of replies, and whether reputation was dependent on the number of previous links between questioner and responder.
The answers to such questions would be interesting academically, becasue network toplogy is a hot topic right now and many researchers are trying to discover the broad classes of behavior (physicists would call them universality classes) possible in real world networks. As I am an academic, that is my main motivation. The answers may also be interesting to monks who wonder about effects on reputation other than the quality of answer.
-Mark
In reply to Re: Re: Best way to traverse all Perlmonks nodes?
by kvale
in thread Best way to traverse all Perlmonks nodes?
by kvale
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |