“…Notice in fact that, without any intention to be exhaustive in citing the large literature on the subject, the state of the art of analytical methods for disordered Ising models defined over Poissonian small-world graphs results nowadays as follows: i) in the case of no short-range couplings, J 0 = 0, and for one community, n = 1, modulo a large use of some population dynamics algorithm for low temperatures, the replica method and the cavity method [25,29,30,31] have established the base to solve exactly the model in any region of the phase diagram, even rigorously in the SK case [32,33] and in unfrustrated cases [34]; ii) for J 0 = 0 and n = 1 these methods have been successfully applied to the one-dimensional case [35,36] but a generalization to higher dimensions (except infinite dimensions [37]) seems impossible due to the presence of loops of any length [53]; on the other hand, even if it is exact only in the P region, the method we have presented in the Ref. [20], modulo solving analytically or numerically a non random Ising model, can be exactly applied in any dimension, and more in general to any underlying pure graph (L 0 , Γ 0 ); iii) for J 0 = 0 and n ≥ 2, the problem was solved only in the limit of infinite connectivity: exactly in the n = 2 CW case in its general form, which includes arbitrary sizes of the two communities, but with no coupling disorder [23]; and, within the replica-symmetric solution, in the generic n SK case, but only in the presence of a same mutual interaction among the n communities of same size [38,39]. Out of this range of models, no method was known to face analytically the general problem with finite connectivities, in arbitrary dimension d 0 , and with a general disorder, despite its relevance in network theory, as e.g., in social networks [54].…”