Q25. Use NodeXL to reproduce the organizational chart below. Take note of the appearance of the network with various layout options. Try changing the type to "directed" in the chart panel of the NodeXL ribbon. What do you say about organizational charts as networks from examining the different layouts?
Q26. Amir likes Bashir. Chastity is liked by Danica. Chastity likes Ellen. Amir likes Danica and Ellen. Franke likes everyone. Gillian likes Danica. Ellen likes Bashir. Sketch this directed network.
Q27. Consider the imaginary bibliographies shown below for 7 classic works of sociology.
- Aron, Raymond. 1967. Les Étapes de la pensée sociologique
- Bourdieu, Pierre. 1972. Esquisse d'une théorie de la pratique, précédé de trois études d'ethnologie kabyle (Outline of a Theory of Practice)
- Crozier, Michel. 1964. The Bureaucratic Phenomenon
- Durkheim, Emile. 1912. Elementary Forms of the Religious Life
- Erikson, Kai. 1967. Wayward Puritans
- Frazier, E. Franklin. 1955. Bourgeoisie noire
- Geiger, Theodore. 1963. Demokratie ohne Dogma: Die Gesellschaft zwischen Pathos und Niichternheit.
Q28. Consider the three networks in the figure below. For each one, calculate the ratio of actual number of edges to the most maximum number of edges possible (assuming the graphs are simple).
Q29. Consider the series below showing the maximum number of edges (m) possible in networks with different numbers of vertices (n). Come up with a general formula for m in terms of n (that is, for a network with n vertices, what is the maximum number of edges — assuming no self-edges and no multi-edges?).
Q30. Write out your responses to the following.
- Name at least ten areas of human, social, natural phenomena that have been explored by network researchers.
- Identify/describe three networks you have encountered this week.
- Name at least five academic disciplines in which the study of networks has become a big deal.
Q31. Demonstrate basic familiarity with email, wikis, Twitter, Facebook, newsgroups, listserves.
Q32. In addition to replicating the material in the text, we'll have a "and now try it with this" exercise. Self test at end. Can I : enter vertices and display graph? select an edge ? move the graph plane around? switch graph type between directed and undirected? change data and update graph? move vertices around "manually"? set vertex colors and sizes? use the autofill tool? add vertex labels? add tool tips? save a layout? save a data file?
Q33. Practice Gephi exercises.
Q34. Write out the data for the undirected network below in node list, edge list and full matrix format.
Q35. A researcher asks a respondent, Maria, to list her six closest friends. She says A, B, C, D, E, and F. The researcher then asks which of these friends have you had dinner with in the last week? A, C, D. Which ones have you texted today? A, B, D, F. Which ones did you know before you came to this school? C, D. On whose wall have you posted in the last week? D, E, F.
Q36. Consider the graph matrix below
Q37. Centrality Problems
Q38. Homophily Problems
Q39. Cohesive subgroups problems
Q40. Structural equivalence problems
Q42. Data Collection Problem
Q46. Play with Yasiv's Amazon Recommendation Visualizer. After you have played with it for a bit, carry out some specific "analyses" (we use the term loosely here).
Q47. Use NodeXL to visualize the following networks
Q48. Convert the information below - data on four organizations, listing the members of their boards of directors - into a network data format and then use a network visualization program to show the 2 mode network laid out nicely with nodes labeled.
Q49. Convert this 2-mode data into 1-mode data
Q50. What kind of network data might emerge from: tweets, retweets, hashtags? Assume we have powerful access to the Twitter stream (meaning we can grab all the tweets in a given time frame, all the tweets by a set of users, all the tweets that mention a hashtag or a user, etc. And assume we have access to the API and so can take a user name and get a list of who she follows or who follows her.
Q51. To transpose a matrix we simply swap its rows and columns:
Q52. If necessary, review the Wikipedia page "matrix multiplication." Then practice with the following
Q53. Practice constructing network survey instrument ("by hand"), administering and recording data.
Q54. Use the data you generated in Q53 to produce simple visualizations of these networks in NodeXL and import these into a Word document to report your results.
Q55. Consider this adjacency matrix. Following standard conventions, calculate in- and out-degree for each vertex.
Q57. Facebook Ego Network with Gephi
Q59. Consider the following things1 that can flow or move on a network:
Q60. Use NodeXL to compute betweenness, closeness, and Eigenvector centralities of the network shown below (Excel file here). Label the vertices with these.
- Rearrange the edges so as to get the largest value for betweenness centrality for vertex A
- Rearrange the edges so as to get the largest value for closeness centrality for vertex A
- Rearrange to get largest Eigenvector centrality
Q63. Imagine a 10 x 10 square grid. Each cell can be empty…
Q64. We'll use data on early 20th century Scottish industries to investigate interlocking directorates.
Q67. Work through the first half of chapter 7 of the NodeXL book using the senate data.
Q68. STUDENTS AND CLASSES