A Boolean function f:V(G)→{−1,1} on the vertex set of a graph G is locally p-stable if for every v proportion neighbours w with f(v)=f(w) exactly p. This notion was introduced by Gross and Grupel in [4] while studying scenery reconstruction problem. They give an exponential type lower bound number isomorphism classes functions when G=Qn n-dimensional hypercube ask more precise estimates. In thi...

Operational stability is essential for the success of organic electrochemical transistors (OECTs) in bioelectronics. The oxygen reduction reaction (ORR) a common side that can compromise OECTs, but relationship between ORR and materials degradation poorly understood. In this study, impact on mechanisms thiophene-based OECTs investigated. findings show an increase pH during leads to polymer back...

We develop efficient methods for simulating processes of Ornstein–Uhlenbeck type related to the class p-tempered $$\alpha $$ -stable ( $$\textrm{TS}^p_\alpha ) distributions. Our results hold both univariate and multivariate cases we consider case where distribution is stationary law it background driving Lévy process. In latter case, also derive an explicit representation transition as this wa...

An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. Previous work has considered the problem of finding a matching that is “as stable as possible”, i.e., admits the fewest number of blocking pairs. It is known that this problem is NP-hard and not approximable within n 1 2 −ε, for any ε > 0, unless P=NP, where n is the number of agents in a given sr insta...

An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, i.e. admits the fewest number of blocking pairs. In this paper we prove that, given an sr instance with n agents, in which all preference lists are complete, the problem of finding a matching with the fewest number of bloc...