1 / 15

“Pajek”: Large Network Analysis

“Pajek”: Large Network Analysis. Agenda. Introduction Network Definitions Network Data Files Network Analysis. 2. Introduction to Slovenian Spider: Pajek. http://vlado.fmf.uni-lj.si/pub/networks/pajek/ Free software Windows 32 bit Pajek 2.05. “Whom would you choose as a friend ?”. 3.

alayna
Download Presentation

“Pajek”: Large Network Analysis

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. “Pajek”: Large Network Analysis

  2. Agenda • Introduction • Network Definitions • Network Data Files • Network Analysis 2

  3. Introduction to Slovenian Spider: Pajek • http://vlado.fmf.uni-lj.si/pub/networks/pajek/ • Free software • Windows 32 bit • Pajek 2.05 “Whom would you choose as a friend ?” 3

  4. Introduction • Its applications: • Communication networks: links among pages or servers on Internet, usage of phone calls • Transportation networks • Flow graphs of programs • Bibliographies, citation networks 4

  5. Data Structures • Six data structures: • Network(*.net) – main object (vertices and lines - arcs, edges) • Partition(*.clu) – nominal property of vertices (gender); • Vector(*.vec) – numerical property of vertices; • permutation (*.per) – reordering of vertices; • cluster (*.cls) – subset of vertices (e.g. a cluster from partition); • hierarchy (*.hie) – hierarchically ordered clusters and vertices.

  6. Introduction • Pajek 2.05

  7. Network Definitions • Graph Theory • Graphs represent the structure of networks • Directed and undirected graphs • Lists of vertices arcs and edges, where each arch and edge has a value. • To view the network data files: NotePad, EditPlus

  8. Network Data File Open Network Data File (*.net) Number of Vertices 8

  9. Transform Transform

  10. Report Information

  11. Visualization • Energy – Idea: the network is represented like a physical system, and we are searching for the state with minimal energy. • Two algorithms are included: • Layout/Energy/Kamada-Kawai – slower • Layout/Energy/Fruchterman-Reingold – faster, drawing in a plane or space (2D or 3D), and selecting the repulsion factor

  12. Network Creation 12

  13. Partitions File name: *.clu

  14. Degree

  15. Assignment • Network Building (2 or 3 Students/Group) • Random Network • Small-World Network • Scale-free Network • Required Characteristics • Combination of arcs and edges • Number of vertices >100 • Partition in 2 groups • In-degree and Out-degree • Information Report • Visualization

More Related