#### DMCA

## Structure and evolution of online social networks (2006)

### Cached

### Download Links

- [studystream.org]
- [nrl.iis.sinica.edu.tw]
- [www.hung-truong.com]
- [www.tomkinshome.com]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining |

Citations: | 400 - 4 self |

### Citations

3932 | Emergence of scaling in random networks
- Barabási, Albert
- 1999
(Show Context)
Citation Context ...both computer science and physics communities, aimed at studying properties of large-scale real-world graphs. Power law degree distributions were also noted on the graph defined by the world-wide web =-=[21, 4]-=-. Broder et al [8] studied the world-wide web from a connectivity point of view and showed that it has a large strongly connected component. Several other studies have also shown that the average diam... |

3612 |
Social Network Analysis: Methods and Applications
- Wasserman, Faust
- 1994
(Show Context)
Citation Context ...xplaining and analyzing friendships [18] and demonstrating the small-world and navigability properties of these graphs [23, 9, 1]. For surveys of analysis of large graphs, the readers are referred to =-=[29, 28, 2, 25, 11, 10, 16]-=-. Many of these above studies were performed on static graphs whereas most real-world graphs are evolving in nature. In fact, there are very papers that study the evolution of real-world graphs; this ... |

3323 |
Collective dynamics of ’small-world’ networks
- Watts, Strogatz
- 1998
(Show Context)
Citation Context ...” principle can be analytically shown to induce power-law degree distributions. Kleinberg [17, 15] proposed a model to explain the small-world phenomenon and navigability in social networks; see also =-=[30]-=-. Leskovec et al [22] proposed a forest-fire graph model to explain the decreasing diameter phenomenon observed in citation graphs. For a survey of mathematical analysis of some of these models, the r... |

3063 | On random graphs
- ERDÖS, RÉNYI
- 1959
(Show Context)
Citation Context ...actable mathematical models for massive graphs. Because of their evolutionary nature and their power law degree distributions, these graphs cannot be modeled by traditional Erdö–Rényi random graphs =-=[12, 6]-=-. However, there have been a few alternate models that are more faithful to observed properties. One is the so-called configuration model, which chooses a graph uniformly at random from all graphs wit... |

2594 | The structure and function of complex networks
- Newman
(Show Context)
Citation Context ...xplaining and analyzing friendships [18] and demonstrating the small-world and navigability properties of these graphs [23, 9, 1]. For surveys of analysis of large graphs, the readers are referred to =-=[29, 28, 2, 25, 11, 10, 16]-=-. Many of these above studies were performed on static graphs whereas most real-world graphs are evolving in nature. In fact, there are very papers that study the evolution of real-world graphs; this ... |

2385 | Random Graphs
- Bollobas
- 1985
(Show Context)
Citation Context ...actable mathematical models for massive graphs. Because of their evolutionary nature and their power law degree distributions, these graphs cannot be modeled by traditional Erdö–Rényi random graphs =-=[12, 6]-=-. However, there have been a few alternate models that are more faithful to observed properties. One is the so-called configuration model, which chooses a graph uniformly at random from all graphs wit... |

2143 | Statistical mechanics of complex networks
- Albert, Barabási
(Show Context)
Citation Context ...xplaining and analyzing friendships [18] and demonstrating the small-world and navigability properties of these graphs [23, 9, 1]. For surveys of analysis of large graphs, the readers are referred to =-=[29, 28, 2, 25, 11, 10, 16]-=-. Many of these above studies were performed on static graphs whereas most real-world graphs are evolving in nature. In fact, there are very papers that study the evolution of real-world graphs; this ... |

1666 | On power-law relationships of the Internet topology
- Faloutsos, Faloutsos, et al.
- 1999
(Show Context)
Citation Context ...verage distance, small-world phenomenon, clustering coefficient, connected components, community structures, etc. We briefly outline some of the work in this area. Faloutsos, Faloutsos, and Faloutsos =-=[13]-=- made a crucial observation showing that the degree distribution on the internet follow a power law. Subsequently, an intense body of work followed in both computer science and physics communities, ai... |

