"

eliorar@post.bgu.ac.il : /

4 ................................................................................................................................ :
4 ............................................................................................................................................... :
4 ...................................................................................................................................
5 ............................................................................................................. Bipartite Graph
5 .......................................................................................................................................
5 ............................................................................................................................. /
6 ......................................................................................................................................
6 ...................................................................................................................................... Sparse Graph
7 ....................................................................................................................................
7 .............................................................................................................................................. Distance
7 ..................................................................................... Characteristic path length = average distance
8 ......................................................................................................................... - Diameter
8 .............................................................................................................................................. Hop Plot
8 ..................................................................................................................................... Local Hop Plot
9 ......................................................................................... )Distribution( Probability Density Function
9 ............................................................................................................................. Degree Distribution
9 ................................................................................................................................. Network Density
01 ........................................................................................... Power Law and Exponential Distribution
00 ......................................................................................................................................... Scale Free
01 ....................................................................................................................................... Percolation
01 ........................................................................................................................ Small world networks
01 ........................................................................................................................ Clustering Coefficient
01 ............................................................................................................... Local Clustering Coefficient
04 .................................................................................................................. Centrality and Betweenness
04 ................................................................................................................. Bi-Connected Component
04 ......................................................................................................................................... Cut Points
04 .......................................................................................................................... Centrality Measures
04 ................................................................................................................................... Degree

.0

04 ........................................................................................................................... Reachability

2.

05 .................................................................................................................................. Farness

3.

05 ............................................................................................................................... Closeness

.4

06 ........................................................................................................................... Betweennes

.5

07 ....................................................................................................................... Eigenvector Centrality

08 ..................................................................................................................................... Betweenness
08 ..........................................................................................................................................
08 .......................................................................................................................... Bellman Criterion
09 ............................................................................................................................................ Stress
11 .................................................................................... Shortest Path Betweenness Centrality (BC)
11 .......................................................................................................... BC with end points included
11 ......................................................................................................... Combinatorial Path Counting
11 ...................................................................................................................... Source Dependency
11 ........................................................................................................................ Brandes algorithm
14 ....................................................................................................................... Betweenness Variants
14 ..................................................................................................................................... End-Points
15 .............................................................................................................................. K-Betweenness
16 ............................................................................................................................. Length Scale BC
17 .................................................................................................... BC with respect to traffic matrix
18 ........................................................................................................................ Edge Betweenness
19 ...................................................................................................................... Group Betweenness
10 ........................................................................................................................ Flow Betweenness
10 ........................................................................................................................... Random Walk BC
11 ................................................................................................................. Betweenness Comparison
11 ............................................................................................................................... Group Centrality
11 ................................................................................................................................ Group Degree
11 ............................................................................................................................ Group Closeness
11 ...................................................................................................................... Group Betweenness
11 ........................................................................................................................................ Communities
11 ................................................................................................................................ Girvan Newman
11 ........................................................................................................................................ Modularity
14 ............................................................................................................................. Label Propagation
15 .................................................................................................................................... Random Graphs
2

15 ....................................................................................................................................... Erdos-Renyi
16 .................................................................................................................................. Watts-Strogatz
17 ................................................................................................................................. Barabasi-Albert
18 ........................................................................................................................................... Waxman
18 ....................................................................................................................................... Transit Stub
19 ............................................................................................................................. Kronecker Graphs
41 ............................................................................................................................................... Diffusion
41 .................................................................................................. Cascading: Susceptible-Infective (SI)
41 ................................................................................ Cascading: Susceptible-Infective-Removed (SIR)
40 ............................................................................. Cascading: Susceptible-Infective-Susceptible (SIS)
40 .............................................................................................................................................. Tipping
40 ................................................................................................................................................... GAP
40 ..................................................................................................................................... Grounding
40 ............................................................................................................................... Interpretation
40 ........................................................................................................................... Annotated Atom
40 ............................................................................................................................................. Rules
40 ............................................................................................................................ Grounding Rules
41 .......................................................................................................................... Least Fix Point (LFP)
41 ...................................................................................................................................... Link Prediction
41 ................................................................................................ Group Betweenness Centrality (GBC)
41 ........................................................................................................................... Group Degree (GD)
41 ............................................................................................................................... Common Friends
41 ............................................................................................................................................ Distance
41 .......................................................................................................................... Shortest Path Count
44 .......................................................................................................... Preferential Attachment Score
44 ............................................................................................................................ Jaccard Coefficient
44 .................................................................................................................................... Katz Measure
44 ................................................................................................................................. Vertex Features
45 ............................................................................................................................... Friends Measure
45 ..................................................................................................................................... Total Friends

(Nodes) N
(Links) L
/(N,L) :
K
> - <k

Aij=1 if there is a link between node i and j

Aij=0 if nodes i and j are not connected to each other.

Aij A ji
2L
k
N
:

Aii 0
1 N
L Aij
2 i , j 1

.
.
L ( -)
* / 1' .

Aij A ji
L
k
N

Aii 0
N

ij

i , j 1

:
.
L ( )
/' .
( ) :

Ai j 1
k N 1

Aii 0
)N ( N 1
L Lmax
2

.
.
L .
' .0 -

 Bipartite Graph
U V -
U ,V U V -
.
, '.

: .
" .
:
/ ( :)Strongly connected ( AB
)BA .
( :)Weakly connected .

/
:
.0 : .

.1 :
N

k
i 1

1
2L
k
N
N

:
5

 .0 : - ( )in-degree - ()out-degree
() .

B
C

G
F

kCout 1 , kCin 2 , kC 3
:Source
:Sink
.1 :

k in k out
L
N

.
.
N

out
i

k
i 1

1
N

k out

kiin ,
i 1

1
N

k in

.
:I,j
:n=1 i j- .Aij=1.Aij=0 ,
:n=2 1 i j- .AikAkj=1 .AikAkj=0
:1
N

N ij( 2 ) Aik Akj [ A2 ]ij

k 1

, N ij( n ) [ An ]ij :n
* .

Sparse Graph
, Sparse Graph


Distance
( ) 1
.
.
. A B -
B.A -

Characteristic path length = average distance

> <d :

ij

i , j i

1
2 Lmax

dij i .j

)N ( N 1
2

- Lmax ( ).

: .
> <d :

ij

i , j i

1
Lmax

 - Diameter
( . ) ?

Hop Plot
) Hop-Plot(k .k-

X " ( Diameter -)

)N ( N 1
:
2

( . Lmax )

Hop-Plot .
1- ,
) d(u,v ).d(v,u
,k k-1 .k

Local Hop Plot

Hop-Plot .
( ) :
) (
) (

, d- .v
|) (

- 1-.

)Distribution( Probability Density Function

.x x
( )

( )

Degree Distribution
.k P(k)
.k Nk
( )

.power law Degree Distribution

Network Density
number of nodes
number of links
density of the network

Power Law and Exponential Distribution

:Power Law
, . ,Power law
.log log - .Power-Law
, .
:Exponential
. ,

.
:Universality ,Degree Distribution ( 1.)1-

Power-Law :Exponential

f ( x ) cx 0.5
f ( x ) cx 1
f ( x ) cx
,Power Law .Exponential
Power Law - .Exponential
:log

1 ( Power Law ) .
10

68

y Exponential .
:
:Exp : y , x . .
:Power-Law : y , x .
.Power-Law
:
.
power law .
scale free .

Scale Free
,
( ).

Scale Free average degree, distance diameter, degree distribution

.
power law 1 1 - . scale free
1- .
Scale Free Diameter , .6-

: . distribution
.
? ' , hub , crawling
. scale free .

11

Percolation
/ ( ).
- Percolation Threshold x .giant component
, avg degree 0 .
avg degree .1
- Reverse Percolation giant connected component .
. scale free
scale free network ,
.

Small world networks

, "
. Small World ( L
N .
) 1 -

12

Clustering Coefficient
( )

Clustering coefficient of a complete graph is 1

Local Clustering Coefficient

.
. k ) (

Local Clustering Coefficient of a vertex

( ) links between s neighbors

( )

( )

13

| |
| ( )| (| ( )|

| |
| ( )| (| ( )|

:Undirected

:Directed

Centrality and Betweenness

Bi-Connected Component
Bi-Connected Component 1 1
().

.
.Bi-Connected
.Bi-Connected
.Bi-Connected-

Cut Points
.Cut-Point

Cut-Points Bi-Connected Components .

Cut Points - .
.Cut-Points

Centrality Measures
Degree .1
Degree = size of local neighborhood | | .
Reachability .2
.
)
)

)
)

