Open Access

Evolving network structure of academic institutions

Applied Network Science20172:1

https://doi.org/10.1007/s41109-016-0020-1

Received: 15 October 2016

Accepted: 29 December 2016

Published: 19 January 2017

Abstract

Today’s colleges and universities consist of highly complex structures that dictate interactions between the administration, faculty, and student body. These structures can play a role in dictating the efficiency of policy enacted by the administration and determine the effect that curriculum changes in one department have on other departments. Despite the fact that the features of these complex structures have a strong impact on the institutions, they remain by-and-large unknown in many cases. In this paper we study the academic structure of our home institution of Trinity College in Hartford, CT using the major and minor patterns between graduating students to build a temporal multiplex network describing the interactions between different departments. Using recent network science techniques developed for such temporal networks we identify the evolving community structures that organize departments’ interactions, as well as quantify the interdisciplinary centrality of each department. We implement this framework for Trinity College, finding practical insights and applications, but also present it as a general framework for colleges and universities to better understand their own structural makeup in order to better inform academic and administrative policy.

Keywords

Multiplex network Temporal network Community detection Centrality

Introduction

The organizational structures of today’s higher education academic institutions are exceedingly complex with few exceptions (Berger 2002). In particular, modern colleges and universities are comprised of many different departments that interact with one another through various faculty and student activity (Hillier and Penn 1991). Additionally, most universities are organized into multiple schools and virtually all colleges and universities offer unique programs and concentrations that facilitate further inter-department interactions (Toma 2010). Unsurprisingly, the complex structures of these colleges and universities have a significant impact on both the scientific and scholarly production of their faculty members and the academic, social, and eventually professional endeavors of their students (Pascarella et al. 2005; Pascarella 2006). Previous studies have investigated the structure of interactions between different colleges and universities via hiring networks (Clauset et al. 2015) and the scientific co-authorship (Newman 2006), and social and communication networks have been studied within individual institutions (Bernard et al. 1980; Guimera et al. 2003). However, little is known about the structure of the academic interactions within a given college or university. Instead, institutions are led to make significant decisions and craft policy based on simplistic statistics such as class size and the distribution of degrees awarded by various departments, which ignores key information such as which departments are more similar or strongly linked to other departments according to more specific metrics. Therefore, there is a need to extract and interpret more nuanced information characterizing the structural patterns in our colleges and universities in order to develop more efficient policies to better serve the faculty and the student body alike.

The study of networks has emerged as a uniquely fruitful area of research, yielding important theoretical tools for understanding real-world complex structures and systems (Strogatz 2001). At its structural core a network is mathematically represented by a graph – a collection of nodes and the edges connecting them (Boccaletti et al. 2006; Newman 2003). Applications of network science approaches are widespread, ranging from understanding microscopic phenomena, e.g., protein-protein interactions (Han et al. 2004; Vazquez et al. 2003) and gene-regulation (Huang et al. 2005; Teichmann and Babu 2004), to macroscopic phenomena, e.g., social interactions between people (Bagrow and Lin 2012; Palla et al. 2005) and large-scale power grids (Motter et al. 2013; Rohden et al. 2012). Two concepts that are particularly useful for understanding the structural patterns of a network are community structure and centrality. Community structure refers to partitions of a network into groups such that many links connect nodes within the same group, but few links connect nodes in different groups (Newman 2012). Thus, the community structure of a network describes a natural organization of the network into groups of closely-related nodes as defined by the network structure. On the other hand, centrality refers to a measure of the standing of each individual node in a network compared to others (Wasserman and Faust 1994). Therefore, centrality measures are useful in identifying individual nodes that are important for connecting the overall network. While many different network centralities exist, each in some way describes the importance of each node in terms of connecting the overall network.

In this paper we study the network structure of our home institution, Trinity College, in Hartford, CT. We begin by constructing a network describing the academic interactions between different departments using the major and minor patterns of graduating seniors. This academic network is time-varying, and thus is a natural example of a temporal multiplex network. Using techniques recently developed for such temporal multiplex networks we study the community structure of Trinity College and the interdisciplinary centrality of its various departments as they evolve through the years. Our results shed a great deal of light on the structural patterns of Trinity College, offering practical insights into the structure of the institution that we believe might better inform the creation and implementation of policy. For instance, several communities exist that highlight important groups of well-connected departments. Interestingly, the communities that emerge differ from the typical science vs humanities separation that one might expect – instead we find that the community structure is much more nuanced. This suggests a less unified academic environment than might be ideal and the possibility for various policies to affect departments in various communities much differently. Moreover, we identify certain “stalwart” departments that remain in the same community through the years, while other departments are more flexible in their standing, belonging to multiple communities as years pass. We also use network centrality techniques to identify those departments that are particularly important in terms of connecting the whole environment. Interestingly, departments that are more central do not necessarily correspond to those departments that are larger. We also identify departments that act as strong connectors due to their majors, while other departments act as strong connectors due to their minors. Finally, we close with a discussion of our results and an outlook into their possible applications and use at other institutions.

