English
Related papers

Related papers: On proportional network connectivity

200 papers

Reliable spanners can withstand huge failures, even when a linear number of vertices are deleted from the network. In case of failures, a reliable spanner may have some additional vertices for which the spanner property no longer holds, but…

Computational Geometry · Computer Science 2022-04-25 Kevin Buchin , Sariel Har-Peled , Daniel Olah

From the perspective of network analysis, the ubiquitous networks are comprised of regular and irregular components, which makes uncovering the complexity of network structures to be a fundamental challenge. Exploring the regular…

Social and Information Networks · Computer Science 2018-08-30 Tao Wu , Shaojie Qiao , Xingping Xian , Xi-Zhao Wang , Wei Wang , Yanbing Liu

We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges. Each edge appears in the network with its associated…

Combinatorics · Mathematics 2019-03-20 Amir Kafshdar Goharshady , Fatemeh Mohammadi

Robustness of network of networks (NON) has been studied only for dependency coupling (J.X. Gao et. al., Nature Physics, 2012) and only for connectivity coupling (E.A. Leicht and R.M. D Souza, arxiv:0907.0894). The case of network of n…

Physics and Society · Physics 2013-10-22 Gaogao Dong , Lixin Tian , Ruijin Du , H. Eugene Stanley

We consider a network consisting of $n$ components (links or nodes) and assume that the network has two states, up and down. We further suppose that the network is subject to shocks that appear according to a counting process and that each…

Applications · Statistics 2015-07-16 S. Zarezadeh , S. Ashrafi , M. Asadi

Given a graph $G$ whose edges are perfectly reliable and whose nodes each operate independently with probability $p\in[0,1],$ the node reliability of $G$ is the probability that at least one node is operational and that the operational…

Combinatorics · Mathematics 2017-07-17 Jason Brown , Lucas Mol

Neural networks are very successful at detecting patterns in noisy data, and have become the technology of choice in many fields. However, their usefulness is hampered by their susceptibility to adversarial attacks. Recently, many methods…

Machine Learning · Computer Science 2022-07-14 Marco Casadio , Ekaterina Komendantskaya , Matthew L. Daggitt , Wen Kokke , Guy Katz , Guy Amir , Idan Refaeli

Link prediction is one of the fundamental problems in network analysis. In many applications, notably in genetics, a partially observed network may not contain any negative examples of absent edges, which creates a difficulty for many…

Machine Learning · Statistics 2013-01-30 Yunpeng Zhao , Elizaveta Levina , Ji Zhu

Achieving connectivity reliability is one of the significant challenges for 5G and beyond 5G cellular networks. The present understanding of reliability in the context of mobile communication does not adequately cover the stochastic…

Networking and Internet Architecture · Computer Science 2024-09-04 Subhyal Bin Iqbal , Behnam Khodapanah , Philipp Schulz , Gerhard P. Fettweis

Just as a herd of animals relies on its robust social structure to survive in the wild, similarly robustness is a crucial characteristic for the survival of a complex network under attack. The capacity to measure robustness in complex…

Networking and Internet Architecture · Computer Science 2008-11-27 Ali Sydney , Caterina Scoglio , Phillip Schumm , Robert Kooij

Power lines, roadways, pipelines and other physical infrastructure are critical to modern society. These structures may be viewed as spatial networks where geographic distances play a role in the functionality and construction cost of…

Physics and Society · Physics 2015-06-03 Thomas C. McAndrew , Christopher M. Danforth , James P. Bagrow

The connectivity of a graph is an important parameter to evaluate its reliability. $k$-restricted connectivity (resp. $R^h$-restricted connectivity) of a graph $G$ is the minimum cardinality of a set $S$ of vertices in $G$, if exists, whose…

Computational Complexity · Computer Science 2026-01-15 Huazhong Lü , Tingzeng Wu

n the $k$-diameter component connectivity model a network is consider operational if there is a component with diameter at least $k$. Therefore, a network is in a failure state if every component has diameter less than $k$. In this paper we…

Combinatorics · Mathematics 2021-11-09 Adam Buzzard , Nathan Shank

Metros (heavy rail transit systems) are integral parts of urban transportation systems. Failures in their operations can have serious impacts on urban mobility, and measuring their robustness is therefore critical. Moreover, as physical…

Physics and Society · Physics 2015-05-27 Xiangrong Wang , Yakup Koç , Sybil Derrible , Sk Nasir Ahmad , Robert E. Kooij

The links of a physical network cannot cross, which often forces the network layout into non-optimal entangled states. Here we define a network fabric as a two-dimensional projection of a network and propose the average crossing number as a…

Disordered Systems and Neural Networks · Physics 2024-03-05 Cory Glover , Albert-László Barabási

Random K-out graphs are garnering interest in designing distributed systems including secure sensor networks, anonymous crypto-currency networks, and differentially-private decentralized learning. In these security-critical applications, it…

Information Theory · Computer Science 2023-11-07 Eray Can Elumar , Mansi Sood , Osman Yağan

Networks are known to be prone to link failures. In this paper we set out to investigate how networks of varying connectivity patterns respond to different link failure schemes in terms of connectivity, clustering coefficient and shortest…

Physics and Society · Physics 2016-08-14 Serdar Çolak , Hilmi Luş , Ali Rana Atılgan

In this paper, we study crucial elements of a complex network, namely its nodes and connections, which play a key role in maintaining the network's structure and function under unexpected structural perturbations of nodes and edges removal.…

Social and Information Networks · Computer Science 2017-02-07 Hung T. Nguyen , Nam P. Nguyen , Tam Vu , Huan X. Hoang , Thang N. Dinh

We introduce the concept of natural connectivity as a robustness measure of complex networks. The natural connectivity has a clear physical meaning and a simple mathematical formulation. It characterizes the redundancy of alternative paths…

Statistical Mechanics · Physics 2008-02-20 Jun Wu , Yue-Jin Tan , Hong-Zhong Deng , Yong Li , Bin Liu , Xin Lv

We analyze the stability of the network's giant connected component under impact of adverse events, which we model through the link percolation. Specifically, we quantify the extent to which the largest connected component of a network…