Graph limit theory provides a rigorous framework for analysing sequences of large graphs by representing them as continuous objects known as graphons – symmetric measurable functions on the unit ...

High sparse Knowledge Graph is a key challenge to solve the Knowledge Graph Completion task. Due to the sparsity of the KGs, there are not enough first-order neighbors to learn the features of ...

We study the asymptotics for sparse exponential random graph models where the parameters may depend on the number of vertices of the graph. We obtain exact estimates for the mean and variance of the ...

For any α ∈ (0, 1) and any nα ≤ d ≤ n/2, we show that λ(G) ≤ Cα√d with probability at least 1− 1 n , where G is the uniform random undirected d-regular graph on n vertices, λ(G) denotes its second ...