Related papers: New Model of Internet Topology Using k-shell Decom…
Finding a smallest subgraph that is k-edge-connected, or augmenting a k-edge-connected graph with a smallest subset of given candidate edges to become (k+1)-edge-connected, are among the most fundamental Network Design problems. They are…
Most complex systems can be captured by graphs or networks. Networks connect nodes (e.g.\ neurons) through edges (synapses), thus summarizing the system's structure. A popular way of interrogating graphs is community detection, which…
The fractal nature of graphs has traditionally been investigated by using the nodes of networks as the basic units. Here, instead, we propose to concentrate on the graph edges, and introduce a practical and computationally not demanding…
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical…
In the analysis of large-scale network data, a fundamental operation is the comparison of observed phenomena to the predictions provided by null models: when we find an interesting structure in a family of real networks, it is important to…
We analytically explore the scaling properties of a general class of nested subgraphs in complex networks, which includes the $K$-core and the $K$-scaffold, among others. We name such class of subgraphs $K$-nested subgraphs due to the fact…
The pivotal quality of proximity graphs is connectivity, i.e. all nodes in the graph are connected to one another either directly or via intermediate nodes. These types of graphs are robust, i.e., they are able to function well even if they…
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.…
We present a novel neural network architecture, US-Net, for robust nuclei instance segmentation in histopathology images. The proposed framework integrates the nuclei detection and segmentation networks by sharing their outputs through the…
Future quantum internet relies on large-scale entanglement distribution. Quantum decoherence is a significant obstacle in large-scale networks, which otherwise perform better with multiple paths between the source and destination. We…
This article provides a taxonomy of current and past network modeling efforts. In all these efforts over the last few years we see a trend towards not only describing the network, but connected devices as well. This is especially current…
The structural complexity of soft gels is at the origin of a versatile mechanical response that allows for large deformations, controlled elastic recovery and toughness in the same material. A limit to exploiting the potential of such…
We explore the geometry of complex networks in terms of an n-dimensional Euclidean embedding represented by the Moore-Penrose pseudo-inverse of the graph Laplacian $(\bb L^+)$. The squared distance of a node $i$ to the origin in this…
This article presents an analysis of the structural resilience of a fragment of Internet topology against both targeted and random attacks, based on empirical data obtained from the iThena project. Using a processed visualization of the…
The discovery of small world and scale free properties of many real world networks has revolutionized the way we study, analyze, model and process networks. An important way to analyze these complex networks is to visualize them using graph…
Given a set of k networks, possibly with different sizes and no overlaps in nodes or edges, how can we quickly assess similarity between them, without solving the node-correspondence problem? Analogously, how can we extract a small number…
Recent study shows that the accuracy of the k-shell method in determining node coreness in a spreading process is largely impacted due to the existence of core-like group, which has a large k-shell index but a low spreading efficiency.…
Modeling distributed computing in a way enabling the use of formal methods is a challenge that has been approached from different angles, among which two techniques emerged at the turn of the century: protocol complexes, and directed…
The structure of large networks can be revealed by partitioning them to smaller parts, which are easier to handle. One of such decompositions is based on $k$--cores, proposed in 1983 by Seidman. In the paper an efficient, $O(m)$, $m$ is the…
Research on the robustness of the Internet has gained critical importance in the last decades because more and more individuals, societies and firms rely on this global network infrastructure for communication, knowledge transfer, business…