scholarly journals Random Graphs and the Strong Convergence of Bootstrap Means

2000 ◽  
Vol 9 (4) ◽  
pp. 315-347 ◽  
Author(s):  
SÁNDOR CSÖRGŐ ◽  
WEI BIAO WU

We consider graphs Gn generated by multisets [Iscr ]n with n random integers as elements, such that vertices of Gn are connected by edges if the elements of [Iscr ]n that the vertices represent are the same, and prove asymptotic results on the sparsity of edges connecting the different subgraphs Gn of the random graph generated by ∪∞n=1[Iscr ]n. These results are of independent interest and, for two models of the bootstrap, we also use them here to link almost sure and complete convergence of the corresponding bootstrap means and averages of related randomly chosen subsequences of a sequence of independent and identically distributed random variables with a finite mean. Complete convergence of these means and averages is then characterized in terms of a relationship between a moment condition on the bootstrapped sequence and the bootstrap sample size. While we also obtain new sufficient conditions for the almost sure convergence of bootstrap means, the approach taken here yields the first necessary conditions.

1984 ◽  
Vol 21 (01) ◽  
pp. 40-49 ◽  
Author(s):  
F. C. Klebaner

We consider a branching-process model {Zn }, where the law of offspring distribution depends on the population size. We consider the case when the means mn (mn is the mean of offspring distribution when the population size is equal to n) tend to a limit m > 1 as n →∞. For a certain class of processes {Zn } necessary conditions for convergence in L 1 and L 2 and sufficient conditions for almost sure convergence and convergence in L 2 of Wn = Zn/mn are given.


1984 ◽  
Vol 21 (1) ◽  
pp. 40-49 ◽  
Author(s):  
F. C. Klebaner

We consider a branching-process model {Zn}, where the law of offspring distribution depends on the population size. We consider the case when the means mn (mn is the mean of offspring distribution when the population size is equal to n) tend to a limit m > 1 as n →∞. For a certain class of processes {Zn} necessary conditions for convergence in L1 and L2 and sufficient conditions for almost sure convergence and convergence in L2 of Wn = Zn/mn are given.


2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Aiting Shen

Let{Xn,n≥1}be a sequence of random variables satisfying the Rosenthal-type maximal inequality. Complete convergence is studied for linear statistics that are weighted sums of identically distributed random variables under a suitable moment condition. As an application, the Marcinkiewicz-Zygmund-type strong law of large numbers is obtained. Our result generalizes the corresponding one of Zhou et al. (2011) and improves the corresponding one of Wang et al. (2011, 2012).


Filomat ◽  
2015 ◽  
Vol 29 (7) ◽  
pp. 1541-1547
Author(s):  
Yongjun Zhang

In this paper, we obtain strong convergence property for Jamison weighted sums of negatively superadditive dependent (NSD, in short) random variables, which extends the famous Jamison theorem. In addition, some sufficient conditions for complete convergence for weighed sums of NSD random variables are presented. These results generalize the corresponding results for independent identically distributed random variables to the case of NSD random variables without assumption of identical distribution.


2020 ◽  
Vol 18 (1) ◽  
pp. 1540-1551
Author(s):  
Jung Wook Lim ◽  
Dong Yeol Oh

