共查询到20条相似文献,搜索用时 15 毫秒
1.
In this paper, we give a new proof of a result of R. Jones showing almost everywhere convergence of spherical means of actions of Rd on Lp(X)-spaces are convergent for d?3 and p>d/(d-1). 相似文献
2.
Radu-Nicolae Gologan 《Proceedings of the American Mathematical Society》2000,128(5):1377-1380
Using a version of an ergodic lemma due to Cuculescu and Foias, we prove a pointwise ergodic theorem for -contractions which can be viewed as a perturbed version of the celebrated ergodic theorem of Chacon and Ornstein. Surprisingly, to some extent, the complex part of the iterates involved have no effect on the ergodic convergence.
3.
4.
In this paper we generalize Kingman's sub-additive ergodic theorem to a large class of infinite countable discrete amenable group actions. 相似文献
5.
F.J. Martín-Reyes 《Journal of Mathematical Analysis and Applications》2010,368(2):469-481
Let T be a positive invertible linear operator with positive inverse on some Lp(μ), 1?p<∞, where μ is a σ-finite measure. We study the convergence in the Lp(μ)-norm and the almost everywhere convergence of the bilinear operators
6.
7.
Ping-Kwan Tam 《Applied Mathematics Letters》1999,12(8):207-64
A mean ergodic theorem for a matrix is first proved from which a mean ergodic theorem for affine operators on a vector space without any topological structure is obtained. 相似文献
8.
E.H. el Abdalaoui 《Journal of Mathematical Analysis and Applications》2019,469(2):960-981
It is shown that there is a non-singular dynamical system for which the maximal ergodic inequality does not hold. We further discuss the connection between a non-singular dynamical systems and the pointwise convergence of the Furstenberg ergodic averages. 相似文献
9.
10.
11.
Khurelbaatar Gonchigdanzan 《Periodica Mathematica Hungarica》2005,50(1-2):149-153
Summary In this note we prove an almost sure limit theorem for the products of U-statistics. 相似文献
12.
Jindřich Zapletal 《Mathematical Logic Quarterly》2010,56(2):116-125
I prove several natural preservation theorems for the countable support iteration. This solves a question of Ros?anowski regarding the preservation of localization properties and greatly simplifies the proofs in the area (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
13.
Carsten Thomassen 《Journal of Graph Theory》2004,45(4):275-280
We present a short proof of the theorem of Tutte that every planar 3‐connected graph has a drawing in the plane such that every vertex which is not on the outer cycle is the barycenter of its neighbors. Moreover, this holds for any prescribed representation of the outer cycle. © 2004 Wiley Periodicals, Inc. J Graph Theory 45: 275–280, 2004 相似文献
14.
Christian Hirsch 《Random Structures and Algorithms》2015,47(2):361-385
Percolation properties of the dead leaves model, also known as confetti percolation, are considered. More precisely, we prove that the critical probability for confetti percolation with square‐shaped leaves is 1/2. This result is related to a question of Benjamini and Schramm concerning disk‐shaped leaves and can be seen as a variant of the Harris‐Kesten theorem for bond percolation. The proof is based on techniques developed by Bollobás and Riordan to determine the critical probability for Voronoi and Johnson‐Mehl percolation. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 361–385, 2015 相似文献
15.
Central limit theorem and almost sure central limit theorem for the product of some partial sums 总被引:1,自引:0,他引:1
Miao Yu 《Proceedings Mathematical Sciences》2008,118(2):289-294
In this paper, we give the central limit theorem and almost sure central limit theorem for products of some partial sums of
independent identically distributed random variables. 相似文献
16.
17.
18.
Ryszard Jajte 《Proceedings of the American Mathematical Society》2004,132(8):2475-2481
Using simple techniques of finite von Neumann algebras, we prove a limit theorem for random matrices.
19.
Alan L. T. Paterson Amy E. Welch 《Proceedings of the American Mathematical Society》2005,133(9):2761-2770
The path spaces of a directed graph play an important role in the study of graph -algebras. These are topological spaces that were originally constructed using groupoid and inverse semigroup techniques. In this paper, we develop a simple, purely topological, approach to this construction, based on Tychonoff's theorem. In fact, the approach is shown to work even for higher dimensional graphs satisfying the finitely aligned condition, and we construct the groupoid of the graph. Motivated by these path space results, we prove a Tychonoff theorem for an infinite, countable product of locally compact spaces. The main idea is to include certain finite products of the spaces along with the infinite product. We show that the topology is, in a reasonable sense, a pointwise topology.
20.
We consider a variant of an optimisation problem involving sequential entry and exit decisions that has emerged in the economics literature as a real option model. The problem that we solve aims at maximising an ergodic, or long-term average, performance criterion in a pathwise as well as in an expected sense. Such a performance index is probably better suited to decision making within a sustainable economic environment. Our results include a complete characterisation of the optimal strategy, which can take qualitatively different forms depending on the problem's data, as well as explicit expressions for the maximal value of the associated performance index. 相似文献