43,466 research outputs found
LASAGNE: Locality And Structure Aware Graph Node Embedding
In this work we propose Lasagne, a methodology to learn locality and
structure aware graph node embeddings in an unsupervised way. In particular, we
show that the performance of existing random-walk based approaches depends
strongly on the structural properties of the graph, e.g., the size of the
graph, whether the graph has a flat or upward-sloping Network Community Profile
(NCP), whether the graph is expander-like, whether the classes of interest are
more k-core-like or more peripheral, etc. For larger graphs with flat NCPs that
are strongly expander-like, existing methods lead to random walks that expand
rapidly, touching many dissimilar nodes, thereby leading to lower-quality
vector representations that are less useful for downstream tasks. Rather than
relying on global random walks or neighbors within fixed hop distances, Lasagne
exploits strongly local Approximate Personalized PageRank stationary
distributions to more precisely engineer local information into node
embeddings. This leads, in particular, to more meaningful and more useful
vector representations of nodes in poorly-structured graphs. We show that
Lasagne leads to significant improvement in downstream multi-label
classification for larger graphs with flat NCPs, that it is comparable for
smaller graphs with upward-sloping NCPs, and that is comparable to existing
methods for link prediction tasks
On limiting distributions of quantum Markov chains
In a quantum Markov chain, the temporal succession of states is modeled by
the repeated action of a "bistochastic quantum operation" on the density matrix
of a quantum system. Based on this conceptual framework, we derive some new
results concerning the evolution of a quantum system, including its long-term
behavior. Among our findings is the fact that the Cesro limit of any
quantum Markov chain always exists and equals the orthogonal projection of the
initial state upon the eigenspace of the unit eigenvalue of the bistochastic
quantum operation. Moreover, if the unit eigenvalue is the only eigenvalue on
the unit circle, then the quantum Markov chain converges in the conventional
sense to the said orthogonal projection. As a corollary, we offer a new
derivation of the classic result describing limiting distributions of unitary
quantum walks on finite graphs \cite{AAKV01}
Survival of branching random walks in random environment
We study survival of nearest-neighbour branching random walks in random
environment (BRWRE) on . A priori there are three different
regimes of survival: global survival, local survival, and strong local
survival. We show that local and strong local survival regimes coincide for
BRWRE and that they can be characterized with the spectral radius of the first
moment matrix of the process. These results are generalizations of the
classification of BRWRE in recurrent and transient regimes. Our main result is
a characterization of global survival that is given in terms of Lyapunov
exponents of an infinite product of i.i.d. random matrices.Comment: 17 pages; to appear in Journal of Theoretical Probabilit
Subgraph Matching Kernels for Attributed Graphs
We propose graph kernels based on subgraph matchings, i.e.
structure-preserving bijections between subgraphs. While recently proposed
kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al.,
2009) in general can not be applied to attributed graphs, our approach allows
to rate mappings of subgraphs by a flexible scoring scheme comparing vertex and
edge attributes by kernels. We show that subgraph matching kernels generalize
several known kernels. To compute the kernel we propose a graph-theoretical
algorithm inspired by a classical relation between common subgraphs of two
graphs and cliques in their product graph observed by Levi (1973). Encouraging
experimental results on a classification task of real-world graphs are
presented.Comment: Appears in Proceedings of the 29th International Conference on
Machine Learning (ICML 2012
- …