Discrete Malliavin–Stein method: Berry–Esseen bounds for random graphs and percolation
نویسندگان
چکیده
منابع مشابه
Percolation and Random Graphs
In this section, we define percolation and random graph models, and survey the features of these models. 1.
متن کاملClique percolation in random graphs
As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two k cliques means that they share at least l<k vertices. In this paper we develop a theoretical approach to study clique percolation in Erdős-Rényi graphs, which gives not only the exact solutions of the critical point, but also the corresponding order para...
متن کاملRandom Graphs, Spin Glasses and Percolation
Given a function f : [n] → {0, 1}, its k-wise direct product encoding is the function F : [n]k → {0, 1}k defined by F (x1, . . . , xk) = (f(x1), . . . , f(xk)). This simple “encoding” is useful in PCP-like settings, when we want to simulate reading k arbitrary values of f by accessing only a constant number of inputs of the encoding F . The main challenge is to test that a given F is indeed a ”...
متن کاملTHE SCALING LAW FOR THE DISCRETE KINETIC GROWTH PERCOLATION MODEL
The Scaling Law for the Discrete Kinetic Growth Percolation Model The critical exponent of the total number of finite clusters α is calculated directly without using scaling hypothesis both below and above the percolation threshold pc based on a kinetic growth percolation model in two and three dimensions. Simultaneously, we can calculate other critical exponents β and γ, and show that the scal...
متن کاملRisk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The partitions are iteratively constructed by suitable random merges and splits, using cuts of arbitrary geometry. We give a risk bound under the assumption that a “weak learning hypothesis” holds, and characterize this hyp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2017
ISSN: 0091-1798
DOI: 10.1214/15-aop1081