Search results for "Random"
showing 10 items of 3931 documents
Random Logistic Maps II. The Critical Case
2003
Let (X n )∞ 0 be a Markov chain with state space S=[0,1] generated by the iteration of i.i.d. random logistic maps, i.e., X n+1=C n+1 X n (1−X n ),n≥0, where (C n )∞ 1 are i.i.d. random variables with values in [0, 4] and independent of X 0. In the critical case, i.e., when E(log C 1)=0, Athreya and Dai(2) have shown that X n → P 0. In this paper it is shown that if P(C 1=1)<1 and E(log C 1)=0 then (i) X n does not go to zero with probability one (w.p.1) and in fact, there exists a 0<β<1 and a countable set ▵⊂(0,1) such that for all x∈A≔(0,1)∖▵, P x (X n ≥β for infinitely many n≥1)=1, where P x stands for the probability distribution of (X n )∞ 0 with X 0=x w.p.1. A is a closed set for (X n…
A Unified Approach to Likelihood Inference on Stochastic Orderings in a Nonparametric Context
1998
Abstract For data in a two-way contingency table with ordered margins, we consider various hypotheses of stochastic orders among the conditional distributions considered by rows and show that each is equivalent to requiring that an invertible transformation of the vectors of conditional row probabilities satisfies an appropriate set of linear inequalities. This leads to the construction of a general algorithm for maximum likelihood estimation under multinomial sampling and provides a simple framework for deriving the asymptotic distribution of log-likelihood ratio tests. The usual stochastic ordering and the so called uniform and likelihood ratio orderings are considered as special cases. I…
A multi-local optimization algorithm
1998
The development of efficient algorithms that provide all the local minima of a function is crucial to solve certain subproblems in many optimization methods. A “multi-local” optimization procedure using inexact line searches is presented, and numerical experiments are also reported. An application of the method to a semi-infinite programming procedure is included.
The rank of random regular digraphs of constant degree
2018
Abstract Let d be a (large) integer. Given n ≥ 2 d , let A n be the adjacency matrix of a random directed d -regular graph on n vertices, with the uniform distribution. We show that the rank of A n is at least n − 1 with probability going to one as n grows to infinity. The proof combines the well known method of simple switchings and a recent result of the authors on delocalization of eigenvectors of A n .
Testing Goodness-of-Fit with the Kernel Density Estimator: GoFKernel
2015
To assess the goodness-of-fit of a sample to a continuous random distribution, the most popular approach has been based on measuring, using either L∞ - or L2 -norms, the distance between the null hypothesis cumulative distribution function and the empirical cumulative distribution function. Indeed, as far as I know, almost all the tests currently available in R related to this issue (ks.test in package stats, ad.test in package ADGofTest, and ad.test, ad2.test, ks.test, v.test and w2.test in package truncgof) use one of these two distances on cumulative distribution functions. This paper (i) proposes dgeometric.test, a new implementation of the test that measures the discrepancy between a s…
On the analysis of a random walk-jump chain with tree-based transitions and its applications to faulty dichotomous search
2018
Random Walks (RWs) have been extensively studied for more than a century [1]. These walks have traditionally been on a line, and the generalizations for two and three dimensions, have been by extending the random steps to the corresponding neighboring positions in one or many of the dimensions. Among the most popular RWs on a line are the various models for birth and death processes, renewal processes and the gambler’s ruin problem. All of these RWs operate “on a discretized line”, and the walk is achieved by performing small steps to the current-state’s neighbor states. Indeed, it is this neighbor-step motion that renders their analyses tractable. When some of the transitions are to non-ne…
Attractors for non-autonomous retarded lattice dynamical systems
2015
AbstractIn this paperwe study a non-autonomous lattice dynamical system with delay. Under rather general growth and dissipative conditions on the nonlinear term,we define a non-autonomous dynamical system and prove the existence of a pullback attractor for such system as well. Both multivalued and single-valued cases are considered.
Stochastic order characterization of uniform integrability and tightness
2013
We show that a family of random variables is uniformly integrable if and only if it is stochastically bounded in the increasing convex order by an integrable random variable. This result is complemented by proving analogous statements for the strong stochastic order and for power-integrable dominating random variables. Especially, we show that whenever a family of random variables is stochastically bounded by a p-integrable random variable for some p>1, there is no distinction between the strong order and the increasing convex order. These results also yield new characterizations of relative compactness in Wasserstein and Prohorov metrics.
Sign test of independence between two random vectors
2003
A new affine invariant extension of the quadrant test statistic Blomqvist (Ann. Math. Statist. 21 (1950) 593) based on spatial signs is proposed for testing the hypothesis of independence. In the elliptic case, the new test statistic is asymptotically equivalent to the interdirection test by Gieser and Randles (J. Amer. Statist. Assoc. 92 (1997) 561) but is easier to compute in practice. Limiting Pitman efficiencies and simulations are used to compare the test to the classical Wilks’ test. peerReviewed
Directed random walk on the backbone of an oriented percolation cluster
2012
We consider a directed random walk on the backbone of the infinite cluster generated by supercritical oriented percolation, or equivalently the space-time embedding of the ``ancestral lineage'' of an individual in the stationary discrete-time contact process. We prove a law of large numbers and an annealed central limit theorem (i.e., averaged over the realisations of the cluster) using a regeneration approach. Furthermore, we obtain a quenched central limit theorem (i.e.\ for almost any realisation of the cluster) via an analysis of joint renewals of two independent walks on the same cluster.