Results 11 to 20 of about 2,913 (200)

Lacunary Series and Strong Approximation [PDF]

open access: yesEntropy
Strong approximation, introduced by Strassen (1964), is one of the most powerful methods to prove limit theorems in probability and statistics. In this paper we use strong approximation of lacunary series with conditionally independent sequences to prove
István Berkes
doaj   +2 more sources

One bound to rule them all: from Adiabatic to Zeno [PDF]

open access: yesQuantum, 2022
We derive a universal nonperturbative bound on the distance between unitary evolutions generated by time-dependent Hamiltonians in terms of the difference of their integral actions.
Daniel Burgarth   +3 more
doaj   +1 more source

Small deviation properties concerning arrays of non-homogeneous Markov information sources

open access: yesFrontiers in Physics, 2023
In this study, we first define the logarithmic likelihood ratio as a measure between arbitrary generalized information sources and non-homogeneous Markov sources and then establish a class of generalized information sources for small deviation theorems ...
Ximei Qin   +4 more
doaj   +1 more source

Ordinal Pattern Dependence in the Context of Long-Range Dependence

open access: yesEntropy, 2021
Ordinal pattern dependence is a multivariate dependence measure based on the co-movement of two time series. In strong connection to ordinal time series analysis, the ordinal information is taken into account to derive robust results on the dependence ...
Ines Nüßgen, Alexander Schnurr
doaj   +1 more source

Strong limit theorems for anisotropic self-similar fields

open access: yesModern Stochastics: Theory and Applications, 2014
Our paper starts from presentation and comparison of three definitions for the self-similar field. The interconnection between these definitions has been established.
V. Makogin, Yu. Mishura
doaj   +1 more source

Persisting randomness in randomly growing discrete structures: graphs and search trees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values.
Rudolf Grübel
doaj   +1 more source

On Another Type of Convergence for Intuitionistic Fuzzy Observables

open access: yesMathematics, 2023
The convergence theorems play an important role in the theory of probability and statistics and in its application. In recent times, we studied three types of convergence of intuitionistic fuzzy observables, i.e., convergence in distribution, convergence
Katarína Čunderlíková
doaj   +1 more source

Some strong limit theorems for nonhomogeneous Markov chains indexed by controlled trees

open access: yesJournal of Inequalities and Applications, 2016
In this paper, a kind of infinite, local finite tree T, named a controlled tree, is introduced. Some strong limit properties, such as the strong law of large numbers and the asymptotic equipartition property, for nonhomogeneous Markov chains indexed by T,
Weicai Peng   +4 more
doaj   +1 more source

Random walks with sticky barriers

open access: yesModern Stochastics: Theory and Applications, 2022
A new class of multidimensional locally perturbed random walks called random walks with sticky barriers is introduced and analyzed. The laws of large numbers and functional limit theorems are proved for hitting times of successive barriers.
Vladyslav Bohun, Alexander Marynych
doaj   +1 more source

经典组合优化问题的概率极限定理(Probability limit theorems of classical combinatorial optimization problems)

open access: yesZhejiang Daxue xuebao. Lixue ban, 2000
A review was given of the principal probability limit theorems of solutions to classical combinatorial optimization problems.The emphasis was on the travelling salesman problems,minimal spanning trees,matching and lengths of the longest increasing ...
SUZhong-gen(苏中根)
doaj   +1 more source

Home - About - Disclaimer - Privacy