Related papers: Statistical physics of social networking
We propose a method of generating different scale-free networks, which has several input parameters in order to adjust the structure, so that they can serve as a basis for computer simulation of real-world phenomena. The topological…
The friendship paradox is a sociological phenomenon stating that most people have fewer friends than their friends do. The generalized friendship paradox refers to the same observation for attributes other than degree, and it has been…
A spatial scale-free network is introduced and studied whose motivation has been originated in the growing Internet as well as the Airport networks. We argue that in these real-world networks a new node necessarily selects one of its…
We formulate a simple edge generation rule based on an inverse like mass action principle for random graphs over a structured vertex set. We show that under very weak assumptions on the structure generating distribution we obtain a scale…
Network science has released its talents in social network analysis based on the information of static topologies. In reality social contacts are dynamic and evolve concurrently in time. Nowadays they can be recorded by ubiquitous…
This paper considers the problem of estimating exposure to information in a social network. Given a piece of information (e.g., a URL of a news article on Facebook, a hashtag on Twitter), our aim is to find the fraction of people on the…
Social networking sites (SNS) have recently used by millions of people all over the world. An SNS is a society on the Internet, where people communicate and foster friendship with each other. We examine a nation-wide SNS (more than six…
In this paper, we study the connectivity of a one-dimensional soft random geometric graph (RGG). The graph is generated by placing points at random on a bounded line segment and connecting pairs of points with a probability that depends on…
A dynamic model of a society is studied where each person is an uncorrelated and non-interacting random walker. A dynamical random graph represents the acquaintance network of the society whose nodes are the individuals and links are the…
Real world networks have, for a long time, been modelled by scale-free networks, which have many sparsely connected nodes and a few highly connected ones (the hubs). However, both in society and in biology, a new structure must be…
We study a model for a statistical network formed by interactions between its nodes and links. Each node can be in one of two states (Ising spin up or down) and the node-link interaction facilitates linking between the like nodes. For high…
This survey presents the main results achieved for the influence maximization problem in social networks. This problem is well studied in the literature and, thanks to its recent applications, some of which currently deployed on the field,…
The structure of large-scale social networks has predominantly been articulated using generative models, a form of average-case analysis. This chapter surveys recent proposals of more robust models of such networks. These models posit…
Being able to recommend links between users in online social networks is important for users to connect with like-minded individuals as well as for the platforms themselves and third parties leveraging social media information to grow their…
In this paper we model the tomography of scale free networks by studying the structure of layers around an arbitrary network node. We find, both analytically and empirically, that the distance distribution of all nodes from a specific…
We introduce a new threshold model of social networks, in which the nodes influenced by their neighbours can adopt one out of several alternatives. We characterize social networks for which adoption of a product by the whole network is…
Social Network Analysis is a way of studying agents embedded in contexts. In about 1998, physicists discovered social networks as representations of complex systems. Small-world and scale-free networks are the paradigmatic models of this…
We model a social network by a random graph whose nodes represent agents and links between two of them stand for a reciprocal interaction; each agent is also associated to a binary variable which represents a dichotomic opinion or…
In a graph, nodes can be characterized locally (with their degree $k$) or globally (e.g. with their average length path $\xi$ to other nodes). Here we investigate how $\xi$ depends on $k$. Our earlier algorithm of the construction of the…
We study Erd\"{o}s-R\'enyi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights below the percolation threshold (percolation clusters)…