Displaying similar documents to “The generalized Julia set perturbed by composing additive and multiplicative noises.”

Further results on sequentially additive graphs

Suresh Manjanath Hegde, Mirka Miller (2007)

Discussiones Mathematicae Graph Theory

Similarity:

Given a graph G with p vertices, q edges and a positive integer k, a k-sequentially additive labeling of G is an assignment of distinct numbers k,k+1,k+2,...,k+p+q-1 to the p+q elements of G so that every edge uv of G receives the sum of the numbers assigned to the vertices u and v. A graph which admits such an assignment to its elements is called a k-sequentially additive graph. In this paper, we give an upper bound for k with respect to which the given graph may possibly be k-sequentially...

Additive Covariance kernels for high-dimensional Gaussian Process modeling

Nicolas Durrande, David Ginsbourger, Olivier Roustant (2012)

Annales de la faculté des sciences de Toulouse Mathématiques

Similarity:

Gaussian Process models are often used for predicting and approximating expensive experiments. However, the number of observations required for building such models may become unrealistic when the input dimension increases. In oder to avoid the curse of dimensionality, a popular approach in multivariate smoothing is to make simplifying assumptions like additivity. The ambition of the present work is to give an insight into a family of covariance kernels that allows combining the features...

On the computational complexity of (O,P)-partition problems

Jan Kratochvíl, Ingo Schiermeyer (1997)

Discussiones Mathematicae Graph Theory

Similarity:

We prove that for any additive hereditary property P > O, it is NP-hard to decide if a given graph G allows a vertex partition V(G) = A∪B such that G[A] ∈ 𝓞 (i.e., A is independent) and G[B] ∈ P.

Nordhaus-Gaddum-Type Results for Resistance Distance-Based Graph Invariants

Kinkar Ch. Das, Yujun Yang, Kexiang Xu (2016)

Discussiones Mathematicae Graph Theory

Similarity:

Two decades ago, resistance distance was introduced to characterize “chemical distance” in (molecular) graphs. In this paper, we consider three resistance distance-based graph invariants, namely, the Kirchhoff index, the additive degree-Kirchhoff index, and the multiplicative degree-Kirchhoff index. Some Nordhaus-Gaddum-type results for these three molecular structure descriptors are obtained. In addition, a relation between these Kirchhoffian indices is established.

Minimal forbidden subgraphs of reducible graph properties

Amelie J. Berger (2001)

Discussiones Mathematicae Graph Theory

Similarity:

A property of graphs is any class of graphs closed under isomorphism. Let ₁,₂,...,ₙ be properties of graphs. A graph G is (₁,₂,...,ₙ)-partitionable if the vertex set V(G) can be partitioned into n sets, V₁,V₂,..., Vₙ, such that for each i = 1,2,...,n, the graph G [ V i ] ∈ i . We write ₁∘₂∘...∘ₙ for the property of all graphs which have a (₁,₂,...,ₙ)-partition. An additive induced-hereditary property is called reducible if there exist additive induced-hereditary properties ₁ and ₂ such that = ₁∘₂....

A noise of new type and its generalized functionals

Takeyuki Hida (2011)

Banach Center Publications

Similarity:

The purpose of this paper is to introduce a new noise denoted by P'(u). It has the space parameter u, being compared with the usual noise depending on the time t. We first explain why such a noise arises naturally. Then, we come to the analysis of functionals of this new noise. We shall emphasize the significance of generalized functionals of P'(u), in particular, linear and quadratic.