534 research outputs found
Symmetrization for Embedding Directed Graphs
Recently, one has seen a surge of interest in developing such methods
including ones for learning such representations for (undirected) graphs (while
preserving important properties). However, most of the work to date on
embedding graphs has targeted undirected networks and very little has focused
on the thorny issue of embedding directed networks. In this paper, we instead
propose to solve the directed graph embedding problem via a two-stage approach:
in the first stage, the graph is symmetrized in one of several possible ways,
and in the second stage, the so-obtained symmetrized graph is embedded using
any state-of-the-art (undirected) graph embedding algorithm. Note that it is
not the objective of this paper to propose a new (undirected) graph embedding
algorithm or discuss the strengths and weaknesses of existing ones; all we are
saying is that whichever be the suitable graph embedding algorithm, it will fit
in the above proposed symmetrization framework.Comment: has been accepted to The Thirty-Third AAAI Conference on Artificial
Intelligence (AAAI 2019) Student Abstract and Poster Progra
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs
We present a near-optimal polynomial-time approximation algorithm for the
asymmetric traveling salesman problem for graphs of bounded orientable or
non-orientable genus. Our algorithm achieves an approximation factor of O(f(g))
on graphs with genus g, where f(n) is the best approximation factor achievable
in polynomial time on arbitrary n-vertex graphs. In particular, the
O(log(n)/loglog(n))-approximation algorithm for general graphs by Asadpour et
al. [SODA 2010] immediately implies an O(log(g)/loglog(g))-approximation
algorithm for genus-g graphs. Our result improves the
O(sqrt(g)*log(g))-approximation algorithm of Oveis Gharan and Saberi [SODA
2011], which applies only to graphs with orientable genus g; ours is the first
approximation algorithm for graphs with bounded non-orientable genus.
Moreover, using recent progress on approximating the genus of a graph, our
O(log(g) / loglog(g))-approximation can be implemented even without an
embedding when the input graph has bounded degree. In contrast, the
O(sqrt(g)*log(g))-approximation algorithm of Oveis Gharan and Saberi requires a
genus-g embedding as part of the input.
Finally, our techniques lead to a O(1)-approximation algorithm for ATSP on
graphs of genus g, with running time 2^O(g)*n^O(1)
Chord Diagrams and Coxeter Links
This paper presents a construction of fibered links out of chord
diagrams \sL. Let be the incidence graph of \sL. Under certain
conditions on \sL the symmetrized Seifert matrix of equals the
bilinear form of the simply-laced Coxeter system associated to
; and the monodromy of equals minus the Coxeter element of
. Lehmer's problem is solved for the monodromy of these Coxeter links.Comment: 18 figure
Clustering and Community Detection in Directed Networks: A Survey
Networks (or graphs) appear as dominant structures in diverse domains,
including sociology, biology, neuroscience and computer science. In most of the
aforementioned cases graphs are directed - in the sense that there is
directionality on the edges, making the semantics of the edges non symmetric.
An interesting feature that real networks present is the clustering or
community structure property, under which the graph topology is organized into
modules commonly called communities or clusters. The essence here is that nodes
of the same community are highly similar while on the contrary, nodes across
communities present low similarity. Revealing the underlying community
structure of directed complex networks has become a crucial and
interdisciplinary topic with a plethora of applications. Therefore, naturally
there is a recent wealth of research production in the area of mining directed
graphs - with clustering being the primary method and tool for community
detection and evaluation. The goal of this paper is to offer an in-depth review
of the methods presented so far for clustering directed networks along with the
relevant necessary methodological background and also related applications. The
survey commences by offering a concise review of the fundamental concepts and
methodological base on which graph clustering algorithms capitalize on. Then we
present the relevant work along two orthogonal classifications. The first one
is mostly concerned with the methodological principles of the clustering
algorithms, while the second one approaches the methods from the viewpoint
regarding the properties of a good cluster in a directed network. Further, we
present methods and metrics for evaluating graph clustering results,
demonstrate interesting application domains and provide promising future
research directions.Comment: 86 pages, 17 figures. Physics Reports Journal (To Appear
Reversibility of the non-backtracking random walk
Let be a connected graph of uniformly bounded degree. A
non-backtracking random walk (-NBRW) on evolves according to the following rule: Given , at time the walk picks at random some edge which is incident to that was not crossed in the last steps and moves to its other end-point. If no such edge exists then it makes a simple random walk step. Assume that for some every ball of radius in contains a simple cycle of length at least . We show that under some "nice" random time change the -NBRW becomes reversible. This is used to prove that it is recurrent iff the simple random walk is.EPSRC grant EP/L018896/1
On the relation between the connection and the loop representation of quantum gravity
Using Penrose binor calculus for () tensor expressions, a
graphical method for the connection representation of Euclidean Quantum Gravity
(real connection) is constructed. It is explicitly shown that: {\it (i)} the
recently proposed scalar product in the loop-representation coincide with the
Ashtekar-Lewandoski cylindrical measure in the space of connections; {\it (ii)}
it is possible to establish a correspondence between the operators in the
connection representation and those in the loop representation. The
construction is based on embedded spin network, the Penrose graphical method of
calculus, and the existence of a generalized measure on the space of
connections modulo gauge transformations.Comment: 19 pages, ioplppt.sty and epsfig.st
- …