Abstract In practice, noise exists in the process of data collection and hypergraph construction. Therefore, missing, abundant, noisy connections may be introduced into generated structure, which lead to inaccurate inference on hypergraph. Another issue comes from increasing stream, is also very common many applications. It important consider structure evolution methods hypergraph, optimize acc...

In this paper, we study two questions related to the problem of testing whether a function is close to a homomorphism. For two finite groups (not necessarily Abelian), an arbitrary map , and a parameter , say that is -close to a homomorphism if there is some homomorphism such that and differ on at most elements of , and say that is -far otherwise. For a given and , a homomorphism tester should ...

In this paper, we investigate the generalized Hyers-Ulam-Rassias and the Isac and Rassias-type stability of the conditional of orthogonally ring $*$-$n$-derivation and orthogonally ring $*$-$n$-homomorphism on $C^*$-algebras. As a consequence of this, we prove the hyperstability of orthogonally ring $*$-$n$-derivation and orthogonally ring $*$-$n$-homomorphism on $C^*$-algebras.

A d-uniform hypergraph H is a sum hypergraph iff there is a finite S ⊆ IN such that H is isomorphic to the hypergraph H+d (S) = (V, E), where V = S and E = {{v1, . . . , vd} : (i 6= j ⇒ vi 6= vj)∧ ∑d i=1 vi ∈ S}. For an arbitrary d-uniform hypergraph H the sum number σ = σ(H) is defined to be the minimum number of isolated vertices w1, . . . , wσ 6∈ V such that H ∪ {w1, . . . , wσ} is a sum hyp...