The network

We start by describing the construction of the academic network of Trinity College. To begin, we identify the full range of departments at the college that offer all possible major and minor degrees. At Trinity College we identify 32 such departments, assigning each one a distinct four-letter code, which is summarized in Table 1 in the Appendix. For example, the anthropology and mathematics departments are represented ANTH and MATH, respectively. Next, for each graduating year we identify all students that earned a degree from two or more departments. Each of these students then contributes to one or more interactions between different departments of the form major-major, major-minor, or minor-minor. For instance, a student that completes a double-major in engineering and mathematics contributes one major-major interaction between engineering and mathematics. On the other hand, a student that completes a major in English with minors in sociology and film contributes three interactions: two major-minor interactions between english and sociology and english and film, respectively, and one minor-minor interaction between sociology and film. For each of the three types of interactions we create an adjacency matrix that represents the number of interactions for the class graduating in year t, denoting them \(\tilde {A}_{\text {maj-maj}}^{(t)}\), \(\tilde {A}_{\text {maj-min}}^{(t)}\), and \(\tilde {A}_{\text {min-min}}^{(t)}\). Since our college consists of 32 departments, each adjacency matrix is 32 by 32, representing the interactions between 32 nodes. Each interaction contributes a link of weight one to the corresponding entry in the appropriate matrix. Finally, we interpret each interaction as undirected, so that each resulting adjacency matrix is symmetric.

Using the process outlined above we obtain for each graduating class three adjacency matrices, each describing the relationships between departments via major-majors, major-minors, and minor-minors. In order to combine these topologies into one overall network we introduce a parameter α [ 0,1] describing the relative importance of a minor in comparison to a major. Specifically, for the class graduating in year t we build the overall adjacency matrix \(\tilde {A}_{\alpha }^{t}\), defined as
$$\begin{array}{*{20}l} \tilde{A}_{\alpha}^{(t)}=\tilde{A}_{\text{maj-maj}}^{(t)}+\alpha \tilde{A}_{\text{maj-min}}^{(t)}+\alpha^{2} \tilde{A}_{\text{min-min}}^{(t)}, \end{array} $$
(1)
such that, in comparison to major-major interactions, major-minor and minor-minor interactions are weighted by a fraction of α and α 2, respectively. In principle one can choose α to be the average number of courses required for a minor as compared to a major, or one can vary α to examine the effect that minors play in altering the structure of the network (as we do below). Finally, we note that makeup of the student body any given year consists not only of the students that graduate that year, but also those that eventually graduate in each of the three following years. Therefore, the adjacency matrix we use to describe the network of the academic environment in year t, denoted \(A_{\alpha }^{(t)}\), is created by combining the adjacency matrices of the graduating classes for years t, t+1, t+2, and t+3:
$$\begin{array}{*{20}l} A_{\alpha}^{(t)}=\tilde{A}_{\alpha}^{(t)}+\tilde{A}_{\alpha}^{(t+1)}+\tilde{A}_{\alpha}^{(t+2)}+\tilde{A}_{\alpha}^{(t+3)}. \end{array} $$
(2)
The adjacency matrix \(A_{\alpha }^{(t)}\) thus describes the interaction between different departments via their students’ major and minoring patterns in a year t for a chosen minor parameter α. In principle \(A_{\alpha }^{(t)}\) is weighted but remains symmetric. A small portion of such a network, describing the engineering (ENGR), mathematics (MATH), and Philosophy (PHIL) departments, is illustrated in Fig. 1 a. Note that the network is both undirected and weighted. Such a network can be obtained for a range of several years, giving rise to a multi-layered temporal network where the network for each distinct year comprises a different layer, as illustrated in Fig. 1 b. Note that each different layer, corresponding to the network at a different year, consists of the same collection of nodes, but with different connection patterns, thus contributing to a temporal multiplex network (De Domenico et al. 2013; Kivelä et al. 2014). We also note that, since the most recent year available in our dataset is 2016, the most recent layer in our network is that for 2013 (which includes the graduating classes 2013, 2014, 2015, and 2016). In the remainder of this paper we investigate the structural features of this temporal multiplex network representing the academic interactions at Trinity College, first focusing on community structure, then on centrality.
Fig. 1

