FBM: A Flexible Random Walk Based Generative Model for Social Network
نویسندگان
چکیده
This paper studies the static and dynamic characteristics of the real social networks as well as their proposed generative models, among which the Butterfly Model [1] is useful while not flexible enough to generate the social networks with the expected power-law exponent. And a novel Flexible Butterfly Model (FBM) is proposed based on the Butterfly Model and combined with the Monte Carlo method, and a Bayesian Graph Model for the training of the FBM Model is built in order to learn parameters from real social networks. Experiments have shown that the FBM model can adjust the law power exponent of the generated social network effectively by the introduced parameters. Meanwhile, the FBM model also maintains the vast majority of important characteristics that the Butterfly model has.
منابع مشابه
A Flexible Integrated Forward/ Reverse Logistics Model with Random Path-based Memetic Algorithm
Due to business and environmental issues, the efficient design of an integrated forward/reverse logistics network has recently attracted more attention from researchers. The significance of transportation cost and customer satisfaction spurs an interest in developing a flexible network design model with different delivery paths. This paper proposes a flexible mixed-integer programming model to ...
متن کاملDistance in the Forest Fire Model How far are you from Eve?
Leskovec, Kleinberg and Faloutsos (2005) observed that many social networks exhibit properties such as shrinking (i.e. bounded) diameter, densification, and (power-law) heavy tail degree distributions. To explain these phenomena, they introduced a generative model, called the Forest Fire model, and using simulations showed that this model indeed exhibited these properties; however, proving this...
متن کاملConvergence of dependent walks in a random scenery to fBm-local time fractional stable motions
It is classical to approximate the distribution of fractional Brownian motion by a renormalized sum Sn of dependent Gaussian random variables. In this paper we consider such a walk Zn that collects random rewards ξj for j ∈ Z, when the ceiling of the walk Sn is located at j. The random reward (or scenery) ξj is independent of the walk and with heavy tail. We show the convergence of the sum of i...
متن کاملProbit-Based Traffic Assignment: A Comparative Study between Link-Based Simulation Algorithm and Path-Based Assignment and Generalization to Random-Coefficient Approach
Probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. The problem of path overlapping in network modelling has been one of the main issues to be tackled. Due to its flexible covariance structure, probit model can adequately address the pro...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کامل