Related papers: Universal perspectives on irredundance for X-set p…
In an incoherent metal, transport is controlled by the collective diffusion of energy and charge rather than by quasiparticle or momentum relaxation. We explore the possibility of a universal bound $D \gtrsim \hbar v_F^2/(k_B T)$ on the…
A practical limitation of deep neural networks is their high degree of specialization to a single task and visual domain. Recently, inspired by the successes of transfer learning, several authors have proposed to learn instead universal,…
The minimum dominating set problem asks for a dominating set with minimum size. First, we determine some vertices contained in the minimum dominating set of a graph. By applying a particular scheme, we ensure that the resulting graph is…
Zero forcing is an iterative coloring process on a graph that has been widely used in such different areas as the modelling of propagation phenomena in networks and the study of minimum rank problems in matrices and graphs. This paper deals…
A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two feasible solutions S and T of size k, whether it is…
In this paper we begin an exploration of several domination-related parameters (among which are the total, restrained, total restrained, paired, outer connected and total outer connected domination numbers) in the generalized lexicographic…
In this work, we propose a new framework for reachable set computation through continuous evolution of a set of parameters and offsets which define a parametope, through the intersection of constraints. This results in a dynamical approach…
Spectral dimensionality reduction algorithms are widely used in numerous domains, including for recognition, segmentation, tracking and visualization. However, despite their popularity, these algorithms suffer from a major limitation known…
Nonstandard graphs have been defined and examined in prior works. The present work does the same for nonstandard digraphs. Since digraphs have more structure than do graphs, the present discussion requires more complicated definitions and…
The concept of universality has shaped our understanding of many-body physics, but is mostly limited to homogenous systems. Here, we present a study of universality on a non-homogeneous graph, the long-range diluted graph (LRDG). Its…
Inspired by the potential of improving tractability via gap- or above-guarantee parametrisations, we investigate the complexity of Dominating Set when given a suitable lower-bound witness. Concretely, we consider being provided with a…
A dominating set $S$ of graph $G$ is called an $r$-grouped dominating set if $S$ can be partitioned into $S_1,S_2,\ldots,S_k$ such that the size of each unit $S_i$ is $r$ and the subgraph of $G$ induced by $S_i$ is connected. The concept of…
In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms…
In network theory, the domination parameter is vital in investigating several structural features of the networks, including connectedness, their tendency to form clusters, compactness, and symmetry. In this context, various domination…
We introduce an extension of decision problems called resiliency problems. In resiliency problems, the goal is to decide whether an instance remains positive after any (appropriately defined) perturbation has been applied to it. To tackle…
A disordered array of metal grains with large and random intergrain conductances is studied within the one-loop accuracy renormalization group approach. While at low level of disorder the dependence of conductivity on log T is nonuniversal…
Capacitated Domination generalizes the classic Dominating Set problem by specifying for each vertex a required demand and an available capacity for covering demand in its closed neighborhood. The objective is to find a minimum-sized set of…
The extended persistence diagram is an invariant of piecewise linear functions, which is known to be stable under perturbations of functions with respect to the bottleneck distance as introduced by Cohen-Steiner, Edelsbrunner, and Harer. We…
In this paper, we establish universal approximation theorems for neural networks applied to general nonlinear ill-posed operator equations. In addition to the approximation error, the measurement error is also taken into account in our…
Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas…