A common definition of a robust connection between two nodes in a network such as a communication network is that there should be at least two independent paths connecting them, so that the failure of no single node in the network causes them to become disconnected. This definition leads us naturally to consider bicomponents, subnetworks in which every node has a robust connection of this kind to every other. Here we study bicomponents in both real and model networks using a combination of exact analytic techniques and numerical methods. We show that standard network models predict there to be essentially no small bicomponents in most networks, but there may be a giant bicomponent, whose presence coincides with the presence of the ordinary giant component, and we find that real networks seem by and large to follow this pattern, although there are some interesting exceptions. We study the size of the giant bicomponent as nodes in the network fail, using a specially developed computer algorithm based on data trees, and find in some cases that our networks are quite robust to failure, with large bicomponents persisting until almost all vertices have been removed.
University of Barcelona(巴塞罗那大学);Universitat de les Illes Balears(巴利阿里群岛大学);University of Catania(卡塔尼亚大学);University of Padua(帕多瓦大学);Istituto Nazionale di Fisica Nucleare, Sez. Padova(意大利国家核物理研究所帕多瓦分部);University of Limerick(利默里克大学);City College of New York(纽约市立学院);University of Maribor(马里博尔大学);Kyung Hee University(庆熙大学);China Medical University Hospital, China Medical University(中国医科大学医院,中国医科大学)