4,916 research outputs found
On Linkedness of Cartesian Product of Graphs
We study linkedness of Cartesian product of graphs and prove that the product
of an -linked and a -linked graphs is -linked if the graphs are
sufficiently large. Further bounds in terms of connectivity are shown. We
determine linkedness of product of paths and product of cycles
Hexagonal Tilings: Tutte Uniqueness
We develop the necessary machinery in order to prove that hexagonal tilings
are uniquely determined by their Tutte polynomial, showing as an example how to
apply this technique to the toroidal hexagonal tiling.Comment: 12 figure
Transience and recurrence of random walks on percolation clusters in an ultrametric space
We study existence of percolation in the hierarchical group of order ,
which is an ultrametric space, and transience and recurrence of random walks on
the percolation clusters. The connection probability on the hierarchical group
for two points separated by distance is of the form , with , non-negative constants , and . Percolation was proved in Dawson and Gorostiza
(2013) for , with
. In this paper we improve the result for the critical case by
showing percolation for . We use a renormalization method of the type
in the previous paper in a new way which is more intrinsic to the model. The
proof involves ultrametric random graphs (described in the Introduction). The
results for simple (nearest neighbour) random walks on the percolation clusters
are: in the case the walk is transient, and in the critical case
, there exists a critical
such that the walk is recurrent for and transient for
. The proofs involve graph diameters, path lengths, and
electric circuit theory. Some comparisons are made with behaviours of random
walks on long-range percolation clusters in the one-dimensional Euclidean
lattice.Comment: 27 page
- …