Abstract Relational extraction plays an important role in the field of natural language processing to predict semantic relationships between entities a sentence. Currently, most models have typically utilized tools capture high-level features with attention mechanism mitigate adverse effects noise sentences for prediction results. However, task relational classification, these mechanisms do not...

a r t i c l e i n f o a b s t r a c t Keywords: The Laplace operator for graphs The Harnack inequalities Eigenvalues Diameter We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.