69,964 research outputs found
Generic-case complexity, decision problems in group theory and random walks
We give a precise definition of ``generic-case complexity'' and show that for
a very large class of finitely generated groups the classical decision problems
of group theory - the word, conjugacy and membership problems - all have
linear-time generic-case complexity. We prove such theorems by using the theory
of random walks on regular graphs.Comment: Revised versio
The boundary action of a sofic random subgroup of the free group
We prove that the boundary action of a sofic random subgroup of a finitely
generated free group is conservative. This addresses a question asked by
Grigorchuk, Kaimanovich, and Nagnibeda, who studied the boundary actions of
individual subgroups of the free group. Following their work, we also
investigate the cogrowth and various limit sets associated to sofic random
subgroups. We make heavy use of the correspondence between subgroups and their
Schreier graphs, and central to our approach is an investigation of the
asymptotic density of a given set inside of large neighborhoods of the root of
a sofic random Schreier graph.Comment: 21 pages, 2 figures, made minor corrections, to appear in Groups,
Geometry, and Dynamic
Statistical hyperbolicity in groups
In this paper, we introduce a geometric statistic called the "sprawl" of a
group with respect to a generating set, based on the average distance in the
word metric between pairs of words of equal length. The sprawl quantifies a
certain obstruction to hyperbolicity. Group presentations with maximum sprawl
(i.e., without this obstruction) are called statistically hyperbolic. We first
relate sprawl to curvature and show that nonelementary hyperbolic groups are
statistically hyperbolic, then give some results for products, for
Diestel-Leader graphs and lamplighter groups. In free abelian groups, the word
metrics asymptotically approach norms induced by convex polytopes, causing the
study of sprawl to reduce to a problem in convex geometry. We present an
algorithm that computes sprawl exactly for any generating set, thus quantifying
the failure of various presentations of Z^d to be hyperbolic. This leads to a
conjecture about the extreme values, with a connection to the classic Mahler
conjecture.Comment: 14 pages, 5 figures. This is split off from the paper "The geometry
of spheres in free abelian groups.
Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm
Many practical problems in almost all scientific and technological
disciplines have been classified as computationally hard (NP-hard or even
NP-complete). In life sciences, combinatorial optimization problems frequently
arise in molecular biology, e.g., genome sequencing; global alignment of
multiple genomes; identifying siblings or discovery of dysregulated pathways.In
almost all of these problems, there is the need for proving a hypothesis about
certain property of an object that can be present only when it adopts some
particular admissible structure (an NP-certificate) or be absent (no admissible
structure), however, none of the standard approaches can discard the hypothesis
when no solution can be found, since none can provide a proof that there is no
admissible structure. This article presents an algorithm that introduces a
novel type of solution method to "efficiently" solve the graph 3-coloring
problem; an NP-complete problem. The proposed method provides certificates
(proofs) in both cases: present or absent, so it is possible to accept or
reject the hypothesis on the basis of a rigorous proof. It provides exact
solutions and is polynomial-time (i.e., efficient) however parametric. The only
requirement is sufficient computational power, which is controlled by the
parameter . Nevertheless, here it is proved that the
probability of requiring a value of to obtain a solution for a
random graph decreases exponentially: , making
tractable almost all problem instances. Thorough experimental analyses were
performed. The algorithm was tested on random graphs, planar graphs and
4-regular planar graphs. The obtained experimental results are in accordance
with the theoretical expected results.Comment: Working pape
- …