Network structure example. Illustration of a small portion of the network for a a single year and b a multiplex network constructed from two adjacent years

Community structure

Many real world networks display a key feature known as community, or modular, structure: a partition of the nodes into two or more groups where nodes share many links with nodes in the same group, but few with nodes in other groups, relatively speaking (Newman 2012). The identification of communities thus provides a valuable description of the structure of the network and has many different applications in many different contexts such as groups of friends in social networks and similar species in food webs (Girvan and Newman 2002). In the case of the academic network studied here, the identification of communities not only allows us to better understand the network structure, but has more specific utility. For instance, knowledge of the community structure might allow institutions to better predict what groups of departments may be more or less impacted by certain policies or understand what other departments will be more or less affected by a curriculum change in another department. Denoting the community to which node i belongs in a given partition as s i , the community structure of a single-layer network represented by the adjacency matrix A can be identified by maximizing the modularity Q (Newman and Girvan 2004), defined as
$$\begin{array}{*{20}l} Q = \frac{1}{N\langle k\rangle}\sum_{ij}\left(A_{ij}-\frac{k_{i}k_{j}}{N\langle k\rangle}\right)\delta(s_{i},s_{j}), \end{array} $$
(3)

where \(k_{i}=\sum _{j}A_{ij}\) is the (possibly weighted) degree of node i, \(\langle k\rangle =N^{-1}\sum _{i}k_{i}\) is the mean degree, and δ(s i ,s j ) is the Kronecker delta function that evaluates to one if s i =s j and zero otherwise. In practice, finding community structure in large networks is a difficult problem, however several methods exist for identifying community structures including aggregative (Clauset et al. 2004), divisive (Duch and Arenas 2005), and spectral (Newman 2006) methods. Here we use the divisive method of extremal optimization (Duch and Arenas 2005).

We begin by studying community structure in single layers of the network, constructed using a minor parameter of α=0.5, corresponding to a weighting where major-minor interactions are half as significant and double major interactions and double minor interactions are a quarter as significant. In principle one could estimate α as the ratio of the average number of credits required for institution-wide minors to the average number of credits required for institution-wide majors. Here we make this simple choice, noting that we will consider varying α below. In Fig. 2 we illustrate community structure found in the single-layer networks from the three most recent years of 2011, 2012, and 2013, indicating different communities by color. Departments are presented in an order that best groups departments in the same community, and in the same order through the three years. In 2011 we identify three communities, roughly corresponding to historical humanities (red, e.g., economics, history, and political science), artistic humanities and descriptive sciences (green, e.g., english, religion, biology, and neuroscience), and finally the quantitative science (blue, e.g., engineering, mathematics, and physics). Note that this partition into communities is significantly different from the sciences vs. humanities separation that one may expect. In particular, while the quantitative sciences constitute a community, the descriptive sciences belong to the same community as the artistic humanities. In 2012 we observe a significant change via the birth of a new community, roughly corresponding the descriptive sciences (orange). This community is primarily made up of departments which belonged to the artistic humanities the previous year, but also includes anthropology and environmental science, both of which belonged to the historical humanities. Also, classical studies department switched from the quantitative sciences community to the historical humanities community. Finally, more changes are observed in 2013: physics joins the descriptive science community, economics, environmental science, and urban studies join the quantitative science community, and philosophy and religion join the historical humanities.
Fig. 2

Community structure: single layers. Community structure, indicated by color, for the networks from the three most recent years of a 2011, b 2012, and c 2013. Minor parameter: α=0.5

The year-to-year variation in the communities described above indicates the need for a more nuanced approach for understanding the evolution of community structure through time (Mucha et al. 2010). In particular, while the overall composition of communities from year-to-year share similar properties, we observe both the split of one community into two as well as switching of some department from one community to another. A natural question then arises: do we still observe such phenomena if a given node’s community membership in two adjacent layers is connected? In order to answer this question we turn to recent work where the concept of modularity has been formulated for the case of temporal multiplex networks (Bazzi et al. 2016). In particular, we now designate the community of node i in each layer t by \(s_{i}^{(t)}\), and adopt the multilayer modularity formulation
$$\begin{array}{*{20}l} Q_{\omega}&=\frac{1}{L}\sum_{t=1}^{L}\left[\frac{1}{N\langle k^{(t)}\rangle}\sum_{i,j=1}^{N}\left(A_{ij}^{(t)}-\frac{k_{i}^{(t)}k_{j}^{(t)}}{N\langle k^{(t)}\rangle}\right)\delta\left(s_{i}^{(t)},s_{j}^{(t)}\right)\right] \end{array} $$
(4)
$$\begin{array}{*{20}l} &+\frac{2\omega_{\text{mod}}}{N(L-1)}\sum_{t=1}^{L-1}\sum_{i=1}^{N}\delta\left(s_{i}^{(t)},s_{i}^{(t+1)}\right), \end{array} $$
(5)

