Related papers: Normal approximation for hierarchical structures
We consider $M/Ph/n+M$ queueing systems in steady state. We prove that the Wasserstein distance between the stationary distribution of the normalized system size process and that of a piecewise Ornstein-Uhlenbeck (OU) process is bounded by…
The random intersection graph model $\mathcal G(n,m,p)$ is considered. Due to substantial edge dependencies, studying even fundamental statistics such as the subgraph count is significantly more challenging than in the classical binomial…
Random-scan Gibbs samplers possess a natural hierarchical structure. The structure connects Gibbs samplers targeting higher dimensional distributions to those targeting lower dimensional ones. This leads to a quasi-telescoping property of…
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact representation, inference in such models is intractable even…
We study the complexity of approximations to the normalized information distance. We introduce a hierarchy of computable approximations by considering the number of oscillations. This is a function version of the difference hierarchy for…
Parameter estimation is a fundamental challenge in machine learning, crucial for tasks such as neural network weight fitting and Bayesian inference. This paper focuses on the complexity of estimating translation $\boldsymbol{\mu} \in…
We consider an edge-weighted uniform random graph with a given degree sequence (Repeated Configuration Model) which is a useful approximation for many real-world networks. It has been observed that the vertices which are separated from the…
The sequence of derangements is given by the formula $D_0 = 1, D_n = nD_{n-1} + (-1)^n, n>0$. It is a classical object appearing in combinatorics and number theory. In this paper we consider two classes of sequences: first class is given by…
We give lower bounds on the maximum possible girth of an $r$-uniform, $d$-regular hypergraph with at most $n$ vertices, using the definition of a hypergraph cycle due to Berge. These differ from the trivial upper bound by an absolute…
Let $M$ be a random matrix in the orthogonal group $\O_n$, distributed according to Haar measure, and let $A$ be a fixed $n\times n$ matrix over $\R$ such that $\tr(AA^t)=n$. Then the total variation distance of the random variable…
We use the Stein-Chen method to prove new explicit inequalities for the total variation, Wasserstein and local distances between the distribution of a random diagonal sum of a Bernoulli matrix and a Poisson distribution. Approximation…
We consider solutions to an elliptic partial differential equation in $\mathbb{R}^d$ with a stationary, random conductivity coefficient. The boundary condition on a square domain of width $L$ is chosen so that the solution has a macroscopic…
Stochastic dynamics of a quantum system driven by $N$ statistically independent random sudden quenches in a fixed time interval is studied. We reveal that with growing $N$ the system approaches a deterministic limit indicating…
Let $(\xi_i)_{i=1,...,n}$ be a sequence of independent and symmetric random variables. We consider the upper bounds on tail probabilities of self-normalized deviations $$ \mathbf{P} \Big( \max_{1\leq k \leq n} \sum_{i=1}^{k} |\xi_i|\big/…
We study the Wasserstein distance of order 1 between the empirical distribution and the marginal distribution of stationary $\alpha$-dependent sequences. We prove some moments inequalities of order p for any p $\ge$ 1, and we give some…
We provide a general bound on the Wasserstein distance between two arbitrary distributions of sequences of Bernoulli random variables. The bound is in terms of a mixing quantity for the Glauber dynamics of one of the sequences, and a simple…
In this paper the problem of finding various spanning structures in random hypergraphs is studied. We notice that a general result of Riordan [Spanning subgraphs of random graphs, Combinatorics, Probability & Computing 9 (2000), no. 2,…
In this paper, we consider the convergence rate with respect to the Wasserstein distance in the invariance principle for sequential dynamical systems. We utilize and modify the techniques previously employed for stationary sequences to…
Several real-world and abstract structures and systems are characterized by marked hierarchy to the point of being expressed as trees. Because the study of these entities often involves sampling (or discovering) the tree nodes in a specific…
Sample average approximation (SAA) replaces an intractable expected objective by an empirical average and is a basic device of modern stochastic optimization. We develop a rate theory for optimal values and empirical…