اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLexical growth, entropy and the benefits of networking
109
0
0.0
(
0
)
تأليف
Robert Shour
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
If each node of an idealized network has an equal capacity to efficiently exchange benefits, then the networks capacity to use energy is scaled by the average amount of energy required to connect any two of its nodes. The scaling factor equals textit{e}, and the networks entropy is $ln(n)$. Networking emerges in consequence of nodes minimizing the ratio of their energy use to the benefits obtained for such use, and their connectability. Networking leads to nested hierarchical clustering, which multiplies a networks capacity to use its energy to benefit its nodes. Network entropy multiplies a nodes capacity. For a real network in which the nodes have the capacity to exchange benefits, network entropy may be estimated as $C log_L(n)$, where the base of the log is the path length $L$, and $C$ is the clustering coefficient. Since $n$, $L$ and $C$ can be calculated for real networks, network entropy for real networks can be calculated and can reveal aspects of emergence and also of economic, biological, conceptual and other networks, such as the relationship between rates of lexical growth and divergence, and the economic benefit of adding customers to a commercial communications network. textit{Entropy dating} can help estimate the age of network processes, such as the growth of hierarchical society and of language.
قيم البحث
اقرأ أيضاً
Mobile traffic is projected to increase 1000 times from 2010 to 2020. This poses significant challenges on the 5th generation (5G) wireless communication system design, including network structure, air interface, key transmission schemes, multiple ac
cess, and duplexing schemes. In this paper, full duplex networking issues are discussed, aiming to provide some insights on the design and possible future deployment for 5G. Particularly, the interference scenarios in full duplex are analyzed, followed by discussions on several candidate interference mitigation approaches, interference proof frame structures, transceiver structures for channel reciprocity recovery, and super full duplex base station where each sector operates in time division duplex (TDD) mode. The extension of TDD and frequency division duplex (FDD) to full duplex is also examined. It is anticipated that with future standardization and deployment of full duplex systems, TDD and FDD will be harmoniously integrated, supporting all the existing half duplex mobile phones efficiently, and leading to a substantially enhanced 5G system performance.
Degraded K-user broadcast channels (BC) are studied when receivers are facilitated with cache memories. Lower and upper bounds are derived on the capacity-memory tradeoff, i.e., on the largest rate of reliable communication over the BC as a function
of the receivers cache sizes, and the bounds are shown to match for some special cases. The lower bounds are achieved by two new coding schemes that benefit from non-uniform cache assignment. Lower and upper bounds are also established on the global capacity-memory tradeoff, i.e., on the largest capacity-memory tradeoff that can be attained by optimizing the receivers cache sizes subject to a total cache memory budget. The bounds coincide when the total cache memory budget is sufficiently small or sufficiently large, characterized in terms of the BC statistics. For small cache memories, it is optimal to assign all the cache memory to the weakest receiver. In this regime, the global capacity-memory tradeoff grows as the total cache memory budget divided by the number of files in the system. In other words, a perfect global caching gain is achievable in this regime and the performance corresponds to a system where all cache contents in the network are available to all receivers. For large cache memories, it is optimal to assign a positive cache memory to every receiver such that the weaker receivers are assigned larger cache memories compared to the stronger receivers. In this regime, the growth rate of the global capacity-memory tradeoff is further divided by the number of users, which corresponds to a local caching gain. Numerical indicate suggest that a uniform cache-assignment of the total cache memory is suboptimal in all regimes unless the BC is completely symmetric. For erasure BCs, this claim is proved analytically in the regime of small cache-sizes.
We introduce an axiomatic approach to entropies and relative entropies that relies only on minimal information-theoretic axioms, namely monotonicity under mixing and data-processing as well as additivity for product distributions. We find that these
axioms induce sufficient structure to establish continuity in the interior of the probability simplex and meaningful upper and lower bounds, e.g., we find that every relative entropy must lie between the Renyi divergences of order $0$ and $infty$. We further show simple conditions for positive definiteness of such relative entropies and a characterisation in term of a variant of relative trumping. Our main result is a one-to-one correspondence between entropies and relative entropies.
Using a sharp version of the reverse Young inequality, and a Renyi entropy comparison result due to Fradelizi, Madiman, and Wang, the authors are able to derive Renyi entropy power inequalities for log-concave random vectors when Renyi parameters bel
ong to $(0,1)$. Furthermore, the estimates are shown to be sharp up to absolute constants.
In this work, we study coded placement in caching systems where the users have unequal cache sizes and demonstrate its performance advantage. In particular, we propose a caching scheme with coded placement for three-user systems that outperforms the
best caching scheme with uncoded placement. In our proposed scheme, users cache both uncoded and coded pieces of the files, and the coded pieces at the users with large memories are decoded using the unicast/multicast signals intended to serve users with smaller memories. Furthermore, we extend the proposed scheme to larger systems and show the reduction in delivery load with coded placement compared to uncoded placement.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
