Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Yamada, Taiki"'
Autor:
Yamada, Taiki
The Shapley value, one of the well-known allocation rules in game theory, does not take into account information about the structure of the graph, so by using the Shapley value for each hyperedge, we introduce a new allocation rule by considering the
Externí odkaz:
http://arxiv.org/abs/2110.06506
In a previous work, the authors introduced a Lin-Lu-Yau type Ricci curvature for directed graphs referring to the formulation of the Chung Laplacian. The aim of this note is to provide a von Renesse-Sturm type characterization of our lower Ricci curv
Externí odkaz:
http://arxiv.org/abs/2011.11418
In a previous work, the authors have introduced a Lin-Lu-Yau type Ricci curvature for directed graphs, and obtained a diameter comparison of Bonnet-Myers type. In this paper, we investigate rigidity properties for the equality case, and conclude a ma
Externí odkaz:
http://arxiv.org/abs/2011.00755
For undirected graphs, the Ricci curvature introduced by Lin-Lu-Yau has been widely studied from various perspectives, especially geometric analysis. In the present paper, we discuss generalization problem of their Ricci curvature for directed graphs
Externí odkaz:
http://arxiv.org/abs/1909.07715
Autor:
Yamada, Taiki
We define the Ricci curvature on simplicial complexes by modifying the definition of the Ricci curvature on graphs, and we prove the upper and lower bounds of the Ricci curvature. These properties are generalizations of previous studies. Moreover, we
Externí odkaz:
http://arxiv.org/abs/1906.07404
Publikováno v:
In Engineering Structures 15 March 2023 279
Autor:
Yamada, Taiki
Two complete graphs are connected by adding some edges. The obtained graph is called the gluing graph. The more we add edges, the larger the Ricci curvature on it becomes. We calculate the Ricci curvature of each edge on the gluing graph and obtain t
Externí odkaz:
http://arxiv.org/abs/1809.00136
Autor:
Watanabe, Kazuyoshi, Yamada, Taiki
In this paper we compare the combinatorial Ricci curvature on cell complexes and the LLY-Ricci curvature defined on graphs. A cell complex is correspondence to a graph such that the vertexes are cells and the edges are vectors on the cell complex. We
Externí odkaz:
http://arxiv.org/abs/1801.05593
Autor:
Yamada, Taiki
We define the distance between edges of graphs and study the coarse Ricci curvature on edges. We consider the Laplacian on edges based on the Jost-Horak's definition of the Laplacian on simplicial complexes. As one of our main results, we obtain an e
Externí odkaz:
http://arxiv.org/abs/1712.03465
Autor:
Yamada, Taiki
In this paper, we define the curvature dimension inequalities CD(m, K) on finite directed graphs modifying the case of undirected graphs. As a main result, we evaluate m and K on finite directed graphs.
Comment: 7 pages
Comment: 7 pages
Externí odkaz:
http://arxiv.org/abs/1701.01510