where L is the total number of layers in the multiplex, \(k_{i}^{(t)}\) is the degree of node i in layer t, and 〈k (t)〉 is the mean degree in layer t. We note that the formulation of the multilayer modularity in Eq. (5) has two contributing terms and is a slight modification (up to a rescaling of Q ω and ω mod) of that in Ref. (Bazzi et al. 2016). The first term accounts for the modularity within each individual layer and the second term, which includes a modularity persistence parameter ω mod>0 accounts for the agreement in the communities for the same node in two adjacent layers. Thus, ω mod modifies the degree to which the communities of the same node in subsequent layers is preferred to be the same, i.e., persist. In the limit ω mod→0+ persistence has no effect on the multilayer modularity and the resulting community structure is simply that of each individual layer, while larger values of ω mod dictate a preference for nodes in adjacent layers to remain in the same community, thereby unifying the community structure of the multiplex.

In Fig. 3 we illustrate the community structure, indicated by color, found in the 10-layered multiplex consisting of the years 2004–2013 for a minor parameter value α=0.5 and persistence value of ω mod=0.2, which we find nicely balances the effects of persistence vs. modularity in individual layers. (Community structure is found using a modification of the extremal optimization technique and is summarized in the Appendix.) Departments are presented in an order that best groups departments in the same communities, easing the visual identification of different communities and their evolution. Overall, we observe four different communities and a complex pattern of structure. First, several “stalwart” departments exist that remain in the same community over all ten years: art history, history, international studies, and language and culture studies form a backbone of the historical humanities community (red), chemistry, computer science, engineering, mathematics, and physics form the backbone of the quantitative science community (blue), and english, film studies, and religion (as well as the individualized degree program) form the backbone of the artistic humanities community (green). These stalwart departments are contrasted by traveler departments: those that switch community membership at least once through the ten years studied. We note that physics belonged to different communities when considering layers in isolation [see Fig. 2], but with the added preference for agreement between nodes in adjacent layers via the persistence parameter ω mod, physics becomes a stalwart of the quantitative sciences. Another community also exists (yellow) comprised of the descriptive sciences and some other humanities, but is extinguished by the year 2011, by which time most of its members have joined the artistic humanities community. Again, the effect of persistence is observed in the descriptive sciences: in the single layers for 2012 and 2013 the descriptive sciences comprised its own community [see Fig. 2], but this is not true for the overall multiplex with ω mod=0.2. Rather, the effect of persistence is to keep the descriptive sciences in the same community as the artistic humanities. Finally, we observe in many instances that multiple traveler departments switch communities simultaneously or approximately at the same time. For instance, economics, political science, public policy and law, and urban studies all switch from the quantitative science community to the historical science community at the end of 2006. Moreover, philosophy, music, theater and dance, American studies, women, gender, and sexuality, sociology, and anthropology all join the artistic humanities between 2005 and 2008.
Fig. 3

Community structure: temporal network. Evolution of community structure, indicated by color, throughout the college from 2004–2013. Minor parameter: α=0.5. Persistence parameter: ω=0.2

Centrality

As a complement to the features of our academic network captured by community structure, we also study the centrality properties of our network. While a great many centrality measures exist for a given network, each with slightly different meanings, all centralities measure in some sense each node’s role or importance in connecting the network (Newman 2003). Moreover, many of the most useful centrality measure are represented by eigenvectors of a matrix, for instance PageRank centrality (Gleich 2015), hub and authority centrality (Kleinberg 1999), dynamical importance (Restrepo et al. 2006), and classical eigenvector centrality (Newman 2003). For a single-layered network any eigenvector-based centrality measure is described by the the dominant eigenvector of a matrix C that is some function of the adjacency matrix A (MacCluer 2000). For instance, in the case of PageRank centrality the centrality c i of node i is given by v i where v is the leading eigenvector of the matrix C=(D in)−1 A, where \(D^{\text {in}}=\text {diag}(k_{1}^{\text {in}},\dots,k_{N}^{\text {in}})\).