823 | The small-world phenomenon: an algorithm perspective. In:
- Kleinberg
- 2000
(Show Context)
Citation Context ...selves to a pre-existing node with probability proportional to the degree of the latter. This “rich get richer” principle can be analytically shown to induce power-law degree distributions. Kleinberg =-=[17, 15]-=- proposed a model to explain the small-world phenomenon and navigability in social networks; see also [30]. Leskovec et al [22] proposed a forest-fire graph model to explain the decreasing diameter ph... |

672 |
Exploring complex networks
- Strogatz
- 2001
(Show Context)
Citation Context |

632 |
BRandom graphs with arbitrary degree distribution and their application
- Newman, Strogatz, et al.
- 2001
(Show Context)
Citation Context ...ternate models that are more faithful to observed properties. One is the so-called configuration model, which chooses a graph uniformly at random from all graphs with a prescribed degree distribution =-=[5, 24, 26]-=-; the degree distribution can be set to match practical observations and is usually a power law. Another approach is to use a generative model to describe the evolution of graphs. A typical example is... |

566 |
Evolution of Networks: From Biological Nets to the Internet and WWW
- Dorogotsev, Mendes
- 2003
(Show Context)
Citation Context |

537 | Graphs over time: densification laws, shrinking diameters and possible explanations
- Leskovec, Kleinberg, et al.
- 2005
(Show Context)
Citation Context ...ant impact on the connectivity of the remaining nodes. Over time, the average distance between users in the giant component is seen to fall. This surprising result has been observed in other settings =-=[22]-=-; we show it here for online social networks. Given these findings, we draw some high-level behavioral conclusions about the structure and evolution of online social networks. First, there are two dis... |

506 | critical point for random graphs with a given degree sequence
- Molloy, Reed, et al.
- 1995
(Show Context)
Citation Context ...ternate models that are more faithful to observed properties. One is the so-called configuration model, which chooses a graph uniformly at random from all graphs with a prescribed degree distribution =-=[5, 24, 26]-=-; the degree distribution can be set to match practical observations and is usually a power law. Another approach is to use a generative model to describe the evolution of graphs. A typical example is... |

417 | Evolution of networks
- Dorogovtsev, Mendes
- 2002
(Show Context)
Citation Context |

368 | Trawling the Web for emerging cyber-communities - Kumar, Raghavan, et al. - 1999 |

365 | On the bursty evolution of blogspace.
- Kumar, Novak, et al.
- 2003
(Show Context)
Citation Context ...l other studies have also shown that the average diameter of the web is quite small [8, 3]. Online friendship and email graphs have been studied in the context of explaining and analyzing friendships =-=[18]-=- and demonstrating the small-world and navigability properties of these graphs [23, 9, 1]. For surveys of analysis of large graphs, the readers are referred to [29, 28, 2, 25, 11, 10, 16]. Many of the... |

290 |
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs.
- Bollobás
- 1980
(Show Context)
Citation Context ...ternate models that are more faithful to observed properties. One is the so-called configuration model, which chooses a graph uniformly at random from all graphs with a prescribed degree distribution =-=[5, 24, 26]-=-; the degree distribution can be set to match practical observations and is usually a power law. Another approach is to use a generative model to describe the evolution of graphs. A typical example is... |

289 | Stochastic models for the web graph.
- Kumar, Raghavan, et al.
- 2000
(Show Context)
Citation Context ...tical observations and is usually a power law. Another approach is to use a generative model to describe the evolution of graphs. A typical example is the copying or the preferential attachment model =-=[20, 4]-=-: nodes arrive one by one, and link themselves to a pre-existing node with probability proportional to the degree of the latter. This “rich get richer” principle can be analytically shown to induce po... |

285 |
Navigation in a small world.
- Kleinberg
- 2000
(Show Context)
Citation Context ...selves to a pre-existing node with probability proportional to the degree of the latter. This “rich get richer” principle can be analytically shown to induce power-law degree distributions. Kleinberg =-=[17, 15]-=- proposed a model to explain the small-world phenomenon and navigability in social networks; see also [30]. Leskovec et al [22] proposed a forest-fire graph model to explain the decreasing diameter ph... |

