Related papers: Rough statistical convergence of sequences in a pa…
A class of subsets designated as very thin subsets of natural numbers has been studied and seen that theory of convergence may be rediscovered if very thin sets are given to play main role instead of thin or finite sets which removes some…
We investigate an inverse problem in time-frequency localization: the approximation of the symbol of a time-frequency localization operator from partial spectral information by the method of accumulated spectrograms (the sum of the…
We survey some basic results on the Gromov-Prohorov distance between metric measure spaces. (We do not claim any new results.) We give several different definitions and show the equivalence of them. We also show that convergence in the…
If we know that some kind of sequence always converges, we can ask how quickly and how uniformly it converges. Many convergent sequences converge non-uniformly and, relatedly, have no computable rate of convergence. However proof-theoretic…
According to the Dudley-Wichura extension of the Skorohod representation theorem, convergence in distribution to a limit in a separable set is equivalent to the existence of a coupling with elements converging a.s. in the metric. A density…
The random networks enriched with additional structures as metric and group-symmetry in background metric space are investigated. The important quantities like he clustering coefficient as well as the mean degree of separation in such…
Convergence rates in spectral regularization methods quantify the approximation error in inverse problems as a function of the noise level or the number of sampling points. Classical strong convergence rate results typically rely on source…
Consider $q_n$ a random pointed quadrangulation chosen equally likely among the pointed quadrangulations with $n$ faces. In this paper we show that, when $n$ goes to $+\infty$, $q_n$ suitably normalized converges weakly in a certain sense…
The study of random graphs and networks had an explosive development in the last couple of decades. Meanwhile, techniques for the statistical analysis of sequences of networks were less developed. In this paper we focus on networks…
In this paper, we study the existence of the random approximations and fixed points for random almost lower semicontinuous operators defined on finite dimensional Banach spaces, which in addition, are condensing or 1-set-contractive. Our…
Unlike classical simple random walks, one-dimensional random walks in random environments (RWRE) are known to have a wide array of potential limiting distributions. Under certain assumptions, however, it is known that CLT-like limiting…
Many real phenomena may be modelled as random closed sets in $\mathbb{R}^d$, of different Hausdorff dimensions. In many real applications, such as fiber processes and $n$-facets of random tessellations of dimension $n\leq d$ in spaces of…
In this paper, we introduce the notion of partially ordered {\epsilon}-chainable metric spaces and we derive new coupled fixed point theorems for uniformly locally contractive mappings on such spaces.
We develop a simple and unified approach to investigate several aspects of the cluster statistics of random expansive (multi-)sets. In particular, we determine the limiting distribution of the size of the smallest and largest clusters, we…
In this paper, we use theory of rough set to study graphs using the concept of orbits. We investigate the indiscernibility partitions and approximations of graphs induced by orbits of graphs. We also study rough membership functions,…
We consider a sequence of identically independently distributed random samples from an absolutely continuous probability measure in one dimension with unbounded density. We establish a new rate of convergence of the $\infty-$Wasserstein…
We extend the fair machine learning literature by considering the problem of proportional centroid clustering in a metric context. For clustering $n$ points with $k$ centers, we define fairness as proportionality to mean that any $n/k$…
In this paper we study sectional curvature bounds for Riemannian manifolds with density from the perspective of a weighted torsion free connection introduced recently by the last two authors. We develop two new tools for studying weighted…
In Pawlak's rough set theory, a set is approximated by a pair of lower and upper approximations. To measure numerically the roughness of an approximation, Pawlak introduced a quantitative measure of roughness by using the ratio of the…
A dialectical rough set theory focussed on the relation between roughly equivalent objects and classical objects was introduced in \cite{AM699} by the present author. The focus of our investigation is on elucidating the minimal conditions…