نتایج جستجو برای: renyi inequality
تعداد نتایج: 57804 فیلتر نتایج به سال:
This paper introduced a new life time data analysis distribution name three parameters quasi gamma discussed about its some properties including moment generating function, rth origin and mean, mean deviations, reliability measurements, Bonferroni Lorenz curve, Order statistics, Renyi entropy, also maximum likelihood method real-life applications.
in order to estimate the effects of the macrc~econornic indicators on the income distribution of iran, the time series data during the period of 1971-1991 were used. first the yammetric inequality indicators (the gini coefficients) were estimated for the years 1991-1972. the results show the lowest level of inequality in 1980 with g=0.42 and the highest level in 1982 with g=0.55. arzulysing the...
equitable distribution of income and economic growth are challenges for policy-makers. therefore, it is important to investigate the influencing factors of it. given that financial development is an important factor affecting on income inequality, in this study, the effect of financial development on the gini coefficient as income inequality index is examined with using panel data methods durin...
We analyze random networks that change over time. First we analyze a dynamic Erdős-Renyi model, whose edges change over time. We describe its stationary distribution, its convergence thereto, and the SI contact process on the network, which has relevance for connectivity and the spread of infections. Second, we analyze the effect of node turnover, when nodes enter and leave the network, which h...
Abstract. In this article, we prove a local large deviation principle (LLDP) for the empirical locality measure of typed random networks on n nodes conditioned to have a given empirical type measure and empirical link measure. From the LLDP, we deduce a full large deviation principle for the typed random graph, and the classical Erdos-Renyi graphs, where nc/2 links are inserted at random among ...
We show that for sets with the Hausdorff–Besicovitch dimension equal zero the box counting algorithm commonly used to calculate Renyi exponents (dq) can exhibit perfect scaling suggesting non zero dq’s. Properties of these pathological sets (pseudofractals) are investigated. Numerical, as well as analytical estimates for dq’s are obtained. A simple indicator is given to distinguish pseudofracta...
Already in his Lectures on Search Renyi suggested to consider a search problem, where an unknown x ∈ X = {1, 2, . . . , n} is to be found by asking for containment in a minimal number m(n, k) of subsets A1, . . . , Am with the restrictions |Ai| ≤ k < n2 for i = 1, 2, . . . ,m. Katona gave in 1966 the lower bound m(n, k) ≥ log n h( k n) in terms of binary entropy and the upper bound m(n, k) ≤ ⌈
The concept of strongly balanced graph is introduced. It is shown that there exists a strongly balanced graph with u vertices and e edges if and only if I s u 1 s e s (2"). This result is applied to a classic question of Erdos and Renyi: What is the probability that a random graph on n vertices contains a given graph? A rooted version of this problem is also solved.
Assume in a sample of size M one finds M(i) representatives of species i with i = 1..N*. The normalized frequency pi* triple bond Mi/M, based on the finite sample, may deviate considerably from the true probabilities p(i). We propose a method to infer rank-ordered true probabilities r(i) from measured frequencies M(i). We show that the rank-ordered probabilities provide important informations o...
Detailed study of multifractal characteristics of the financial time series of asset values and of its returns is performed using a collection of the high frequency Deutsche Aktienindex data. The tail index (α), the Renyi exponents based on the box counting algorithm for the graph (dq) and the generalized Hurst exponents (Hq) are computed in parallel for short and daily return times. The result...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید