Zobrazeno 1 - 10
of 11 508
pro vyhledávání: '"Yan Jin"'
In this paper, we primarily study the Pogorelov-type $C^2$ estimates for $(k-1)$-convex solutions of the sum Hessian equation under the assumption of semi-convexity, and apply these estimates to obtain a rigidity theorem for global solutions satisfyi
Externí odkaz:
http://arxiv.org/abs/2412.11822
A digraph $D$ is $k$-linked if for every $2k$-tuple $ x_1,\ldots , x_k, y_1, \ldots , y_k$ of distinct vertices in $D$, there exist $k$ pairwise vertex-disjoint paths $P_1,\ldots, P_k$ such that $P_i$ starts at $x_i$ and ends at $y_i$, $i\in [k]$. In
Externí odkaz:
http://arxiv.org/abs/2412.08180
As circuit designs become more intricate, obtaining accurate performance estimation in early stages, for effective design space exploration, becomes more time-consuming. Traditional logic optimization approaches often rely on proxy metrics to approxi
Externí odkaz:
http://arxiv.org/abs/2412.02268
Given a digraph $H$, we say a digraph $H^\prime$ is an $H$-subdivision if $H^\prime$ is obtained from $H$ by replacing one or more arcs from $H$ with internally vertex-disjoint path(s). In this paper, we prove that for any digraph $H$ with $h$ arcs a
Externí odkaz:
http://arxiv.org/abs/2411.07786
Autor:
Pei, Zhiyuan, Yan, Jianqi, Yan, Jin, Yang, Bailing, Li, Ziyuan, Zhang, Lin, Liu, Xin, Zhang, Yang
Recently, deep learning in stock prediction has become an important branch. Image-based methods show potential by capturing complex visual patterns and spatial correlations, offering advantages in interpretability over time series models. However, im
Externí odkaz:
http://arxiv.org/abs/2410.19291
Let D be a digraph and C be a cycle in D. For any two vertices x and y in D, the distance from x to y is the minimum length of a path from x to y. We denote the square of Let $D$ be a digraph and $C$ be a cycle in $D$. For any two vertices $x$ and $y
Externí odkaz:
http://arxiv.org/abs/2407.18636
Suppose that $D$ is a digraph, and $H$ is a multi-digraph on $k$ vertices with $q$ arcs. Let $\mathcal{P}(D)$ be the set of paths in a digraph $D$. An $H$-subdivision $(f,g)$ in a digraph $D$ is a pair of bijections $f : V(H)\rightarrow V(D)$ and $g
Externí odkaz:
http://arxiv.org/abs/2407.06675
The clustering method based on graph models has garnered increased attention for its widespread applicability across various knowledge domains. Its adaptability to integrate seamlessly with other relevant applications endows the graph model-based clu
Externí odkaz:
http://arxiv.org/abs/2403.13846
A digraph is strongly connected if it has a directed path from $x$ to $y$ for every ordered pair of distinct vertices $x, y$ and it is strongly $k$-connected if it has at least $k+1$ vertices and remains strongly connected when we delete any set of a
Externí odkaz:
http://arxiv.org/abs/2402.16593
Autor:
Qi, Yuzhen, Yan, Jin
In this paper, we show that for any positive integer $m$ and $k\in [2]$, let $G$ be a $(2m+2k+2)$-connected graph and let $a_1,\ldots , a_m, s, t$ be any distinct vertices of $G$, there are $k$ internally disjoint $s$-$t$ paths $P_1, \ldots, P_k$ in
Externí odkaz:
http://arxiv.org/abs/2402.12639