20,985 research outputs found
Counting Conjugacy Classes in
We show that if a f.g. group has a non-elementary WPD action on a
hyperbolic metric space , then the number of -conjugacy classes of
-loxodromic elements of coming from a ball of radius in the Cayley
graph of grows exponentially in . As an application we prove that for
the number of distinct -conjugacy classes of fully
irreducibles from an -ball in the Cayley graph of with
on the order of grows exponentially in
Finite type coarse expanding conformal dynamics
We continue the study of non-invertible topological dynamical systems with
expanding behavior. We introduce the class of {\em finite type} systems which
are characterized by the condition that, up to rescaling and uniformly bounded
distortion, there are only finitely many iterates. We show that subhyperbolic
rational maps and finite subdivision rules (in the sense of Cannon, Floyd,
Kenyon, and Parry) with bounded valence and mesh going to zero are of finite
type. In addition, we show that the limit dynamical system associated to a
selfsimilar, contracting, recurrent, level-transitive group action (in the
sense of V. Nekrashevych) is of finite type. The proof makes essential use of
an analog of the finiteness of cone types property enjoyed by hyperbolic
groups.Comment: Updated versio
From rubber bands to rational maps: A research report
This research report outlines work, partially joint with Jeremy Kahn and
Kevin Pilgrim, which gives parallel theories of elastic graphs and conformal
surfaces with boundary. One one hand, this lets us tell when one rubber band
network is looser than another, and on the other hand tell when one conformal
surface embeds in another.
We apply this to give a new characterization of hyperbolic critically finite
rational maps among branched self-coverings of the sphere, by a positive
criterion: a branched covering is equivalent to a hyperbolic rational map if
and only if there is an elastic graph with a particular "self-embedding"
property. This complements the earlier negative criterion of W. Thurston.Comment: 52 pages, numerous figures. v2: New example
Integer symmetric matrices having all their eigenvalues in the interval [-2,2]
We completely describe all integer symmetric matrices that have all their
eigenvalues in the interval [-2,2]. Along the way we classify all signed
graphs, and then all charged signed graphs, having all their eigenvalues in
this same interval. We then classify subsets of the above for which the integer
symmetric matrices, signed graphs and charged signed graphs have all their
eigenvalues in the open interval (-2,2).Comment: 33 pages, 18 figure
Optimal network topologies: Expanders, Cages, Ramanujan graphs, Entangled networks and all that
We report on some recent developments in the search for optimal network
topologies. First we review some basic concepts on spectral graph theory,
including adjacency and Laplacian matrices, and paying special attention to the
topological implications of having large spectral gaps. We also introduce
related concepts as ``expanders'', Ramanujan, and Cage graphs. Afterwards, we
discuss two different dynamical feautures of networks: synchronizability and
flow of random walkers and so that they are optimized if the corresponding
Laplacian matrix have a large spectral gap. From this, we show, by developing a
numerical optimization algorithm that maximum synchronizability and fast random
walk spreading are obtained for a particular type of extremely homogeneous
regular networks, with long loops and poor modular structure, that we call
entangled networks. These turn out to be related to Ramanujan and Cage graphs.
We argue also that these graphs are very good finite-size approximations to
Bethe lattices, and provide almost or almost optimal solutions to many other
problems as, for instance, searchability in the presence of congestion or
performance of neural networks. Finally, we study how these results are
modified when studying dynamical processes controlled by a normalized (weighted
and directed) dynamics; much more heterogeneous graphs are optimal in this
case. Finally, a critical discussion of the limitations and possible extensions
of this work is presented.Comment: 17 pages. 11 figures. Small corrections and a new reference. Accepted
for pub. in JSTA
- …