Related papers: A Mutual Selection Model for Weighted Networks
We develop a statistical theory to characterize correlations in weighted networks. We define the appropriate metrics quantifying correlations and show that strictly uncorrelated weighted networks do not exist due to the presence of…
Understanding the causes and effects of network structural features is a key task in deciphering complex systems. In this context, the property of network nestedness has aroused a fair amount of interest as regards ecological networks.…
This letter introduces a mechanism for constructing, through a process of distributed decision-making, substrates for the study of collective dynamics on extended power-law weighted networks with both a desired scaling exponent and a fixed…
Clustering and closure coefficients are among the most widely applied indicators in the description of the topological structure of a network. Many distinct definitions have been proposed over time, particularly in the case of weighted…
A random network model which allows for tunable, quite general forms of clustering, degree correlation and degree distribution is defined. The model is an extension of the configuration model, in which stubs (half-edges) are paired to form…
The Barab\'{a}si-Albert (BA) model is extended to include the concept of local world and the microscopic event of adding edges. With probability $p$, we add a new node with $m$ edges which preferentially link to the nodes presented in the…
We introduce a family of one-dimensional geometric growth models, constructed iteratively by locally optimizing the tradeoffs between two competing metrics, and show that this family is equivalent to a family of preferential attachment…
We propose a network model with a fixed number of nodes and links with a dynamics which favors links between nodes differing in connectivity. Parameter regimes where the degree distributions follow power-laws, P(k) ~ k^-gamma, high…
A general relation for the dependence of nearest neighbor degree correlations on degree is derived. Dependence of local clustering on degree is shown to be the sole determining factor of assortative versus disassortative mixing in networks.…
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…
We provide a framework for modeling social network formation through conditional multinomial logit models from discrete choice and random utility theory, in which each new edge is viewed as a "choice" made by a node to connect to another…
Dense networks with weighted connections often exhibit a community like structure, where although most nodes are connected to each other, different patterns of edge weights may emerge depending on each node's community membership. We…
In this paper, we empirically investigate correlations among four centrality measures, originated from the social science, of various complex networks. For each network, we compute the centrality measures, from which the partial correlation…
We propose a deterministic weighted scale-free small-world model for considering pseudofractal web with the coevolution of topology and weight. In the model, we have the degree distribution exponent $\gamma$ restricted to a range between 2…
Cluster-Weighted Modeling (CWM) is a flexible mixture approach for modeling the joint probability of data coming from a heterogeneous population as a weighted sum of the products of marginal distributions and conditional distributions. In…
A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this paper a model is developed in…
Using a model of wealth distribution where traders are characterized by quenched random saving propensities and trade among themselves by bipartite transactions, we mimic the enhanced rates of trading of the rich by introducing the…
Complex networks of real-world systems are believed to be controlled by common phenomena, producing structures far from regular or random. Clustering, community structure and assortative mixing by degree are perhaps among most prominent…
Tie strength prediction, sometimes named weight prediction, is vital in exploring the diversity of connectivity pattern emerged in networks. Due to the fundamental significance, it has drawn much attention in the field of network analysis…
The cluster-weighted model (CWM) is a mixture model with random covariates which allows for flexible clustering and density estimation of a random vector composed by a response variable and by a set of covariates. In this class of models,…