Related papers: Scaling in Local Optimal Paths Cracks
Consider a computer network that consists of a path with $n$ nodes. The nodes are labeled with inputs from a constant-sized set, and the task is to find output labels from a constant-sized set subject to some local constraints---more…
Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion. Routing becomes increasingly more difficult as the number of selected…
We investigate numerically the Self Organized Criticality (SOC) properties of the dissipative Olami-Feder-Christensen model on small-world and scale-free networks. We find that the small-world OFC model exhibits self-organized criticality.…
Cascading breakdowns of real networks are severe accidents in recent years, such as the blackouts of the power transportation networks in North America. In this paper, we study the effects of geographical structure on the cascading…
We introduce an optimum principle for a vehicular traffic network with road bottlenecks. This network breakdown minimization (BM) principle states that the network optimum is reached, when link flow rates are assigned in the network in such…
We study the propagation of cascading failures in complex supply networks with a focus on nonlocal effects occurring far away from the initial failure. It is shown that a high clustering and a small average path length of a network…
It has recently been shown that the expected energy requirements of a control action applied to a complex network scales exponentially with the number of nodes that are targeted. While the exponential scaling law provides an adequate…
The convergence performance of distributed optimization algorithms is of significant importance to solve optimal power flow (OPF) in a distributed fashion. In this paper, we aim to provide some insights on how to partition a power system to…
Locally Checkable Labeling (LCL) problems are graph problems in which a solution is correct if it satisfies some given constraints in the local neighborhood of each node. Example problems in this class include maximal matching, maximal…
Small-world networks, known for high local clustering and short path lengths, are a fundamental structure in many real-world systems, including social, biological, and technological networks. We apply the theory of (marked) local…
Predicting the growth of large cracks in brittle materials is a fundamental unresolved problem in fracture mechanics. Under out-of-plane shear loading, an initially planar crack may fragment into multiple cracks, forming an echelon crack…
A new model about cascading occurrences caused by perturbation is established to search after the mechanism because of which catastrophes in networks occur. We investigate the avalanche dynamics of our model on 2-dimension Euclidean…
Metcalfe's Law captures the relationship between the value of a network and its scale, asserting that a network's value is directly proportional to the square of its size. Over the past four decades, various researchers have proposed…
We introduce a scalable searching algorithm for finding nodes and contents in random networks with Power-Law (PL) and heavy-tailed degree distributions. The network is searched using a probabilistic broadcast algorithm, where a query…
In this letter, we propose a new routing strategy with a single free parameter $\alpha$ only based on local information of network topology. In order to maximize the packets handling capacity of underlying structure that can be measured by…
Wireless information-centric networks consider storage as one of the network primitives, and propose to cache data within the network in order to improve latency and reduce bandwidth consumption. We study the throughput capacity and delay…
Communication networks, power grids, and transportation networks are all examples of networks whose performance depends on reliable connectivity of their underlying network components even in the presence of usual network dynamics due to…
Performance of standard processes over large distributed networks typically scales with the size of the network. For example, in planar topologies where nodes communicate with their natural neighbors, the scaling factor is $O(n)$, where $n$…
We investigate the behavior of extended urban traffic networks within the framework of percolation theory by using real and synthetic traffic data. Our main focus shifts from the statistical properties of the cluster size distribution…
Constrained Optimum Path (COP) problems appear in many real-life applications, especially on communication networks. Some of these problems have been considered and solved by specific techniques which are usually difficult to extend. In…