اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimization of Network Robustness to Random Breakdowns
94
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study network configurations that provide optimal robustness to random breakdowns for networks with a given number of nodes $N$ and a given cost--which we take as the average number of connections per node $kav$. We find that the network design that maximizes $f_c$, the fraction of nodes that are randomly removed before global connectivity is lost, consists of $q=[(kav-1)/sqrtkav]sqrt N$ high degree nodes (``hubs) of degree $sqrt{kav N}$ and $N-q$ nodes of degree 1. Also, we show that $1-f_c$ approaches 0 as $1/sqrt N$--faster than any other network configuration including scale-free networks. We offer a simple heuristic argument to explain our results.
قيم البحث
اقرأ أيضاً
Notes of the lectures delivered in Les Houches during the Summer School on Complex Systems (July 2006).
We report a cluster of results regarding the difficulty of finding approximate ground states to typical instances of the quantum satisfiability problem $k$-QSAT on large random graphs. As an approximation strategy, we optimize the solution space over
`classical product states, which in turn introduces a novel autonomous classical optimization problem, PSAT, over a space of continuous degrees of freedom rather than discrete bits. Our central results are: (i) The derivation of a set of bounds and approximations in various limits of the problem, several of which we believe may be amenable to a rigorous treatment. (ii) A demonstration that an approximation based on a greedy algorithm borrowed from the study of frustrated magnetism performs well over a wide range in parameter space, and its performance reflects structure of the solution space of random $k$-QSAT. Simulated annealing exhibits metastability in similar `hard regions of parameter space. (iii) A generalization of belief propagation algorithms introduced for classical problems to the case of continuous spins. This yields both approximate solutions, as well as insights into the free energy `landscape of the approximation problem, including a so-called dynamical transition near the satisfiability threshold. Taken together, these results allow us to elucidate the phase diagram of random $k$-QSAT in a two-dimensional energy-density--clause-density space.
We investigate the emergence of quantum scars in a general ensemble of random Hamiltonians (of which the PXP is a particular realization), that we refer to as quantum local random networks. We find two types of scars, that we call stochastic and stat
istical. We identify specific signatures of the localized nature of these eigenstates by analyzing a combination of indicators of quantum ergodicity and properties related to the network structure of the model. Within this parallelism, we associate the emergence of statistical scars to the presence of motifs in the network, that reflects how these are associated to links with anomalously small connectivity (as measured, e.g., by their betweenness). Most remarkably, statistical scars appear at well-defined values of energy, predicted solely on the base of network theory. We study the scaling of the number of statistical scars with system size: below a threshold connectivity, we find that the number of statistical scars increases with system size. This allows to the define the concept of statistical stability of quantum scars.
We analyze complex networks under random matrix theory framework. Particularly, we show that $Delta_3$ statistic, which gives information about the long range correlations among eigenvalues, provides a qualitative measure of randomness in networks. A
s networks deviate from the regular structure, $Delta_3$ follows random matrix prediction of linear behavior, in semi-logarithmic scale with the slope of $1/pi^2$, for the longer scale.
Empirical observations and theoretical studies indicate that the overall travel-time of vehicles in a traffic network can be optimized by means of ramp metering control systems. Here, we present an analysis of traffic data of the highway network of N
orth-Rhine-Westfalia in order to identify and characterize the sections of the network which limit the performance, i.e., the bottlenecks. It is clarified whether the bottlenecks are of topological nature or if they are constituted by on-ramps. This allows to judge possible optimization mechanisms and reveals in which areas of the network they have to be applied.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
