Inhomogeneous random zero sets

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

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

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

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

منابع مشابه

Inhomogeneous Random Graphs

The ‘classical’ random graphs, introduced by Erdős and Rényi half a century ago, are homogeneous in the sense that all their vertices play the same role and the degrees of the vertices tend to be concentrated around a typical value. Many graphs arising in the real world do not have this property, having, for example, power-law degree distributions. Thus there has been much recent interest in de...

متن کامل

Geometric Inhomogeneous Random Graphs

For the theoretical study of real-world networks, we propose a model of scale-free randomgraphs with underlying geometry that we call geometric inhomogeneous random graphs (GIRGs).GIRGs generalize hyperbolic random graphs, which are a popular model to test algorithms forsocial and technological networks. Our generalization overcomes some limitations of hyperbolicrandom graphs, w...

متن کامل

Distribution of Normalized Zero-Sets of Random Entire Functions with Small Random Perturbation

In this paper, we extend our earlier result (see [Y2008]) on the distribution of normalized zero-sets of random entire functions to random entire functions with small random perturbation.

متن کامل

Zero sets in pointfree topology and strongly $z$-ideals

In this paper a particular case of z-ideals, called strongly z-ideal, is defined by introducing zero sets in pointfree topology. We study strongly z-ideals, their relation with z-ideals and the role of spatiality in this relation. For strongly z-ideals, we analyze prime ideals using the concept of zero sets. Moreover, it is proven that the intersection of all zero sets of a prime ideal of C(L),...

متن کامل

Independent Zero-Knowledge Sets

We define and construct Independent Zero-Knowledge Sets (ZKS) protocols. In a ZKS protocols, a Prover commits to a set S, and for any x, proves non-interactively to a Verifier if x ∈ S or x / ∈ S without revealing any other information about S. In the independent ZKS protocols we introduce, the adversary is prevented from successfully correlate her set to the one of a honest prover. Our notion ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Indiana University Mathematics Journal

سال: 2014

ISSN: 0022-2518

DOI: 10.1512/iumj.2014.63.5260