相关论文: Strong Consistency of Frechet Sample Mean Sets for…

In this manuscript, we claim that the newly introduced $\mathcal{F}$-metric space \cite[\, M.~Jleli and B.~Samet, On a new generalization of metric spaces, J. Fixed Point Theory Appl, 20(3) 2018]{JS1} is metrizable. Also, we deduce that the…

Fr\'echet means of samples from a probability measure $\mu$ on any smoothly stratified metric space M with curvature bounded above are shown to satisfy a central limit theorem (CLT). The methods and results proceed by introducing and…

For random systems subject to a constraint, the microcanonical ensemble requires the constraint to be met by every realisation ("hard constraint"), while the canonical ensemble requires the constraint to be met only on average ("soft…

Motivated in part by various sequences of graphs growing under random rules (like internet models), convergent sequences of dense graphs and their limits were introduced by Borgs, Chayes, Lov\'asz, S\'os and Vesztergombi and by Lov\'asz and…

Statistical limits are defined relaxing conditions on conventional convergence. The main idea of the statistical convergence of a sequence l is that the majority of elements from l converge and we do not care what is going on with other…

Let $Y=(Y(t))_{t\geq0}$ be a zero-mean Gaussian stationary process with covariance function $\rho:\mathbb{R}\to\mathbb{R}$ satisfying $\rho(0)=1$. Let $f:\mathbb{R}\to\mathbb{R}$ be a square-integrable function with respect to the standard…

Testing equality of two multivariate distributions is a classical problem for which many non-parametric tests have been proposed over the years. Most of the popular two-sample tests, which are asymptotically distribution-free, are based…

We define a general notion of a smooth invariant (central) ergodic measure on the space of paths of an $N$-graded graph (Bratteli diagram). It is based on the notion of standardness of the tail filtration in the space of paths, and the…

Wasserstein barycenters define averages of probability measures in a geometrically meaningful way. Their use is increasingly popular in applied fields, such as image, geometry or language processing. In these fields however, the probability…

A recent work of Abbasi et al. [FOCS 2023] introduced the notion of $\varepsilon$-scatter dimension of a metric space and showed a general framework for efficient parameterized approximation schemes (so-called EPASes) for a wide range of…

We study an inhomogeneous sparse random graph on [N] = {1, . . . , N } as introduced in a seminal paper by Bollobas, Janson and Riordan (2007): vertices have a type (here in a compact metric space S), and edges between different vertices…

In this article we present a Bernstein inequality for sums of random variables which are defined on a graphical network whose nodes grow at an exponential rate. The inequality can be used to derive concentration inequalities in…

We obtain results concerning the so-called factorization for the convergence of random variables almost everywhere (almost surely or with probability one), belonging to the classical Lebesgue-Riesz spaces and we extend these results to the…

Since the pioneering works of Jakobson and Benedicks & Carleson and others, it has been known that a positive measure set of quadratic maps admit invariant probability measures absolutely continuous with respect to Lebesgue. These measures…

In this paper, we first prove that any interior point of an open interval of the real line can be interpreted as Fr\'echet means with respect to corresponding metric distances, thus extending the result of [Dinh et al., Mathematical…

The Fr\'echet regression is a useful method for modeling random objects in a general metric space given Euclidean covariates. However, the conventional approach could be sensitive to outlying objects in the sense that the distance from the…

A distributional symmetry is invariance of a distribution under a group of transformations. Exchangeability and stationarity are examples. We explain that a result of ergodic theory provides a law of large numbers: If the group satisfies…

Let $d \geq 2$. The Cheeger constant of a graph is the minimum surface-to-volume ratio of all subsets of the vertex set with relative volume at most 1/2. There are several ways to define surface and volume here: the simplest method is to…

Sampling is a fundamental topic in graph signal processing, having found applications in estimation, clustering, and video compression. In contrast to traditional signal processing, the irregularity of the signal domain makes selecting a…

There are several notions of convergence for sequences of bounded degree graphs. One such notion is left convergence, which is based on counting neighborhood distributions. Another notion is right convergence, based on counting…