492,999 research outputs found
On Index Coding and Graph Homomorphism
In this work, we study the problem of index coding from graph homomorphism
perspective. We show that the minimum broadcast rate of an index coding problem
for different variations of the problem such as non-linear, scalar, and vector
index code, can be upper bounded by the minimum broadcast rate of another index
coding problem when there exists a homomorphism from the complement of the side
information graph of the first problem to that of the second problem. As a
result, we show that several upper bounds on scalar and vector index code
problem are special cases of one of our main theorems.
For the linear scalar index coding problem, it has been shown in [1] that the
binary linear index of a graph is equal to a graph theoretical parameter called
minrank of the graph. For undirected graphs, in [2] it is shown that
if and only if there exists a homomorphism from
to a predefined graph . Combining these two results, it
follows that for undirected graphs, all the digraphs with linear index of at
most k coincide with the graphs for which there exists a homomorphism from
to . In this paper, we give a direct proof to this result
that works for digraphs as well.
We show how to use this classification result to generate lower bounds on
scalar and vector index. In particular, we provide a lower bound for the scalar
index of a digraph in terms of the chromatic number of its complement.
Using our framework, we show that by changing the field size, linear index of
a digraph can be at most increased by a factor that is independent from the
number of the nodes.Comment: 5 pages, to appear in "IEEE Information Theory Workshop", 201
Brick assignments and homogeneously almost self-complementary graphs
AbstractA graph is called almost self-complementary if it is isomorphic to the graph obtained from its complement by removing a 1-factor. In this paper, we study a special class of vertex-transitive almost self-complementary graphs called homogeneously almost self-complementary. These graphs occur as factors of symmetric index-2 homogeneous factorizations of the “cocktail party graphs” K2n−nK2. We construct several infinite families of homogeneously almost self-complementary graphs, study their structure, and prove several classification results, including the characterization of all integers n of the form n=pr and n=2p with p prime for which there exists a homogeneously almost self-complementary graph on 2n vertices
A Quest to Unravel the Metric Structure Behind Perturbed Networks
Graphs and network data are ubiquitous across a wide spectrum of scientific and application domains. Often in practice, an input graph can be considered as an observed snapshot of a (potentially
continuous) hidden domain or process. Subsequent analysis, processing, and inferences are then performed on this observed graph. In this paper we advocate the perspective that an observed graph is often a noisy version of some discretized 1-skeleton of a hidden domain, and specifically we will consider the following natural network model: We assume that there is a true graph G^* which is a certain proximity graph for points sampled from a hidden domain X; while the observed graph G is an Erdos-Renyi type perturbed version of G^*.
Our network model is related to, and slightly generalizes, the much-celebrated small-world network model originally proposed by Watts and Strogatz. However, the main question we aim to answer is orthogonal to the usual studies of network models (which often focuses on characterizing / predicting behaviors and properties of real-world networks). Specifically, we aim to recover the metric structure of G^* (which reflects that of the hidden space X as we will show) from the observed graph G. Our main result is that a simple filtering process based on the Jaccard index can recover this metric within a multiplicative factor of 2 under our network model. Our work makes one step towards the general question of inferring structure of a hidden space from its observed noisy graph representation. In addition, our results also provide a theoretical understanding for Jaccard-Index-based denoising approaches
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
The orthogonality dimension of a graph G over ? is the smallest integer k for which one can assign a nonzero k-dimensional real vector to each vertex of G, such that every two adjacent vertices receive orthogonal vectors. We prove that for every sufficiently large integer k, it is NP-hard to decide whether the orthogonality dimension of a given graph over ? is at most k or at least 2^{(1-o(1))?k/2}. We further prove such hardness results for the orthogonality dimension over finite fields as well as for the closely related minrank parameter, which is motivated by the index coding problem in information theory. This in particular implies that it is NP-hard to approximate these graph quantities to within any constant factor. Previously, the hardness of approximation was known to hold either assuming certain variants of the Unique Games Conjecture or for approximation factors smaller than 3/2. The proofs involve the concept of line digraphs and bounds on their orthogonality dimension and on the minrank of their complement
Approximate Closest Community Search in Networks
Recently, there has been significant interest in the study of the community
search problem in social and information networks: given one or more query
nodes, find densely connected communities containing the query nodes. However,
most existing studies do not address the "free rider" issue, that is, nodes far
away from query nodes and irrelevant to them are included in the detected
community. Some state-of-the-art models have attempted to address this issue,
but not only are their formulated problems NP-hard, they do not admit any
approximations without restrictive assumptions, which may not always hold in
practice.
In this paper, given an undirected graph G and a set of query nodes Q, we
study community search using the k-truss based community model. We formulate
our problem of finding a closest truss community (CTC), as finding a connected
k-truss subgraph with the largest k that contains Q, and has the minimum
diameter among such subgraphs. We prove this problem is NP-hard. Furthermore,
it is NP-hard to approximate the problem within a factor , for
any . However, we develop a greedy algorithmic framework,
which first finds a CTC containing Q, and then iteratively removes the furthest
nodes from Q, from the graph. The method achieves 2-approximation to the
optimal solution. To further improve the efficiency, we make use of a compact
truss index and develop efficient algorithms for k-truss identification and
maintenance as nodes get eliminated. In addition, using bulk deletion
optimization and local exploration strategies, we propose two more efficient
algorithms. One of them trades some approximation quality for efficiency while
the other is a very efficient heuristic. Extensive experiments on 6 real-world
networks show the effectiveness and efficiency of our community model and
search algorithms
The distance-t chromatic index of graphs
We consider two graph colouring problems in which edges at distance at most
are given distinct colours, for some fixed positive integer . We obtain
two upper bounds for the distance- chromatic index, the least number of
colours necessary for such a colouring. One is a bound of (2-\eps)\Delta^t
for graphs of maximum degree at most , where \eps is some absolute
positive constant independent of . The other is a bound of (as ) for graphs of maximum degree at most
and girth at least . The first bound is an analogue of Molloy and Reed's
bound on the strong chromatic index. The second bound is tight up to a constant
multiplicative factor, as certified by a class of graphs of girth at least ,
for every fixed , of arbitrarily large maximum degree , with
distance- chromatic index at least .Comment: 14 pages, 2 figures; to appear in Combinatorics, Probability and
Computin
Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy
This paper initiates the study of I/O algorithms (minimizing cache misses) from the perspective of fine-grained complexity
(conditional polynomial lower bounds). Specifically, we aim to answer why sparse graph problems are so hard, and why the Longest Common Subsequence problem gets a savings of a factor of the size of cache times the length of a cache line, but no more. We take the reductions and techniques from complexity and fine-grained complexity and apply them to the I/O model to generate new (conditional) lower bounds as well as new faster algorithms. We also prove the existence of a time hierarchy for the I/O model, which motivates the fine-grained reductions.
- Using fine-grained reductions, we give an algorithm for distinguishing 2 vs. 3 diameter and radius that runs in O(|E|^2/(MB)) cache misses, which for sparse graphs improves over the previous O(|V|^2/B) running time.
- We give new reductions from radius and diameter to Wiener index and median. These reductions are new in both the RAM and I/O models.
- We show meaningful reductions between problems that have linear-time solutions in the RAM model. The reductions use low I/O complexity (typically O(n/B)), and thus help to finely capture between "I/O linear time" O(n/B) and RAM linear time O(n).
- We generate new I/O assumptions based on the difficulty of improving sparse graph problem running times in the I/O model. We create conjectures that the current best known algorithms for Single Source Shortest Paths (SSSP), diameter, and radius are optimal.
- From these I/O-model assumptions, we show that many of the known reductions in the word-RAM model can naturally extend to hold in the I/O model as well (e.g., a lower bound on the I/O complexity of Longest Common Subsequence that matches the best known running time).
- We prove an analog of the Time Hierarchy Theorem in the I/O model, further motivating the study of fine-grained algorithmic differences
- …