# data[].attributes.body
===
Hello, Antares, and thanks for posting this.  You don't describe what your relation is (always important), but I see from the adjacency matrix that everyone is tied to everyone else (I wonder what single relation could do that!), and I assume from your edge list that the relation is without direction.  In your edge list, you're missing the tie James, DeDee.
-- Best, Prof. Cook
===
My network is our family physician and our family. The nodes would be the following individuals: myself, Tara (my wife), Brenda (my mother-in-law), James (my father-in-law), and DeDee (my grandmother-in-law).  Our family physician, Dr. Varoni, will be the tie between all of us and the clinic.

Matrix: See Attached Picture

Edge List:

Dr. Varoni, Thomas

Dr. Varoni, Tara

Dr. Varoni, Brenda

Dr. Varoni, James

Dr. Varoni, DeDee

Thomas, Tara

Thomas, Brenda

Thomas, James

Thomas, DeDee

Tara, Brenda

Tara, James

Tara, DeDee

Brenda, James

Brenda, DeDee

-Antares

# data[].attributes.body
Gym-goers
(Document attached)
====
Hi, Serpens. You've almost got it -- but two kinds of problem exist in your work.  First, the "inter" and "with" in the relation "interacting with" indicates a tie without direction -- it's something people do together ("talking to" would have direction).  This means you shouldn't have arrows in your network graph.  Second, assuming you did have a network with direction, you show the ties J->A and J->K in your network graph, but not A->J or K->J.  Work on those details and you'll do great!
Best, Prof. Cook

# data[].attributes.body
I don't know how to open the entire document after posting it in the Padlet, but here it is. And I forgot to add C,B to the end when I uploaded it.
====
Hi, Pegasus.  You've ALMOST got it right!  In a directed network, the "sender of the tie" (in this case the one in the pair who is responsible for the other's work) is in rows in an adjacency matrix and is the leftmost member of the pair in an edge list.  Your adjacency matrix appears to be flipped on that score, with columns where rows should be and vice versa.  The edge list does not correspond to the adjacency matrix.  If the cell [S->G] equals 1 but the cell [G->S] equals zero, there should be a row in the edge list that reads S,G but NOT a row that reads G,S.
-- Best, Prof. Cook
====

# data[].attributes.body
Here is my network. Copulation of friends, siblings and couples.

Edge List

Jake and Lisa are boyfriend/girlfriend
Mike and Rob are brothers
Tina and Lisa are sisters

Rob and Kate are brother and sister

Kate and Mike are dating

Lisa and Mike are friends

Graph

Actors | Jake | Mike | Tina | Rob | Kate | Lisa
Jake                                                                1
Mike                                          1                   1
Tina                                                                1
Rob                     1                               1
Kate                    1
Lisa       1           1          1

====
Phoenix,
Hello!  "Copulation" is defined as sexual intercourse, which means... well, that's interesting, at the very least!  But in your edge list you describe all kinds of different kinds of relations.  This is a problem for a network that should be avoided.  A single network should describe a single kind of relation.

Let's move on to focus on the correspondence between the edge list and the adjacency matrix (which you have labeled as "graph." Remember, a graph is a picture of a network).

According to the edge list, the following are pairs:
Jake, Lisa
Mike, Rob
Tina, Lisa
Rob, Kate
Kate, Mike
Lisa, Mike

But according to your adjacency matrix, the following are pairs:
Jake, Lisa
Mike, Rob
Tina, Lisa
Rob, Rob
Kate, Kate
Lisa, Mike

The edge list and the adjacency matrix should be describing the same network.  Right now, they're describing different networks, and that's a problem.
-- Prof. Cook
====

# data[].attributes.body
My fictional network is a fund raising planning committee. Each has specific responsibilities that need to be competed that affect the activities of the other members. The members of the committee are the nodes and the tasks that need to be done are the ties that bind them together

Edge list

John – Scott

John – Dustin

Scott – John

Scott – Alan

Scott – Zack

Scott – Ryan

Alan – Scott

Dustin – John

Zack – Scott

Zack – Ryan

Ryan – Scott

Ryan - Zack

Adjacency matrix

John       Scott      Alan       Dustin    Zack       Ryan

John       --            1             0             1             0             0

Scott      1             --            1             0             1             1

Alan       0             1             --            0             0             0

Dustin    1             0             0             --            0             0

Zack       0             1             0             0             --            1

Ryan      0             1             0             0             1             --

=====
Scorpius,
Thanks!  That's a great description of a network.  The edge list and the adjacency matrix correspond to one another, which is super.  However, keep in mind that what you've described in the text accompanying these networks is a partnership.  This indicates a lack of direction in the tie, right?  When there's a lack of direction in a tie, the edge list doesn't require both the naming of John - Dustin and Dustin - John.  Only one row is required, and which node goes first in the pair doesn't matter.
-- Best, Prof. Cook

