Zobrazeno 1 - 10
of 408
pro vyhledávání: '"05C21"'
Autor:
Licona, Miguel, Tey, Joaquín
It is known that if a plane graph is graceful (resp. near-graceful), then its semidual is conservative (resp. near-conservative). In this work we prove that the semidual of a plane graph of size $M$ consisting of two nested cycles is conservative if
Externí odkaz:
http://arxiv.org/abs/2411.12998
Autor:
Ma, Jicheng, Yang, Yunyan
On a connected finite graph, we propose an evolution of weights including Ollivier's Ricci flow as a special case. During the evolution process, on each edge, the speed of change of weight is exactly the difference between the Wasserstein distance re
Externí odkaz:
http://arxiv.org/abs/2411.06393
Optimal transport on a graph focuses on finding the most efficient way to transfer resources from one distribution to another while considering the graph's structure. This paper introduces a new distributed algorithm that solves the optimal transport
Externí odkaz:
http://arxiv.org/abs/2410.05509
Autor:
Schiffer, Stefan, Zizza, Martina
Let $f$ and $g$ be two volume-preserving diffeomorphisms on the cube $Q=[0,1]^{\nu}$, $\nu \geq 3$. We show that there is a divergence-free vector field $v \in L^1((0,1);L^p(Q))$ such that $v$ connects $f$ and $g$ through the corresponding flow and $
Externí odkaz:
http://arxiv.org/abs/2410.01576
Autor:
Dugan, William T.
The Chan-Robbins-Yuen polytope ($CRY_n$) of order $n$ is a face of the Birkhoff polytope of doubly stochastic matrices that is also a flow polytope of the directed complete graph $K_{n+1}$ with netflow $(1,0,0, \ldots , 0, -1)$. The volume and lattic
Externí odkaz:
http://arxiv.org/abs/2409.15519
Kochol introduced the assigning polynomial $F(G,\alpha;k)$ to count nowhere-zero $(A,b)$-flows of a graph $G$, where $A$ is a finite Abelian group and $\alpha$ is a $\{0,1\}$-assigning from a family $\Lambda(G)$ of certain nonempty vertex subsets of
Externí odkaz:
http://arxiv.org/abs/2409.09634
The problem of multi-task regression over graph nodes has been recently approached through Graph-Instructed Neural Network (GINN), which is a promising architecture belonging to the subset of message-passing graph neural networks. In this work, we di
Externí odkaz:
http://arxiv.org/abs/2409.08023
Autor:
Ma, Jicheng, Yang, Yunyan
In this paper, we propose a modified Ricci flow, as well as a quasi-normalized Ricci flow, on arbitrary weighted graph. Each of these two flows has a unique global solution. In particular, these global existence and uniqueness results do not require
Externí odkaz:
http://arxiv.org/abs/2408.09435
Autor:
Teknomo, Kardi
An Ideal Flow Network (IFN) is a strongly connected network where relative flows are preserved (irreducible premagic matrix). IFN can be decomposed into canonical cycles to form a string code called network signature. A network signature can be compo
Externí odkaz:
http://arxiv.org/abs/2408.06344
We show that the dual graph of the triangulation of the flow polytope of the zigzag graph adorned with the length-reverse-length framing is a subgraph of a grid graph. Through M\'esz\'aros, Morales, and Striker's bijection between simplices of the tr
Externí odkaz:
http://arxiv.org/abs/2406.20048