Related papers: Multivariate approximation in total variation, II:…
In this note, we establish the convergence in distribution of the maxima of i.i.d. random variables to the Gumbel distribution with the associated normalizing sequences for several examples that are related to the normal distribution.…
In this paper we study time semi-discrete approximations of a class of polynomially stable infinite dimensional systems modeling the damped vibrations. We prove that adding a suitable numerical viscosity term in the numerical scheme, one…
Associated to each complex-valued random variable satisfying appropriate integrability conditions, we introduce a different generalization of the Stirling numbers of the second kind. Various equivalent definitions are provided. Attention,…
Various methods of summation for divergent series of real numbers have been generalized to analogous results for sums of iid random variables. The natural extension of results corresponding to Ces\`aro summation amounts to proving almost…
It is proved that the sum of n independent but non-identically distributed doubly truncated Normal distributions converges in distribution to a Normal distribution. It is also shown how the result can be applied in estimating a constrained…
This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…
The "typical" asymptotic behavior of the weighted sums of independent, identically distibuted random vectors in k-dimensional space is considered. It is shown that under finitnes of fifth absolute moment of an individual term the rate of…
We survey some uses of adjoint functors in graph theory pertaining to colourings, complexity reductions, multiplicativity, circular colourings and tree duality. The exposition of these applications through adjoint functors unifies the…
In the setting where we have $n$ independent observations of a random variable $X$, we derive explicit error bounds in total variation distance when approximating the number of observations equal to the maximum of the sample (in the case…
In this paper, we present new applications of our general minimax theorems. In particular, one of them concerns the multiplicity of global minima for the integral functional of the Calculus of Variations.
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
We develop a Glivenko--Cantelli theory for monotone, almost additive functions of i.\,i.\,d.\ sequences of random variables indexed by~$\Z^d$. Under certain conditions on the random sequence, short range correlations are allowed as well. We…
We investigate the distributions of the number of: (1) monochromatic complete subgraphs over edgewise 2-colorings of complete graphs; and (2) monochromatic arithmetic progressions over 2-colorings of intervals, as statistical Ramsey theory…
Stochastic linear combinations of some random vectors are studied where the distribution of the random vectors and the joint distribution of their coefficients are Dirichlet. A method is provided for calculating the distribution of these…
We demonstrate how connections between graph theory and Diophantine approximation can be used in conjunction to give simple and accessible proofs of seemingly difficult results in both subjects.
We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…
The purpose of the present paper is to establish moderate deviation principles for a rather general class of random variables fulfilling certain bounds of the cumulants. We apply a celebrated lemma of the theory of large deviations…
We proved that for any finite collection of sparse subgraphs $(D_m)_{m=1}^\ell$ of the complete graph $K_{2n}$, and a uniformly chosen perfect matching $R$ in $K_{2n}$, the random vector $(|E(R \cap D_m)|)_{m=1}^\ell$ jointly converges to a…
Let d = (d1, d2, ..., dn) be a vector of non-negative integers with even sum. We prove some basic facts about the structure of a random graph with degree sequence d, including the probability of a given subgraph or induced subgraph.…
We use Stein's method to establish the rates of normal approximation in terms of the total variation distance for a large class of sums of score functions of marked Poisson point processes on $\mathbb{R}^d$. As in the study under the weaker…