241 | A largescale study of the evolution of web pages.
- Fetterly, Manasse, et al.
- 2003
(Show Context)
Citation Context ...ge pattern of blogs and the emergence of bursty communities in the blogspace [19]. Structural properties of different snapshots of the world-wide web graph was studied by Fetterly et al and Cho et al =-=[14, 27]-=-. Recently, Leskovec, Kleinberg, and Faloutsos [22] considered citation graphs and showed that these exhibit densification and shrinking diameters over time. A parallel body of work is concerned with ... |

232 | Geographic routing in social networks. - Liben-Nowell, Novak, et al. - 2005 |

222 | Diameter of the world wide web
- ALBERT, JEONG, et al.
- 1999
(Show Context)
Citation Context ...world-wide web from a connectivity point of view and showed that it has a large strongly connected component. Several other studies have also shown that the average diameter of the web is quite small =-=[8, 3]-=-. Online friendship and email graphs have been studied in the context of explaining and analyzing friendships [18] and demonstrating the small-world and navigability properties of these graphs [23, 9,... |

220 | What’s new on the web?: the evolution of the web from a search engine perspective.
- Ntoulas, Cho, et al.
- 2004
(Show Context)
Citation Context ...ge pattern of blogs and the emergence of bursty communities in the blogspace [19]. Structural properties of different snapshots of the world-wide web graph was studied by Fetterly et al and Cho et al =-=[14, 27]-=-. Recently, Leskovec, Kleinberg, and Faloutsos [22] considered citation graphs and showed that these exhibit densification and shrinking diameters over time. A parallel body of work is concerned with ... |

166 | An Experimental Study of Search in Global Social Networks
- Dodds, Muhamad, et al.
- 2003
(Show Context)
Citation Context ... [8, 3]. Online friendship and email graphs have been studied in the context of explaining and analyzing friendships [18] and demonstrating the small-world and navigability properties of these graphs =-=[23, 9, 1]-=-. For surveys of analysis of large graphs, the readers are referred to [29, 28, 2, 25, 11, 10, 16]. Many of these above studies were performed on static graphs whereas most real-world graphs are evolv... |

158 | How to Search a Social Network.
- Adamic, Adar
- 2005
(Show Context)
Citation Context ... [8, 3]. Online friendship and email graphs have been studied in the context of explaining and analyzing friendships [18] and demonstrating the small-world and navigability properties of these graphs =-=[23, 9, 1]-=-. For surveys of analysis of large graphs, the readers are referred to [29, 28, 2, 25, 11, 10, 16]. Many of these above studies were performed on static graphs whereas most real-world graphs are evolv... |

145 | Mathematical results on scale-free random graphs.
- Bollobas, Riordan
- 2003
(Show Context)
Citation Context ...roposed a forest-fire graph model to explain the decreasing diameter phenomenon observed in citation graphs. For a survey of mathematical analysis of some of these models, the readers are referred to =-=[7, 16]-=-. 3. MEASUREMENTS In this section we detail our study on two online social networks at Yahoo!. Each social network is presented as a directed time graph G = (V,E), i.e., every node v ∈ V and directed ... |

111 | Complex Networks and Decentralized Search Algorithms.
- Kleinberg
- 2006
(Show Context)
Citation Context |

1 |
On the bursty evolution of blogspace.World Wide
- Kumar, Novak, et al.
- 2005
(Show Context)
Citation Context ...n time and use these snapshots to make inferences about the evolutionary process. This approach was used to study the linkage pattern of blogs and the emergence of bursty communities in the blogspace =-=[19]-=-. Structural properties of different snapshots of the world-wide web graph was studied by Fetterly et al and Cho et al [14, 27]. Recently, Leskovec, Kleinberg, and Faloutsos [22] considered citation g... |

1 |
Trawling the web for emerging cyber-communities.WWW8
- Kumar, Raghavan, et al.
- 1999
(Show Context)
Citation Context ...both computer science and physics communities, aimed at studying properties of large-scale real-world graphs. Power law degree distributions were also noted on the graph defined by the world-wide web =-=[21, 4]-=-. Broder et al [8] studied the world-wide web from a connectivity point of view and showed that it has a large strongly connected component. Several other studies have also shown that the average diam... |