when affinity meets resistance on the topological centrality of edges in complex networks gyan...

29
When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li Zhang and Hesham Mekky.] I M A I n t e r n a t i o n a l w o r k s h o p o n C o m p l e x S y s t e m s a n d N e t w o r k s , 2 0 1 2 .

Upload: bryan-horn

Post on 21-Jan-2016

222 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

When Affinity Meets Resistance

On the Topological Centrality of Edges in Complex Networks

Gyan RanjanUniversity of Minnesota, MN

[Collaborators: Zhi-Li Zhang and Hesham Mekky.]

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 2: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Overview Motivation

Geometry of networks

n-dimensional embedding

Bi-partitions of a graph

Connectivity within and across partitions

Random detours Overhead

Real-world networks and applications

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 3: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Overview Motivation

Geometry of networks

n-dimensional embedding

Bi-partitions of a graph

Connectivity within and across partitions

Random detours Overhead

Real-world networks and applications

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 4: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Motivation Complex networks

Study of entities and inter-connections Applicable to several fields

Biology, structural analysis, world-wide-web

Notion of centrality Position of entities and inter-connections

Page-rank of Google

Utility

Roles and functions of entities and inter-connections Structure determines functionality

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 5: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Cart before the Horse

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Centrality of nodes: Red to blue to white, decreasing order [1].

Western states power grid Network sciences co-authorship

Page 6: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

State of Art Node centrality measures

Degree, Joint-degree Local influence

Shortest paths based Random-walks based

Page Rank

Sub-graph centrality

Edge centrality Shortest paths based [Explicit] Combination of node centralities of end-points [Implicit]

Joint degree across the edge

Our approach A geometric and topological view of network structure

Generic, unifies several approaches into one

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 7: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Overview Motivation

Geometry of networks

n-dimensional embedding

Bi-partitions of a graph Connectivity within and across partitions

Random detours Overhead

Example and real-world networks

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 8: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Definitions Network as a graph G(V, E)

Simple, connected and unweighted [for simplicity] Extends to weighted networks/graphs

wij is the weight of edge eij

Topological dimensions |V(G)| = n [Order of the graph] |E(G)| = m [Number of edges] Vol(G) = 2 m [Volume of the graph] d(i) = Degree of node i

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 9: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

The Graph and Algebra For a graph G(V, E)

[A]nxn = Adjacency matrix of G(V, E) aij = 1 if in E(G), 0 otherwise [D] nxn = Degree matrix of G(V, E) [L] nxn = D – A = Laplacian matrix of G(V, E)

Structure of L

Symmetric, centered and positive semi-definite L U Lambda

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 10: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Geometry of Networks The Moore-Penrose pseudo-inverse of L

Lp

where

In this n-dimensional space [2]:

x

x

x

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 11: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Overview Motivation

Geometry of networks

n-dimensional embedding

Bi-partitions of a graph

Connectivity within and across partitions

Random detours Overhead

Real-world networks and applications

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 12: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Bi-Partitions of a Network Connected bi-partitions of G(V, E)

P(S, S’): a cut with two connected sub-graphs V(S), V(S’) and E(S, S’) : nodes and edges T(G), T(S) and T(S’) : Spanning trees T set of spanning trees in

S and S’ respectively

set of connected bi-partitions

Represents a reduced state First point of disconnectedness Where does a node / edge lie?

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

S S’

Page 13: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Bi-Partitions and L+

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Lower the value, bigger the sub-graph in which eij lies.

Lower the value, bigger the sub-graph in which i lies.

A measure of centrality of edge eij in E(G):

Page 14: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Bi-Partitions and L+

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Higher the value, more the spanning trees on which eij lies.

[2, 3]

For an edge eij in E(G):

Page 15: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

When the Graph is a Tree

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Lower the value, closer to the tree-center i is.

Lower the value, closer to the tree-center eij is.

Page 16: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

When the Graph is a Tree

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 17: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Overview Motivation

Geometry of networks

n-dimensional embedding

Bi-partitions of a graph

Connectivity within and across partitions

Random detours Overhead

Real-world networks and applications

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 18: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Random Detours Random walk from i to j

Hitting time: Hij Commute time: Cij = Hij + Hji = Vol(G) [2, 3]

Random detour i to j but through k

Detour overhead [1]

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 19: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Recurrence in Detours

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Expected number of times the walker returns to source

Page 20: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Overview Motivation

Geometry of networks

n-dimensional embedding

Bi-partitions of a graph

Connectivity within and across partitions

Random detours Overhead

Real-world networks and applications

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 21: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Wherein lies the Core

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 22: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

The Net-Sci Network

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2. Selecting edges based on centrality

Page 23: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

The Western States Power-Grid

|V(G)| = 4941, |E(G)| = 6954

(a) Edges with Le+ ≤ 1/3 of mean(b) Edges with Le+ ≤ 1/2 of mean(c) Edges with Le+ ≤ mean

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 24: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Extract Trees the Greedy Way

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2. The Italian power grid

network

Spanning tree obtained through Kruskal’s algorithm on Le

+

Page 25: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Relaxed Balanced Bi-Partitioning

Balanced connected bi-partitioning NP-Hard problem Relaxed version feasible

|E(S, S’)| minimization not required Node duplication permitted

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 26: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Summary of Results Geometric approach to centrality

The eigen space of L+ Length of position vector, angular and Euclidean distances

Notion of centrality Based on position and connectedness

Global measure, topological connection

Applications

Core identification Greedy tree extraction Relaxed bi-partitioning

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 27: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Questions?

Thank you!

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 28: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Selected References [1] G. Ranjan and Z. –L. Zhang, Geometry of Complex Networks

and Topological Centrality, [arXiv 1107.0989].

[2] F. Fouss et al., Random-walk computation of similarities betweennodes of a graph with application to collaborative recommendation, IEEE Transactions on Knowledge and Data Engineering, 19, 2007.

[3] D. J. Klein and M. Randic. Resistance distance. J. Math. Chemistry, 12:81–95, 1993.

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.

Page 29: When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li

Acknowledgment The work was supported by DTRA grant HDTRA1-09-1-0050 and

NSF grants CNS-0905037, CNS-1017647 and CNS-1017092.

IMA

Inte

rnatio

nal w

orksh

op

on

Com

ple

x S

yste

ms a

nd

N

etw

orks, 2

01

2.