1,954 research outputs found
Counting approximately-shortest paths in directed acyclic graphs
Given a directed acyclic graph with positive edge-weights, two vertices s and
t, and a threshold-weight L, we present a fully-polynomial time
approximation-scheme for the problem of counting the s-t paths of length at
most L. We extend the algorithm for the case of two (or more) instances of the
same problem. That is, given two graphs that have the same vertices and edges
and differ only in edge-weights, and given two threshold-weights L_1 and L_2,
we show how to approximately count the s-t paths that have length at most L_1
in the first graph and length at most L_2 in the second graph. We believe that
our algorithms should find application in counting approximate solutions of
related optimization problems, where finding an (optimum) solution can be
reduced to the computation of a shortest path in a purpose-built auxiliary
graph
I/O-optimal algorithms on grid graphs
Given a graph of which the n vertices form a regular two-dimensional grid,
and in which each (possibly weighted and/or directed) edge connects a vertex to
one of its eight neighbours, the following can be done in O(scan(n)) I/Os,
provided M = Omega(B^2): computation of shortest paths with non-negative edge
weights from a single source, breadth-first traversal, computation of a minimum
spanning tree, topological sorting, time-forward processing (if the input is a
plane graph), and an Euler tour (if the input graph is a tree). The
minimum-spanning tree algorithm is cache-oblivious. The best previously
published algorithms for these problems need Theta(sort(n)) I/Os. Estimates of
the actual I/O volume show that the new algorithms may often be very efficient
in practice.Comment: 12 pages' extended abstract plus 12 pages' appendix with details,
proofs and calculations. Has not been published in and is currently not under
review of any conference or journa
On Counting Oracles for Path Problems
We initiate the study of counting oracles for various path problems in graphs. Distance oracles have gained a lot of attention in recent years, with studies of the underlying space and time tradeoffs. For a given graph G, a distance oracle is a data structure which can be used to answer distance queries for pairs of vertices s,t in V(G). In this work, we extend the set up to answering counting queries: for a pair of vertices s,t, the oracle needs to provide the number of (shortest or all) paths from s to t. We present O(n^{1.5}) preprocessing time, O(n^{1.5}) space, and O(sqrt{n}) query time algorithms for oracles counting shortest paths in planar graphs and for counting all paths in planar directed acyclic graphs. We extend our results to other graphs which admit small balanced separators and present applications where our oracle improves the currently best known running times
Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
Graphical models are popular statistical tools which are used to represent
dependent or causal complex systems. Statistically equivalent causal or
directed graphical models are said to belong to a Markov equivalent class. It
is of great interest to describe and understand the space of such classes.
However, with currently known algorithms, sampling over such classes is only
feasible for graphs with fewer than approximately 20 vertices. In this paper,
we design reversible irreducible Markov chains on the space of Markov
equivalent classes by proposing a perfect set of operators that determine the
transitions of the Markov chain. The stationary distribution of a proposed
Markov chain has a closed form and can be computed easily. Specifically, we
construct a concrete perfect set of operators on sparse Markov equivalence
classes by introducing appropriate conditions on each possible operator.
Algorithms and their accelerated versions are provided to efficiently generate
Markov chains and to explore properties of Markov equivalence classes of sparse
directed acyclic graphs (DAGs) with thousands of vertices. We find
experimentally that in most Markov equivalence classes of sparse DAGs, (1) most
edges are directed, (2) most undirected subgraphs are small and (3) the number
of these undirected subgraphs grows approximately linearly with the number of
vertices. The article contains supplement arXiv:1303.0632,
http://dx.doi.org/10.1214/13-AOS1125SUPPComment: Published in at http://dx.doi.org/10.1214/13-AOS1125 the Annals of
Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical
Statistics (http://www.imstat.org
On the phase transitions of graph coloring and independent sets
We study combinatorial indicators related to the characteristic phase
transitions associated with coloring a graph optimally and finding a maximum
independent set. In particular, we investigate the role of the acyclic
orientations of the graph in the hardness of finding the graph's chromatic
number and independence number. We provide empirical evidence that, along a
sequence of increasingly denser random graphs, the fraction of acyclic
orientations that are `shortest' peaks when the chromatic number increases, and
that such maxima tend to coincide with locally easiest instances of the
problem. Similar evidence is provided concerning the `widest' acyclic
orientations and the independence number
Effectively Counting s-t Simple Paths in Directed Graphs
An important tool in analyzing complex social and information networks is s-t
simple path counting, which is known to be #P-complete. In this paper, we study
efficient s-t simple path counting in directed graphs. For a given pair of
vertices s and t in a directed graph, first we propose a pruning technique that
can efficiently and considerably reduce the search space. Then, we discuss how
this technique can be adjusted with exact and approximate algorithms, to
improve their efficiency. In the end, by performing extensive experiments over
several networks from different domains, we show high empirical efficiency of
our proposed technique. Our algorithm is not a competitor of existing methods,
rather, it is a friend that can be used as a fast pre-processing step, before
applying any existing algorithm
Absorbing Random Walks Interpolating Between Centrality Measures on Complex Networks
Centrality, which quantifies the "importance" of individual nodes, is among
the most essential concepts in modern network theory. As there are many ways in
which a node can be important, many different centrality measures are in use.
Here, we concentrate on versions of the common betweenness and it closeness
centralities. The former measures the fraction of paths between pairs of nodes
that go through a given node, while the latter measures an average inverse
distance between a particular node and all other nodes. Both centralities only
consider shortest paths (i.e., geodesics) between pairs of nodes. Here we
develop a method, based on absorbing Markov chains, that enables us to
continuously interpolate both of these centrality measures away from the
geodesic limit and toward a limit where no restriction is placed on the length
of the paths the walkers can explore. At this second limit, the interpolated
betweenness and closeness centralities reduce, respectively, to the well-known
it current betweenness and resistance closeness (information) centralities. The
method is tested numerically on four real networks, revealing complex changes
in node centrality rankings with respect to the value of the interpolation
parameter. Non-monotonic betweenness behaviors are found to characterize nodes
that lie close to inter-community boundaries in the studied networks
- …