Zum Hauptinhalt springen Zur Suche springen Zur Hauptnavigation springen
Beschreibung
Recently, graphs have been studied and applied in various math and science fileds. In this monograph, we consider graphs with fractal property. Starting with graphs (combinatorial objects), we construct the corresponding groupoids (algebraic objects). The fractal property of graphs and groupoids is detected by the automata labelings (automata-theoretic objects). The groupoids with fractal property will be called graph fractaloids. By defining suitable representations of groupoids, we establish von Neumann algebras (operator-algebraic objects). As elements of the von Neumann algebras, we define the labeling operators (operator-theoretic objects) of graph fractaloids. In Part 1, by computing the free moments (free-probabilistic data) of the operators, we verify how the graph fractaloids act in the von Neumann algebras. Also, based on such computations, we can classify the graph fractaloids, in Part 2. Our classification shows the richness of graph fractaloids which are not fractal groups, in general. In Part 3, we show that, for any finite graph, there always exists a finite fractal graph containing it as its part.
Recently, graphs have been studied and applied in various math and science fileds. In this monograph, we consider graphs with fractal property. Starting with graphs (combinatorial objects), we construct the corresponding groupoids (algebraic objects). The fractal property of graphs and groupoids is detected by the automata labelings (automata-theoretic objects). The groupoids with fractal property will be called graph fractaloids. By defining suitable representations of groupoids, we establish von Neumann algebras (operator-algebraic objects). As elements of the von Neumann algebras, we define the labeling operators (operator-theoretic objects) of graph fractaloids. In Part 1, by computing the free moments (free-probabilistic data) of the operators, we verify how the graph fractaloids act in the von Neumann algebras. Also, based on such computations, we can classify the graph fractaloids, in Part 2. Our classification shows the richness of graph fractaloids which are not fractal groups, in general. In Part 3, we show that, for any finite graph, there always exists a finite fractal graph containing it as its part.
Details
Erscheinungsjahr: 2009
Genre: Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: Einband - flex.(Paperback)
ISBN-13: 9783639194470
ISBN-10: 3639194470
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Cho, Ilwoo
Hersteller: VDM Verlag Dr. Müller
Verantwortliche Person für die EU: OmniScriptum GmbH & Co. KG, Bahnhofstr. 28, D-66111 Saarbrücken, info@akademikerverlag.de
Maße: 220 x 150 x 13 mm
Von/Mit: Ilwoo Cho
Erscheinungsdatum: 01.09.2009
Gewicht: 0,145 kg
Artikel-ID: 101497086

Ähnliche Produkte