cse 610: special topics in social and information network analysissariyuce.com/610/9.4.pdf ·...
TRANSCRIPT
![Page 1: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/1.jpg)
CSE 610: Special Topics inSocial and Information Network Analysis
A. Erdem Sariyuce
![Page 2: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/2.jpg)
What is “Network Science”?•Study of complex networks (complex means non-trivial)
♫
vertex
edge
degree is 3
![Page 3: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/3.jpg)
What is “Network Science”?•Study of complex networks (complex means non-trivial)• Social networks• Information networks
• Web networks• Telecommunication networks• Computer networks• Biological networks
• Cognitive and semantic networks
♫
vertex
edge
degree is 3
![Page 4: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/4.jpg)
What is “Network Science”?•Study of complex networks (complex means non-trivial)• Social networks• Information networks
• Web networks• Telecommunication networks• Computer networks• Biological networks
• Cognitive and semantic networks
•Distinct entities: Nodes (or vertices)
•Connections: Links (or edges)
♫
vertex
edge
degree is 3
![Page 5: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/5.jpg)
Graphs (networks) are everywhere
Social Information
Protein-interactionRouters
![Page 6: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/6.jpg)
Transformers of disciplines•Graph theory•Mathematics
•Statistical mechanics• Physics
•Data mining• Computer science
• Inferential modeling• Statistics
•Social structure• Sociology
![Page 7: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/7.jpg)
Questions we ask•Real-world networks•What characteristics do we observe?
•Nodes and edges•Which ones are more important than others?•What does important mean in this context?
![Page 8: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/8.jpg)
Questions we ask•Given a person in a social network;• How do we determine her social circles?• How do we suggest new friends?• Can we infer her spouse? (there is a paper on that)
•Or given a webpage about booking flights, • How likely it will be accessed next week? • How can we make it appear on top in search results?
![Page 9: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/9.jpg)
Questions we ask•Graph algorithms•What is used in the state-of-the-art search engines?•What about recommendation systems?
•How does a network evolve over time?•Which nodes will get more edges?•Which edges will be removed or added?
![Page 10: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/10.jpg)
Logistics•Class hours: MW 3:30-4:50 @ Fronzcak 422
•Office: 323 Davis Hall•Office hours: T 10-12
•[email protected]•Website: http://sariyuce.com/F19.html•Piazza page
![Page 11: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/11.jpg)
This class is not hard•No prerequisite needed• Background in graph theory, discrete math
•No textbook required. Will benefit from• Networks: An Introduction• By M. Newman
• Networks, Crowds and Markets (has a webpage)• By D. Easley and J. Kleinberg
![Page 12: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/12.jpg)
Lectures and papers•Papers will be pointed for advanced topics• Community Detection, Temporal Networks …
•Great papers from the top venues!• Science, Nature• SIGKDD, WWW, WSDM, ICDM, SDM• VLDB, SIGMOD, ICDE
![Page 13: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/13.jpg)
Grading•Homeworks• 4 x 10%
•Midterm• 20% (In class)
•Project• 40%
![Page 14: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/14.jpg)
Homeworks•Combination of data analysis, algorithm design, and math• Analysis and discussions by charts, tables• Require light coding to automate things
•Due in one week• Individually
•All homeworks should be typed!• Email it before the class on the due date
![Page 15: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/15.jpg)
Project• Proposal by 2nd week• Report (1p): 3%• Presentation (5m): 2%
• Progress by 8th week• Report (≤9p):8%• Presentation (5m): 7%
• Final by last week• Report (≤9p):10%• Presentation (15m):10%
•Can do in pairs• Don’t have to
• Ideas will be provided• Don’t worry, I’ll guide
•We have to meet every other week, at least•Office hours! Tue 10-12
•We aim to publish papers!
![Page 16: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/16.jpg)
Academic integrity•Don’t cheat in homeworks, please, really easy to detect!
•New university policy this year!• https://grad.buffalo.edu/succeed/current-students/policy-
library.academics.html#grievanceandintegrity
•Zero tolerance: Failure in the course for first attempt
•Grads: Sanctions can even reach to RA/TA cancellation
![Page 17: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/17.jpg)
Questions?
![Page 18: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/18.jpg)
Project Ideas•Repeatability experiments for some popular papers• And extensions
•Surveys on certain hot topics•With a codebase for comparison
•Any idea you may want to go for!• Consultation with instructor
![Page 19: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/19.jpg)
Project Ideas•Graph summarization by tree hierarchy• VLDB tutorial
•Finding dense regions in weighted networks• Driven by weighted motifs
•Speeding up fundamental graph computations• Triangle counting• Peeling with bucket structure
![Page 20: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/20.jpg)
Project Ideas•Collective similarity measurements in bipartite graphs• Beyond pairwise, related to distance metrics
•Conductance measurement• State-of-the-art dense subgraph discovery algorithms
•Core-periphery structure in non-traditional graphs• Bipartite graphs•Weighted graphs
![Page 21: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/21.jpg)
Schedule9/4: Introduction, Course Overview, Graph Theory 10/21: Network Motifs
10/23: Progress Presentations (Progress Report due)
9/9: Link analysis9/11: PageRank, Proposal Presentations (Prop. Rep. due)
10/28: NO CLASS (Instructor on travel) 10/30: Non-traditional and heterogeneous networks
9/16: Graph Traversal (HW 1 out)9/18: Maximum Flow
11/4: Temporal Graphs I11/6: Temporal Graphs II (HW 3 out)
9/23: Shortest Path (HW 1 due)9/25: Network Centrality
11/11: Streaming graph algorithms I11/13: Streaming graph algorithms II (HW 3 due)
9/30: Community Detection I10/2: Community Detection II
11/18: Machine Learning on Networks11/20: Graph embeddings (HW 4 out)
10/7: Dense Subgraph Discovery10/9: Midterm Exam (HW 2 out)
11/25: Parallel Graph Analytics11/27: Parallel Graph Frameworks I (HW 4 due)
10/14: Graph partitioning I 10/16: Graph partitioning II (HW 2 due)
12/2: Parallel Graph Frameworks II12/4: Final Presentations (Final Report due)
![Page 22: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/22.jpg)
Review of Graph Theory
![Page 23: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/23.jpg)
Representing Networks•Distinct entities: Nodes (or vertices)
•Connections: Links (or edges)
♫
vertex
edge
degree is 3
![Page 24: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/24.jpg)
•Dots and lines
•Single edge between any pair of nodes
•Degree of a vertex• Number of edges it is connected
•No other information
Simple graph is just nodes and edges
![Page 25: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/25.jpg)
•Edge is from a source vertex to target vertex• In-degree of a vertex• Number of in-coming edges
•Out-degree of a vertex• Number of out-going edges
•An edge can be in both directions• Regarded as undirected
Directed graph has directions on edges
![Page 26: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/26.jpg)
•Multiple edges between two vertices•Multi-edge• Example?
•Self-loops• A vertex is connected to itself
•Any combination is possible• Directed multiedges with self-loops
Multi-edges and self-loops
![Page 27: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/27.jpg)
•Labels• Binary or multiple classes•Multiple labels
•Scalar values• Integer or fraction
•Can be combined with others
•Algorithms get more complex
Attributes on vertices and edges
3.2
5.1
2.4
0.9 2.0
1.3
![Page 28: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/28.jpg)
•Not all relations are pairwise• Edges with any number of vertices• Hyperedge•Group relations
Hypergraphs (or bipartite graphs)A
1
C
2B
D
A C
B
D
![Page 29: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/29.jpg)
•Affiliation networks (two-mode)
•Bipartite graph• Two set of vertices• Edges only across sets
Hypergraphs (or bipartite graphs)A
1
C
2B
D
A
1
CB D
2
![Page 30: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/30.jpg)
•Affiliation networks (two-mode)
•Bipartite graph• Two set of vertices• Edges only across sets
•Projection to one-mode• Sharing affiliations• Author-paper à Co-authorship
Hypergraphs (or bipartite graphs)A
1
C
2B
D
A
1
CB D
2A C
BD
![Page 31: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/31.jpg)
k-partite graphs•k partitions
•No edge among nodesin the same partition
•Folksonomy data• Users put tags to posts• Users• Tags• Posts
• 3-partite
![Page 32: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/32.jpg)
•Adjacency matrix
•For n vertices• Square matrix: n x n• Undirected -> binary, symmetric
Graph is a matrix1
3
6
42
5
0 0 1 1 0 00 0 1 1 0 01 1 0 0 0 11 1 0 0 1 00 0 0 1 0 00 0 1 0 0 0
![Page 33: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/33.jpg)
•Adjacency matrix
•For n vertices• Square matrix: n x n• Undirected -> binary, symmetric• Directed -> binary, not symmetric
Graph is a matrix1
3
6
42
5
0 0 1 1 0 00 0 1 0 0 00 1 0 0 0 10 1 0 0 0 00 0 0 1 0 00 0 0 0 0 0
![Page 34: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/34.jpg)
•Adjacency matrix
•For n vertices• Square matrix: n x n• Undirected -> binary, symmetric• Directed -> binary, not symmetric•Weighted -> not binary
Graph is a matrix1
3
6
42
5
0 0 10 15 0 00 0 30 0 0 00 30 0 0 0 200 25 0 0 0 00 0 0 50 0 00 0 0 0 0 0
10
15
30 50
25
20
![Page 35: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/35.jpg)
•Adjacency matrix•For bipartite graph• n vertices and m hyperedges• Rectangle matrix: n x m• Rows are vertices• Columns are edges
•How to store matrices in memory?
Graph is a matrix
1 32
BA
4
A B1 1 02 1 13 1 14 0 1
![Page 36: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/36.jpg)
• Path: Sequence of vertices• Every consecutive vertex pair is connected• Length is the number of edges
• Two vertices are connected if there is a path between them• u and v are connected, u and w are not• Connected component• Maximal set of connected vertices
• u,x,y,v and w,z
•Geodesic path: Shortest path• Path with smallest length: Least number of edges• For u,v : u-x-v, for u-w: infinity
Path and connectedness
u
w
y
x
v
z
![Page 37: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/37.jpg)
•Can be directed as well
•Directed path• For every consecutive vertex pair u,v:• u à v edge should exist
• No directed path from u to v
Path and connectedness
u
w
y
x
v
z
![Page 38: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/38.jpg)
•Clique
•Cycle
•Tree
•DAG
•Planar
•Less complex algorithms• And easier analysis
Special graphs
![Page 39: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/39.jpg)
•Clique: Complete graph• All the vertices are directly connected to each other• k-clique has k vertices• k choose 2 edges
•Maximal-clique• Not a part of larger clique
•Maximum-clique• Largest clique in the graph• NP-Hard
Clique
![Page 40: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/40.jpg)
•Every vertex can reach itself via some path• k-cycle: Cycle with a path of k edges
•ABCDEFGH: 8-cycle• ABDE: 4-cycle• BCD: 3-cycle
Cycle
H
A
F
G
C
B
E
D
![Page 41: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/41.jpg)
•Every vertex can reach itself via some path• k-cycle: Cycle with a path of k edges
•Can be directed as well• Directed path• AHGFE is a cycle
Cycle
H
A
F
G
C
B
E
D
![Page 42: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/42.jpg)
•Graph with no cycles
•n vertices, n-1 edges• Root• Parent• Children
•One parent for each vertex, except root
Tree
![Page 43: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/43.jpg)
•Graph with no directed cycles• n vertices• How many edges?
•Root?• Source and sink
•Citation networks!• e• b• a,g,f• c,d• h,i
Directed Acyclic Graphs (DAG)
b
a
d
f
c
e ihg
![Page 44: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/44.jpg)
•Graph with no directed cycles• n vertices• How many edges?
•Root?• Source and sink
•Citation networks!• e• b• a,g,f• c,d• h,i
Directed Acyclic Graphs (DAG)
b
a
d
f
c
e ihg
b
a
d
f
c
e
i
h
g
![Page 45: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/45.jpg)
•Can be drawn on a plane with no crossing edges
•Cycles? Trees?
•Triangle?
•Four-clique?
Planar graphs
1 3
42
![Page 46: CSE 610: Special Topics in Social and Information Network Analysissariyuce.com/610/9.4.pdf · •Study of complex networks (complex means non-trivial) •Social networks •Information](https://reader033.vdocuments.us/reader033/viewer/2022051809/601420cc0ff68d278c71c7c2/html5/thumbnails/46.jpg)
•Can be drawn on a plane with no crossing edges
•Cycles? Trees?
•Triangle?
•Four-clique?
•Smallest non-planar clique?
•Road networks!
Planar graphs
1 3
42
4
1
32