( (
( (

R(u,v) = Reachability of u from v is

) (

() :
)
)

o
o
o
o
o

(
(

x.
.
1 .
.
attenuation factor
.

14

Farness .3
.
) - Farness(v .
)

(
o
o

) (

.
, .

Closeness .4
Farness- .
)

) (

15

Betweennes .5

( . )

Betweenness

Farness

Reach

Degree

Vertex

60

33

5.84

78

28

5.93

72

27

6.12

43

30

5.75

15

32

5.25

41

35

5.18

10

16

Eigenvector Centrality
" .
:
.0 .
.
.1
.1 )) (

) (

.a

) (

( * ):
( )

||

|| )

.b .norm
.c , 1
1'.

EC- .
:
:
(

|
)

()

|
)

" ( " : )1-

) (

.
.1
17

Betweenness

) (
) (
) (

) (

Bellman Criterion
s t- v" )

) (

) (
) (

( .

s t- v:
)
) (
) (
) (

)
(
) (

) (

18

Stress
.

) (

) (

Stress , :

Stress v ( ) ,
.
:
) (
) (

) (

( s- t- )v

19

)Shortest Path Betweenness Centrality (BC

Betweenness :
) (

) (

:
.0 s
.t-
.1 ( ).
BC(v) , .v

BC with end points included

) (

) (

) (

, !
Combinatorial Path Counting
) (
) :1
( ) (
:

) (
)

) (

) (

: , s - v-
) ( . s-v-
) (

s .u -
.
Source Dependency
v .s-

) (

) (

) (

) (

) (

20

 :2 s , t s v:

)) (

) (

) (

0- w.
:

s- . v
s t
) ( .
,
v ,
,

.

: s :v
) (

)) (

)) (

) (

) (

) (

)) (

( ) (

) (

)* ( : Multigraph- 0- v.w-

21

Pair Dependency

s- t- v .e,

) (

) (

) (

) (

,
. s-w-
w ) (

s--
.( ) ,
s- v-"
v

. Pair dependency- s, t v-

) (

{
:
)) (

) (

) (
)

) (

) (

22

Brandes algorithm

23

Betweenness Variants
End-Points
.
.
) (

)) (

( ) (

) (

) (

Accumulation
] [

] [

] [

) (

] [
] [

) (

) (

,0 - 0- , .s
) :

) (

) (

. " :

: s,t,
s ( )n-1.
t ( )n-1.
0 ,BC- " ) 2(n-1 .Betweenness -

24

K-Betweenness
Betweenness - (
.)5
) (

) (

K-Betweenness ,BC BC ,
Rank- , Rank- " -
.BCk
( SSSP :)Accumulation

25

Length Scale BC
.
.
.
) (

) (

1 :
.0 Accumulation :End-Points-

.1 Accumulation Traffic Matrix .

26

BC with respect to traffic matrix

.
.
:
s.)t-
]

) (

) (

:
Accumulation
]

] [

] [

] [
] [

] [

) (
) (

) (

Traffic Matrix , ,:
.0 K-Betweenness :
) (
{

.1 Length Scale BC :
)

27

Edge Betweenness
.
:
- 1- .
TM- .
:
:
)
, ( ) :
.

(
)

28

Group Betweenness
.
) (

) (

, 0 BC .
1 1 4 BC ,1-
.
.

GBC" GBC . BC BC
/.
:

"

.C w ,C Betweenness
, C .
.
29

s 0 t1.t2-
) (
w1
s- t2- ,w1:
( ).
s- t1- w2 )1/2( t2-
) (
)
( , w2
, w1
.t2-

30

Flow Betweenness
Flow-Betweeness ,
.
:

) (
) (

) (

Betweenness- ( )v
.
,
) (

) (

) (

) (

FBC " ( ).
Random Walk BC
- Random Move v v .
Random Walk .Random Moves
Random Walk s t Random Walk s t-
).O(n3

31

Betweenness Comparison

" .
Flow BC .
Random Walk BC ,
( ).

Group Centrality
.
:

( 1" .)Betweenness Centrality

, 1 {. }1,4
: .
Group Degree
.

|) ( |

) (

: .M
( ).
Group Closeness
)
)
.0
.1
.1

) (

( , :
)
)
)

(
(
(

)
)
)

( .
(
( .

Group Betweenness
) (

) (

) (

.
32

Communities

Girvan Newman
: .
:
.0
.1
.1
.4
.5

Edge-Betweeness .
Betweenness - .
Betweenness- .
K / .
.

.O(n3) Sparse Graphs

Modularity
, ,
.
,
k- . e
i ( j
" ).

,
( )
.
. i
Q:
)

.i
, .
i .

: n m-:
.0 n .
.1 :
.a ,m m ,
, .
.b -

.m

.O(n2) Sparse Graphs

: , .
.
33

Label Propagation
,
.
:
.0 .
.1 ,
.
n
.1 ( -
)
:
.0 .
.1 , ,
.
:

34

Random Graphs
.
?
.0 .
.1 ,
.
.1 / .
.4 ( ) ,
.
.5 ," .

.
.

Erdos-Renyi
- Random Networks x-.
:
Size
Density
:
) G(n,p

) ( , p .

p , p 0 0- "
, , . p=0.5

) (

n .

Degree Distribution - :

np<1 G(n,p) - .O(log(n)) -

np=1 G(n,p) - ).O(n2/3

) (

Degree Distribution -
( )Scale-Free Power-Law

.

.Local Clustering Coefficient ,
, 1
Clustering Coefficient.

35

Watts-Strogatz
Small world networks ,
" . Small World
N
( L ) 1 -
. 1- .Erdos-Renyi
:
diameter
characteristic path length
Locality / clustering
:
.0 n .
.1 k- , k- .
Rewiring .1 .

:
.0 .2k
Rewiring .1 .
):
Average Distance .1 Clustering Coefficient (

Degree Distribution .
.

36

Barabasi-Albert
Scale-Free .Preferential attachment
1 : ( )Growth:Preferential attachment -
Growth .
Preferential attachment , .
"" .
:
:
.0 .
.1 m .
.1 : k ( )k
:k-

.i
.j
Algorithm1 BA(v,i):
1. Store degrees of existing vertices
2. For i:
a. For
( ):
]) (
i.
[
3.
Algrithm2 BA(v,i):
=>
.
1. L = choose i links from E
2. For e in L:
a.
[
) ( ]
b.
(
)
:
Degree Distribution Scale-Free Power law :
) (
Average Path Length ( 1 ) ,
.
:
:
.Communities-
tradeoff ,Preferential attachment
.

37

Waxman
, (
).
:
.0 .
.1 1 1 , ,
.
:
( )Heavy-tailed .
Power Law :

Transit Stub
.
:
???
)Stub Domain (network
o Source or Sink of the communications
o Can be a complex network
)Transit Domain (network
o Only a pass-through
o Transit ISP
Stub-Stub links connect two different stubs directly
Multi-homed Stub Domains are connected to more than
one Transit Domain

38

Kronecker Graphs
( )
.

:
.0 .
.1
.
.1 ,0,1
,
.
.a ,
,
.Small World
:
G H- , G H:
(
)
(
)

H G - ( ,)bipartite G H 1
-:

: .
39

Diffusion
.
Cascading . , .
Tipping .
Homophilic .

)Cascading: Susceptible-Infective (SI

) Susceptible (s .
) Infective (I .
S ,I :

.I

) (nf

) (nf

v )
) ( - v -.
( / v ( v ).
)
(

) ( :

)Cascading: Susceptible-Infective-Removed (SIR

Removed , ( ).
:

( )v,v v v .
:
.0 I - .R -
.1 I-.R-
:
.0 .R-
.1 S R- .

)
) (

) (

) (
) (nf
()

(
)
) (nf

) (
) (
(
) nf
(
40

)Cascading: Susceptible-Infective-Susceptible (SIS

:

( )v,v v v .
.

Tipping
,
( ).

GAP
.GAP = Generalized Automated Programs
Grounding
.
Interpretation
] [
A ,Ground Atoms Atom.
: .
.
Annotated Atom
.Interpretation:

Rules
.0 .) ( AND
.1 (
).
.1
) () ( .
.4 :
Grounding Rules
, , . ,
.
* lower bound- .

41

)Least Fix Point (LFP

.
:

) (
)

)
( )

:
Result
V
X
LFP

)Inf(B
0.9
0.5
0

)e(A,B
0.9
0.5 X
0.9

)Inf(A
1
1
0.5

Interpretation
I1
I2
I3

Link Prediction
(
)
: G )

