Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
4. Girvan-Newman (GN) Algorithm a) Write down the sequence of steps resulting from applying the GN algorithm in the following graph:

4. Girvan-Newman (GN) Algorithm a) Write down the sequence of steps resulting from applying the GN algorithm in the following graph:

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

please send complete solution for Q4 part a 

4. Girvan-Newman (GN) Algorithm a) Write down the sequence of steps resulting from applying the GN algorithm in the following graph: b) . The following quantity is called the modularity of a graph that has been divided in M communities: k;k; 2L ij L is the number of links in the graph, A is the graph's adjacency matrix, k; is the degree of node i and c; is the community to which node i belongs, which should be an integer number between 1 and M. The symbol 8 is a Kroenecker deltal. It is expected that the greater the modularity is, the best the division of the graphs in communities. Find which division obtained from item (a) has the largest value of modularity and draw the resulting graph with nodes coloured according to their communities. c) best division according to item (b). Draw the corresponding dendrogram of the process from item (a) indicating the place for the d) Check whether the communities obtained in item (b) are strong or weak and, based on this classification, comment whether the algorithm seems to give a good division.
Transcribed Image Text:4. Girvan-Newman (GN) Algorithm a) Write down the sequence of steps resulting from applying the GN algorithm in the following graph: b) . The following quantity is called the modularity of a graph that has been divided in M communities: k;k; 2L ij L is the number of links in the graph, A is the graph's adjacency matrix, k; is the degree of node i and c; is the community to which node i belongs, which should be an integer number between 1 and M. The symbol 8 is a Kroenecker deltal. It is expected that the greater the modularity is, the best the division of the graphs in communities. Find which division obtained from item (a) has the largest value of modularity and draw the resulting graph with nodes coloured according to their communities. c) best division according to item (b). Draw the corresponding dendrogram of the process from item (a) indicating the place for the d) Check whether the communities obtained in item (b) are strong or weak and, based on this classification, comment whether the algorithm seems to give a good division.
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS