1. S Battiston, J B Glattfelder, D Garlaschelli, F Lillo and G Caldarelli. The Structure of Financial Networks. In Network Science. Springer, 2010, pages 131–163. BibTeX

    @incollection{battiston2010structure,
    	author = "Battiston, S. and Glattfelder, J B and Garlaschelli, D and Lillo, F and Caldarelli, G",
    	booktitle = "Network Science",
    	keywords = "PRJ{\_}FOC,REF{\_}CDSNETS11,REF{\_}FED11,TOP{\_}SYSRISC,cds",
    	mendeley-tags = "PRJ{\_}FOC,REF{\_}CDSNETS11,REF{\_}FED11,TOP{\_}SYSRISC,cds",
    	pages = "131--163",
    	publisher = "Springer",
    	title = "{The Structure of Financial Networks}",
    	year = 2010
    }
    
  2. Mark Buchanan and Guido Caldarelli. A networked world. Physics World 23(2):22–24, 2010. BibTeX

    @article{buchanan2010networked,
    	author = "Buchanan, Mark and Caldarelli, Guido",
    	file = ":Users/Gcalda/Google Drive (This email address is being protected from spambots. You need JavaScript enabled to view it.)/Mendeley Desktop/Buchanan, Caldarelli/Physics World/Buchanan, Caldarelli - 2010 - A networked world.pdf:pdf",
    	issn = 09538585,
    	journal = "Physics World",
    	number = 2,
    	pages = "22--24",
    	publisher = "Institute of Physics",
    	title = "{A networked world}",
    	volume = 23,
    	year = 2010
    }
    
  3. P Giammatteo, D Donato, V Zlatić and G Caldarelli. A PageRank-based preferential attachment model for the evolution of the World Wide Web. EPL (Europhysics Letters) 91(1):18004, July 2010. URL, DOI BibTeX

    @article{gianmatteo2010pagerank,
    	abstract = "We propose a model of network growth aimed at mimicking the evolution of the World Wide Web. To this$\backslash$n purpose, we take as a key quantity, in the network evolution, the centrality or importance of a$\backslash$n vertex as measured by its PageRank. Using a preferential attachment rule and a rewiring procedure$\backslash$n based on this quantity, we can reproduce most of the topological properties of the system.",
    	author = "Giammatteo, P. and Donato, D. and Zlati{\'{c}}, V. and Caldarelli, G.",
    	doi = "10.1209/0295-5075/91/18004",
    	file = ":Users/Gcalda/Google Drive (This email address is being protected from spambots. You need JavaScript enabled to view it.)/Mendeley Desktop/Giammatteo et al/EPL (Europhysics Letters)/Giammatteo et al. - 2010 - A PageRank-based preferential attachment model for the evolution of the World Wide Web.pdf:pdf",
    	issn = "0295-5075",
    	journal = "EPL (Europhysics Letters)",
    	month = "jul",
    	number = 1,
    	pages = 18004,
    	title = "{A PageRank-based preferential attachment model for the evolution of the World Wide Web}",
    	url = "http://stacks.iop.org/0295-5075/91/i=1/a=18004?key=crossref.ce114846a77e2d0540a6ac32d84f4376",
    	volume = 91,
    	year = 2010
    }
    
  4. Vinko Zlatic, Andrea Gabrielli and Guido Caldarelli. Topologically biased random walk and community finding in networks. PHYSICAL REVIEW E 82(6, 2), December 2010. DOI BibTeX

    @article{ISI:000286742900001,
    	abstract = "We present an approach of topology biased random walks for undirected networks. We focus on a one-parameter family of biases, and by using a formal analogy with perturbation theory in quantum mechanics we investigate the features of biased random walks. This analogy is extended through the use of parametric equations of motion to study the features of random walks vs parameter values. Furthermore, we show an analysis of the spectral gap maximum associated with the value of the second eigenvalue of the transition matrix related to the relaxation rate to the stationary state. Applications of these studies allow ad hoc algorithms for the exploration of complex networks and their communities.",
    	author = "Zlatic, Vinko and Gabrielli, Andrea and Caldarelli, Guido",
    	doi = "10.1103/PhysRevE.82.066109",
    	issn = "1539-3755",
    	journal = "PHYSICAL REVIEW E",
    	month = "dec",
    	number = "6, 2",
    	title = "{Topologically biased random walk and community finding in networks}",
    	volume = 82,
    	year = 2010
    }