Recently Taylor et al. (2016) formulated the centrality problem for a temporal multiplex network for any eigenvector-based centrality. Given a temporal multiplex as we study here with adjacency matrices A (1),…,A (L) for the different layers the centrality matrices C (1),…,C (L) are computed and used to construct the supra-centrality matrix
$$ \mathbb{C}=\left[\begin{array}{ccccc} C^{(1)} & \omega_{\text{cen}}I & 0 & \cdots & 0 \\ \omega_{\text{cen}}I & C^{(2)} & \ddots & & \vdots \\ 0 & \ddots & \ddots & \ddots &0 \\ \vdots & & \ddots & C^{(L-1)} & \omega_{\text{cen}}I \\ 0 & \cdots & 0 & \omega_{\text{cen}}I & C^{(L)} \end{array}\right], $$
(6)
where ω cen represents a centrality persistence measure with a similar interpretation as the modularity persistence parameter used above. The centrality of each node in each layer is then given by the dominant eigenvector of \(\mathbb {C}\), which comes in the form
$$\begin{array}{*{20}l} \boldsymbol{v} = \left[\boldsymbol{v}^{(1)T}|\boldsymbol{v}^{(2)T}|\cdots|\boldsymbol{v}^{(L)T}\right]^{T}. \end{array} $$
(7)
Finally, since the centrality of a given node may differ significantly from layer-to-layer, i.e., the values of v (t) may differ on average significantly from those of \(\boldsymbol {v}^{(t^{\prime })}\) we compute the conditional centralities of each node in each layer, defined as
$$\begin{array}{*{20}l} u_{i}^{(t)}=\frac{v_{i}^{(t)}}{\sum_{j=1}^{N}v_{j}^{(t)}}. \end{array} $$
(8)

Specifically, the conditional centralities normalize the centralities in each layer to one, quenching any effect of layer-to-layer effects.

Here we focus on classical eigenvector centrality of our network, using C (t)=A (t), which not unlike PageRank centrality values nodes that are nearby other important nodes. The eigenvector centrality of a given node tends to be (but is not always) positively correlated with the degree of that node. We begin by investigating the centralities of the stalwart departments of the quantitative sciences community found above: chemistry, computer science, engineering, mathematics, and physics. For reference, we plot the number of majors present in each department during each year in Fig. 4 a. (We forgo plotting their minors due to the fact that these particular departments do not offer disciplinary minors and therefore have little effect on the centralitles.) In Fig. 4 b we plot the evolution of each department’s eigenvector centrality over the last ten years, computed using ω cen=5 (and α=0.5). First, we note that of these five departments engineering has on average the most majors, followed by mathematics, computer science, chemistry, then physics. However, mathematics has by far the largest centrality score. In hindsight we find that (i) a larger percentage of mathematics students also major or minor in another department and (ii) the other major or minor chosen by mathematics majors are surprisingly broad – in addition to sharing majors and minors with the other quantitative sciences a significant number of mathematics students share majors or minors with department such as classical studies, economics, music, and philosophy (particularly in the most recent years).
Fig. 4

Eigenvector centrality: Quantitative sciences. Evolution of the a number of majors and b eigenvector centrality of chemistry, computer science, engineering, mathematics, and physics from 2004–2013 using ω cen=5

We also use our network centrality measure to investigate the effect that minors have on the overall network structure. In particular, we study the eigenvector centrality of the four most central departments over the last ten years: economics, international studies, language and culture studies, and political science. In Fig. 5 a and b we plot the number of majors and minors, respectively, of these four popular departments. Economics has by far the most majors, followed by political science, then international studies, then language and culture studies. However language and culture studies has far more minors than the other three. (This is due to the fact that a large number of students complete a minor in a foreign language, all of which are housed in the language and culture studies department.) To highlight the role that minors play, we next compute the centralities for these four departments using a small minor parameter, α=0.05, intermediate minor parameters, α=0.35 and 0.65, and a large minor parameter, α=0.95, plotting the results in Fig. 5 c and d. In the former case with α=0.05 the evolution of the departments’ centralities are reasonably well-described by the number of majors shown in Fig. 5 a, except that language and culture studies is perhaps more central than expected, but still ranks below economics. However, as α is increased through 0.35, 0.65, and eventually to 0.95, language and culture studies’ centrality is strengthened by its large number of minors, making it the most central department in the college by a significant margin.
Fig. 5