# data[].attributes.body
===
Hi, Tucana.  Unfortunately, there are some issues with your work here.  You label the matrix a graph (a graph is a picture of a network).  The matrix is not an adjacency matrix (see the reading -- in an adjacency matrix, each node has both one row and one column).  Finally, the edge list and the matrix do not correspond to one another.  I encourage you to return to the readings -- and please feel free to ask me if you have any questions.
-- Best, Prof. Cook
===

The data provided is associated with the number of individuals in our household corresponding the number of courses they care taking in school.  At this moment in time, everyone in this family is attending some type of class/course.
Edge List:
| A, A
| A, B
| B, D
| C, C
| D, A
| D, B
| D, C
| E, B
| E, C

Graph

# data[].attributes.body
=====
Hi, Vela!  I've pasted in your edge list from the comments.  Thanks for being flexible. Your subject matter for the network is hilarious (as are pets).  The edge list and the network graph correspond well (although do be sure to type out the full node names in an edge list -- I had to take a few seconds to figure out who L2 and L1 were).  Good work.
-- Best, Prof. Cook
=====

Vela

My Pets Who Like Each Other

In our house, we have 4 dogs and 1 cat who each have different relationships with each other.  Some of them like each other, some have no interest in each other, and with some one likes the other but it is not reciprocated.

Pets:

Lexi (L1)

Lady (L2)

Buddy

Tasha

Mims (The Cat)

Edge List:
L1, M
L2, L1
B, T
B, M
T, B
T, M
M, L
M, B

Social Network Graph

# data[].attributes.body
====
Hi, Alchiba.  If the relation is "which businesses worked together," then there is no direction to the relation.  Therefore, there shouldn't be any direction to the ties!  In contrast, a relation for which there would be direction would be "paid money to."

Ignoring the content of the relation, let's look at the correspondence between the network graph and the edge list.  Assuming that you DO want direction in your network as stated, for the two forms to correspond perfectly, the edge list should read:
a,c
c,e
b,e
b,d
... because in an edge list describing direction, the first node listed in the pair is the sender of the tie and the second node listed is the recipient.
-- Best, Prof. Cook

# data[].attributes.body
I used Microsoft word and inserted shapes for my graph that would not upload properly on here but my network this week shows which customers’ ordered pizza from which employees.

The employees are B, L and R. The customers are S, A, K and J.                 I e-mailed my graph in but wanted to post my edge list here. Sorry! Kudos to all of you who got yours on here!

B, K

L, S

R, A

R, J
===
Hi, Hydra!  I put it up here for you.  Good work -- your edge list and network graph correspond just fine!
-- Best, Prof. Cook
===

# data[].attributes.body
My adjacency matrix got caught off in my first post. Here is is complete matrix.

# data[].attributes.body
I chose to use a group of actors as an example of a Social Network. The relationship I looked at focused on their personal ties outside of rehearsal. The actors are Jane, Catherine, Terry, and Shawn. They are represented in the graph by the first letter of their name. Both the digraph and the adjacency matrix show how the group relates to each other. Jane is dating Shawn but has no other ties within the group. Shawn and Terry are friend as well as Terry and Catherine. Both Terry and Shawn have two ties while Catherine only has one.

====
Thanks, Spica; I see the matrix up above.  This works out pretty well, except that by the way that you set up the matrix and describe the ties (relationships with), there should not be direction in the graph.  These relationships are shared between pairs of people, not things that are sent from one member of the pair to the other member of the pair, so there's not direction implied by the relation for the network (see the reading for Week 1 on this). That means that you should not have a digraph with arrows; instead, you should draw the graph with lines between nodes to signify a lack of direction.
-- Best, Prof. Cook

# data[].attributes.body
This is the other part - sorry I couldn't get everything to upload together.   I did one word doc, but it only allowed the top half to be visible so I just added the second posting.

Lyra

# data[].attributes.body
I choose to continue with my example from last week - the neighborhood Nerf game with the kids.

You'll see that the direction goes both ways between all players except one.  Nathan is the youngest and does not enjoy being hit with the Nerf darts.  The rest of the gang is good with him and they let him play and shoot everyone, but no one shoots him back.

Lyra
====
Hi, Lyra.  This is a really interesting and stylish network graph, but I'm not seeing the required second form of a network...

... never mind!  I see the work you posted above!  Got it.  Poor, poor Nathan.  You know, this is really interesting.  Usually, with small networks patterns are easier to see in graphs than in matrices.  But in your case, the pattern is much easier to see in the matrix than in the graph!

Focusing in on details: in the matrix listed above, there are eight nodes, and everyone but Nathan receives seven ties, with Nathan receiving zero ties. But in the graph below, Nathan receives four ties. Also, Joe and Ava only receive six ties in the graph. And poor, poor Madison seems to get two ties from Cameron! So there's not a perfect correspondence between the graph and the matrix.
-- Prof. Cook
====

# data[].attributes.headline
 - I chose to study the relationships between students in a math class, outside that specific class.  Nodes are the students, ties are the existence of a relationship outside of class (another class together).

# data[].attributes.subject
 - I chose to study the relationships between students in a math class, outside that specific class.  Nodes are the students, ties are the existence of a relationship outside of class (another class together).

