Paul Muldoon was born in County Armagh in 1951. He attended Queen's University in Belfast where he studied English literature under Seamus Heaney. In 1973, the year he graduated from Queen's, Faber and Faber published his first collection of poems. From 1973 to 1986 he worked as a radio and television producer for BBC Northern Ireland. He moved to the United States in 1987 and has held various university teaching posts. He currently lives in New Jersey and is the Howard G. B. Clark '21 Professor at Princeton University and Chair of the Peter B. Lewis Center for the Arts. Muldoon is married to novelist Jean Hanff Korelitz, with whom he has two children.
(Paul Muldoon papers, 1939-2016)
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