304 research outputs found
Cop and robber game and hyperbolicity
In this note, we prove that all cop-win graphs G in the game in which the
robber and the cop move at different speeds s and s' with s'<s, are
\delta-hyperbolic with \delta=O(s^2). We also show that the dependency between
\delta and s is linear if s-s'=\Omega(s) and G obeys a slightly stronger
condition. This solves an open question from the paper (J. Chalopin et al., Cop
and robber games when the robber can hide and ride, SIAM J. Discr. Math. 25
(2011) 333-359). Since any \delta-hyperbolic graph is cop-win for s=2r and
s'=r+2\delta for any r>0, this establishes a new - game-theoretical -
characterization of Gromov hyperbolicity. We also show that for weakly modular
graphs the dependency between \delta and s is linear for any s'<s. Using these
results, we describe a simple constant-factor approximation of the
hyperbolicity \delta of a graph on n vertices in O(n^2) time when the graph is
given by its distance-matrix
Kazhdan and Haagerup properties from the median viewpoint
We prove the existence of a close connection between spaces with measured
walls and median metric spaces. We then relate properties (T) and Haagerup
(a-T-menability) to actions on median spaces and on spaces with measured walls.
This allows us to explore the relationship between the classical properties (T)
and Haagerup and their versions using affine isometric actions on -spaces.
It also allows us to answer an open problem on a dynamical characterization of
property (T), generalizing results of Robertson-Steger.Comment: final versio
Geometry of infinitely presented small cancellation groups, Rapid Decay and quasi-homomorphisms
We study the geometry of infinitely presented groups satisfying the small
cancelation condition C'(1/8), and define a standard decomposition (called the
criss-cross decomposition) for the elements of such groups. We use it to prove
the Rapid Decay property for groups with the stronger small cancelation
property C'(1/10). As a consequence, the Metric Approximation Property holds
for the reduced C*-algebra and for the Fourier algebra of such groups. Our
method further implies that the kernel of the comparison map between the
bounded and the usual group cohomology in degree 2 has a basis of power
continuum. The present work can be viewed as a first non-trivial step towards a
systematic investigation of direct limits of hyperbolic groups.Comment: 40 pages, 8 figure
On a generalization of median graphs: -median graphs
Median graphs are connected graphs in which for all three vertices there is a
unique vertex that belongs to shortest paths between each pair of these three
vertices. To be more formal, a graph is a median graph if, for all , it holds that where
denotes the set of all vertices that lie on shortest paths connecting
and . In this paper we are interested in a natural generalization of
median graphs, called -median graphs. A graph is a -median graph, if
there are vertices such that, for all , it holds that , . By definition, every median graph with vertices is an -median graph.
We provide several characterizations of -median graphs that, in turn, are
used to provide many novel characterizations of median graphs
Submodular relaxation for inference in Markov random fields
In this paper we address the problem of finding the most probable state of a
discrete Markov random field (MRF), also known as the MRF energy minimization
problem. The task is known to be NP-hard in general and its practical
importance motivates numerous approximate algorithms. We propose a submodular
relaxation approach (SMR) based on a Lagrangian relaxation of the initial
problem. Unlike the dual decomposition approach of Komodakis et al., 2011 SMR
does not decompose the graph structure of the initial problem but constructs a
submodular energy that is minimized within the Lagrangian relaxation. Our
approach is applicable to both pairwise and high-order MRFs and allows to take
into account global potentials of certain types. We study theoretical
properties of the proposed approach and evaluate it experimentally.Comment: This paper is accepted for publication in IEEE Transactions on
Pattern Analysis and Machine Intelligenc
- …