Generating correlated networks from uncorrelated ones.

@article{Ramezanpour2003GeneratingCN,
  title={Generating correlated networks from uncorrelated ones.},
  author={A. Ramezanpour and V. Karimipour and A. Mashaghi},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2003},
  volume={67 4 Pt 2},
  pages={
          046107
        }
}
Given an ensemble of random graphs with a specific degree distribution, we show that the transformation which converts these graphs to their line (edge-dual) graphs produces an ensemble of graphs with nearly the same degree distribution, but with degree correlations and a much higher clustering coefficient. We also study the percolation properties of these new graphs. 
The Structure and Function of Complex Networks
  • M. Newman
  • Physics, Computer Science
  • SIAM Rev.
  • 2003
TLDR
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks. Expand
On the degree distribution of projected networks mapped from bipartite networks
Many real-world systems can be represented by bipartite networks. In a bipartite network, the nodes are divided into two disjoint sets, and the edges connect nodes that belong to different sets.Expand
Structural properties of scale‐free networks
Many networks have been reported recently to follow a scalefre degree distribution in which the fraction of sites having k connections follows a power law: P (k) = k . In this chapter we study theExpand
Topological phase transitions of random networks
To provide a phenomenological theory for the various interesting transitions in restructuring networks we employ a statistical mechanical approach with detailed balance satisfied for the transitionsExpand
A Generalized Configuration Model with Degree Correlations
In this paper we present a generalization of the classical configuration model. Like the classical configuration model, the generalized configuration model allows users to specify an arbitrary degreeExpand
Variability in higher order structure of noise added to weighted networks
TLDR
Noise does not present as a monolithic nuisance, but rather as a nuanced, topologydependent, and even useful entity in characterizing higher-order network interactions, and this work provides an alternate approach to noise management by embracing its role in such interactions. Expand
Non-monotonic dynamics and crosstalk in signaling pathways and their implications for pharmacology
TLDR
It is shown that for two simple interacting linear signaling pathways that carry two different signals with different physiological responses, a non-monotonic input-output relation can arise with simple network topologies including coherent and incoherent feed-forward loops. Expand
Compensatory ability to null mutation in metabolic networks
TLDR
Analyzing more than 800 organism's metabolic networks suggests that the reactions with larger impact degrees are likely essential and the universal reactions should also be essential, and shows that scale‐free feature and reaction reversibility contribute to the robustness in metabolic networks. Expand
Hypergraph Learning with Line Expansion
TLDR
By reducing the hypergraph to a simple graph, the proposed line expansion makes existing graph learning algorithms compatible with the higher-order structure and has been proven as a unifying framework for various hypergraph expansions. Expand
A generalized configuration model with degree correlations and its percolation analysis
TLDR
A generalization of the classical configuration model, where the stubs in the configuration model are partitioned into b blocks of equal sizes and a permutation function h is chosen, it is shown that the Pearson degree correlation function is linear in q for any fixed b. Expand

References

Random Graphs