Related papers: Graph W*-probability Theory
In this paper, we will consider the projections in a graph W*-algebra.
In [16], we observed the graph W*-probability theory. In this paper, we will review [16] and introduce special amalgamated random variables in this amalgamated W*-probability space. In particular, we will observe the amalgamated…
In this paper we give a generalization of a result of Wei.
We study topological properties of the graph topology.
We develop a theory of graph C*-algebras using path groupoids and inverse semigroups. Row finiteness is not assumed so that the theory applies to graphs for which there are vertices emitting a countably infinite set of edges. We show that…
In this paper, we will consider the free probabilistic information about compressed random variables in a graph W*-Probability space. Recall the diagonal compressed random variables in a graph W*-probability space. In particular, we can see…
This is a replacement paper. There are 6 chapters. The first two chapters are introductory. The third chapter is on extremal graph theory. The fourth chapter is about algebra in graph theory. The fifth chapter is focused on algorithms. The…
An introductory paper to the graph k-colorability problem.
In this paper, we give a class of reconstructible graphs.
In this paper, we will use the graph W*-probability technique to re-compute the moments and cumulants of the operator which is the N-free sum of semicircular elements. This computation is well-known, but I used the graph probability…
In this paper, we propose a framework for graph signal processing using category theory. The aim is to generalize a few recent works on probabilistic approaches to graph signal processing, which handle signal and graph uncertainties.
We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.
We develop a clear connection between deFinetti's theorem for exchangeable arrays (work of Aldous--Hoover--Kallenberg) and the emerging area of graph limits (work of Lovasz and many coauthors). Along the way, we translate the graph theory…
We study Cantor's powerset theorem from a graph-theoretic perspective, consider some alternative proofs to Cantor's original, and provide a new proof.
The topic of this treatise is a combinatorial technique called Graph Pebbling. We investigate pebbling numbers, weight functions, flow networks, hypercubes, and the zero-sum conjecture of Erd\H{o}s and Lemke. This investigation is a…
In [15] and [16], we constructed a graph W*-probability space over its diagonal subalgebra. To study this strudture is a good example of Speicher's amalgamated W*-probability spaces. In this paper, we will observe the diagonal compressed…
Let $W$ be a finite Coxeter group and $\Omega$ be its $W$-graph algebra as defined by Gyoja. The author's previous paper \cite{hahn2016wgraphs} considered this algebra in some detail, proposed, and proved in some small cases the $W$-graph…
This paper investigates some combinatorial and algebraic properties of a Witt type formula for graphs.
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.