arXiv subjects

M. E. J. Newman

Publications and source records attributed to M. E. J. Newman.

At least 91 records · Page 5Linked to original sources

arXiv2007

Community Structure in the United States House of Representatives

We investigate the networks of committee and subcommittee assignments in the United States House of Representatives from the 101st--108th Congresses, with the committees connected by ``interlocks'' or common membership. We examine the community structure in these networks using several methods, revealing strong links between certain committees as well as an intrinsic hierarchical structure in the House as a whole. We identify structural changes, including additional hierarchical levels and higher modularity, resulting from the 1994 election, in which the Republican party earned majority status in the House for the first time in more than forty years. We also combine our network approach with analysis of roll call votes using singular value decomposition to uncover correlations between the political and organizational structure of House committees.

physics.soc-ph↗

arXiv2007

Component sizes in networks with arbitrary degree distributions

We give an exact solution for the complete distribution of component sizes in random networks with arbitrary degree distributions. The solution tells us the probability that a randomly chosen node belongs to a component of size s, for any s. We apply our results to networks with the three most commonly studied degree distributions -- Poisson, exponential, and power-law -- as well as to the calculation of cluster sizes for bond percolation on networks, which correspond to the sizes of outbreaks of SIR epidemic processes on the same networks. For the particular case of the power-law degree distribution, we show that the component size distribution itself follows a power law everywhere below the phase transition at which a giant component forms, but takes an exponential form when a giant component is present.

cond-mat.stat-mech↗

arXiv2007

Large-scale structure of time evolving citation networks

In this paper we examine a number of methods for probing and understanding the large-scale structure of networks that evolve over time. We focus in particular on citation networks, networks of references between documents such as papers, patents, or court cases. We describe three different methods of analysis, one based on an expectation-maximization algorithm, one based on modularity optimization, and one based on eigenvector centrality. Using the network of citations between opinions of the United States Supreme Court as an example, we demonstrate how each of these methods can reveal significant structural divisions in the network, and how, ultimately, the combination of all three can help us develop a coherent overall picture of the network's shape.

physics.soc-ph↗

arXiv2007

Mixture models and exploratory analysis in networks

Networks are widely used in the biological, physical, and social sciences as a concise mathematical representation of the topology of systems of interacting components. Understanding the structure of these networks is one of the outstanding challenges in the study of complex systems. Here we describe a general technique for detecting structural features in large-scale network data which works by dividing the nodes of a network into classes such that the members of each class have similar patterns of connection to other nodes. Using the machinery of probabilistic mixture models and the expectation-maximization algorithm, we show that it is possible to detect, without prior knowledge of what we are looking for, a very broad range of types of structure in networks. We give a number of examples demonstrating how the method can be used to shed light on the properties of real-world networks, including social and information networks.

physics.data-an↗

arXiv2007

Growing distributed networks with arbitrary degree distributions

We consider distributed networks, such as peer-to-peer networks, whose structure can be manipulated by adjusting the rules by which vertices enter and leave the network. We focus in particular on degree distributions and show that, with some mild constraints, it is possible by a suitable choice of rules to arrange for the network to have any degree distribution we desire. We also describe a mechanism based on biased random walks by which appropriate rules could be implemented in practice. As an example application, we describe and simulate the construction of a peer-to-peer network optimized to minimize search times and bandwidth requirements.

physics.soc-ph↗

arXiv2006

Structural Inference of Hierarchies in Networks

One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to form groups of groups, and so forth, up through all levels of organization in the network. Here, we give a precise definition of hierarchical structure, give a generic model for generating arbitrary hierarchical structure in a random graph, and describe a statistically principled way to learn the set of hierarchical features that most plausibly explain a particular real-world network. By applying this approach to two example networks, we demonstrate its advantages for the interpretation of network data, the annotation of graphs with edge, vertex and community properties, and the generation of generic null models for further hypothesis testing.

physics.soc-ph↗

arXiv2006

Finding community structure in networks using the eigenvectors of matrices

We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as "modularity" over possible divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a number of possible algorithms for detecting community structure, as well as several other results, including a spectral measure of bipartite structure in networks and a new centrality measure that identifies those vertices that occupy central positions within the communities to which they belong. The algorithms and measures proposed are illustrated with applications to a variety of real-world complex networks.

physics.data-an↗

arXiv2006

Power laws, Pareto distributions and Zipf's law

When the probability of measuring a particular value of some quantity varies inversely as a power of that value, the quantity is said to follow a power law, also known variously as Zipf's law or the Pareto distribution. Power laws appear widely in physics, biology, earth and planetary sciences, economics and finance, computer science, demography and the social sciences. For instance, the distributions of the sizes of cities, earthquakes, solar flares, moon craters, wars and people's personal fortunes all appear to follow power laws. The origin of power-law behaviour has been a topic of debate in the scientific community for more than a century. Here we review some of the empirical evidence for the existence of power-law forms and the theories proposed to explain them.

cond-mat.stat-mech↗

arXiv2006

Exact solutions for models of evolving networks with addition and deletion of nodes

There has been considerable recent interest in the properties of networks, such as citation networks and the worldwide web, that grow by the addition of vertices, and a number of simple solvable models of network growth have been studied. In the real world, however, many networks, including the web, not only add vertices but also lose them. Here we formulate models of the time evolution of such networks and give exact solutions for a number of cases of particular interest. For the case of net growth and so-called preferential attachment -- in which newly appearing vertices attach to previously existing ones in proportion to vertex degree -- we show that the resulting networks have power-law degree distributions, but with an exponent that diverges as the growth rate vanishes. We conjecture that the low exponent values observed in real-world networks are thus the result of vigorous growth in which the rate of addition of vertices far exceeds the rate of removal. Were growth to slow in the future, for instance in a more mature future version of the web, we would expect to see exponents increase, potentially without bound.

