Related papers: Rough I-statistical convergence of sequences

Strict frequentism defines probability as the limiting relative frequency in an infinite sequence. What if the limit does not exist? We present a broader theory, which is applicable also to random phenomena that exhibit diverging relative…

We consider the space of complete and separable metric spaces which are equipped with a probability measure. A notion of convergence is given based on the philosophy that a sequence of metric measure spaces converges if and only if all…

The present study introduces the notions of statistical convergence of order $\alpha$ and strong $p-$ Ces\`{a}ro summability of order $\alpha$ in partial metric spaces. Also, we examine the inclusion relations between these concepts. In…

While the majority of approaches to the characterization of complex networks has relied on measurements considering only the immediate neighborhood of each network node, valuable information about the network topological properties can be…

We establish the rate of convergence of distributions of sums of independent identically distributed random variables to the Gaussian distribution in terms of truncated pseudomoments by implementing the idea of Yu. Studnyev for getting…

We study the rate of convergence in the Shape Theorem of first-passage percolation, obtaining the precise asymptotic rate of decay for the probability of linear order deviations under a moment condition. Our results are stated for a given…

The nature of the alignment with gaps corresponding to a longest common subsequence (LCS) of two independent iid random sequences drawn from a finite alphabet is investigated. It is shown that such an optimal alignment typically matches…

Let $(X,d)$ be a finite metric space with $|X|=n$. For a positive integer $k$ we define $A_k(X)$ to be the quotient set of all $k$-subsets of $X$ by isometry, and we denote $|A_k(X)|$ by $a_k$. The sequence $(a_1,a_2,\ldots,a_{n})$ is…

Now a days, data mining and knowledge discovery methods are applied to a variety of enterprise and engineering disciplines to uncover interesting patterns from databases. The study of Sequential patterns is an important data mining problem…

In this paper we are going to discuss compactness in Lorentz sequence spaces. Firstly, it will be shown how to define such a space, check whether a sequence belongs to it and calculate its norm. Equipped with this knowledge, we will proceed…

We establish tightness of graph-based stochastic processes in the space $D[0+\epsilon,1-\epsilon]$ with $\epsilon >0$ that allows for discontinuities of the first kind. The graph-based stochastic processes are based on statistics…

We call $i$ a fixed point of a given sequence if the value of that sequence at the $i$-th position coincides with $i$. Here, we enumerate fixed points in the class of restricted growth sequences. The counting process is conducted by…

The study of finite approximations of probability measures has a long history. In (Xu and Berger, 2017), the authors focus on constrained finite approximations and, in particular, uniform ones in dimension $d=1$. The present paper gives an…

We explore the limit of stochastic differential equations driven by some random processes satisfying singularly perturbed second order stochastic differential equations. The main tool we employ is the universal limit theorem in rough path…

We study convergence almost everywhere of sequences of Schr\"odinger means. We also replace sequences by uncountable sets.

Let recall that the term 'k-th extreme' was introduced in a limiting sense. That is, if $X_{r:n}$ denote the r-th order statistic then for fix k, as $n\to\infty$, $X_{n-k+1:n}$ is called the k-th extremes or k-th largest order statistics.…

We work out the graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function $W(x,y)$ on the unit square, with $x$ and $y$ uniform on the interval $(0,1)$.…

We define a weakly threshold sequence to be a degree sequence $d=(d_1,\dots,d_n)$ of a graph having the property that $\sum_{i \leq k} d_i \geq k(k-1)+\sum_{i > k} \min\{k,d_i\} - 1$ for all positive $k \leq \max\{i:d_i \geq i-1\}$. The…

This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of…

In this article, we study about the $\lambda$-statistical convergence with respect to the density of moduli and find some results related to statistical convergence as well. Also we introduce the concept of $f_\lambda$-summable sequence and…