‘Clumpiness’ mixing in complex networks

  title={‘Clumpiness’ mixing in complex networks},
  author={Ernesto Estrada and Naomichi Hatano and Amauri Guti{\'e}rrez},
  journal={Journal of Statistical Mechanics: Theory and Experiment},
Three measures of clumpiness of complex networks are introduced. The measures quantify how most central nodes of a network are clumped together. The assortativity coefficient defined in a previous study measures a similar characteristic, but accounts only for the clumpiness of the central nodes that are directly connected to each other. The clumpiness coefficient defined in the present paper also takes into account the cases where central nodes are separated by a few links. The definition is… 

Higher order assortativity in complex networks

Conformity: A Path-Aware Homophily Measure for Node-Attributed Networks

A novel measure, namely Conformity, designed to provide a node-centric quantification of assortative mixing patterns, allowing for a more detailed evaluation of the impact that nodes at different degrees of separations have on the homophilic embeddedness of a target.

Using network centrality measures to manage landscape connectivity.

  • Ernesto EstradaO. Bodin
  • Environmental Science
    Ecological applications : a publication of the Ecological Society of America
  • 2008
It is found that centrality depends on the way the graph-theoretical model of habitat patches is constructed, although even the simplest network representation, not taking strength and directionality of potential organisms flows into account, still provides a coarse-grained assessment of the most important patches according to their contribution to landscape connectivity.

CD-Based Indices for Link Prediction in Complex Network

Improve and refine CD index, referred as CDI index, is improved and refine, combining the advantages of CD index and evolutionary mechanism of the network model BA, and Experimental results reveal thatCDI index can increase prediction accuracy of CD on negative assortative networks.

Intuitive planning: global navigation through cognitive maps based on grid-like codes

It is shown that grid cells resemble the eigenvectors of the relationship between place cells and can be learnt from local inputs and contain not only local information but also global knowledge that can provide both distributions over future states and a global distance measure encoding approximate distances between every object in the world.

Measuring attitudes as a complex system Structured thinking and support for the Canadian carbon tax

Evidence is found that the emotional but not the structural properties significantly predict individuals' attitudes toward the carbon tax, which provides preliminary evidence for the efficacy of CAMs as a tool for studying political attitudes.

Dominating scale-free networks with variable scaling exponent: heterogeneous networks are not difficult to control

This work addresses complex network controllability from the perspective of the minimum dominating set (MDS) and shows that the more heterogeneous a network degree distribution is, the easier it is to control the entire system.

Disordered proteins and network disorder in network descriptions of protein structure, dynamics and function: hypotheses and a comprehensive review.

It is proposed that disordered protein regions evolved to help other protein segments reach 'rarely visited' but functionally-related states and to show the role of disorder in 'spatial games' of amino acids.



Food-web structure and network theory: The role of connectance and size

It is demonstrated that although some food webs have small-world and scale-free structure, most do not if they exceed a relatively low level of connectance, and a continuum of real-world networks including food webs whose ratios of observed to random clustering coefficients increase as a power–law function of network size over 7 orders of magnitude is identified.

Assortative mixing in networks.

  • M. Newman
  • Computer Science
    Physical review letters
  • 2002
This work proposes a model of an assortatively mixed network and finds that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.

Subgraph centrality in complex networks.

A new centrality measure that characterizes the participation of each node in all subgraphs in a network, C(S)(i), which is better able to discriminate the nodes of a network than alternate measures such as degree, closeness, betweenness, and eigenvector centralities.

Communicability in complex networks.

A new measure of the communicability of a complex network is proposed, which is a broad generalization of the concept of the shortest path and able to distinguish finer structures of networks, such as communities into which a network is divided.

Epidemic spreading in scale-free networks with community structure

It is found that networks with strong community structure are helpful for reducing the danger brought by epidemic prevalence in the network, which is shown by the comparison results of the prevalence scale, the variability ofThe prevalence scale and the average degree of new infected nodes at each time step.

Characterization of complex networks: A survey of measurements

This article presents a survey of measurements capable of expressing the most relevant topological features of complex networks and includes general considerations about complex network characterization, a brief review of the principal models, and the presentation of the main existing measurements.

Spectral scaling and good expansion properties in complex networks

The existence of a scaling between the principal eigenvector and the subgraph centrality of a complex network indicates that the network has "good expansion" (GE) properties. GE is the important but

Evolution of networks

The recent rapid progress in the statistical physics of evolving networks is reviewed, and how growing networks self-organize into scale-free structures is discussed, and the role of the mechanism of preferential linking is investigated.