Name
Abstract | ||
|---|---|---|
The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page and each of whose edges corresponds to a hyperlink from one web page to another. Recently, there has been considerable interest in using random graphs to model complex real-world networks to gain an insight into their properties. In this paper we propose an extended version of a new random model of the web graph in which the degree of a vertex depends on its age. We use the differential equation method to obtain basic results on the probability of edges being present. From this we are able to characterize the degree sequence of the model and study its behaviour near the connectivity threshold. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1080/15427951.2007.10129135 | INTERNET MATHEMATICS |
Keywords | Field | DocType |
degree sequence,web graphs,dierential,con- nectivity,protean graphs,. random graphs,random graph,web pages | Strength of a graph,Discrete mathematics,Combinatorics,Random graph,Line graph,Path (graph theory),Web page,Computer science,Cycle graph,Degree distribution,Multiple edges | Journal |
Volume | Issue | ISSN |
4 | 1 | 1542-7951 |
Citations | PageRank | References |
8 | 0.65 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pawel Pralat | 1 | 234 | 48.16 |
| Nicholas C. Wormald | 2 | 1506 | 230.43 |