(a)
Answer: Embeddedness: Embeddedness of an edge in a network to be the number of common neighbors the two endpoints have.
Here, the embeddedness of the edge between A & B is 2.
Since A & B have 2 common neighbors i.e C & D.
(b)
Answer: Neighbourhood overlap: Neighborhood overlap of an edge is embeddedness divided by the total number of neighbors of both nodes connected by that edge.
Here, neighborhood overlap between nodes A & B is 2:3
As, the embeddedness of the edge between A & B is 2, and nodes connected to at least A or B are 3 (C, D & E).
(c)
Answer: Strong triadic closure property can be defined by understanding the following phenomenon "If two people in a social network have a friend in common, then there is an increased likelihood that they will become friends themselves at some point in the future."
Thus, here in the given figure, nodes E, G, H satisfies the strong triadic closure property, since, EH & EG are the edged between E & H, E & G, thus establishing a strong bond between E, H & E, G, thereby by according to strong triadic closure property, edge HG should exist, which is present n the figure.
Also, there is a possibility to satisfying of strong triadic closure property between A , E & E, H
therefore given graph satisfies strong triadic closure property.
(d)
Answer: Social Capital in a network system can be defined as, First, social capital is sometimes viewed as a property of a group, with some groups functioning more effectively than others because of the favorable properties of their social structures or networks.
Alternately, it has also been considered as a property of an individual; used in this sense, a person can have more or less social capital depending on his or her position in the underlying social structure or network.
Thus in the given figure, Nodes E & H are having the highest Social Capital among all the nodes in the given network system.
The following questions refer to the following graph. B D H E (a) (2 marks) Compute...
1. What is the difference between 1-mode and 2-mode graph? Give an example for each. 2. List various graph data structures to store social network information. 3. What is “six degrees of separation” in the context of social networks? What is the average degree of separation for Facebook and Twitter (you can cite other studies that have reported these statistics)? 4. What is “strength of weak ties”? Explain the rationale behind this phenomenon. 5. List and describe the various centrality...
Explain ur working
4. [6 marks] Using the following graph representation (G(VE,w)): V a, b,c, d,e, fh E -la, b, [a, fl,la,d, (b,ej, [b,d, c,fl,fc,d],Id,el, sd, f) W(a, b) 4, W(a, f)-9, W(a, d)-10 W(b, e) 12, W (b, d)7, W(c,d) 3 a) [3 marks] Draw the graph including weights. b) [2 + 1-3 marks] Given the following algorithm for finding a minimum spanning tree for a graph: Given a graph (G(V,E)) create a new graph (F) vith nodes (V)...
File Edit Format View Help Graphs and trees 4. [6 marks] Using the following graph representation (G(V,E,w)): v a,b,c,d,e,f E fa,b), (a,f),fa,d), (b,e), (b,d), (c,f),(c,d),(d,e),d,f)) W(a,b) 4,W(a,f) 9,W(a,d) 10 W(b,e) 12,W(b,d) 7,W(c,d) 3 a) Draw the graph including weights. b) Given the following algorithm for Inding a minimum spanning tree for a graph: Given a graph (G(V,E)) create a new graph (F) with nodes (V) and no edges Add all the edges (E) to a set S and order them...
ignore red marks. Thanks
10. (16) You will compute the strongly connected components of this graph in three steps. a. STRONGLY-CONNECTED-COMPONENTS (G) (7) Perform a depth-first search on call DFS(G) to compute finishing times w/ for each vertex the following graph. (To make 2 compute GT this easier to grade, everyone call DFS(GT), but in the main loop of DFS, consider the vertices in order of decreasing wf (as computed in line 1) please start with vertex "a" and 4...
2. Consider the (undirected) graph G having the following vertex set Vand edge set E. V-0,1,2,3,4,5,6,7,8,9 E- 0,1,10,2), 11,2;, 12,4), 12,3), 13,4), (4,5), {5.6,, 14,6, 2,7) e) [8pts] Show the action of BFS starting at vertex 2. Show action of queue, parent array implementation of BFS spanning tree and display nodes in order they are traversed. Choose next node as it occurs in the adjacency list.
Which of the following is not a topological ordering for the graph: A ) O f, e, d, a, c, b O f, a, b, d, e, c O e, f, a, d, c, b O f,a,c,e,d,b QUESTION 4 Which of the following is not part of the definition of a flow? The flow out of the source is 0. O The flow into a vertex (not the source or drain) equals the flow out of that vertex. O The...
question 1 and 2 please, thank
you.
1. In the following graph, suppose that the vertices A, B, C, D, E, and F represent towns, and the edges between those vertices represent roads. And suppose that you want to start traveling from town A, pass through each town exactly once, and then end at town F. List all the different paths that you could take Hin: For instance, one of the paths is A, B, C, E, D, F. (These...
6. [20 pts.] Below is the final P matrix after applying Floyd's all pairs shortest path algorith on a graph with nodes (A, B, C, D, E, F, G, H). In the matrix below 1 corresponds o 0 5 0 2 0 5 5 Determine the shortest path between nodes D and F. a)
6. [20 pts.] Below is the final P matrix after applying Floyd's all pairs shortest path algorith on a graph with nodes (A, B, C, D,...
QUESTION UNE (10 MARKS 1. A set of three D-flip flops a, b and care connected as shown in figure 1. [Note that:Flip flop A reads Data on either edge of the clock] DF I Clock - Cik 0 Dota el e of a Fig. 1. A circuit of three D-flip flops 1.1.State one operational difference between flip flop B and C. 11 MARKS 1.2.Complete the timing diagram in figure 2 by giving the state of each flip-flop [Use the...
Hi, I could use some help for this problem for my discrete math
class. Thanks!
18. Consider the graph G = (V, E) with vertex set V = {a, b, c, d, e, f, g} and edge set E = {ab, ac, af, bg, ca, ce) (here we're using some shorthand notation where, for instance, ab is an edge between a and b). (a) (G1) Draw a representation of G. (b) (G2) Is G isomorphic to the graph H -(W,F)...