Eigenvector centrality: Effect of minors. Evolution of the a number of majors and b number of minors of economics, international studies, language and culture studies, and political science from 2004–2013. For the same years, the eigenvector centralities of each department using ω cen=5 and minor parameters c α=0.05, d 0.35 e α=0.65, and f 0.95

Discussion

The academic landscape of today’s colleges and universities are organized by complex, time-varying networks that describe interactions between different departments (Berger 2002). Moreover, the structural features of these academic networks have a strong impact on the activity of faculty members and the endeavors of students (Pascarella et al. 2005). While social networks within colleges and universities have been studied in the past (Bernard et al. 1980; Guimera et al. 2003), the academic network structures describing interactions between departments is poorly understood. This leaves administration and individual departments to make decisions based on more simplistic statistical measure, without a robust understanding of the structure of the institution as a whole. To address this shortcoming, we have presented in this paper a framework constructing such an academic network and performed an analysis of community structure and centrality.

Our approach stems from the construction of a temporal multiplex network based on the double major, major-minor, and double minor patterns of graduating students. In particular, by representing departments as nodes and years as layers, we construct for each year a network based on the number of students that each pair of departments shares. Network features can then be extracted from any individual layer, or from the multiplex as a whole. Here we have focused on the two key features of community structure and centrality, using our home institution of Trinity College in Hartford, CT as an example. Beginning with community structure, we find that the community structure in any given year is more nuanced than the expected breakdown of sciences vs humanities. Rather, the sciences tends to break down into two communities, roughly corresponding to quantitative and descriptive sciences, while the humanities also tend to break down into two communities, roughly corresponding to historical and artistic humanities. Interestingly, recent years show a breakdown of, roughly speaking, historical and political humanities, artistic humanities, quantitative sciences, and descriptive sciences. However, through time these departments split and combine with one another, and certain departments switch between different communities while other stalwart departments remain in the same community. We also use time-varying eigenvector centrality to identify departments that are particularly important in connecting the college and study the effect that minors play in determining the relative standing of different departments.

These results have several practical applications. For instance, policy designed for the sciences will likely impact departments in different ways, depending on whether it is a quantitative or descriptive science. Thus, we hypothesize that in certain cases, taking the more subtle structure of the institution into account might result in more effective policies, and in other cases separate policies should be implemented targeting different parts of the college. Additionally, these results indicate an academic structure that might be more segregated than is ideal. To better unify the academic environment of the college, departments could focus on developing partnerships and interactions with other departments outside their community rather than inside. Moreover, we have used the time-evolution of the community structure to find stalwart departments that tend to remain in the same community, while others switch between communities intermittently, identifying which departments have more or less flexible interactions with their fellow departments.

Second, we have found that the evolution of the eigenvector centrality of a department reveals more than just the relative size of the department. We emphasize that a department’s centrality does not necessarily correspond to its individual importance, but rather its importance in connecting the college as a whole. For instance, while mathematics has a moderate number of majors compared to the other quantitative sciences, it is highly central due to both its high number and diversity of double majors. Additionally, we can differentiate departments that are central due to their major influence (e.g., economics and political science) from those that are central due to their minor influence (e.g., language and culture studies).

While we have applied this approach to our home institution, we note that it is flexible and can in principle be applied to any other college or university where data describing the degrees of graduating seniors can be obtained. This opens the possibility for other researchers and institution officials to perform similar studies on their own college or university in order to better craft policies. A natural question then arises: how “similar” are the network structures at different colleges and universities? For instance: At different institutions, do communities break down into similar categories as we have found at Trinity? Do highly central departments at one institution tend to also be more central at other institutions? Are there significant differences in the structure of liberal arts colleges vs larger universities? We hypothesize that the framework presented here can be used to give insight into these questions.

Appendix

Department codes

The degrees awarded by Trinity College belong to 32 different departments. Here we identify each department with a different four-letter key, summarized in Table 1.
Table 1

Key of department codes

Code

Department

Code

Department

AMST

American Studies

INTS

International Studies

ANTH

Anthropology

LCST

Language and Culture Studies

ARTH

Art History

MATH

Mathematics

BIOC

Biochemistry

MUSI

Music

BIOL

Biology

NEUR

Neuroscience

CHEM

Chemistry

PHIL

Philosophy

CLST

Classical Studies

PHYS

Physics

COMP

Computer Science

POLS

Political Science

ECON

Economics

PSYC

Psychology

EDUC

Educational Studies

PPLW

Public Policy and Law

ENGR

Engineering

RELI

Religion

