اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRandom connection models in the thermodynamic regime: central limit theorems for add-one cost stabilizing functionals
68
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The paper deals with a random connection model, a random graph whose vertices are given by a homogeneous Poisson point process on $mathbb{R}^d$, and edges are independently drawn with probability depending on the locations of the two end points. We establish central limit theorems (CLT) for general functionals on this graph under minimal assumptions that are a combination of the weak stabilization for the-one cost and a $(2+delta)$-moment condition. As a consequence, CLTs for isomorphic subgraph counts, isomorphic component counts, the number of connected components are then derived. In addition, CLTs for Betti numbers and the size of biggest component are also proved for the first time.
قيم البحث
اقرأ أيضاً
The approximation of integral type functionals is studied for discrete observations of a continuous It^o semimartingale. Based on novel approximations in the Fourier domain, central limit theorems are proved for $L^2$-Sobolev functions with fractiona
l smoothness. An explicit $L^2$-lower bound shows that already lower order quadrature rules, such as the trapezoidal rule and the classical Riemann estimator, are rate optimal, but only the trapezoidal rule is efficient, achieving the minimal asymptotic variance.
We obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting random walks on the simplex of probability measures over a finite set. Due to a reinforcement mechanism, the increments of the walks are correlated, for
cing their convergence to the same, possibly random, limit. Random walks of this form have been introduced in the context of urn models and in stochastic approximation. We also propose an application to opinion dynamics in a random network evolving via preferential attachment. We study, in particular, random walks interacting through a mean-field rule and compare the rate they converge to their limit with the rate of synchronization, i.e. the rate at which their mutual distances converge to zero. Under certain conditions, synchronization is faster than convergence.
Open Quantum Random Walks, as developed in cite{APSS}, are a quantum generalization of Markov chains on finite graphs or on lattices. These random walks are typically quantum in their behavior, step by step, but they seem to show up a rather classica
l asymptotic behavior, as opposed to the quantum random walks usually considered in Quantum Information Theory (such as the well-known Hadamard random walk). Typically, in the case of Open Quantum Random Walks on lattices, their distribution seems to always converge to a Gaussian distribution or a mixture of Gaussian distributions. In the case of nearest neighbors homogeneous Open Quantum Random Walks on $ZZ^d$ we prove such a Central Limit Theorem, in the case where only one Gaussian distribution appears in the limit. Through the quantum trajectory point of view on quantum master equations, we transform the problem into studying a certain functional of a Markov chain on $ZZ^d$ times the Banach space of quantum states. The main difficulty is that we know nothing about the invariant measures of this Markov chain, even their existence. Surprisingly enough, we are able to produce a Central Limit Theorem with explicit drift and explicit covariance matrix. The interesting point which appears with our construction and result is that it applies actually to a wider setup: it provides a Central Limit Theorem for the sequence of recordings of the quantum trajectories associated to any completely positive map. This is what we show and develop as an application of our result. In a second step we are able to extend our Central Limit Theorem to the case of several asymptotic Gaussians, in the case where the operator coefficients of the quantum walk are block-diagonal in a common basis.
Let $r=r(n)$ be a sequence of integers such that $rleq n$ and let $X_1,ldots,X_{r+1}$ be independent random points distributed according to the Gaussian, the Beta or the spherical distribution on $mathbb{R}^n$. Limit theorems for the log-volume and t
he volume of the random convex hull of $X_1,ldots,X_{r+1}$ are established in high dimensions, that is, as $r$ and $n$ tend to infinity simultaneously. This includes, Berry-Esseen-type central limit theorems, log-normal limit theorems, moderate and large deviations. Also different types of mod-$phi$ convergence are derived. The results heavily depend on the asymptotic growth of $r$ relative to $n$. For example, we prove that the fluctuations of the volume of the simplex are normal (respectively, log-normal) if $r=o(n)$ (respectively, $rsim alpha n$ for some $0 < alpha < 1$).
We consider the problem of optimal transportation with quadratic cost between a empirical measure and a general target probability on R d , with d $ge$ 1. We provide new results on the uniqueness and stability of the associated optimal transportation
potentials , namely, the minimizers in the dual formulation of the optimal transportation problem. As a consequence, we show that a CLT holds for the empirical transportation cost under mild moment and smoothness requirements. The limiting distributions are Gaussian and admit a simple description in terms of the optimal transportation potentials.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
