Data-hungry AI applications are fed complex information, and that's where graph databases and knowledge graphs play a crucial role.

The graphs with a given number n of vertices and given (vertex or edge) connectivity k, having minimum Wiener index are determined. In both cases this is Kk + (K₁ + U Kn-k-1), the graph obtained by ...

We provide a new general theorem for multivariate normal approximation on convex sets. The theorem is formulated in terms of a multivariate extension of Stein couplings. We apply the results to a ...