相关论文: Enhancing multiplex global efficiency
In this paper, we study information transport in multiplex networks comprised of two coupled subnetworks. The upper subnetwork, called the logical layer, employs the shortest paths protocol to determine the logical paths for packets…
Many systems in nature, society and technology can be described as networks, where the vertices are the system's elements and edges between vertices indicate the interactions between the corresponding elements. Edges may be weighted if the…
This paper studies reduced-order modeling of dynamic networks with strongly connected topology. Given a graph clustering of an original complex network, we construct a quotient graph with less number of vertices, where the edge weights are…
This paper proposes and analyzes a communication-efficient distributed optimization framework for general nonconvex nonsmooth signal processing and machine learning problems under an asynchronous protocol. At each iteration, worker machines…
We study a model of information spreading on multiplex networks, in which agents interact through multiple interaction channels (layers), say online vs.\ offline communication layers, subject to layer-switching cost for transmissions across…
In a multiplex network, a set of nodes is connected by different types of interactions, each represented as a separate layer within the network. Multiplexes have emerged as a key instrument for modeling large-scale complex systems, due to…
Random walks constitute a fundamental mechanism for many dynamics taking place on complex networks. Besides, as a more realistic description of our society, multiplex networks have been receiving a growing interest, as well as the dynamical…
In several important routing contexts it is required to identify a set of routes, each of which optimizes a different criterion. For instance, in the context of vehicle routing, one route would minimize the total distance traveled, while…
An added edge to a graph is called an inset edge. Predicting k inset edges which minimize the average distance of a graph is known to be NP-Hard. When k = 1 the complexity of the problem is polynomial. In this paper, we further find the…
l. Introduction Modern network are multi-layer by their structure. This requires the development of new mathematical models, which would allow to adequately describe the existing physical and logical connections between the elements on its…
Network robustness is a central point in network science, both from a theoretical and a practical point of view. In this paper, we show that layer degradation, understood as the continuous or discrete loss of links' weight, triggers a…
Complex networks can be understood as graphs whose connectivity deviates from those of regular or near-regular graphs, which are understood as being `simple'. While a great deal of the attention so far dedicated to complex networks has been…
The general communication tree embedding problem is the problem of mapping a set of communicating terminals, represented by a graph G, into the set of vertices of some physical network represented by a tree T. In the case where the vertices…
The evolutionary processes of complex systems contain critical information regarding their functional characteristics. The generation time of edges provides insights into the historical evolution of various networked complex systems, such…
Convex optimization is an essential tool for modern data analysis, as it provides a framework to formulate and solve many problems in machine learning and data mining. However, general convex optimization solvers do not scale well, and…
The minimal number of nodes required to multilaterate a network endowed with geodesic distance (i.e., to uniquely identify all nodes based on shortest path distances to the selected nodes) is called its metric dimension. This quantity is…
Structure inference is an important task for network data processing and analysis in data science. In recent years, quite a few approaches have been developed to learn the graph structure underlying a set of observations captured in a data…
The devices designed for the Internet-of-Things encompass a large variety of distinct processor architectures, forming a highly heterogeneous zoo. In order to tackle this, we employ a simulator to estimate the performance of the…
This paper proposes and illustrates a general framework to integrate the areas of vision research and complex networks. Each image pixel is associated to a network node and the Euclidean distance between the visual properties (e.g.…
Real-world multi-layer networks feature nontrivial dependencies among links of different layers. Here we argue that, if links are directed, dependencies are twofold. Besides the ordinary tendency of links of different layers to align as the…