Seamus Heaney was born in Co. Derry in 1939.
He studied at St. Columbs College, Derry, and at Queens University, Belfast. After
graduating from Queens in 1961, he taught at St. Josephs College of Education
in Belfast before taking a lectureship in the English Department at Queens
from 1966-1972 (during the academic year 1970-1971 he held a visiting lectureship
at the University of California at Berkeley). His first collection,
Eleven Poems,was published as part of the Queens Festival pamphlet series,
followed by Death of a Naturalist in 1966, and Door Into
the Darkin 1969. He received the Eric Gregory Award in 1966,
followed by the Cholomondeley Award, 1967, the Somerset Maugham Award,
1968, and the Geoffrey Faber Memorial Prize also in 1968.
Force-directed ego graph of people, places, and organizations directly connected to
Network Graph Help
Nodes in the graph are arranged based on the strength of connection between
individuals or organizations, with an attempt to avoid overlapping labels
for readability. The strength of a connection is determined by the number and kinds of
relationships between individuals or organizations. For example, a founder of
the Belfast Group has a stronger relationship to that organization than does someone
who was just a participant; spouses have stronger connections than people who simply
corresponded with each other; and so on.
You can change the appearance of the graph to explore its content. You can drag nodes to different positions on the graph. Doing this may help you see which individuals are connected to one another. Clicking on any individual node will also fix it in place, which is indicated by a black outline. You can make the node float freely again by double-clicking on it.
You can resize nodes based on their network properties (see below), and you can turn the labels on or off, which may make it easier to identify authors or see the connections among them. When labels are turned off, you can hover your pointer over a particular node on the graph and see the name of the person it represents. You can also set the labels to appear only on nodes that are a particular size or larger.
When sized by degree, a node’s size is determined by how many connections (or “edges”) it has to other nodes. The larger the node, the more edges it has to other nodes in the network. This option helps to identify the most connected nodes.
When sized by betweeness, a node’s size is determined by how often it lies on the shortest path between two other nodes. The larger the node, the more often it appears on the shortest paths that exist throughout the network. Nodes that feature a high degree of betweenness act as brokers for other nodes in the system. People with a high degree of betweenness are often not the central actor in a group but instead help connect disparate groups.
When sized by eigenenvector centrality, a node’s size is determined by how many
connections its connections have. The larger the node, the more connections exist on the
nodes that it is connected to. This measure of centrality often helps identify the most
influential individual in a network.
Click on a node or node label for more information