Results 21 to 25 of about 175,356 (25)
arXiv, 2010 We introduce adequate concepts of expansion of a digraph to obtain a sequential construction of minimal strong digraphs. We characterize the class of minimal strong digraphs whose expansion preserves the property of minimality. We prove that every minimal strong digraph of order $n\geq 2$ is the expansion of a minimal strong digraph of order $n-1$ and ...
arxiv
Strong coalitions in graphs [PDF]
arXivFor a graph $G=(V,E)$, a set $D\subset V(G)$ is a strong dominating set of $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)$. A strong coalition consists of two disjoint sets of vertices $V_{1}$ and $V_{2}$, neither of which is a strong dominating set but whose union $V_{1}\cup V_{2}$,
arxiv
On determinacy/indeterminacy of Moment Problems [PDF]
arXiv, 2016 This paper treat determinacy of strong moment problems in part I and indeterminacy of strong moment problems in part II. This paper is a summary of the following papers: [1] Ald\'en. E., Determinacy of Strong Moment Problems. [2] On Indeterminacy of Strong Moment Problems. [3] Indeterminacy of Strong Moment Problems.
arxiv
How to Mitigate Overfitting in Weak-to-strong Generalization? [PDF]
arXivAligning powerful AI models on tasks that surpass human evaluation capabilities is the central problem of \textbf{superalignment}. To address this problem, weak-to-strong generalization aims to elicit the capabilities of strong models through weak supervisors and ensure that the behavior of strong models aligns with the intentions of weak supervisors ...
arxiv
Strong cliques in vertex-transitive graphs [PDF]
arXiv, 2018 A clique (resp., independent set) in a graph is strong if it intersects every maximal independent sets (resp., every maximal cliques). A graph is CIS if all of its maximal cliques are strong and localizable if it admits a partition of its vertex set into strong cliques.
arxiv