7CS034 Data scienceTopics and groups for the presentation sessions (Week 6) and individual report (Week 8)“Complex networks and collective behaviour”MSc in Data Science, MSc in Artificial IntelligenceSchool of Mathematics and Computer ScienceUniversity of WolverhamptonDr. Eva M. Navarro Ló[email protected] Assessment method summary for the course unit 22 General rules for group presentations 23 Marking scheme for group presentations 34 List of topics per group (when registration is finalised in Week 2, the number of projectsand students per project may vary) 45 General rules for the individual report 86 Marking scheme for the individual report 811 Assessment method summary for the course unit• Team work. 50% group presentation during Week 6 (from 30th November to 4th December 2020).Each group will be assessed based on the group’s presentation; each member of a group will receivethe same mark as other members (i.e. it is the group’s work that is assessed here).• Individual work. 50% individual report between 1,000 and 3,000 words, submitted in CANVASbefore 18th December.• Final mark. Team work + Individual work.In the following sections, the general rules for both course works are given.2 General rules for group presentations1. The presentations will be done virtually at the same day and time of the lectures and Q&A sessions(Wednesday 2nd December 15:00–17:00, Friday 4th December 10:00–12:00).2. Groups of 3–5 students have been made randomly by Canvas.3. A topic is assigned to each group.4. The presentations will be distributed in the 4 hours of Week 6 (Wednesday 2nd December 15:00–17:00, Friday 4th December 10:00–12:00).5. Attendance at these 4 sessions is compulsory for all the students registered (whether you presentor not on the day) and we will keep an attendance sheet. Those not attending will have a mark ofzero. If you need to miss these presentations, email me before the fact!6. You will make a presentation of approximately 10 minutes, all the members of the group willpresent it to the rest of the class, and there will be 5 minutes for questions.7. You will e-mail the presentation to Eva Navarro by 12:00 on Friday 4th December 2020.8. The presentation counts for 50% of the total mark of the course. Each presentation will be markedfrom 0 to 50.9. All the students within the same group will receive the same mark (except those that did not attendthe lecture, who will get zero). Exceptions for attendance will be considered.10. The proposed topics for the presentations are related to topological properties and models of complex networks, and to synchronisation of dynamical networks. Thus, we will have covered thebasic theory in class when you come to prepare the presentation. References are provided at theend of every lecture.11. Be imaginative and do not repeat what we have studied in class.12. If your name does not appear in any of the groups below, please, contact me as soon as possible.13. The title for each presentation that I give below is only a suggestion. Feel free to change it to makeit more attractive. You can also propose your own topics.14. Any program (with instructions for its execution) that you implement will be sent to me with thefinal presentation.15. You should include appropriate references within your presentation. Put the references you haveused!16. If you have any problem or question, contact me at [email protected]!23 Marking scheme for group presentationsThis coursework consists of a presentation about topological properties and models of complex networks,and synchronisation of dynamical networks. The presentation will be worth 50% of the final mark of thecourse. The presentation will be marked between 0-50. Each group will be assessed based on the group’spresentation; each member of a group will receive the same mark as other members (i.e. it is the group’swork that is assessed here).Each group will prepare a set of slides (no limit, but probably should not be more than 8, consideringthe time limit) which will be submitted as PDF before 12:00 on the 4th of December 2020. Then eachgroup will make a presentation to the other students about their topic. I will ask some questions, and willallow all other students to ask questions too. The presentation should not take longer than 10 minutes.You can present any simulation and programs that you have implemented. The assessment will be basedon both the slides and the presentation. The presentation can be made by one or more students, it is leftto each group to decide whom and how that will be done. It is encouraged that all the members of thegroup participate.The criteria that I will use to assess the coursework are as follows:1. Up to 25 points will be assigned to the description of the theme. Essentially this relates to howwell you understood the topic.2. Up to 15 points will be assigned for the presentation. This is how well you were able to transmitthe information. It includes several aspects, such as:• Whether you included Title, Authors, References, etc.• How well you have highlighted the main points, rather than details of less importance.• How well you illustrated the concept (for example, figures, diagrams, etc.).• How attractive is the presentation.• How you orally presented your work.Essentially this section relates to how well you presented the ideas.3. Up to 10 points will be assigned for initiative and originality. This is how much you haveresearched the topic beyond the material of the lectures and how original you have been beyondthe description of the topic. This includes, for example, whether you have produced additionalsoftware implementations.As with all of the work that you produce in your academic life, no plagiarism will be tolerated. However, as with all academic publications, it is fine to cite other people’s work as long as you appropriatelyreference the source of the citation.34 List of topics per group (when registration is finalised in Week 2, thenumber of projects and students per project may vary)1. Title: “Network Visualisation”Hints. There are many tools in order to visualise and analyse networks. A good example of thesetools is Pajek. We have mentioned others in the classes. The purpose of this study is to discovertools that facilitate the visualisation and analysis of complex networks. The properties we are moreinterested in are topological properties (remember: size, density, connectivity). You are expectedto make a brief study of these tools and explain which is the best for different purposes. It wouldbe great you could choose one of these tools and use it to visualise a concrete example. Most ofthe visualisation tools come with data sets of real complex networks.• Joyce Ngai.• Oana Onofrei.• Gemma Powell.2. Title: “Real-world Complex Networks and Their Topological Properties”.Hints. This work should include examples of real complex networks (as many as possible, and notthe same as those presented in class). You are expected to explain the basic topological propertiesof each of these networks (remember: size, density and connectivity), and of course, any otherproperty you would like to include. Maybe, you can group the specific complex networks (forinstance, small-world, random-graph or scale-free). You can group them by any other topologicalproperty that you want. The important thing is that the examples should not be simply listed, andan explanation of their topology and their characteristics must be included.• Russell Jones.• Gea Perkins.• Himanshu Singh.3. Title: “Random-graph Networks”Hints. Implement the algorithm to obtain a random-graph network. By using this algorithm, buildrandom-graph networks of several sizes (start with small N and move to large N). Check howdifferent networks can be obtained with different probabilites p. Can you see any similaritiesbetween the networks that you have obtained with some real-world networks? What are their maintopological properties?• Sally Frost.• Chloe Glasgow.• La Richardson.44. Topic. “Small-world Networks with Rewiring”Hints. Design and implement an algorithm that takes a probability p as a parameter and, startingwith a regular network, rewires the network by using Watts and Strogatz’s algorithm. What isthe result when you change the probability p of rewiring each link? Are there any differences inthe result if you increase the size of the network (N)? Can you see any similarities between thenetworks that you have obtained with some real-world networks? What are their main topologicalproperties?• Yosuf Faizi.• Zoe Mason.• Hassan Mohamed.5. Title: “Small-world Networks with Addition of Links”Hints. Design and implement an algorithm that takes a probability p as a parameter and, startingwith a regular network, adds new links by using Newman and Watts’ algorithm. What is the resultwhen you change the probability p of adding new links? Are there any differences in the result ifyou increase the size of the network (N)? Can you see any similarities between the networks thatyou have obtained with some real-world networks? What are their main topological properties?• Sandeep Kaur.• Lovejot Singh.• Shilpa Graak.• Rajdeep Kaur.• Sukhdeep Kaur.6. Title: “BA Scale-free Networks”Hints. Design and implement an algorithm to obtain a scale-free network. The scale-free networkmodel to use is the Barabási and Albert (BA) scale-free model (growth + linear preferential attachment). What happens when you change the different parameters of the algorithm? Which isthe one that generates more changes in the result? Are there any differences in the result if youincrease the size of the network (N)? Can you see any similarities between the networks that youhave obtained with some real-world networks? What are their main topological properties?• Ashley Durnall.• Mohammad Mansuri.• Folashade Nnadozie.7. Title: “Computing the Average Path Length in Small-world Networks”.Hints. Design and try to implement an algorithm for the computation of the average path length(L) in a small-world network. The small-world network model to use is Watts and Strogatz’smodel. Identify the problems for its implementation. You may start by exploring the use of thebreadth-first search algorithm or Dijkstra’s algorithm. What are the difficulties for implementingthe L-computation algorithm for small-world networks? If you find a lot of problems for computingL in small-world networks, propose the algorithm for another complex network model. Are theremany differences?• Divya Bollepally.• Hajer Khalil.58. Title: “Computing the Clustering Coefficient in Scale-free Networks”Hints. Design and try to implement an algorithm for the computation of the clustering coefficient(C) in a scale-free network. The scale-free network model to use is the Barabási and Albert (BA)scale-free model (growth + linear preferential attachment). Identify the problems for its implementation. What are the difficulties for implementing the C-computation algorithm for scale-freenetworks? If you find a lot of problems for computing C in scale-free networks, propose thealgorithm for another complex network model. Are there many differences?• Wasim Ansari.• Yasmin Taylor.• Faiza Musa.9. Title: “Synchronisation over dynamical networks with linear and uniform coupling”Hints. Consider any model for a dynamical system and the ordinary differential equations describing the relationships between the rates of change of all the variables of this model. Chooseappropriate values for the parameters of this system and the initial conditions to use in your simulations. You can contact me for ideas on systems to use. In this assignment, you are expected tocreate a dynamical network of N linearly coupled systems of the form of the dynamical systemthat you have selected. In class, we have studied dynamical networks of linearly coupled identicaldynamical systems. There are several types of linear couplings, for this presentation, consider alinear and uniform coupling. The topology of the network can be any of the ones studied in class,that is: regular network, random graph network, small-world network or scale-free network.Do you obtain a synchronised behaviour of all the coupled systems? What happens when youchange the different parameters of the linear and uniform coupling? Are there any differences inthe result when you change the number of systems coupled (N)? Do you think that the networktopology can affect the synchronisability of the network of coupled systems?• Maduabuchi Onuoha.• Aaron Rafferty.• Ibrahim Animashaun.10. Title: “Synchronisation over dynamical networks with diffusive coupling”Hints. Consider any model for a dynamical system and the ordinary differential equations describing the relationships between the rates of change of all the variables of this model. Chooseappropriate values for the parameters of this system and the initial conditions to use in your simulations. You can contact me for ideas on systems to use. In this assignment, you are expected tocreate a dynamical network of N linearly coupled systems of the form of the dynamical systemthat you have selected. In class, we have studied dynamical networks of linearly coupled identicaldynamical systems. There are several types of linear couplings, for this presentation, consider adiffusive coupling. The topology of the network can be any of the ones studied in class, that is:regular network, random graph network, small-world network or scale-free network.Do you obtain a synchronised behaviour of all the coupled systems? What happens when youchange the different parameters of the linear and uniform coupling? Are there any differences inthe result when you change the number of systems coupled (N)? Do you think that the networktopology can affect the synchronisability of the network of coupled systems?• Kirti Kirti.6• Le Nguyen.• Khundmir Syed.75 General rules for the individual reportYou will write an individual report about the topic that your group presented to the rest of the students.This report will have between 1,000 and 3,000 words. The deadline to submit this report is 12:00midday, 18th December 2020. The report will be submitted at CANVAS.6 Marking scheme for the individual reportThe report will be worth 50% of the final mark of the course.The criteria that we will use to mark the report are as follows:1. Up to 25 points will be assigned to the description of the theme. Essentially this relates to howwell you understood the topic.2. Up to 15 points will be assigned for the presentation of ideas. This is how well and clearly youare able to transmit the information. It includes several aspects, such as:• Whether you included Title, Abstract, Motivation, Goals, Methods, Results, References, etc.• How well you have highlighted the main points, rather than details of less importance.• How well you illustrated the concept (for example, figures, diagrams, etc.).• How attractive is the writing.• How you present your work in writing.Essentially this section relates to how well you presented the ideas.3. Up to 10 points will be assigned for initiative and originality. This is how much you haveresearched the topic beyond the material of the lectures and how original you have been beyondthe description of the topic. This includes, for example, whether you have produced additionalsoftware implementations.As with all of the work that you produce in your academic life, no plagiarism will be tolerated. However, as with all academic publications, it is fine to cite other people’s work as long as you appropriatelyreference the source of the citation.8

- Assignment status: Already Solved By Our Experts
*(USA, AUS, UK & CA PhD. Writers)***CLICK HERE TO GET A PROFESSIONAL WRITER TO WORK ON THIS PAPER AND OTHER SIMILAR PAPERS, GET A NON PLAGIARIZED PAPER FROM OUR EXPERTS**

**NO PLAGIARISM**– CUSTOM PAPER