A5-Graphs.pdf - CX 4010 CSE 6010 Assignment 5 Graph Analytics Due Dates \u2022 Due 11:00 AM Friday \u2022 Revision(optional 11:59 PM Monday \u2022 No late

A5-Graphs.pdf - CX 4010 CSE 6010 Assignment 5 Graph...

This preview shows page 1 - 2 out of 5 pages.

CX 4010 / CSE 6010 Assignment 5 Graph Analytics Due Dates: Due: 11:00 AM, Friday, October 11, 2019 Revision (optional): 11:59 PM, Monday October 14, 2019 No late submissions will be accepted 1.Background Graphs arise in many applications in science, engineering, and the social sciences. Here, we are particularly interested in a class of graphs known as scale-free networks. An important characteristic of scale-free network is they include some number of hubnodes that contain a relatively large number of links, but the vast majority of nodes contain relatively few links. The number of links attached to a node is referred to as the node’s degree. Technically, a scale-free network is defined as a network whose node degree distribution follows a power-law. Scale free networks are interesting because there is empirical evidence that they arise in many applications of current interest. See [1] for information on power law distributions and applications. Here, we will assume all graphs are undirected graphs. You must use the adjacency list approach to represent your graph in memory. The adjacency matrix representation does not scale well to large graphs so should not be used. This assignment involves generating scale free network graphs and performing an analysis of the maximum path length through the graph. The problem is divided into two parts. The first part involves writing a program to generate a graph, storing it in a file, and considering if the generated topology is scale-free. The second involves writing another separate program that reads the graph file created by the graph generation program and computing the diameter of the graph to evaluate how the maximum distance between nodes increases with network size. You will work in teams of two persons each to attack this problem. For each team one person will develop a program to generate a network graph and completing associated tasks. The second person will develop a program that reads the graph file and performs an analysis of the graph. The two programs should be completely separate “stand-alone” programs. The interface between the two programs will be the format of the file specifying the graph. You and your partner must define and document a common file format for the graph, and write up all of your results into a single, combined report.While most teams have two people, one may have three. If you are part of a three-person team, each person on the team will implement one of the two programs, so your team will have two separate implementations of one part and one implementation of the other, and the three of you should jointly complete the remaining tasks and write the report.2.Part 1: Random Graph Generation To complete this part of the assignment, write a program called graphgenthat creates a scale-free network graph, stores the result into a file, and generates a histogram of the node degree distribution. Your program can have up to five command line parameters. The first three are required, and the other two are optional. The first parameter is the number of nodes in the network
Background image
Image of page 2

You've reached the end of your free preview.

Want to read all 5 pages?

  • Fall '17
  • Richard Fujimoto

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern

Stuck? We have tutors online 24/7 who can help you get unstuck.
A+ icon
Ask Expert Tutors You can ask You can ask You can ask (will expire )
Answers in as fast as 15 minutes
A+ icon
Ask Expert Tutors