A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...