Boolean random functions

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The notion of Boolean random functions is considered which is a generalization of Boolean random closed sets. Their construction is based on the combination of a sequence of primary random functions by the operation ∨ (supremum) or ∧ (infimum), and their main properties (among which the supremum or infimum infinite divisibility) are given in the case of scalar random functions built on Poisson point processes. Examples of applications to the modeling of rough surfaces are given.

Cite

CITATION STYLE

APA

Jeulin, D. (2015). Boolean random functions. Lecture Notes in Mathematics, 2120, 143–169. https://doi.org/10.1007/978-3-319-10064-7_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free