Yi Wang

activity

20062025

most citedDeep Speech 2: End-to-End Speech Recognition in English and Mandarin

2.2k citations · 3.4k across the 88 of their papers we have counts for

collaborators

Showing math.COShow all

14 papers · 1 filter

math.CO2023

On extremal spectral radius of blow-up uniform hypergraphs

Shao-Han Xu, Fu-Tao Hu, Yi Wang

Let $G$ be an $r$ -uniform hypergraph of order $t$ and $ρ (G)$ is the spectral radius of $A (G)$ , where $A (G)$ is the adjacency tensor of $G$ . A blow-up of $G$ res…

math.CO2023

Spanning trees in graphs without large bipartite holes

Jie Han, Jie Hu, Lidan Ping +3

We show that for any $ε > 0$ and $Δ \in N$ , there exists $α > 0$ such that for sufficiently large $n$ , every $n$ -vertex graph $G$ satisfying that $δ(G)\geq\varepsilon…

math.CO2023

On integral variations for roots of the Laplacian matching polynomial of graphs

Yi Wang, Hai-Jian Cui, Sebastian M. Cioabă

In this paper, we study the Laplacian matching polynomial of a graph and the effect of adding edges to a graph on the roots (called Laplacian matching roots) of this polynomial. In…

math.CO2023

Positivity problem of three-term recurrence sequences

Yanni Pei, Yaling Wang, Yi Wang

We present some necessary and/or sufficient conditions for the positivity problem of three-term recurrence sequences. As applications we show the positivity of diagonal Taylor coef…

math.CO2022

A hypergraph Heilmann--Lieb theorem

Jiang-Chao Wan, Yi Wang, Yi-zheng Fan

The Heilmann--Lieb theorem is a fundamental theorem in algebraic combinatorics which provides a characterization of the distribution of the zeros of matching polynomials of graphs.…

math.CO2022

Spectra of weighted uniform hypertrees

Jiang-Chao Wan, Yi Wang, Fu-Tao Hu

Let $T$ be a $k$ -tree equipped with a weighting function $\w: V(T)\cup E(T)\rightarrow \C$, where $k \geq 3$ . The weighted matching polynomial of the weighted $k$ -tree $(T,\w)$ is…