cond-mat.stat-mech↗

arXiv2006

Optimal design of spatial distribution networks

We consider the problem of constructing public facilities, such as hospitals, airports, or malls, in a country with a non-uniform population density, such that the average distance from a person's home to the nearest facility is minimized. Approximate analytic arguments suggest that the optimal distribution of facilities should have a density that increases with population density, but does so slower than linearly, as the two-thirds power. This result is confirmed numerically for the particular case of the United States with recent population data using two independent methods, one a straightforward regression analysis, the other based on density dependent map projections. We also consider strategies for linking the facilities to form a spatial network, such as a network of flights between airports, so that the combined cost of maintenance of and travel on the network is minimized. We show specific examples of such optimal networks for the case of the United States.

cond-mat.dis-nn↗

arXiv2006

Nonequilibrium phase transition in the coevolution of networks and opinions

Models of the convergence of opinion in social systems have been the subject of a considerable amount of recent attention in the physics literature. These models divide into two classes, those in which individuals form their beliefs based on the opinions of their neighbors in a social network of personal acquaintances, and those in which, conversely, network connections form between individuals of similar beliefs. While both of these processes can give rise to realistic levels of agreement between acquaintances, practical experience suggests that opinion formation in the real world is not a result of one process or the other, but a combination of the two. Here we present a simple model of this combination, with a single parameter controlling the balance of the two processes. We find that the model undergoes a continuous phase transition as this parameter is varied, from a regime in which opinions are arbitrarily diverse to one in which most individuals hold the same opinion. We characterize the static and dynamical properties of this transition.

physics.soc-ph↗

arXiv2006

Modularity and community structure in networks

Many networks of interest in the sciences, including a variety of social and biological networks, are found to divide naturally into communities or modules. The problem of detecting and characterizing this community structure has attracted considerable recent attention. One of the most sensitive detection methods is optimization of the quality function known as "modularity" over the possible divisions of a network, but direct application of this method using, for instance, simulated annealing is computationally costly. Here we show that the modularity can be reformulated in terms of the eigenvectors of a new characteristic matrix for the network, which we call the modularity matrix, and that this reformulation leads to a spectral algorithm for community detection that returns results of better quality than competing methods in noticeably shorter running times. We demonstrate the algorithm with applications to several network data sets.

physics.data-an↗

arXiv2005

A network-based ranking system for American college football

American college football faces a conflict created by the desire to stage national championship games between the best teams of a season when there is no conventional playoff system to decide which those teams are. Instead, ranking of teams is based on their record of wins and losses during the season, but each team plays only a small fraction of eligible opponents, making the system underdetermined or contradictory or both. It is an interesting challenge to create a ranking system that at once is mathematically well-founded, gives results in general accord with received wisdom concerning the relative strengths of the teams, and is based upon intuitive principles, allowing it to be accepted readily by fans and experts alike. Here we introduce a one-parameter ranking method that satisfies all of these requirements and is based on a network representation of college football schedules.

physics.soc-ph↗

arXiv2005

Solution for the properties of a clustered network

We study Strauss's model of a network with clustering and present an analytic mean-field solution which is exact in the limit of large network size. Previous computer simulations have revealed a degenerate region in the model's parameter space in which triangles of adjacent edges clump together to form unrealistically dense subgraphs, and perturbation calculations have been found to break down in this region at all orders. Our analytic solution shows that this region corresponds to a classic symmetry-broken phase and that the onset of the degeneracy corresponds to a first-order phase transition in the density of the network.

cond-mat.stat-mech↗

arXiv2005

Vertex similarity in networks

We consider methods for quantifying the similarity of vertices in networks. We propose a measure of similarity based on the concept that two vertices are similar if their immediate neighbors in the network are themselves similar. This leads to a self-consistent matrix formulation of similarity that can be evaluated iteratively using only a knowledge of the adjacency matrix of the network. We test our similarity measure on computer-generated networks for which the expected results are known, and on a number of real-world networks.

physics.soc-ph↗

arXiv2005

Threshold effects for two pathogens spreading on a network

Diseases spread through host populations over the networks of contacts between individuals, and a number of results about this process have been derived in recent years by exploiting connections between epidemic processes and bond percolation on networks. Here we investigate the case of two pathogens in a single population, which has been the subject of recent interest among epidemiologists. We demonstrate that two pathogens competing for the same hosts can both spread through a population only for intermediate values of the bond occupation probability that lie above the classic epidemic threshold and below a second higher value, which we call the coexistence threshold, corresponding to a distinct topological phase transition in networked systems.

cond-mat.stat-mech↗

arXiv2005

A network analysis of committees in the United States House of Representatives

Network theory provides a powerful tool for the representation and analysis of complex systems of interacting agents. Here we investigate the United States House of Representatives network of committees and subcommittees, with committees connected according to ``interlocks'' or common membership. Analysis of this network reveals clearly the strong links between different committees, as well as the intrinsic hierarchical structure within the House as a whole. We show that network theory, combined with the analysis of roll call votes using singular value decomposition, successfully uncovers political and organizational correlations between committees in the House without the need to incorporate other political information.

nlin.AO↗

arXiv2004

Shape and efficiency in spatial distribution networks

We study spatial networks that are designed to distribute or collect a commodity, such as gas pipelines or train tracks. We focus on the cost of a network, as represented by the total length of all its edges, and its efficiency in terms of the directness of routes from point to point. Using data for several real-world examples, we find that distribution networks appear remarkably close to optimal where both these properties are concerned. We propose two models of network growth that offer explanations of how this situation might arise.

cond-mat.dis-nn↗