Network+Sciences-2010Spring-part-3

Network+Sciences-2010Spring-part-3 - Network Sciences An...

Info iconThis preview shows pages 1–13. Sign up to view the full content.

View Full Document Right Arrow Icon
Network Sciences Lecturer: Prof. Xiang LI EE @ Fudan University 2010 Spring —— An English introductory course for undergraduate students Adaptive Networks and Control Lab
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Some Notifications The course slides are available at the V-campus. The PDF copy of our textbook <Linked: the New Science of Networks> One reference book with more technical details: <Network Science: Theory and Applications>
Background image of page 2
Last Friday’s question How to code a network into your computer? Write down and tell me your algorithm.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Last Friday’s (possible) answers Given a network with N nodes, and M (<N 2 /2) edges, to code it into a computer program, Define an array (matrix) with N*N elements Define a triplet with 3*M elements Any else?
Background image of page 4
Graph types (a) (b) (c) (d) (a) undirected and un-weighted network with same type of nodes and links (b) undirected and un-weighted network with different types of nodes and links (c) undirected but weighted network with weights on both nodes and links (d) directed but un-weighted network with same type of nodes
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Definition: Simple Graph Simple graph An unweighted and undirected graph without multiple edges and self-loops . This course mainly focuses on Simple Graphs . So a network is ‘simple’ if it’s a simple graph.
Background image of page 6
Simple Graph ? multiple edges self-loop × × They above two are not simple graphs
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
ER random graph model A (simple) random graph with N nodes, which has probability M=[pN(N-1)/2] edges.
Background image of page 8
Pseudo-code explanations from WWW e p 5 3 f f : \E ö x f : \E ö x ± ² F * f : \E ö x f : \E ö x
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
The point is not how to write Pseudo-code. The point is how to translate descriptions of a model into Pseudo-code, which will reflect your considering aspects behind the model descriptions.
Background image of page 10
Classroom Question How to put the ER model into your computer with pseudo-code?
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
computer with pseudo-code? Algorithm description of the ER
Background image of page 12
Image of page 13
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 50

Network+Sciences-2010Spring-part-3 - Network Sciences An...

This preview shows document pages 1 - 13. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online