output
19982026
most citedConvergence of Edge Computing and Deep Learning: A Comprehensive Survey

1.5k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2016 · math.COShow all

6 papers · 2 filters

math.CO2016★ 1 cited

Asymptotic -log-convexity and P-recursive sequences

Qing-Hu Hou, Zuo-Ru Zhang

A sequence is said to be asymptotically -log-convex if it is -log-convex for sufficiently large. We present a criterion on the asymptotical -log-…

math.CO2016★ 1 cited

Copositive Tensor Detection and Its Applications in Physics and Hypergraphs

Haibin Chen, Zhanghai Huang, Liqun Qi

Copositivity of tensors plays an important role in vacuum stability of a general scalar potential, polynomial optimization, tensor complementarity problem and tensor generalized ei…

math.CO2016★ 18 cited

Spectral radius and Hamiltonian properties of graphs, II

Jun Ge, Bo Ning

In this paper, we first present spectral conditions for the existence of in graphs (2-connected graphs) of order , which are motivated by a conjecture of Erdős. Then w…

math.CO2016★ 1 cited

Extreme values of the stationary distribution of random walks on directed graphs

Sinan Aksoy, Fan Chung, Xing Peng

We examine the stationary distribution of random walks on directed graphs. In particular, we focus on the {\em principal ratio}, which is the ratio of maximum to minimum values of…

math.CO2016★ 12 cited

The Randić index and signless Laplacian spectral radius of graphs

Bo Ning, Xing Peng

Given a connected graph , the Randić index is the sum of over all edges of , where and are the degree of vertices…

math.CO2016★ 26 cited

Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs

Binlong Li, Bo Ning

In 1962, Erdős proved a theorem on the existence of Hamilton cycles in graphs with given minimum degree and number of edges. Significantly strengthening in case of balanced biparti…