Related papers: Two-distance minimal dominating set problem studie…
A primary challenge in metagenomics is reconstructing individual microbial genomes from the mixture of short fragments created by sequencing. Recent work leverages the sparsity of the assembly graph to find $r$-dominating sets which enable…
We investigate dynamics of an inference algorithm termed the belief propagation (BP) when employed in spin glass (SG) models and show that its macroscopic behaviors can be traced by recursive updates of certain auxiliary field distributions…
This study investigated typical performance of approximation algorithms known as belief propagation, greedy algorithm, and linear-programming relaxation for maximum coverage problems on sparse biregular random graphs. After using the cavity…
A continuous-time projection quantum Monte Carlo algorithm is employed to simulate the ground state of a short-range quantum spin-glass model, namely, the two-dimensional Edwards-Anderson Hamiltonian with transverse field, featuring…
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that the distance-d dominating-set problem, also known as the…
The spread of an epidemic is often modeled by an SIR random process on a social network graph. The MinINF problem for optimal social distancing involves minimizing the expected number of infections, when we are allowed to break at most $B$…
In this article, we consider the problem of computing minimum dominating set for a given set $S$ of $n$ points in $\IR^2$. Here the objective is to find a minimum cardinality subset $S'$ of $S$ such that the union of the unit radius disks…
We study a multi-species spin glass system where the density of each species is kept fixed at increasing volumes. The model reduces to the Sherrington-Kirkpatrick one for the single species case. The existence of the thermodynamic limit is…
We introduce a comprehensive theoretical and algorithmic framework that bridges formal group theory and group entropies with modern machine learning, paving the way for an infinite, flexible family of Mirror Descent (MD) optimization…
Todays astrometry has reached the micro-arcsecond level in angular measurements of celestial objects. The next generations of astrometric facilities are aiming at the sub-micro-arcsecond scale. Sub-micro-arcsecond astrometry requires a…
Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-problem may be of main interest. We introduce here a…
Mirror descent (MD) is a powerful first-order optimization technique that subsumes several optimization algorithms including gradient descent (GD). In this work, we develop a semi-definite programming (SDP) framework to analyze the…
We study the approximability of the maximum size independent set (MIS) problem in bounded degree graphs. This is one of the most classic and widely studied NP-hard optimization problems. We focus on the well known minimum degree greedy…
The random assignment problem asks for the minimum-cost perfect matching in the complete $n\times n$ bipartite graph $\Knn$ with i.i.d. edge weights, say uniform on $[0,1]$. In a remarkable work by Aldous (2001), the optimal cost was shown…
Using Monte Carlo simulations (MCS) and the Migdal-Kadanoff approximation (MKA), Marinari et al. study in their comment on our paper the link overlap between two replicas of a three-dimensional Ising spin glass in the presence of a coupling…
Retraction note: After posting the manuscript on arXiv, we were informed by Erik Jan van Leeuwen that both results were known and they appeared in his thesis[vL09]. A PTAS for MDS is at Theorem 6.3.21 on page 79 and A PTAS for MCDS is at…
We commence the study of domination in the incidence graphs of combinatorial designs. Let $D$ be a combinatorial design and denote by $\gamma(D)$ the domination number of the incidence (Levy) graph of $D$. We obtain a number of results…
We consider an Erdos-Renyi random graph consisting of N vertices connected by randomly and independently drawing an edge between every pair of them with probability c/N so that at N->infinity one obtains a graph of finite mean degree c. In…
Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in the dominating set. We propose a new order-based randomised local search (RLS$_o$) algorithm to solve minimum dominating set problem in large…
In 2002 Biskup et al. [Europhys. Lett. 60, 21 (2002)] sketched a rigorous proof for the behavior of the 2D Ising lattice gas, at a finite volume and a fixed excess \delta M of particles (spins) above the ambient gas density (spontaneous…