ENGL

English

SOCI

Sociology

ENVI

Environmental Science

STUD

Studio Arts

FILM

Film Studies

THDA

Theatre and Dance

HIST

History

URBS

Urban Studies

INDP

Individualized Degree Program

WGSE

Women, Gender and Sexuality

Multiplex community detection

As discussed in Ref. (Bazzi et al. 2016), community detection in multiplex networks involves several subtle challenges. However, the optimization of multiplex modularity, i.e., Eq. (5), can often be done using a modification of existing techniques for detecting communities in simple monoplex networks. Here we use a modification of the extremal optimization approach (Duch and Arenas 2005) summarized as follows. We begin by finding the community structures for each individual layer using extremal optimization. Next, we re-index the communities such that the Hamming distance between the communities for each pair of adjacent layers in minimized. (The Hamming distance between the communities of layers t and t+1 is simply the number of nodes for which \(s_{i}^{(t)}\ne s_{i}^{(t+1)}\).) At this point the community structures for each isolated layer have been found and are best-matched, maximizing the first term on the right hand-side of Eq. (5). Finally, we sweep through each node in each layer in a random order, adjusting its membership to the community that locally optimizes Eq. (5). Here we perform a total of 100 such sweeps.

We note that finding community structure both in the isolated layers as well as in the layered multiplex includes a stochastic element. Therefore, the results presented in the main text represent the best outcome of 500 realization of maximizing the modularity in the multiplex. We find that the result for each realization is locally stable, i.e., changing the community membership of any one single node in a single layer decreases the overall multiplex modularity Q ω .

Declarations

Acknowledgments

The authors thank Terry Hosig in the Registrar’s Office at Trinity College for help in obtaining the data. P.S.S. thanks Lauren Kiely Skardal for many helpful discussions. M.A. and S.W. acknowledge financial support from the Summer Student Research Program at Trinity College.

Authors’ contributions

PSS designed and devised the study. PSS, MA, and SW analyzed the data, prepared the figures, and wrote the main text of the manuscript. All authors read and approved the final manuscript.

Competing interests

The authors declare that they have no competing interests.

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Authors’ Affiliations

(1)
Department of Mathematics, Trinity College