# data[].attributes.body
Kitalpha

====
Great job, Kitalpha!  The two forms of the network correspond to one another, and the network itself is described well.
-- Best Regards, Prof. Cook

# data[].attributes.headline
I'm not entirely sure that I have this right, but I think this is correct. I also decided to continue one of my examples from last week and go with actors and movies as was explained in the reading.  

# data[].attributes.subject
I'm not entirely sure that I have this right, but I think this is correct. I also decided to continue one of my examples from last week and go with actors and movies as was explained in the reading.  

# data[].attributes.body
====
Hello!  I don't know who this is, and I don't see any work on this post beyond two sentences.  It would be a good idea, if this is you, to post a new post!
Best, Prof. Cook
====

# data[].attributes.body
===
Well done, Libra!  Very accurate and thorough.
-- Prof. Cook
===

I am expanding on my example from last week about writing tutors and students. I experienced both with graph and digraph, edge list and another representing direction. This social network represents which students made an appointment with which writing tutors, for instance in the digraph, E made an appointment with C, so E is the sender and C is the recipient and so on.

C and K = Writing Tutors

R, E, and B = Students

# data[].attributes.body
My digraph represents a leadership network. The nodes are members of a six-man volleyball team and the ties show the leadership relationships between the team members. It is directed because one member may indicate that they look to a teammate for leadership but that leadership tie may not be reciprocated. For instance, in the attached fictional network, Chris looks to Lucas for leadership but Lucas does not look to Chris for leadership.

Carina
======
Carina,  this is a very accurate and thorough presentation.  Great work.
-- Prof. Cook
======

Thank you!

# data[].attributes.body
Social Networks by Electra
=====
Electra, thanks for writing in with this example.  Just to be explicit, "calling to each other" is a directional tie: "Robin 2 calls to Robin 5" does not HAVE to be reciprocated by "Robin 5 calls to Robin 2." In your work, the adjacency matrix does not quite correspond to the edge list.  Remember that in an edge list for a directed network, the first of the two nodes listed is the sender.  In an adjacency network, the horizontal rows are the senders.  So your edge list in this case should look like this:

1,3
2,4
2,5
4,1
4,2

Hope this is helpful.
Best, Prof. Cook
=====

# data[].attributes.body
Ragusor Social Networks
======
Hello, Ragusor!  That's a really interesting social network and I really like the story you tell above the adjacency matrix.  Remember that since your ties have direction (as indicated in the story and also by the arrows in the network graph), the rows in your adjacency matrix should be the "senders" of the ties and the columns should "receive" the ties.  Your adjacency matrix should therefore look like this:

1     2     3    4
1          1     0    0
2  0             1    0
3  0     0            1
4  1     0     0

- Best, Prof. Cook
======

# data[].attributes.headline
Hopefully everyone will be able to see this. It took much longer than I anticipated. I based mine on a basketball team, and passes throughout the game. 

# data[].attributes.subject
Hopefully everyone will be able to see this. It took much longer than I anticipated. I based mine on a basketball team, and passes throughout the game. 

# data[].attributes.body
Kuma

# data[].attributes.body
I am hoping this works for you. But my point here is to show the connections in a work setting:
John has a connection to Shelley
Shelley has a connection with both Carl and Gwendoline.
Carl and Gwendoline have a connection with each other.
====
Hi, Altair!  It ALMOST works -- but .ODG files are not widespread, and so Padlet can't recognize them (neither can Google Docs or Microsoft Word, it turns out).  If you can save your document as either a .docx or .doc or .pdf file, then Padlet will be able to recognize it.
Best,
Prof. Cook

# data[].attributes.body
====
Columba, GREAT job and great work!  Your move from network form to network form is right on target, very accurate.
-- Best, Prof. Cook
====
My network example is tenants in an apartment building, the relation is speaking to another tenant in that same building. I know we were supposed to depict the network TWO different ways, but I wanted the practice, so I did three…Sorry about the quality of the graph and matrix; the word file just kept cutting off both.

Edge List

Erica, Brad

Erica, Lyvia

Erica, Lawrence

Erica, Florence

Brad, Lyvia

Brad, Lawrence

Brad, Florence

Brad, Tina

Lyvia, Lawrence

# data[].attributes.body
-Sagitta
====
Sagitta, very close!  Check out the arrow headed from D to C in the graph.  The edge list's fifth row should therefore read D, C. Also, I don't see E, B and D, B in the edge list. Because this network is a digraph with direction, it matters which letter appears first, and a double-headed arrow represents TWO distinct ties.
Best, Prof. Cook

P.S. Folks, notice the cool thing Sagitta has done: put BOTH in a SINGLE Word document, then uploaded the Word document onto the Pad. Nicely managed, and a choice for others to emulate.

# data[].attributes.body
======
Vega, well done! -- Prof. Cook
======

Adjacency Matrix without direction
A       B        C        D       E
A                        1        0        1        0
B              1                  1        0        1
C              0        1                  1        0
D             1         0        1                  1
E             0         1        0        1
Adjacency List
AB
AD
BC
CD
DE