Related papers: Link deletion in directed complex networks
We propose a natural model of evolving weighted networks in which new links are not necessarily connected to new nodes. The model allows a newly added link to connect directly two nodes already present in the network. This is plausible in…
While link prediction in networks has been a hot topic over the years, its robustness has not been well discussed in literature. In this paper, we study the robustness of some mainstream link prediction methods under various kinds of…
The lack of studying the complex organization of directed network usually limits to the understanding of underlying relationship between network structures and functions. Structural controllability and structural predictability, two…
In spite of a few attempts in understanding the dynamical robustness of complex networks, this extremely important subject of research is still in its dawn as compared to the other dynamical processes on networks. We hereby consider the…
Proteins are an important class of biomolecules that serve as essential building blocks of the cells. Their three-dimensional structures are responsible for their functions. In this thesis we have investigated the protein structures using a…
In social networks of human individuals, social relationships do not necessarily last forever as they can either fade gradually with time, resulting in link aging, or terminate abruptly, causing link deletion, as even old friendships may…
In the understanding of important edges in complex networks, the edges with larger degree are naturally considered more important, and they will cause greater destructiveness when attacked. However, through simulation analysis, we conclude…
Adversarial robustness has received increasing attention along with the study of adversarial examples. So far, existing works show that robust models not only obtain robustness against various adversarial attacks but also boost the…
A growing family of random graphs is called robust if it retains a giant component after percolation with arbitrary positive retention probability. We study robustness for graphs, in which new vertices are given a spatial position on the…
Two different types of directed networks are investigated, transcriptional regulation networks and neural networks. The directed network structure are studied and also shown to reflect the different processes taking place on the networks.…
It was recently found that cascading failures can cause the abrupt breakdown of a system of interdependent networks. Using the percolation method developed for single clustered networks by Newman [Phys. Rev. Lett. {\bf 103}, 058701 (2009)],…
From the proliferative mechanisms generating neurons from progenitor cells to neuron migration and synaptic connection formation, several vicissitudes culminate in the mature brain. Both component loss and gain remain ubiquitous during…
We study network configurations that provide optimal robustness to random breakdowns for networks with a given number of nodes $N$ and a given cost--which we take as the average number of connections per node $\kav$. We find that the…
In this paper, we numerically investigate the robustness of cooperation clusters in prisoner's dilemma played on scale-free networks, where the network topologies change by continuous removal and addition of nodes. Each removal and addition…
Great part of the interest in complex networks has been motivated by the presence of structured, frequently non-uniform, connectivity. Because diverse connectivity patterns tend to result in distinct network dynamics, and also because they…
Strengthening or destroying a network is a very important issue in designing resilient networks or in planning attacks against networks including planning strategies to immunize a network against diseases, viruses etc.. Here we develop a…
Most real complex networks -- such as protein interactions, social contacts, the internet -- are only partially known and available to us. While the process of exploring such networks in many cases resembles a random walk, it becomes a key…
The feed-forward relationship naturally observed in time-dependent processes and in a diverse number of real systems -such as some food-webs and electronic and neural wiring- can be described in terms of so-called directed acyclic graphs…
We study cyber security issues in networked control of a linear dynamical system. Specifically, the dynamical system and the controller are assumed to be connected through a communication channel that face malicious attacks as well as…
Complex networks grow subject to structural constraints which affect their measurable properties. Assessing the effect that such constraints impose on their observables is thus a crucial aspect to be taken into account in their analysis. To…