References

  1. Bagrow, JP, Lin YR (2012) Mesoscopic structure and social aspects of human mobility. PloS One7(5): 37676.ADSView ArticleGoogle Scholar
  2. Bazzi, M, Porter MA, Williams S, McDonald M, Fenn DJ, Howison SD (2016) Community detection in temporal multilayer networks, with an application to correlation networks. Multiscale Model Simul14(1): 1–41.MathSciNetView ArticleMATHGoogle Scholar
  3. Berger, JB (2002) The influence of the organizational structures of colleges and universities on college student learning. Peabody J Educ77(3): 40–59.View ArticleGoogle Scholar
  4. Bernard, HR, Killworth PD, Sailer L (1980) Informant accuracy in social network data iv: A comparison of clique-level structure in behavioral and cognitive network data. Soc Netw2(3): 191–218.View ArticleGoogle Scholar
  5. Boccaletti, S, Latora V, Moreno Y, Chavez M, Hwang DU (2006) Complex networks: Structure and dynamics. Phys Rep424(4): 175–308.ADSMathSciNetView ArticleGoogle Scholar
  6. Clauset, A, Arbesman S, Larremore DB (2015) Systematic inequality and hierarchy in faculty hiring networks. Sci Adv1(1): 1400005.ADSView ArticleGoogle Scholar
  7. Clauset, A, Newman ME, Moore C (2004) Finding community structure in very large networks. Phys Rev E70(6): 066111.ADSView ArticleGoogle Scholar
  8. De Domenico, M, Solé-Ribalta A, Cozzo E, Kivelä M, Moreno Y, Porter MA, Gómez S, Arenas A (2013) Mathematical formulation of multilayer networks. Phys Rev X3(4): 041022.Google Scholar
  9. Duch, J, Arenas A (2005) Community detection in complex networks using extremal optimization. Phys Rev E72(2): 027104.ADSView ArticleGoogle Scholar
  10. Girvan, M, Newman ME (2002) Community structure in social and biological networks. Proc Nat Acad Sci99(12): 7821–7826.ADSMathSciNetView ArticleMATHGoogle Scholar
  11. Gleich, DF (2015) Pagerank beyond the web. SIAM Rev57(3): 321–363.MathSciNetView ArticleMATHGoogle Scholar
  12. Guimera, R, Danon L, Diaz-Guilera A, Giralt F, Arenas A (2003) Self-similar community structure in a network of human interactions. Phys Rev E68(6): 065103.ADSView ArticleGoogle Scholar
  13. Han, J-DJ, Bertin N, Hao T, Goldberg DS, Berriz GF, Zhang LV, Dupuy D, Walhout AJ, Cusick ME, Roth FP, et al (2004) Evidence for dynamically organized modularity in the yeast protein–protein interaction network. Nature430(6995): 88–93.ADSView ArticleGoogle Scholar
  14. Hillier, B, Penn A (1991) Visible colleges: structure and randomness in the place of discovery. Sci Context4(01): 23–50.View ArticleGoogle Scholar
  15. Huang, S, Eichler G, Bar-Yam Y, Ingber DE (2005) Cell fates as high-dimensional attractor states of a complex gene regulatory network. Phys Rev Lett94(12): 128701.ADSView ArticleGoogle Scholar
  16. Kivelä, M, Arenas A, Barthelemy M, Gleeson JP, Moreno Y, Porter MA (2014) Multilayer networks. J Complex Netw2(3): 203–271.View ArticleGoogle Scholar
  17. Kleinberg, JM (1999) Authoritative sources in a hyperlinked environment. J ACM (JACM)46(5): 604–632.MathSciNetView ArticleMATHGoogle Scholar
  18. MacCluer, CR (2000) The many proofs and applications of perron’s theorem. Siam Rev42(3): 487–498.ADSMathSciNetView ArticleMATHGoogle Scholar
  19. Motter, AE, Myers SA, Anghel M, Nishikawa T (2013) Spontaneous synchrony in power-grid networks. Nat Phys9(3): 191–197.View ArticleGoogle Scholar
  20. Mucha, PJ, Richardson T, Macon K, Porter MA, Onnela JP (2010) Community structure in time-dependent, multiscale, and multiplex networks. Science328(5980): 876–878.ADSMathSciNetView ArticleMATHGoogle Scholar
  21. Newman, ME (2003) The structure and function of complex networks. SIAM Rev45(2): 167–256.ADSMathSciNetView ArticleMATHGoogle Scholar
  22. Newman, ME (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E74(3): 036104.ADSMathSciNetView ArticleGoogle Scholar
  23. Newman, ME (2012) Communities, modules and large-scale structure in networks. Nat Phys8(1): 25–31.MathSciNetView ArticleGoogle Scholar
  24. Newman, ME, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E69(2): 026113.ADSView ArticleGoogle Scholar
  25. Palla, G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature435(7043): 814–818.ADSView ArticleGoogle Scholar
  26. Pascarella, ET (2006) How college affects students: Ten directions for future research. J Coll Stud Dev47(5): 508–520.View ArticleGoogle Scholar
  27. Pascarella, ET, Terenzini PT, Feldman KA (2005) How College Affects Students, Vol. 2. Jossey-Bass San Francisco, CA.Google Scholar
  28. Restrepo, JG, Ott E, Hunt BR (2006) Characterizing the dynamical importance of network nodes and links. Phys Rev Lett97(9): 094102.ADSView ArticleGoogle Scholar
  29. Rohden, M, Sorge A, Timme M, Witthaut D (2012) Self-organized synchronization in decentralized power grids. Phys Rev Lett109(6): 064101.ADSView ArticleGoogle Scholar
  30. Strogatz, SH (2001) Exploring complex networks. Nature410(6825): 268–276.ADSView ArticleGoogle Scholar
  31. Taylor, D, Meyers SA, Clauset A, Porter MA, Mucha PJ (2016) Eigenvector-based centrality measures for temporal networks. Multiscale Modeling and Simulation: A SIAM Interdisciplinary Journal, in press. arXiv: 1507.01266.Google Scholar
  32. Teichmann, SA, Babu MM (2004) Gene regulatory network growth by duplication. Nat Genet36(5): 492–496.View ArticleGoogle Scholar
  33. Toma, JD (2010) Building Organizational Capacity: Strategic Management in Higher Education. JHU Press, Baltimore.Google Scholar
  34. Vazquez, A, Flammini A, Maritan A, Vespignani A (2003) Global protein function prediction from protein-protein interaction networks. Nat Biotechnol21(6): 697–700.View ArticleGoogle Scholar
  35. Wasserman, S, Faust K (1994) Social Network Analysis: Methods and Applications, Vol. 8. Cambridge university press, Cambridge.View ArticleMATHGoogle Scholar

Copyright

© The Author(s) 2017