Almost sure convergence of vertex degree densities in the vertex splitting model

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On discriminativity of vertex-degree-based indices

A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...

متن کامل

Almost sure convergence of the forward-backward-forward splitting algorithm

In this paper, we propose a stochastic forward–backward–forward splitting algorithm and prove its almost sure weak convergence in real separable Hilbert spaces. Applications to composite monotone inclusion andminimization problems are demonstrated.

متن کامل

Almost Sure Classification of Densities

Let a class F of densities be given. We draw an i.i.d. sample from a density f which may or may not be in F . After every n, one must make a guess whether f ∈ F or not. A class is almost surely discernible if there exists such a sequence of classification rules such that for any f , we make finitely many errors almost surely. In this paper several results are given that allow one to decide whet...

متن کامل

On the eigenvalues of some matrices based on vertex degree

The aim of this paper is to compute some bounds of forgotten index and then we present spectral properties of this index. In continuing, we define a new version of energy namely ISI energy corresponded to the ISI index and then we determine some bounds for it.

متن کامل

Almost Sure Testability of Classes of Densities

Let a class F of densities be given. We draw an i.i.d. sample from a density f which may or may not be in F . After every n, one must make a guess whether f 2 F or not. A class is almost surely testable if there exists such a testing sequence such that for any f , we make nitely many errors almost surely. In this paper, several results are given that allow one to decide whether a class is almos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Models

سال: 2016

ISSN: 1532-6349,1532-4214

DOI: 10.1080/15326349.2016.1182029