November 2022
Intermediate to advanced
352 pages
15h 54m
English
Content preview from Network Science
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Index
a
- Adamic‐Adar node 71, 72, 79, 81
- agglomerative methods 39
- aggressive cutting strategy 252
- airline traffic network 151
- Albert, Reka 5
- alters 62
- articulation point 35, 36, 38, 316
- Asheville, vehicle routing problem in 285–299
- authority centrality 151–157, 327
- measures 102
- authorship graph 167
- auto insurance, fraud detection in 312–320
- auto‐relationship 167
- average degree 8
- average path length 8
- average revenue per user (ARPU) 6
b
- back‐and‐forth approach 111
- backtracking algorithm 176
- Barabási, Albert‐László 5
- Bellman = Ford algorithm 220
- betweenness centrality 129–136, 316
- biconnected component 35–38
- binary relations 235, 237
- bipartite graphs 70, 72, 75, 76, 179, 180
- Boolean functions 90
- Bott, Helen 4
- Boykov‐Kolmogorov algorithm 195
- branch‐and‐bond method 242
- branch‐and‐bound nodes 252, 253
- branch‐and‐cut process 251
- brewing process 265, 266
- bridges 35
- brute‐force search algorithm 25
c
- Call Detail Records (CDRs) xii
- Capacitated Vehicle Routing Problem (CVRP) 286
- Carley, Kathleen 5
- cascade process 320
- centralities 123 see also network centralities
- centrality measures 302
- centrality metrics 299, 316, 322, 325
- central node 24
- characteristics of networks 7
- claims 315
- cliques 278
- closeness centrality 124–129
- cluster coefficient measures 102
- clustering analysis ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.