Related papers: Weak Laws in Geometric Probability
We study the statistics of the gravitational (Newtonian) force in a particular kind of weakly correlated distribution of point-like and unitary mass particles generated by the so-called Gauss-Poisson point process. In particular we extend…
Sidorenko's conjecture states that the number of copies of a bipartite graph $H$ in a graph $G$ is asymptotically minimised when $G$ is a quasirandom graph. A notorious example where this conjecture remains open is when $H=K_{5,5}\setminus…
The limits of scaled relative entropies between probability distributions associated with N-particle weakly interacting Markov processes are considered. The convergence of such scaled relative entropies is established in various settings.…
We establish the Kolmogorov-Feller weak law of large numbers for Frechet mean on non-compact symmetric spaces under certain regularity conditions. Our results accommodate non-identically distributed random variables and are accompanied by…
We analyze the joint probability distribution on the lengths of the vectors of hidden variables in different layers of a fully connected deep network, when the weights and biases are chosen randomly according to Gaussian distributions, and…
The paper deals with the asymptotic laws of functional of standard random variables. These classes of statistics are closely related to estimators of the extreme value index when the underlying distribution function is in the Weibull domain…
The purpose of this paper is to study the approximation of vector valued mappings defined on a subset of a normed space. We investigate Korovkin-type conditions under which a given sequence of linear operators becomes a so-called…
Consider the binomial model $G^{d+1}(n,p)$ of the random $(d+1)$-uniform hypergraph on $n$ vertices, where each edge is present, independently of one another, with probability $p:\mathbb{N}\to[0,1]$. We prove that, for all…
We investigate inexact proximity operators for weakly convex functions. To this aim, we derive sum rules for proximal {\epsilon}-subdifferentials, by incorporating the moduli of weak convexity of the functions into the respective formulas.…
In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of…
Power law distributions have been found in many natural and social phenomena, and more recently in the source code and run-time characteristics of Object-Oriented (OO) systems. A power law implies that small values are extremely common,…
The strong law of large numbers for linear combinations of functions of order statistics ($L$-statistics) based on weakly dependent random variables is proven. We also establish the Glivenko--Cantelli theorem for $\phi$-mixing sequences of…
Consider an election between two candidates in which the voters' choices are random and independent and the probability of a voter choosing the first candidate is $p>1/2$. Condorcet's Jury Theorem which he derived from the weak law of large…
A graph polynomial $P$ is weakly distinguishing if for almost all finite graphs $G$ there is a finite graph $H$ that is not isomorphic to $G$ with $P(G)=P(H)$. It is weakly distinguishing on a graph property $\mathcal{C}$ if for almost all…
This paper explores the well known approximation approach to decide weak bisimilarity of Basic Parallel Processes. We look into how different refinement functions can be used to prove weak bisimilarity decidable for certain subclasses. We…
We extend the definition of weak symmetric continuity to be applicable for functions defined on any nonempty subset of $\R$. Then we investigate basic properties of weakly symmetrically continuous functions and compare them with those of…
In this paper, we derive cumulant bounds for subgraph counts and power-weighted edge length in a class of spatial random networks known as weighted random connection models. This involves dealing with long-range spatial correlations induced…
The notion of weak saturation was introduced by Bollob\'as in 1968. Let $F$ and $H$ be graphs. A spanning subgraph $G \subseteq F$ is weakly $(F,H)$-saturated if it contains no copy of $H$ but there exists an ordering $e_1,\ldots,e_t$ of…
For two given graphs $G$ and $F$, a graph $ H$ is said to be weakly $ (G, F) $-saturated if $H$ is a spanning subgraph of $ G$ which has no copy of $F$ as a subgraph and one can add all edges in $ E(G)\setminus E(H)$ to $ H$ in some order…
It is shown that for sums of functionals of digits in continued fraction expansion the Kolmogorov-Feller weak laws of large numbers and the Khinchine-L\'evy-Feller-Raikov characterization of the domain of attraction of the normal law hold.