English
Related papers

Related papers: Rough I-statistical convergence of double sequence

200 papers

Following the work of [Dikranjan et al., Fund. Math. 249:185-209, 2020] for arithmetic sequences, very recently in [Das et al., Expo. Math. 43(3):125653, 2025], statistically characterized subgroups have been investigated for certain types…

General Topology · Mathematics 2025-06-19 Pratulananda Das , Ayan Ghosh , Tamim Aziz

Up-directed rough sets are introduced and studied by the present author in earlier papers. This is extended by her in two different granular directions in this research, with a surprising algebraic semantics. The granules are based on ideas…

Artificial Intelligence · Computer Science 2022-08-16 Mani A

We provide a general framework to study stochastic sequences related to individual learning in economics, learning automata in computer sciences, social learning in marketing, and other applications. More precisely, we study the asymptotic…

Probability · Mathematics 2014-10-07 Carlos Oyarzun , Johannes Ruf

The law of large numbers for the empirical density for the pairs of uniformly distributed integers with a given greatest common divisor is a classic result in number theory. In this paper, we study the large deviations of the empirical…

Probability · Mathematics 2016-10-07 Behzad Mehrdad , Lingjiong Zhu

Three measures of pseudorandomness of finite binary sequences were introduced by Mauduit and S\'ark\"ozy in 1997 and have been studied extensively since then: the normality measure, the well-distribution measure, and the correlation measure…

Probability · Mathematics 2015-02-04 Kai-Uwe Schmidt

In this paper we introduce a new notion of convergence of sparse graphs which we call Large Deviations or LD-convergence and which is based on the theory of large deviations. The notion is introduced by "decorating" the nodes of the graph…

Probability · Mathematics 2013-02-20 Christian Borgs , Jennifer Chayes , David Gamarnik

In this paper we have introduced the notion of $\mathcal{I}_{(s)}$-density point corresponding to the family of unbounded and $\mathcal{I}$-monotonic increasing positive real sequences, where $\mathcal{I}$ is the ideal of subsets of the set…

General Topology · Mathematics 2023-10-18 Amar Kumar Banerjee , Indrajit Debnath

Bipartite determinantal ideals are introduced by Illian and the author as a vast generalization of the classical determinantal ideals intensively studied in commutative algebra, algebraic geometry, representation theory and combinatorics.…

Commutative Algebra · Mathematics 2024-07-22 Li Li

The randomized Gauss--Seidel method and its extension have attracted much attention recently and their convergence rates have been considered extensively. However, the convergence rates are usually determined by upper bounds, which cannot…

Numerical Analysis · Mathematics 2021-05-25 Yanjun Zhang , Hanyu Li

We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to…

Probability · Mathematics 2017-04-28 Aneta Buraczyńska , Anna Dembińska

Lognormal random variables appear naturally in many engineering disciplines, including wireless communications, reliability theory, and finance. So, too, does the sum of (correlated) lognormal random variables. Unfortunately, no closed form…

General Finance · Quantitative Finance 2015-09-01 Christopher J. Rook , Mitchell Kerman

Soft set theory is an important and emerging area within soft computing, owing to its attribute-oriented mathematical framework and its wide applicability in diverse domains, including science and social sciences. The theoretical…

General Mathematics · Mathematics 2026-05-21 Santanu Acharjee , Sankar K. Pal

In this paper we study the notion of $\mathcal{I}$ and $\mathcal{I^*}$-equal convergence in linear 2-normed spaces and some of their properties. We also establish the relationship between them.

General Topology · Mathematics 2021-12-14 Amar Kumar Banerjee , Nesar Hossain

We consider the problem of estimating the probability of an observed string drawn i.i.d. from an unknown distribution. The key feature of our study is that the length of the observed string is assumed to be of the same order as the size of…

Information Theory · Computer Science 2007-07-13 Aaron B. Wagner , Pramod Viswanath , Sanjeev R. Kulkarni

Two-sample inference for the difference of population means typically relies upon a Central Limit Theorem approximation. When data are drawn from a Negative Binomial distribution, previous work of Shilane et al. (2010) showed that a Normal…

Methodology · Statistics 2012-03-06 David Shilane , Derek Bean

Rueppel's conjecture on the linear complexity of the first $n$ terms of the sequence $(1,1,0,1,0^3,1,0^7,1,0^{15},\ldots)$ was first proved by Dai using the Euclidean algorithm. We have previously shown that we can attach a homogeneous…

Symbolic Computation · Computer Science 2023-05-02 Graham H. Norton

Cluster analysis is a fundamental research issue in statistics and machine learning. In many modern clustering methods, we need to determine whether two subsets of samples come from the same cluster. Since these subsets are usually…

Machine Learning · Computer Science 2025-07-15 Xinying Liu , Lianyu Hu , Mudi Jiang , Simeng Zhang , Jun Lou , Zengyou He

The class of random-cluster models is a unification of a variety of stochastic processes of significance for probability and statistical physics, including percolation, Ising, and Potts models; in addition, their study has impact on the…

Probability · Mathematics 2007-05-23 Geoffrey Grimmett

We consider controlled differential equations and give new estimates for higher order Euler schemes. Our proofs are inspired by recent work of A. M. Davie who considers first and second order schemes. In order to implement the general case…

Classical Analysis and ODEs · Mathematics 2007-05-23 Peter Friz , Nicolas Victoir

The notion of random sequence was introduced by Martin-Loef in 1966. At the same time he defined the so-called randomness deficiency function that shows how close are random sequences to non-random (in some natural sense). Other deficiency…

Logic · Mathematics 2016-08-31 Gleb Novikov