LTCC_2018
/
LTCC_graphs_2018
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
Material related to the LTCC module "Graph algorithms and models". Please see http://www.maths.qmul.ac.uk/~vnicosia/LTCC2018
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
12 Commits
1 Branch
0 Tags
26 MiB
Tag: Branch: Tree: 779c4aad8d
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '779c4aad8d'
${ noResults }
LTCC_graphs_2018/reading_material/week_2
History
KatolaZ 0c932a26cb
added reading material for week 2 		7 years ago
..
Boccaletti2006_physrep.pdf added reading material for week 2 7 years ago
Bonacich1987-Centrality.pdf added reading material for week 2 7 years ago
Nicosia2012.pdf added reading material for week 2 7 years ago
README.md added reading material for week 2 7 years ago

README.md

Reading material for Week 2 (26/02/2018)

The lecture in Week 2 will be focused on the computation of the connected components of a graph, of pairwise node distances, and of various node centrality scores.

Please make sure to have read the references indicated below:

  1. Degree and Degree correlations

    • S. Boccaletti et al. "Complex Networks: Structure and dynamics", Phys. Rep. 424 (2006) 175-308 Only section 2.1.1 "Node degree, degree distributions and correlations" paper here

  2. Definition of connected components associated to nodes and graphs

    • V. Nicosia et al. "Connected components in time-varying graphs", Chaos, vol 22, 2, 023101 doi:10.1063/1.3697996 (2012) Only section "II Components in Static graphs" paper here

  3. Paths, shortest paths, node distances, and betweenness

    • S. Boccaletti et al. "Complex Networks: Structure and dynamics", Phys. Rep. 424 (2006) 175-308 Only section 2.1.2 "Shortest path lengths, diameter and betweenness" paper here

  4. Eigenvector centrality and PageRank

    • P. Bonacich, "Power and Centrality: A Family of Measures", Am. J. Sociol. 92(5), (1987), 1170-1192, Pages 1172-1176 paper here

    • The PageRank Algorithm Wikipedia page