Residual closeness in networks

Physica A Statistical Mechanics and its ApplicationsPublished 19 January 2006

Chavdar Dangalchev

DOI10.1016/j.physa.2005.12.020

Source URL

Citations232

SJR quartileQ2

SJR score0.67

SNIP1.08

TL;DR

A new characteristic (residual closeness) which can measure the network resistance is presented, which is more sensitive than the well-known measures of vulnerability and captures the result of actions even if they are small enough not to disconnect the graph.

Abstract

A new characteristic (residual closeness) which can measure the network resistance is presented. It evaluates closeness after removal of vertices or links, hence two types are considered—vertices and links residual closeness. This characteristic is more sensitive than the well-known measures of vulnerability—it captures the result of actions even if they are small enough not to disconnect the graph. A definition for closeness is modified so it still can be used for unconnected graphs but the calculations are easier.

Keywords

Computer ScienceMathematicsPhysics and Astronomy

NatureCollective dynamics of ‘small-world’ networks

43,160 Citations1998Duncan J. Watts, Steven H. Strogatz

Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.

Social NetworksCentrality in social networks conceptual clarification

16,883 Citations1978Linton C. Freeman

Three distinct intuitive conceptions of centrality are uncovered and existing measures are refined to embody these conceptions, one absolute and one relative measure of the centrality of positions in a network and one reflecting the degree of centralization of the entire network.

Physical Review LettersEfficient Behavior of Small-World Networks

5,151 Citations2001Vito Latora, Massimo Marchiori

It is shown that the underlying general principle of their construction is in fact a small-world principle of high efficiency, which gives a clear physical meaning to the concept of "small world," and also a precise quantitative analysis of both weighted and unweighted networks.

View PDF

Social NetworksA measure of betweenness centrality based on random walks

2,435 Citations2005M. E. J. Newman

A betweenness measure is proposed that relaxes this assumption that information spreads only along those shortest paths, including contributions from essentially all paths between nodes, not just the shortest, although it still gives more weight to short paths.

Physica A Statistical Mechanics and its ApplicationsMean-field theory for scale-free random networks

2,251 Citations1999Albert-Ĺaszló Barabási, Réka Albert +1 more

A mean-field method is developed to predict the growth dynamics of the individual vertices of the scale-free model, and this is used to calculate analytically the connectivity distribution and the scaling exponents.

View PDF

Discrete MathematicsTough graphs and hamiltonian circuits

617 Citations1973Vašek Chvátal

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsEvolution of networks with aging of sites

437 Citations2000S. N. Dorogovt︠s︡ev, J. F. F. Mendes

It is found both from simulation and analytically that the network shows scaling behavior only in the region alpha<1, when alpha increases from -infinity to 0, and the exponent gamma of the distribution of connectivities grows from 2 to the value for the network without aging.

View PDF

Journal of Combinatorial Theory Series BOn a class of posets and the corresponding comparability graphs

237 Citations1978H. A. Jung

The comparability graphs of multitrees are characterized and studied with respect to minimal path coverings to generalized to the notion of a multitree.

Journal of Combinatorial Theory Series BThe binding number of a graph and its Anderson number

225 Citations1973Douglas R. Woodall

Physica A Statistical Mechanics and its ApplicationsGeneration models for scale-free networks

68 Citations2004Chavdar Dangalchev

In this article stochastic models leading to scale-free network are considered and a model close to them is proposed and a characteristic of graphs, which could be used for determining the scale- free topology of networks, is suggested.

View PDF