Abstract Let ({\mathrm{\Gamma}},\le ) be a strictly ordered monoid, and let {{\mathrm{\Gamma}}}^{\ast }\left={\mathrm{\Gamma}}\backslash \{0\} . Let D\subseteq E be an extension of commutative rings with identity, and let I be a nonzero proper ideal of D. Set \begin{array}{l}D+[\kern-2pt[ {E}^{{{\mathrm{\Gamma}}}^{\ast },\le }]\kern-2pt] := \left\{f\in [\kern-2pt[ {E}^{{\mathrm{\Gamma}},\le }]\kern-2pt] \hspace{0.15em}|\hspace{0.2em}f(0)\in D\right\}\hspace{.5em}\text{and}\\ \hspace{0.2em}D+[\kern-2pt[ {I}^{{\Gamma }^{\ast },\le }]\kern-2pt] := \left\{f\in [\kern-2pt[ {D}^{{\mathrm{\Gamma}},\le }]\kern-2pt] \hspace{0.15em}|\hspace{0.2em}f(\alpha )\in I,\hspace{.5em}\text{for}\hspace{.25em}\text{all}\hspace{.5em}\alpha \in {{\mathrm{\Gamma}}}^{\ast }\right\}.\end{array} In this paper, we give necessary conditions for the rings D+[\kern-2pt[ {E}^{{{\mathrm{\Gamma}}}^{\ast },\le }]\kern-2pt] to be Noetherian when ({\mathrm{\Gamma}},\le ) is positively ordered, and sufficient conditions for the rings D+[\kern-2pt[ {E}^{{{\mathrm{\Gamma}}}^{\ast },\le }]\kern-2pt] to be Noetherian when ({\mathrm{\Gamma}},\le ) is positively totally ordered. Moreover, we give a necessary and sufficient condition for the ring D+[\kern-2pt[ {I}^{{\Gamma }^{\ast },\le }]\kern-2pt] to be Noetherian when ({\mathrm{\Gamma}},\le ) is positively totally ordered. As corollaries, we give equivalent conditions for the rings D+({X}_{1},\ldots ,{X}_{n})E{[}{X}_{1},\ldots ,{X}_{n}] and D+({X}_{1},\ldots ,{X}_{n})I{[}{X}_{1},\ldots ,{X}_{n}] to be Noetherian.


2020 ◽  
Vol 18 (1) ◽  
pp. 1164-1172
Author(s):  
Jian Zhou ◽  
Shiyin Zhao

Abstract In this paper, firstly, we study the structural form of reflective integral for a given system. Then the sufficient conditions are obtained to ensure there exists the reflective integral with these structured form for such system. Secondly, we discuss the necessary conditions for the equivalence of such systems and a general three-dimensional differential system. And then, we apply the obtained results to the study of the behavior of their periodic solutions when such systems are periodic systems in t.


10.37236/3414 ◽  
2013 ◽  
Vol 20 (4) ◽  
Author(s):  
Sarah Behrens ◽  
Catherine Erbes ◽  
Michael Ferrara ◽  
Stephen G. Hartke ◽  
Benjamin Reiniger ◽  
...  

A sequence of nonnegative integers is $k$-graphic if it is the degree sequence of a $k$-uniform hypergraph. The only known characterization of $k$-graphic sequences is due to Dewdney in 1975. As this characterization does not yield an efficient algorithm, it is a fundamental open question to determine a more practical characterization. While several necessary conditions appear in the literature, there are few conditions that imply a sequence is $k$-graphic. In light of this, we present sharp sufficient conditions for $k$-graphicality based on a sequence's length and degree sum.Kocay and Li gave a family of edge exchanges (an extension of 2-switches) that could be used to transform one realization of a 3-graphic sequence into any other realization. We extend their result to $k$-graphic sequences for all $k \geq 3$. Finally we give several applications of edge exchanges in hypergraphs, including generalizing a result of Busch et al. on packing graphic sequences.


10.37236/7302 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
David Brandfonbrener ◽  
Pat Devlin ◽  
Netanel Friedenberg ◽  
Yuxuan Ke ◽  
Steffen Marcus ◽  
...  

We give necessary and sufficient conditions under which the Jacobian of a graph is generated by a divisor that is the difference of two vertices. This answers a question posed by Becker and Glass and allows us to prove various other propositions about the order of divisors that are the difference of two vertices. We conclude with some conjectures about these divisors on random graphs and support them with empirical evidence.


Author(s):  
Jing Fu ◽  
Qixing Han ◽  
Daqing Jiang ◽  
Yanyan Yang

This paper discusses the dynamics of a Gilpin–Ayala competition model of two interacting species perturbed by white noise. We obtain the existence of a unique global positive solution of the system and the solution is bounded in [Formula: see text]th moment. Then, we establish sufficient and necessary conditions for persistence and the existence of an ergodic stationary distribution of the model. We also establish sufficient conditions for extinction of the model. Moreover, numerical simulations are carried out for further support of present research.


Sign in / Sign up

Export Citation Format

Share Document