Related papers: Understanding edge-connectivity in the Internet th…
In this paper, we study the crucial elements of complex networks, namely nodes, and edges and their properties such as their community structure, which play an important role in dictating the robustness of the network towards structural…
Network communication using the Internet Protocol (IP) is a pillar of modern Internet applications. IP allows data packets to travel the world through a complex set of interconnected computer networks managed by different operators. How…
Communities in networks are commonly considered as highly cohesive subgraphs which are well separated from the rest of the network. However, cohesion and separation often cannot be maximized at the same time, which is why a compromise is…
While studies of meso-scale structures in networks often focus on community structure, core--periphery structures can reveal new insights. This structure typically consists of a well-connected core and a periphery that is well connected to…
We uncover the global organization of clustering in real complex networks. As it happens with other fundamental properties of networks such as the degree distribution, we find that real networks are neither completely random nor ordered…
We study the spectral properties of a diffusion process taking place on the Internet network focusing on the slowest decaying modes. These modes allow us to identify an underlying modular structure of the Internet roughly corresponding to…
Our aim here is to address the problem of decomposing a whole network into a minimal number of ego-centered subnetworks. For this purpose, the network egos are picked out as the members of a minimum dominating set of the network. However,…
Broadband communications consists of the technologies and equipment required to deliver packet-based digital voice, video, and data services to end users. Broadband affords end users high-speed, always-on access to the Internet while…
Passive network tomography uses end-to-end observations of network communication to characterize the network, for instance to estimate the network topology and to localize random or adversarial glitches. Under the setting of linear network…
Network tomography aims at inferring internal network characteristics based on measurements at the edge of the network. In loss tomography, in particular, the characteristic of interest is the loss rate of individual links and multicast…
Traditional methods for crawling and parsing web applications predominantly rely on extracting hyperlinks from initial pages and recursively following linked resources. This approach constructs a graph where nodes represent unstructured…
Routing optimization is a relevant problem in many contexts. Solving directly this type of optimization problem is often computationally unfeasible. Recent studies suggest that one can instead turn this problem into one of solving a…
In transportation, communication, social and other real complex networks, some critical edges act a pivotal part in controlling the flow of information and maintaining the integrity of the structure. Due to the importance of critical edges…
Decompositions of networks are useful not only for structural exploration. They also have implications and use in analysis and computational solution of processes (such as the Ising model, percolation, SIR model) running on a given network.…
This work introduces a novel algorithm for finding the connected components of a graph where the vertices and edges are grouped into sets defining a Set--Based Graph. The algorithm, under certain restrictions on those sets, has the…
This paper studies the relation between node deletion and algebraic connectivity for graphs with a hierarchical structure represented by layers. To capture this structure, the concepts of layered path graph and its (sub)graph cone are…
Finding the dense regions in a graph is an important problem in network analysis. Core decomposition and truss decomposition address this problem from two different perspectives. The former is a vertex-driven approach that assigns density…
An infrastructure network is a self-organizing network with help of Access Point (AP) of wireless links connecting nodes to another. The nodes can communicate without an ad hoc. They form an uninformed topology (BSS/ESS), where the nodes…
Core decomposition is a fundamental graph problem with a large number of applications. Most existing approaches for core decomposition assume that the graph is kept in memory of a machine. Nevertheless, many real-world graphs are big and…
The Quantum Internet, by enabling quantum communications among remote quantum nodes, is a network capable of supporting functionalities with no direct counterpart in the classical world. Indeed, with the network and communications…