The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Infinite Graph-Directed Systems and Hausdorff Dimension”

The dimension of graph directed attractors with overlaps on the line, with an application to a problem in fractal image recognition

Michael Keane, K. Károly, Boris Solomyak (2003)

Fundamenta Mathematicae

Similarity:

Consider a graph directed iterated function system (GIFS) on the line which consists of similarities. Assuming neither any separation conditions, nor any restrictions on the contractions, we compute the almost sure dimension of the attractor. Then we apply our result to give a partial answer to an open problem in the field of fractal image recognition concerning some self-affine graph directed attractors in space.

Spaces of ω-limit sets of graph maps

Jie-Hua Mai, Song Shao (2007)

Fundamenta Mathematicae

Similarity:

Let (X,f) be a dynamical system. In general the set of all ω-limit sets of f is not closed in the hyperspace of closed subsets of X. In this paper we study the case when X is a graph, and show that the family of ω-limit sets of a graph map is closed with respect to the Hausdorff metric.

Spectral study of alliances in graphs

Juan Alberto Rodríguez-Velazquez, Jose Maria Sigarreta Almira (2007)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper we obtain several tight bounds on different types of alliance numbers of a graph, namely (global) defensive alliance number, global offensive alliance number and global dual alliance number. In particular, we investigate the relationship between the alliance numbers of a graph and its algebraic connectivity, its spectral radius, and its Laplacian spectral radius.

On univoque points for self-similar sets

Simon Baker, Karma Dajani, Kan Jiang (2015)

Fundamenta Mathematicae

Similarity:

Let K ⊆ ℝ be the unique attractor of an iterated function system. We consider the case where K is an interval and study those elements of K with a unique coding. We prove under mild conditions that the set of points with a unique coding can be identified with a subshift of finite type. As a consequence, we can show that the set of points with a unique coding is a graph-directed self-similar set in the sense of Mauldin and Williams (1988). The theory of Mauldin and Williams then provides...

Coupled fixed point theorems in complete metric spaces endowed with a directed graph and application

Mehmet Kir, Esra Yolacan, Hukmi Kiziltunc (2017)

Open Mathematics

Similarity:

The purpose of this paper is to present some existence results for coupled fixed point of a (φ,ψ) -contractive condition for mixed monotone operators in metric spaces endowed with a directed graph. Our results generalize the results obtained by Jain et al. in (International Journal of Analysis, Volume 2014, Article ID 586096, 9 pages). Moreover, we have an application to some integral system to support the results.

The Minimum Spectral Radius of Signless Laplacian of Graphs with a Given Clique Number

Li Su, Hong-Hai Li, Jing Zhang (2014)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at the kite graph PKn−ω,ω among all connected graphs with n vertices and clique number ω. In addition, we show that the spectral radius μ of PKm,ω (m ≥ 1) satisfies [...] More precisely, for m > 1, μ satisfies the equation [...] where [...] and [...] . At last the spectral radius μ(PK∞,ω) of the infinite graph PK∞,ω is also discussed.

How the result of graph clustering methods depends on the construction of the graph

Markus Maier, Ulrike von Luxburg, Matthias Hein (2013)

ESAIM: Probability and Statistics

Similarity:

We study the scenario of graph-based clustering algorithms such as spectral clustering. Given a set of data points, one first has to construct a graph on the data points and then apply a graph clustering algorithm to find a suitable partition of the graph. Our main question is if and how the construction of the graph (choice of the graph, choice of parameters, choice of weights) influences the outcome of the final clustering result. To this end we study the convergence of cluster quality...

Micro tangent sets of continuous functions

Zoltán Buczolich (2003)

Mathematica Bohemica

Similarity:

Motivated by the concept of tangent measures and by H. Fürstenberg’s definition of microsets of a compact set A we introduce micro tangent sets and central micro tangent sets of continuous functions. It turns out that the typical continuous function has a rich (universal) micro tangent set structure at many points. The Brownian motion, on the other hand, with probability one does not have graph like, or central graph like micro tangent sets at all. Finally we show that at almost all...

A sharp upper bound for the spectral radius of a nonnegative matrix and applications

Lihua You, Yujie Shu, Xiao-Dong Zhang (2016)

Czechoslovak Mathematical Journal

Similarity:

We obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the distance spectral radius, the distance Laplacian spectral radius, the distance signless Laplacian spectral radius of an undirected graph or a digraph. These results are new or generalize some known results.