?
: .
: .
: .
:
G":
.0 training set G
.1 test set
51% .a 51% ,
.1 :
True Positive .a
True Negative .b
False Positive .c
False Negative .d

)Group Betweenness Centrality (GBC

GBC ( ,)u,v , .:

GBC- .
42

)Group Degree (GD

) (

|) (

. .
:

) (

) (

) (

) (

Common Friends
) ( |
|) (
.Prediction

, Link

Clustering Coefficient- Common Friends .

Distance
)

( Common Friends - ."

( .

Shortest Path Count

( ,
)
, ( ):

(*) u v-:

, .1

( ).
)

) (

((

) (

((

x .
(*) x .1
43

Preferential Attachment Score

(
|) ( ) ( | )
Preferential attachment 1 .

Jaccard Coefficient
) ( |
) ( |

|) (
|) (

, .

Katz Measure
|

:
l u .v -
, .
.

Vertex Features

.
|) ( |
) (

) (
| |) (

| |) (
)

) (
|

|) (
) (
) (

|
(

) (

) (
)

(
|) (
)

) (
|
( ) (

) (

|) (
) (

) (

44

Friends Measure
)

) (

) (

)
)
( Katz
:
|

- ( 1 ) , .1

Total Friends
|) (

) ( |

- .u, v

45