Protean graphs with a variety of ranking schemes

Theoretical Computer Science

Volumn 410, Issue 52, 2009, Pages 5491-5504

  Janssen, Jeannette ^a   Prałat, Paweł ^a  

^a DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Degree distribution; Differential equations method; Power law graphs; Protean graphs; Random graphs; Scale free networks; Web graphs

Indexed keywords

DEGREE DISTRIBUTION; POWER LAW GRAPHS; PROTEAN GRAPHS; RANDOM GRAPHS; SCALE-FREE NETWORKS; WEB GRAPHS;

DIFFERENTIAL EQUATIONS; GRAPH THEORY;

PARAMETER ESTIMATION;

EID: 70350568222     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.05.009     Document Type: Article

References (14)

1. A. Bonato, A Course on the Web Graph, in: American Mathematical Society Graduate Studies Series in Mathematics, Providence, Rhode Island, 2008
2. C. Borgs, J.T. Chayes, C. Daskalakis, S. Roch, First to market is not everything: An analysis of preferential attachment with fitness, in: Proceedings of the 39rd Annual ACM Symposium on the Theory of Computing, STOC, 2007, pp. 135-144
3. Chung F.R.K., and Lu L. Complex Graphs and Networks (2004), American Mathematical Society, USA
4. Fortunato S., Flammini A., and Menczer F. Scale-free network growth by ranking. Phys. Rev. Lett. 96 21 (2006) 218701
5. Janson S., Łuczak T., and Ruciński A. Random Graphs (2000), Wiley, New York
6. J. Janssen, P. Prałat, Rank-based attachment leads to power law graphs, Preprint
7. Łuczak T., and Prałat P. Protean graphs. Internet Mathematics 3 (2006) 21-40
8. Pittel B., Spencer J., and Wormald N. Sudden emergence of a giant k-core in a random graph. Journal of Combinatorial Theory, Series B 67 (1996) 111-151
9. Prał at P. A note on the diameter of protean graphs. Discrete Mathematics 308 (2008) 3399-3406
10. P. Pralat, Connectivity threshold and recovery time in rank-based models for complex networks, Preprint
11. Prałat P. Protean graphs with a variety of ranking schemes. Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications. COCOA'08. Lecture Notes in Computer Science vol. 5165 (2008), Springer 149-159
12. Prałat P., and Wormald N. Growing protean graphs. Internet Mathematics 4 (2009) 1-16
13. Wormald N.C. Random graphs and asymptotics. In: Gross J.L., and Yellen J. (Eds). Handbook of Graph Theory Section 8.2 (2004), CRC, Boca Raton 817-836
14. Wormald N. The differential equation method for random graph processes and greedy algorithms. In: Karoński M., and Prömel H.J. (Eds). Lectures on Approximation and Randomized Algorithms (1999), PWN, Warsaw 73-155