Related papers: Operations on Fuzzy Incidence Graphs and Strong In…
For a graph $G=(V(G),E(G))$, an Italian dominating function (ID function) of $G$ is a function $f:V(G)\rightarrow \{0,1,2\}$ such that for each vertex $v\in V(G)$ with $f(v)=0$, $f(N(v))\geq2$, that is, either there is a vertex $u \in N(v)$…
Causal inference relies on the structure of a graph, often a directed acyclic graph (DAG). Different graphs may result in different causal inference statements and different intervention distributions. To quantify such differences, we…
In this paper, we study "robust" dominating sets of random graphs that retain the domination property even if a small \emph{deterministic} set of edges are removed. We motivate our study by illustrating with examples from wireless networks…
Reasoning on knowledge graphs is a challenging task because it utilizes observed information to predict the missing one. Particularly, answering complex queries based on first-order logic is one of the crucial tasks to verify learning to…
A high-dimensional and incomplete (HDI) matrix can describe the complex interactions among numerous nodes in various big data-related applications. A stochastic gradient descent (SGD)-based latent factor analysis (LFA) model is remarkably…
A set $D$ of vertices is a strong dominating set in a graph $G$, if for every vertex $x\in V(G) \setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $deg(x) \leq deg(y)$. The strong domination number $\gamma_{st}(G)$ of $G$ is the…
We prove for the contact process on $Z^d$, and many other graphs, that the upper invariant measure dominates a homogeneous product measure with large density if the infection rate $\lambda$ is sufficiently large. As a consequence, this…
We discuss various aspects concerning stochastic domination for the Ising model and the fuzzy Potts model. We begin by considering the Ising model on the homogeneous tree of degree $d$, $\Td$. For given interaction parameters $J_1$, $J_2>0$…
Probabilistic inference in graphical models is the task of computing marginal and conditional densities of interest from a factorized representation of a joint probability distribution. Inference algorithms such as variable elimination and…
The study of power domination in graphs arises from the problem of placing a minimum number of measurement devices in an electrical network while monitoring the entire network. A power dominating set of a graph is a set of vertices from…
In communication networks, the binding numbers of graphs (or networks) are often used to measure the vulnerability and robustness of graphs (or networks). Furthermore, the fractional factors of graphs and the fractional…
A graph is \emph{well-dominated} if all of its minimal dominating sets have the same cardinality. We prove that at least one of the factors is well-dominated if the Cartesian product of two graphs is well-dominated. In addition, we show…
The fuzzy integral is a powerful parametric nonlin-ear function with utility in a wide range of applications, from information fusion to classification, regression, decision making,interpolation, metrics, morphology, and beyond. While the…
We present a brief introduction to a class of interactive fuzzy numbers, called $f$-correlated fuzzy numbers, which consist of pairs of fuzzy numbers where one is dependent on the other by a continuous monotone injective function. We have…
The secure domination numbers of the Cartesian products of two small graphs with paths or cycles is determined, as well as for Mobius ladder graphs. Prior to this work, in all cases where the secure domination number has been determined,…
Fuzzy implication functions are a key area of study in fuzzy logic, extending the classical logical conditional to handle truth degrees in the interval $[0,1]$. While existing literature often focuses on a limited number of families, in the…
Cybersecurity of industrial control system is a very complex and challenging research topic, due to the integration of these systems in national critical infrastructures. The control systems are now interconnected in industrial networks and…
Ordinal regression bridges regression and classification by assigning objects to ordered classes. While human experts rely on discriminative patch-level features for decisions, current approaches are limited by the availability of only…
A domination-based identification problem on a graph $G$ is one where the objective is to choose a subset $C$ of the vertex set of $G$ such that $C$ has both, a domination property, that is, $C$ is either a dominating or a total-dominating…
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. In this context, the conventional factor graphs are referred…