혹시 james live(으)로 찾으셨나요?
블로그
- 과제 degrees then explains vision of the field 2. erdös, rényi - random graph : if each node have more than 1 link in average, the connectedness of network rapidly jumps ※ phase transition, critical point weak ties:
- PageRank Algorithm Page C has a higher PageRank than Page E, even though it has fewer links to it: the link it has is much A web surfer who chooses a random link on every page (but with 15% likelihood jumps to a random page