Empirical results show that spatial factors such as distance, population density and communication range affect our social activities, also reflected by the development of ties in social networks. This motivates the need for social network models that take these spatial factors into account. Therefore, in this paper we propose a gravity-low-based geo-social network model, where connections develop according to the popularity of the individuals, but are constrained through their geographic distance and the surrounding population density. Specifically, we consider a power-law distributed popularity, and random node positions governed by a Poisson point process. We evaluate the characteristics of the emerging networks, considering the degree distribution, the average degree of neighbors and the local clustering coefficient. These local metrics reflect the robustness of the network, the information dissemination speed and the communication locality. We show that unless the communication range is strictly limited, the emerging networks are scale-free, with a rank exponent affected by the spatial factors. Even the average neighbor degree and the local clustering coefficient show tendencies known in non-geographic scale-free networks, at least when considering individuals with low popularity. At high-popularity values, however, the spatial constraints lead to popularity-independent average neighbor degrees and clustering coefficients.The first attempt to describe communities with random connection patterns dates back to the Erdos-Renyi (ER) random graph model from 1959 [19]. This model, however, failed to describe some inherent properties of networks that emerged through social connections: the ER model shows the desired small-world phenomenon, but not the clustering experienced in real networks. This called for more complex network structures, such as the Watts-Strogatz (WS) smallworld network [20], providing high clustering and tunable average path length, still preserving homogeneous connectivity with a Poisson degree distribution. It has been recognized, though that many of the networks, from biological structures to the Internet, are not homogeneous, but scalefree [21], where the degree distribution follows a power law k −γ , k denoting the degree and γ the scaling exponent, with typical values of 2 < γ < 3.The most well-known example of constructing a scalefree topology is the Barabasi-Albert model [9], where the network is formed by adding new vertices, and connect them through a preferential attachment strategy. The link preference in the BA model is proportional to the degree of vertices already in network, which results in a scale-free network with scaling exponent γ = 3. More flexible versions of the preferential attachment model are presented in [22] [23] [24].Another hypothesis of the emergence of scale-free networks is based on the inherent popularity of the members of the network. This hypothesis has been proposed in [10], [11] and is extensively tested for interactions of Wikipedia contributors in [7], [...