Related papers: Optimal Path and Minimal Spanning Trees in Random …
A Barab\'asi-Albert scale-free network is constructed whose nodes are the Poisson distributed random points within a unit square and links are the straight line connections among the nodes. The cost function, which is the total wiring…
The concept of network efficiency, recently proposed to characterize the properties of small-world networks, is here used to study the effects of errors and attacks on scale-free networks. Two different kinds of scale-free networks, i.e.…
Given a set of terminals in 2D/3D, the network with the shortest total length that connects all terminals is a Steiner tree. On the other hand, with enough budget, every terminal can be connected to every other terminals via a straight…
Since its recent introduction, the small-world effect has been identified in several important real-world systems. Frequently, it is a consequence of the existence of a few long-range connections, which dominate the original regular…
Large networked systems are constantly exposed to local damages and failures that can alter their functionality. The knowledge of the structure of these systems is however often derived through sampling strategies whose effectiveness at…
Querying the shortest path between two vertexes is a fundamental operation in a variety of applications, which has been extensively studied over static road networks. However, in reality, the travel costs of road segments evolve over time,…
We present a bipartite network model that captures intermediate stages of optimization by blending the Maximum Entropy approach with Optimal Transport. In this framework, the network's constraints define the total mass each node can supply…
Several fundamental properties of real complex networks, such as the small-world effect, the scale-free degree distribution, and recently discovered topological fractal structure, have presented the possibility of a unique growth mechanism…
We construct small-world spring networks based on a one dimensional chain and study its static and quasistatic behavior with respect to external forces. Regular bonds and shortcuts are assigned linear springs of constant $k$ and $k'$,…
This article constructs the residual network after some regions were damaged and detached from the original crystal network. This residual crystal network simulates the situation where parts of a computer system or power system failed after…
We give exact relations which are valid for small-world networks (SWN's) with a general `degree distribution', i.e the distribution of nearest-neighbor connections. For the original SWN model, we illustrate how these exact relations can be…
Quantifying the contributions, or weights, of comparisons or single studies to the estimates in a network meta-analysis (NMA) is an active area of research. We extend this to the contributions of paths to NMA estimates. We present a general…
Watts and Strogatz [Nature 393, 440 (1998)] have recently introduced a model for disordered networks and reported that, even for very small values of the disorder $p$ in the links, the network behaves as a small-world. Here, we test the…
A network is scale-free if its connectivity density function is proportional to a power-law distribution. Scale-free networks may provide an explanation for the robustness observed in certain physical and biological phenomena, since the…
Preferential attachment is the most popular explanation for the emergence of scaling behavior in the World Wide Web, but this explanation has been challenged by the global information hypothesis, the existence of linear preference and the…
It has recently been shown that the average energy required to control a subset of nodes in a complex network scales exponentially with the cardinality of the subset. While the mean scales exponentially, the variance of the control energy…
Bounded-angle (minimum) spanning trees were first introduced in the context of wireless networks with directional antennas. They are reminiscent of bounded-degree spanning trees, which have received significant attention. Let $P =…
The micro-structure of the giant component of the Erd{\H o}s-R\'enyi network and other configuration model networks is analyzed using generating function methods. While configuration model networks are uncorrelated, the giant component…
We show how one can trace in a systematic way the coarse-grained solutions of individual-based stochastic epidemic models evolving on heterogeneous complex networks with respect to their topological characteristics. In particular, we have…
Given an undirected, weighted graph, the minimum spanning tree (MST) is a tree that connects all of the vertices of the graph with minimum sum of edge weights. In real world applications, network designers often seek to quickly find a…