On a preferential attachment and generalized Pólya's urn model

Annals of Applied Probability

Volumn 23, Issue 3, 2013, Pages 1219-1253

  Collevecchio, Andrea ^a,b   Cotar, Codina ^c   Licalzi, Marco ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b MONASH UNIVERSITY   (Australia)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

P lya's urn process; Preferential attachment; Reinforcement processes; Species sampling sequence

Indexed keywords

EID: 84879618811     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/12-AAP869     Document Type: Article

References (27)

1. ALBERT, R. and BARABÁSI, A.-L. (2002). Statistical mechanics of complex networks. Rev. Modern Phys. 74 47-97. MR1895096
2. BARABÁSI, A.-L. and ALBERT, R. (1999). Emergence of scaling inrandom networks. Science 286 509-512. MR2091634
3. BHAMIDI, S. (2012). Universal techniques to analyze preferential attachment tree and networks: Global and local analysis. Probab. Surv. To appear.
4. BOLLOBÁS, B., RIORDAN, O., SPENCER, J. and TUSNÁDY, G. (2001). The degree sequence of a scale-free random graph process. Random Structures Algorithms 18 279-290. MR1824277
5. CHUNG, F., HANDJANI, S. and JUNGREIS, D. (2003). Generalizations ofPolya's urnproblem. Ann. Comb. 7 141-153.
6. COTAR, C. and LIMIC, V. (2009). Attraction time for strongly reinforced walks. Ann. Appl. Probab. 19 1972-2007. MR2569814
7. DAVIS, B. (1990). Reinforced random walk. Probab. Theory Related Fields 84 203-229. MR1030727
8. DE SOLLA PRICE, D. (1976). A general theory of bibliometric and other cumulative advantage processes. Journal of the American Society for Information Science 27 292-306.
9. DEMBO, A. and ZEITOUNI, O. (1998). Large Deviations Techniques and Applications, 2nd ed. Applications ofMathematics (New York) 38. Springer, New York. MR1619036
10. DENEUBOURG, J. L., ARON, S., GOSS, S. and PASTEELS, J. M. (1990). The self-organising exploratorypattern of the argentine ant. Journal ofInsect Behavior 3 159-168.
11. DEREICH, S. and MÖRTERS, P. (2009). Random networks with sublinear preferential attachment: Degree evolutions. Electron. J. Probab. 14 1222-1267. MR2511283
12. DEREICH, S. and MÖRTERS, P. (2011). Random networks with sublinear preferential attachment: The giant component. Unpublished manuscript.
13. DRINEA, E., ENACHESCU, M. and MITZENMACHER, M. (2001). Variations onrandomgraph models of the web. Technical Repor TR-06-01, Harvard Univ.
14. HANSEN, B. and PITMAN, J. (2000). Prediction rules for exchangeable sequences related to species sampling. Statist. Probab. Lett. 46 251-256. MR1745692
15. HILL, B. M., LANE, D. and SUDDERTH, W. (1987). Exchangeable urn processes. Ann. Probab. 15 1586-1592. MR0905350
16. ISHWARAN, H. and JAMES, L. F. (2003). Generalized weighted Chinese restaurantprocesses for species sampling mixture models. Statist. Sinica 13 1211-1235. MR2026070
17. KRAPIVSKY, P. L. and REDNER, S. L. (2001). Organization of growing random networks. Phys. Rev. E 63 066123.
18. LEE, J., QUINTANA, F. A., MÜLLER, P. and TRIPPA, L. (2012). Defining predictive probability functions for species sampling models. Unpublished manuscript.
19. MÓRI, T. F. (2002). On random trees. Studia Sci. Math. Hungar. 39 143-155. MR1909153
20. OLIVEIRA, R. and SPENCER, J. (2005). Connectivity transitions in networks with super-linear preferential attachment. Internet Math. 2 121-163. MR2193157
21. OLIVEIRA, R. I. (2009). The onset of dominance in balls-in-bins processes with feedback. Random Structures Algorithms 34 454-477. MR2531779
22. PEMANTLE, R. (2007). A survey of random processes with reinforcement. Probab. Surv. 4 1-79. MR2282181
23. PITMAN, J. (1995). Exchangeable and partially exchangeable random partitions. Probab. Theory Related Fields 102 145-158. MR1337249
24. PITMAN, J. (1996). Some developments of the Blackwell-MacQueen urn scheme. In Statistics, Probability and Game Theory (T S. Ferguson, L. S. Shapley and J. B. MacQueen, eds.). Institute of Mathematical Statistics Lecture Notes\Monograph Series 30 245-267. IMS, Hayward, CA. MR1481784
25. RUDAS, A., TÓTH, B. and VALKÓ, B. (2007). Randomtrees and general branch in gprocesses. Random Structures Algorithms 31 186-202. MR2343718
26. SHAH, S., KOTHARI, R., JAYADEVA and CHANDRA, S. (2010). Trail formation in ants. A generalized Polya urn process. Swarm Intelligence 4 145-171.
27. ZHOU, T. (2009). Nonlinear Pòlya urn models and self-organizing processes. Ph. D. thesis, Univ. Pennsylvania. Available at http://www.math. upenn.edu/grad/dissertations/tongzhuThesis.pdf.