Related papers: Link-Space and Network Analysis
The contemporary scientific landscape is characterized by a "curse of dimensionality," where our capacity to collect high-dimensional network data frequently outstrips our ability to computationally simulate or intuitively comprehend the…
Approaches from statistical physics are applied to investigate the structure of network models whose growth rules mimic aspects of the evolution of the world-wide web. We first determine the degree distribution of a growing network in which…
Our work introduces an approach for estimating the contribution of attachment mechanisms to the formation of growing networks. We present a generic model in which growth is driven by the continuous attachment of new nodes according to…
Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…
A model for directed networks is proposed and power laws for their in-degree and/or out-degree distributions are derived from the model. It is based on the Barabasi-Albert model and contains two parameters. The parameters serve as…
A central claim in modern network science is that real-world networks are typically "scale free," meaning that the fraction of nodes with degree $k$ follows a power law, decaying like $k^{-\alpha}$, often with $2 < \alpha < 3$. However,…
Inferring topological characteristics of complex networks from observed data is critical to understand the dynamical behavior of networked systems, ranging from the Internet and the World Wide Web to biological networks and social networks.…
Networks describe a range of social, biological and technical phenomena. An important property of a network is its degree correlation or assortativity, describing how nodes in the network associate based on their number of connections.…
Barab\'asi-Albert's `Scale Free' model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however,…
Models of growing networks are a central topic in network science. In these models, vertices are usually labeled by their arrival time, distinguishing even those node pairs whose structural roles are identical. In contrast, unlabeled…
Relational data are ubiquitous in real-world data applications, e.g., in social network analysis or biological modeling, but networks are nearly always incompletely observed. The state-of-the-art for predicting missing links in the hard…
We study a simple model of dynamic networks, characterized by a set preferred degree, $\kappa$. Each node with degree $k$ attempts to maintain its $\kappa$ and will add (cut) a link with probability $w(k;\kappa)$ ($1-w(k;\kappa)$). As a…
We study the mean length $\ell(k)$ of the shortest paths between a vertex of degree $k$ and other vertices in growing networks, where correlations are essential. In a number of deterministic scale-free networks we observe a power-law…
In many networks of scientific interest we know that the link between any pair of vertices conforms to a specific probability, such as the link probability in the Barab\'asi-Albert scale-free networks. Here we demonstrate how the…
Spatially embedded networks are important in several disciplines. The prototypical spatial net- work we assume is the Random Geometric Graph of which many properties are known. Here we present new results for the two-point degree…
There are diverse mechanisms driving the evolution of social networks. A key open question dealing with understanding their evolution is: How various preferential linking mechanisms produce networks with different features? In this paper we…
The analysis of datasets taking the form of simple, undirected graphs continues to gain in importance across a variety of disciplines. Two choices of null model, the logistic-linear model and the implicit log-linear model, have come into…
This work introduces a method for fitting to the degree distributions of complex network datasets, such that the most appropriate distribution from a set of candidate distributions is chosen while maximizing the portion of the distribution…
Networks in the real world do not exist as isolated entities, but they are often part of more complicated structures composed of many interconnected network layers. Recent studies have shown that such mutual dependence makes real networked…
A useful property of a network that can be used to characterize many systems is the degree distribution. However, many complex networks exhibit higher--order degree correlations that must be studied through other means, such as clustering…