Simulating random variables using moment-generating functions and the saddlepoint approximation

When we are given only a transform such as the moment-generating function of a distribution, it is rare that we can efficiently simulate random variables. Possible approaches such as the inverse transform using numerical inversion of the transform are computationally very expensive. However, the saddlepoint approximation is known to be exact for the Normal, Gamma, and inverse Gaussian distribution and remarkably accurate for a large number of others. We explore the efficient use of the saddlepoint approximation for simulating distributions and provide three examples of the accuracy of these simulations.     

Missing value imputation method for disaster decision-making using K nearest neighbor

Due to destructiveness of natural disasters, restriction of disaster scenarios and some human causes, missing data usually occur in disaster decision-making problems. In order to estimate missing values of alternatives, this paper focuses on imputing heterogeneous attribute values of disaster based on an improved K nearest neighbor imputation (KNNI) method. Firstly, some definitions of trapezoidal fuzzy numbers (TFNs) are introduced and three types of attributes (i.e. linguistic term sets, intervals and real numbers) are converted to TFNs. Then the correlated degree model is utilized to extract related attributes to form instances that will be used in K nearest neighbor algorithm, and a novel KNNI method merging with correlated degree model is presented. Finally, an illustrative example is given to verify the proposed method and to demonstrate its feasibility and effectiveness.     

Decomposition of Variance for Spatial Cox Processes

Abstract. Spatial Cox point processes is a natural framework for quantifying the various sources of variation governing the spatial distribution of rain forest trees. We introduce a general criterion for variance decomposition for spatial Cox processes and apply it to specific Cox process models with additive or log linear random intensity functions. We moreover consider a new and flexible class of pair correlation function models given in terms of normal variance mixture covariance functions. The proposed methodology is applied to point pattern data sets of locations of tropical rain forest trees.     

Cumulants of random sum distributions

Consider a random variable S being the sum of a number N of independent and identically distributed random variables X_j (j = 1, 2, ...) where the number N is itself a non-negative integer-valued random variable independent of the X_j An explicit expression of the r-th cumulant of S is given in terms of the cumulants of N and X_j, Asymptotic properties of the distribution of S are also discussed.     

A class of integral operators generated by random variables

H. Kres Statistisehe Tafeln zur multlvariaten Analysis. Springer-Verlag, Berlin- Heidel-berg-New York 1975, XVIII, 431 S., 26 Tab., DM 48.

D. Rasch: Einführung in die mathematische Statistik - WahrscheinUcllkeitsrechnung und Grundlagen der mathematlsehan Statistlk. VEB Deutscher Verlag delr Wissenschaften, Berlin 1976, 371 S., 37 Abb., 46 'I'ab., 40,– M.

D. Rasch: Einführung in die muthematisehe Statlstik - II .Anweuduugen, VEB Deutscher Verlag der Wissenschaften, Berlin 1976.

Donald L. Snyder: Random Point Processes. -JohnWiley &; Sons, New York 1975,485 S.     

Trading numbers vs. rights? Accounting for liberal and restrictive dynamics in the evolution of asylum and refugee policies

ABSTRACT

The recent evolution of asylum and refugee policies in developed countries has been characterised by two apparently contradictory dynamics. Efforts to limit the number of asylum applicants have coincided with the strengthening of rights for asylum seekers and refugees inside existing protection systems. The ‘numbers vs. rights’ model seeks to explain such counter-veiling trends as a trade-off, as the result of attempts to manage costs within given budget constraints. The model suggests that high numbers of migrants will tend to go hand in hand with attempts to restrict their rights, while low numbers will typically be associated with more rights. This paper provides a critical analysis of the model when applied to asylum and refugee policies and examines its explanatory purchase through the analysis of longitudinal data on visa and asylum statistics. We argue that while the model provides an interesting framework through which to analyse executive decisions in this field, it underestimates the opportunities and constraints provided by the institutional context in which policy choices are made. We argue that ‘over-time’ variation in the influence of non-majoritarian institutions (in Europe, increasingly those operating at the EU level) provide a more compelling account of the dynamics of asylum and refugee policies over time than the political economy predictions of a ‘number vs. rights’ trade-off.     

A strong law of large numbers for independent random variables under non-additive probabilities

Abstract

Under non‐additive probabilities, cluster points of the empirical average have been proved to quasi-surely fall into the interval constructed by either the lower and upper expectations or the lower and upper Choquet expectations. In this paper, based on the initiated notion of independence, we obtain a different Marcinkiewicz-Zygmund type strong law of large numbers. Then the Kolmogorov type strong law of large numbers can be derived from it directly, stating that the closed interval between the lower and upper expectations is the smallest one that covers cluster points of the empirical average quasi-surely.     

Throughput and delay analysis of an opportunistic tree algorithm

Tree algorithms are a well-known class of random access algorithms with a provable maximum stable throughput under the infinite population model (as opposed to ALOHA or the binary exponential backoff algorithm). In this article, we propose a tree algorithm for opportunistic spectrum usage in cognitive radio networks. A channel in such a network is shared among so-called primary and secondary users, where the secondary users are allowed to use the channel only if there is no primary user activity. The tree algorithm designed in this article can be used by the secondary users to share the channel capacity left by the primary users.

We analyze the maximum stable throughput and mean packet delay of the secondary users by developing a tree structured Quasi-Birth Death Markov chain under the assumption that the primary user activity can be modeled by means of a finite state Markov chain and that packets lengths follow a discrete phase-type distribution.

Numerical experiments provide insight on the effect of various system parameters and indicate that the proposed algorithm is able to make good use of the bandwidth left by the primary users.     

A combinatorial study of two-periodic random walks

Two-periodic random walks have up-steps and down-steps of one unit as usual, but the probability of an up-step is α after an even number of steps and β = 1 ? α after an odd number of steps, and reversed for down-steps. This concept was studied by Böhm and Hornik^{[2 Böhm, W.; Hornik, K. On two-periodic random walks with boundaries. Stoch. Models 2010, 26, 165–194.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]]}. We complement this analysis by using methods from (analytic) combinatorics. By using two steps at once, we can reduce the analysis to the study of Motzkin paths, with up-steps, down-steps, and level-steps. Using a proper substitution, we get the generating functions of interest in an explicit and neat form. The parameters that are discussed here are the (one-sided) maximum (already studied by Böhm and Hornik^{[2 Böhm, W.; Hornik, K. On two-periodic random walks with boundaries. Stoch. Models 2010, 26, 165–194.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]]}) and the two-sided maximum. For the asymptotic evaluation of the average value of the two-sided maximum after n random steps, more sophisticated methods from complex analysis (Mellin transform, singularity analysis) are required. The approach to transfer the analysis to Motzkin paths is, of course, not restricted to the two parameters under consideration.     

一类含有随机参数的混沌系统的Hopf分岔研究

文章选取随机变量为系统的随机变量研究含有随机参数混沌系统的Hopf分岔,利用Chebyshev正交多项式逼近理论将含有随机变量的系统转化为等价的确定性系统,通过Hopf分岔定理和Lyapunov系数讨论了随机参数系统的Hopf分岔及稳定性,发现随机系统的渐进稳定性参数区间大小不仅和确定性参数有关,还与随机参数有非常密切的关系.