scholarly journals Geographical Structural Features of the WeChat Social Networks

2020 ◽  
Vol 9 (5) ◽  
pp. 290
Author(s):  
Chuan Ai ◽  
Bin Chen ◽  
Hailiang Chen ◽  
Weihui Dai ◽  
Xiaogang Qiu

Recently, spatial interaction analysis of online social networks has become a big concern. Early studies of geographical characteristics analysis and community detection in online social networks have shown that nodes within the same community might gather together geographically. However, the method of community detection is based on the idea that there are more links within the community than that connect nodes in different communities, and there is no analysis to explain the phenomenon. The statistical models for network analysis usually investigate the characteristics of a network based on the probability theory. This paper analyzes a series of statistical models and selects the MDND model to classify links and nodes in social networks. The model can achieve the same performance as the community detection algorithm when analyzing the structure in the online social network. The construction assumption of the model explains the reasons for the geographically aggregating of nodes in the same community to a degree. The research provides new ideas and methods for nodes classification and geographic characteristics analysis of online social networks and mobile communication networks and makes up for the shortcomings of community detection methods that do not explain the principle of network generation. A natural progression of this work is to geographically analyze the characteristics of social networks and provide assistance for advertising delivery and Internet management.

2017 ◽  
Vol 01 (01) ◽  
pp. 1630001 ◽  
Author(s):  
Hossein Fani ◽  
Ebrahim Bagheri

Online social networks have become a fundamental part of the global online experience. They facilitate different modes of communication and social interactions, enabling individuals to play social roles that they regularly undertake in real social settings. In spite of the heterogeneity of the users and interactions, these networks exhibit common properties. For instance, individuals tend to associate with others who share similar interests, a tendency often known as homophily, leading to the formation of communities. This entry aims to provide an overview of the definitions for an online community and review different community detection methods in social networks. Finding communities are beneficial since they provide summarization of network structure, highlighting the main properties of the network. Moreover, it has applications in sociology, biology, marketing and computer science which help scientists identify and extract actionable insight.


2017 ◽  
Vol 10 (4) ◽  
pp. 50
Author(s):  
Bikash Chandra Singh ◽  
Mohammad Muntasir Rahman ◽  
Md Sipon Miah ◽  
Mrinal Kanti Baowaly

Community detection in online social networks is a difficult but important phenomenon in term of revealing hidden relationships patterns among people so that we can understand human behaviors in term of social-economics perspectives. Community detection algorithms allow us to discover these types of patterns in online social networks. Identifying and detecting communities are not only of particular importance but also have immediate applications. For this reason, researchers have been intensively investigated to implement efficient algorithms to detect community in recent years. In this paper, we introduce set theory to address the community detection problem considering node attributes and network structural patterns. We also formulate probability theory to detect the overlapping community in online social network. Furthermore, we extend our focus on the comparative analysis on some existing community detection methods, which basically consider node attributes and edge contents for detecting community. We conduct comprehensive analysis on our framework so that we justify the performance of our proposed model. The experimental results show the effectiveness of the proposed approach.


2019 ◽  
Vol 8 (3) ◽  
pp. 5434-5440

Networks is a platform which is easily accessible by normal users worldwide. Online Social Networks facilitates users online to get registered with ease of speed and create their own accounts to communicate with the social world for information gathering. This platform allows everyone to get registered online irrespective of their social behaviour. Users here are creating duplicate accounts that is creating Sybil in the network. By this Sybil online Social Networks are suffering for different kinds of Sybil attacks online. In social networks user’s feedback and preferences play an important role in suggesting friends online or recommending products online. When collecting the feedback or preferences of any product online both Sybil user’s and real user’s data is considered as we are not differentiating the Sybil user or real user. From this products, recommended online will not have an efficient rating which would divert the buyers online. To over this problem we propose Sybil Community Detection Algorithm (SCD) and TrustRank Algorithm that bifurcates real user votes and Sybil users votes to fetch the efficient products online thus build secure online environment.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Jun Ge ◽  
Lei-lei Shi ◽  
Lu Liu ◽  
Hongwei Shi ◽  
John Panneerselvam

Link prediction in online social networks intends to predict users who are yet to establish their network of friends, with the motivation of offering friend recommendation based on the current network structure and the attributes of nodes. However, many existing link prediction methods do not consider important information such as community characteristics, text information, and growth mechanism. In this paper, we propose an intelligent data management mechanism based on relationship strength according to the characteristics of social networks for achieving a reliable prediction in online social networks. Secondly, by considering the network structure attributes and interest preference of users as important factors affecting the link prediction process in online social networks, we propose further improvements in the prediction process by designing a friend recommendation model with a novel incorporation of the relationship information and interest preference characteristics of users into the community detection algorithm. Finally, extensive experiments conducted on a Twitter dataset demonstrate the effectiveness of our proposed models in both dynamic community detection and link prediction.


2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Vesa Kuikka

AbstractWe present methods for analysing hierarchical and overlapping community structure and spreading phenomena on complex networks. Different models can be developed for describing static connectivity or dynamical processes on a network topology. In this study, classical network connectivity and influence spreading models are used as examples for network models. Analysis of results is based on a probability matrix describing interactions between all pairs of nodes in the network. One popular research area has been detecting communities and their structure in complex networks. The community detection method of this study is based on optimising a quality function calculated from the probability matrix. The same method is proposed for detecting underlying groups of nodes that are building blocks of different sub-communities in the network structure. We present different quantitative measures for comparing and ranking solutions of the community detection algorithm. These measures describe properties of sub-communities: strength of a community, probability of formation and robustness of composition. The main contribution of this study is proposing a common methodology for analysing network structure and dynamics on complex networks. We illustrate the community detection methods with two small network topologies. In the case of network spreading models, time development of spreading in the network can be studied. Two different temporal spreading distributions demonstrate the methods with three real-world social networks of different sizes. The Poisson distribution describes a random response time and the e-mail forwarding distribution describes a process of receiving and forwarding messages.


2015 ◽  
Vol 11 (3) ◽  
pp. 177-186 ◽  
Author(s):  
Partha Basuchowdhuri ◽  
Riya Roy ◽  
Siddhartha Anand ◽  
Diksha Roy Srivastava ◽  
Subhashis Majumder ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document