The document discusses similarities between the temporal patterns of communication in online social networks like Twitter and the dynamics of beads floating on liquid surfaces.
It hypothesizes that both systems self-organize under restricted resources, causing Twitter users to collectively spread messages and beads to form moving groups, creating dynamic heterogeneity. Local variation analysis is applied to characterize burstiness in user time series on the Higgs boson rumor, finding low popularity users communicate in bursts while high popularity users are more regular. Comparisons with bead experiments suggest interpreting dynamic heterogeneity in critical systems could help characterize viral hashtags in Twitter.
Who to follow and why: link prediction with explanationsNicola Barbieri
Presentation @KDD 2014.
In this paper we study link prediction with explanations for user recommendation in social networks. For this problem we propose WTFW (“Who to Follow and Why”), a stochastic topic model for link prediction over directed and nodes-attributed graphs. Our model not only predicts links, but for each predicted link it decides whether it is a “topical” or a “social” link, and depending on this decision it produces a different type of explanation.
Predictions of links in graphs based on content and information propagations.
Lecture for the M. Sc. Data Science, Sapienza University of Rome, Spring 2016.
One Tag to bind them all: Measuring Term abstractness in Social MetadataInovex GmbH
Social metadata from tagging systems can be used to infer the abstractness of terms. The paper presents methods to construct term graphs based on term co-occurrence and semantic similarity from folksonomies. Different graph-based measures are evaluated for how well they approximate term abstractness as defined in reference taxonomies. Frequency-based measures performed best at ranking terms by abstractness, showing social metadata can provide useful signals about conceptual relations between terms.
In this paper, we consider a criminal investigation on the collective guilt of part members in a working group. Assuming that the statistics we used are reliable, we present the Page Rank Model based on mutual information. First, we use the average mutual information between non-suspicious topics and the suspicious topics to score the topics by degree of suspicion. Second, we build the correlation matrix based on the degree of suspicion and acquire the corresponding Markov state transition matrix. Then, we set the original value for all members of the working group based on the degree of suspicion. At the last, we calculate the suspected degree of each member in the working group. In the small 10-people case, we build the improved Page Rank model. By calculating the statistics of this case, we acquire a table which indicates the ranking of the suspected degree. In contrast with the results given in this issue, we find these two results basically match each other, indicating the model we have built is feasible. In the current case, firstly, we obtain a ranking list on 15 topics in order of suspicion via Page Rank Model based on mutual information. Secondly, we acquire the stable point of Markov state transition matrix using the Markov chain. Then, we build the connection matrix based on the degree of suspicion and acquire the corresponding Markov state transition matrix. Last, we calculate the degree of 83 candidates. From the result, we can see that those suspicious are on the top of the ranking list while those innocent people are at the bottom of the list, representing that the model we have built is feasible. When suspicious topics and conspirators changed, a relatively good result can also be obtained by this model. In the current case, we have the evidence to believe that Dolores and Jerome, who are the senior managers, have significant suspicion. It is recommended that future attention should be paid to them. The Page Rank Model, based on mutual information, takes full account of the information flow in message distribution network. This model can not only deal with the statistics used in conspiracy, but also be applied to detect the infected cells in a biological network. Finally, we present the advantages and disadvantages of this model and the direction of improvements.
FUZZY STATISTICAL DATABASE AND ITS PHYSICAL ORGANIZATIONijdms
This document discusses fuzzy statistical databases and their physical organization. It introduces the concept of fuzzy cardinality for counting elements in a fuzzy set or fuzzy relation. A fuzzy statistical database is proposed to store fuzzy statistics generated from fuzzy relational databases. This fuzzy statistical database contains fuzzy statistical tables, which can be type-1 or type-2 depending on the complexity of the fuzzy attributes. The physical organization of these fuzzy statistical tables is discussed to facilitate efficient storage and retrieval of the imprecise statistical data.
Graph-based Analysis and Opinion Mining in Social NetworkKhan Mostafa
This is the final report for Networks & Data Mining Techniques project focusing on mining social network to estimate public opinion about entities and associated keywords. This project mines Twitter for recent feeds and analyzes them to estimate sentiment score, discussed entity and describing keywords in each tweet. This data is then exploited to elicit overall sentiment associated with each entity. Entities and keywords extracted is also used to form an entity-keyword bigraph. This graph is further used to detect entity communities and keywords found within those communities. Presented implementation works in linear time.
Who to follow and why: link prediction with explanationsNicola Barbieri
Presentation @KDD 2014.
In this paper we study link prediction with explanations for user recommendation in social networks. For this problem we propose WTFW (“Who to Follow and Why”), a stochastic topic model for link prediction over directed and nodes-attributed graphs. Our model not only predicts links, but for each predicted link it decides whether it is a “topical” or a “social” link, and depending on this decision it produces a different type of explanation.
Predictions of links in graphs based on content and information propagations.
Lecture for the M. Sc. Data Science, Sapienza University of Rome, Spring 2016.
One Tag to bind them all: Measuring Term abstractness in Social MetadataInovex GmbH
Social metadata from tagging systems can be used to infer the abstractness of terms. The paper presents methods to construct term graphs based on term co-occurrence and semantic similarity from folksonomies. Different graph-based measures are evaluated for how well they approximate term abstractness as defined in reference taxonomies. Frequency-based measures performed best at ranking terms by abstractness, showing social metadata can provide useful signals about conceptual relations between terms.
In this paper, we consider a criminal investigation on the collective guilt of part members in a working group. Assuming that the statistics we used are reliable, we present the Page Rank Model based on mutual information. First, we use the average mutual information between non-suspicious topics and the suspicious topics to score the topics by degree of suspicion. Second, we build the correlation matrix based on the degree of suspicion and acquire the corresponding Markov state transition matrix. Then, we set the original value for all members of the working group based on the degree of suspicion. At the last, we calculate the suspected degree of each member in the working group. In the small 10-people case, we build the improved Page Rank model. By calculating the statistics of this case, we acquire a table which indicates the ranking of the suspected degree. In contrast with the results given in this issue, we find these two results basically match each other, indicating the model we have built is feasible. In the current case, firstly, we obtain a ranking list on 15 topics in order of suspicion via Page Rank Model based on mutual information. Secondly, we acquire the stable point of Markov state transition matrix using the Markov chain. Then, we build the connection matrix based on the degree of suspicion and acquire the corresponding Markov state transition matrix. Last, we calculate the degree of 83 candidates. From the result, we can see that those suspicious are on the top of the ranking list while those innocent people are at the bottom of the list, representing that the model we have built is feasible. When suspicious topics and conspirators changed, a relatively good result can also be obtained by this model. In the current case, we have the evidence to believe that Dolores and Jerome, who are the senior managers, have significant suspicion. It is recommended that future attention should be paid to them. The Page Rank Model, based on mutual information, takes full account of the information flow in message distribution network. This model can not only deal with the statistics used in conspiracy, but also be applied to detect the infected cells in a biological network. Finally, we present the advantages and disadvantages of this model and the direction of improvements.
FUZZY STATISTICAL DATABASE AND ITS PHYSICAL ORGANIZATIONijdms
This document discusses fuzzy statistical databases and their physical organization. It introduces the concept of fuzzy cardinality for counting elements in a fuzzy set or fuzzy relation. A fuzzy statistical database is proposed to store fuzzy statistics generated from fuzzy relational databases. This fuzzy statistical database contains fuzzy statistical tables, which can be type-1 or type-2 depending on the complexity of the fuzzy attributes. The physical organization of these fuzzy statistical tables is discussed to facilitate efficient storage and retrieval of the imprecise statistical data.
Graph-based Analysis and Opinion Mining in Social NetworkKhan Mostafa
This is the final report for Networks & Data Mining Techniques project focusing on mining social network to estimate public opinion about entities and associated keywords. This project mines Twitter for recent feeds and analyzes them to estimate sentiment score, discussed entity and describing keywords in each tweet. This data is then exploited to elicit overall sentiment associated with each entity. Entities and keywords extracted is also used to form an entity-keyword bigraph. This graph is further used to detect entity communities and keywords found within those communities. Presented implementation works in linear time.
The document discusses assortativity and dissortativity in complex networks. It defines assortativity as "nodes with similar degree connect preferably" and dissortativity as "nodes with low degree try to connect with highly connected nodes." Several studies are summarized that examine assortativity in social networks like Twitter. Happiness was found to be assortative in Twitter reciprocal reply networks. Distance from one's typical location on Twitter was also found to correlate with expressed happiness levels. Assortative networks are described as being more resilient to attacks while disassortative networks are more vulnerable.
Link Prediction in (Partially) Aligned Heterogeneous Social NetworksSina Sajadmanesh
This document discusses link prediction in homogeneous and heterogeneous social networks. It begins by introducing the problem of link prediction and its applications. It then discusses various unsupervised and supervised methods for link prediction in homogeneous networks. Next, it covers relationship prediction and collective link prediction in heterogeneous networks. It also discusses link prediction in aligned heterogeneous networks using link transfer and anchor link inference. Finally, it outlines future work on this topic.
The community detection in complex networks has attracted a growing interest and is the subject of several
researches that have been proposed to understand the network structure and analyze the network
properties. In this paper, we give a thorough overview of different community discovery strategies, we
propose taxonomy of these methods, and we specify the differences between the suggested classes which
helping designers to compare and choose the most suitable strategy for the various types of network
encountered in the real world.
The document presents Kuralagam, a concept relation based search engine for Thirukkural (a classic Tamil literature). It uses CoReX, a concept relation indexing technique, to index Thirukkurals based on concepts and relations rather than keywords. This allows retrieval of semantically related Thirukkurals. The search engine was evaluated against traditional keyword search and found to have higher average precision (0.83 vs 0.52). It presents results in three tabs based on exact matches, related concepts, and expanded queries.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Latent Dirichlet Allocation as a Twitter Hashtag Recommendation SystemShailly Saxena
A Twitter hashtag recommendation system that uses unsupervised learning to recommend relevant hashtags for a given tweet. Latent Dirichlet Allocation model is used to estimate topics from a corpora of more than 5 million tweets.
Data Mining In Social Networks Using K-Means Clustering Algorithmnishant24894
This topic deals with K-Means Clustering Algorithm which is used to categorize the data set into clusters depending upon their similarities like common interest or organization or colleges, etc. It categorize the data into clusters on the basis of mutual friendship.
This document describes an algorithm to automatically classify social media contacts into circles or lists. It first identifies leaders in an ego network by calculating metrics like betweenness centrality, clustering coefficient, and degree density for each node. Leaders are used as seeds to form circles by including their friend connections. The algorithm uses conductance scoring to iteratively add or remove nodes at the circle boundaries. The approach is evaluated on a Facebook dataset and achieves results comparable to previous methods, with balanced error rates and F1 scores used as metrics.
Finding important nodes in social networks based on modified pagerankcsandit
Important nodes are individuals who have huge influence on social network. Finding important
nodes in social networks is of great significance for research on the structure of the social
networks. Based on the core idea of Pagerank, a new ranking method is proposed by
considering the link similarity between the nodes. The key concept of the method is the use of
the link vector which records the contact times between nodes. Then the link similarity is
computed based on the vectors through the similarity function. The proposed method
incorporates the link similarity into original Pagerank. The experiment results show that the
proposed method can get better performance.
Tweet Summarization and Segmentation: A Surveyvivatechijri
The document summarizes various techniques for tweet summarization and segmentation, and discusses how the particle swarm optimization (PSO) algorithm can be used for tweet clustering. It provides an overview of 8 papers that propose different approaches for tweet summarization using techniques like graph clustering, keyword graphs, and segmentation. It also analyzes these techniques and compares the performance of PSO to other clustering algorithms like K-means. The analysis shows that methods combining K-means and PSO have higher accuracy than K-means alone, and that PSO performs better than K-means for real-time tweet clustering, achieving an accuracy of 90.6% versus 62% for K-means.
- The document presents a study analyzing factors that influence continued participation in Twitter group chats. It develops a 5F model examining individual initiative, group characteristics, perceived receptivity, linguistic affinity, and geographic proximity.
- The study analyzes data from 30 educational Twitter chats over two years involving over 71,000 users. It also conducted a user survey.
- The 5F model effectively predicts whether a new user who attends one session will return based on analysis of their contributions, how well they fit with the group linguistically, and other metrics.
What Sets Verified Users apart? Insights Into, Analysis of and Prediction of ...IIIT Hyderabad
Social network and publishing platforms, such as Twitter, support the concept of verification. Veri-
fied accounts are deemed worthy of platform-wide public interest and are separately authenticated by the platform itself. There have been repeated assertions by these platforms about verification not being tan-
tamount to endorsement. However, a significant body of prior work suggests that possessing a verified
status symbolizes enhanced credibility in the eyes of the platform audience. As a result, such a station
is highly coveted among public figures and influencers. Hence, we attempt to characterize the network
of verified users on Twitter and compare the results to similar analyses performed for the entire Twit-
ter network. We extracted the whole graph of verified users on Twitter (as of July 2018) and obtained
231,246 English user-profiles and 79,213,811 connections. Subsequently, in the network analysis, we
found that the sub-graph of verified users mirrors the full Twitter users graph in some aspects, such as
possessing a short diameter. However, our findings contrast with earlier results on multiple fronts, such
as the possession of a power-law out-degree distribution, slight dissortativity, and a significantly higher
reciprocity rate, as elucidated in the paper. Moreover, we attempt to gauge the presence of salient com-
ponents within this sub-graph and detect the absence of homophily with respect to popularity, which
again is in stark contrast to the full Twitter graph. Finally, we demonstrate stationarity in the time series
of verified user activity levels.
It is in this backdrop that we attempt to deconstruct the extent to which Twitter’s verification policy
mingles the notions of authenticity and authority. To this end, we seek to unravel the aspects of a user’s
profile, which likely engender or preclude verification. The aim of the paper is two-fold: First, we test
if discerning the verification status of a handle from profile metadata and content features is feasible.
Second, we unravel the characteristics which have the most significant bearing on a handle’s verification
status. We augmented our dataset with all the 494 million tweets of the aforementioned users over a one
year collection period along with their temporal social reach and activity characteristics. Our proposed
models are able to reliably identify verification status (Area under curve AUC > 99%). We show that
the number of public list memberships, presence of neutral sentiment in tweets and an authoritative
language style are the most pertinent predictors of verification status.
To the best of our knowledge, this work represents the first quantitative attempt at characterizing
verified users on Twitter and also the first attempt at discerning and classifying verification worthy users
on Twitter.
This document discusses predicting new friendships in social networks using temporal information. It describes research on predicting new links in social networks over time using supervised learning models trained on temporal features from past network interactions. The researchers used anonymized Facebook data over 28 months to train decision tree and neural network classifiers to predict new relationships, finding models using temporal information performed better than those without it.
Entity Annotation WordPress Plugin using TAGME TechnologyTELKOMNIKA JOURNAL
The development of internet technology makes more information can be accessed. It makes
information need to be organized in order to be easily managed. One solution can be used is by using the
entity annotation approach which generates tags to represent that document. In this study, TAGME
technology is implemented on a WordPress plugin, which is used to manage a blog. Moreover, information
on Wikipedia ‘Bahasa Indonesia’ is processed to generate an anchor dictionary which is required by the
technology that is implemented. This plugin performs entity annotation by giving tag suggestion for posts in
a blog. Testing is carried out by measuring the precision, recall, and of tag suggestions given by the
plugin. The result shows that the plugin can give tag suggestions with precision 0.7638, recall 0.5508, and
0.59.
Social Trust-aware Recommendation System: A T-Index ApproachNima Dokoohaki
"Social Trust-aware Recommendation System: A T-Index Approach"
Workshop on Web Personalization, Reputation and Recommender Systems (WPRRS09)
Held in conjunction with 2009 IEEE/ WIC/ ACM International Conference on Web Intelligence (WI 2009) and Intelligent Agent Technology,
http://www.wprrs.scitech.qut.edu.au/
Università degli Studi di Milano Bicocca, Milano, Italy
September 15–18, 2009
Sunbelt 2013 conference presentation Hamburg, Bas ReusBas Reus
There is an advance in online collaboration tools, such as online collaboration platforms, in knowledge intensive organizations where people organize themselves to work towards a collective goal by means of online groups. We study the relationship between the structural position of ego in and between two online groups and the behavior ego exhibits in and between both groups. Using theories of structural holes, structural equivalence and structural cohesion, and Simmelian ties, we propose three structural positions of ego where two groups overlap that influences the role(s) that can be played by ego in and between both online groups. Being active in multiple online groups can foster the sharing of information between these groups, however, we argue that in certain circumstances it can work counterproductive. Social network analysis theory lacks theory on the effects of multiple group membership. In order to better understand the effect of multiple group membership on information sharing in organizational online environments, we focus on the role of ego as an active member of two online groups. We will use the term ‘bridging member’ for this scenario. We use communicative genres as organizing structures on online communities in order to determine the behavior ego plays in each group, and the effect when ego is and is not the only bridging member between the two groups. We find that the level of constrain for ego depends on the structural position of ego between two groups.
The Web Science MacroScope: Mixed-methods Approach for Understanding Web Acti...Markus Luczak-Rösch
Invited talk given at the QUEST (Qualitative Experise at Southampton, http://www.quest.soton.ac.uk/) group event (http://www.quest.soton.ac.uk/training/) on Qualitative Methods and Big Data.
AN GROUP BEHAVIOR MOBILITY MODEL FOR OPPORTUNISTIC NETWORKS csandit
Mobility is regarded as a network transport mechanism for distributing data in many networks.
However, many mobility models ignore the fact that peer nodes often carried by people and
thus move in group pattern according to some kind of social relation. In this paper, we propose
one mobility model based on group behavior character which derives from real movement
scenario in daily life. This paper also gives the character analysis of this mobility model and
compares with the classic Random Waypoint Mobility model.
The document discusses analyzing the temporal dynamics of hashtag diffusion on Twitter. It presents two methods: (1) Analyzing heterogeneity in hashtag popularity, which finds that a small number of hashtags are very popular while most are unpopular; (2) Performing a local analysis of hashtag spike trains to quantify non-stationarity using the Lv metric, which compares variations in the intervals between hashtag mentions. The analysis aims to characterize information diffusion and find differences between popular and unpopular hashtags.
The Semantic Evolution of Online CommunitiesMatthew Rowe
This paper studies the semantic evolution of online communities over time. It constructs semantic graphs based on concepts and entities discussed in community forums between given time intervals. It analyzes the macro evolution of these graphs across communities by measuring graph properties like node count, diameter, entropy, and specializations over time. It finds that for concept graphs, these measures tend to converge over time, while for entity graphs, node count increases linearly but other measures converge. This provides insights into how semantics in online communities develop and differ between communities.
The document discusses assortativity and dissortativity in complex networks. It defines assortativity as "nodes with similar degree connect preferably" and dissortativity as "nodes with low degree try to connect with highly connected nodes." Several studies are summarized that examine assortativity in social networks like Twitter. Happiness was found to be assortative in Twitter reciprocal reply networks. Distance from one's typical location on Twitter was also found to correlate with expressed happiness levels. Assortative networks are described as being more resilient to attacks while disassortative networks are more vulnerable.
Link Prediction in (Partially) Aligned Heterogeneous Social NetworksSina Sajadmanesh
This document discusses link prediction in homogeneous and heterogeneous social networks. It begins by introducing the problem of link prediction and its applications. It then discusses various unsupervised and supervised methods for link prediction in homogeneous networks. Next, it covers relationship prediction and collective link prediction in heterogeneous networks. It also discusses link prediction in aligned heterogeneous networks using link transfer and anchor link inference. Finally, it outlines future work on this topic.
The community detection in complex networks has attracted a growing interest and is the subject of several
researches that have been proposed to understand the network structure and analyze the network
properties. In this paper, we give a thorough overview of different community discovery strategies, we
propose taxonomy of these methods, and we specify the differences between the suggested classes which
helping designers to compare and choose the most suitable strategy for the various types of network
encountered in the real world.
The document presents Kuralagam, a concept relation based search engine for Thirukkural (a classic Tamil literature). It uses CoReX, a concept relation indexing technique, to index Thirukkurals based on concepts and relations rather than keywords. This allows retrieval of semantically related Thirukkurals. The search engine was evaluated against traditional keyword search and found to have higher average precision (0.83 vs 0.52). It presents results in three tabs based on exact matches, related concepts, and expanded queries.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Latent Dirichlet Allocation as a Twitter Hashtag Recommendation SystemShailly Saxena
A Twitter hashtag recommendation system that uses unsupervised learning to recommend relevant hashtags for a given tweet. Latent Dirichlet Allocation model is used to estimate topics from a corpora of more than 5 million tweets.
Data Mining In Social Networks Using K-Means Clustering Algorithmnishant24894
This topic deals with K-Means Clustering Algorithm which is used to categorize the data set into clusters depending upon their similarities like common interest or organization or colleges, etc. It categorize the data into clusters on the basis of mutual friendship.
This document describes an algorithm to automatically classify social media contacts into circles or lists. It first identifies leaders in an ego network by calculating metrics like betweenness centrality, clustering coefficient, and degree density for each node. Leaders are used as seeds to form circles by including their friend connections. The algorithm uses conductance scoring to iteratively add or remove nodes at the circle boundaries. The approach is evaluated on a Facebook dataset and achieves results comparable to previous methods, with balanced error rates and F1 scores used as metrics.
Finding important nodes in social networks based on modified pagerankcsandit
Important nodes are individuals who have huge influence on social network. Finding important
nodes in social networks is of great significance for research on the structure of the social
networks. Based on the core idea of Pagerank, a new ranking method is proposed by
considering the link similarity between the nodes. The key concept of the method is the use of
the link vector which records the contact times between nodes. Then the link similarity is
computed based on the vectors through the similarity function. The proposed method
incorporates the link similarity into original Pagerank. The experiment results show that the
proposed method can get better performance.
Tweet Summarization and Segmentation: A Surveyvivatechijri
The document summarizes various techniques for tweet summarization and segmentation, and discusses how the particle swarm optimization (PSO) algorithm can be used for tweet clustering. It provides an overview of 8 papers that propose different approaches for tweet summarization using techniques like graph clustering, keyword graphs, and segmentation. It also analyzes these techniques and compares the performance of PSO to other clustering algorithms like K-means. The analysis shows that methods combining K-means and PSO have higher accuracy than K-means alone, and that PSO performs better than K-means for real-time tweet clustering, achieving an accuracy of 90.6% versus 62% for K-means.
- The document presents a study analyzing factors that influence continued participation in Twitter group chats. It develops a 5F model examining individual initiative, group characteristics, perceived receptivity, linguistic affinity, and geographic proximity.
- The study analyzes data from 30 educational Twitter chats over two years involving over 71,000 users. It also conducted a user survey.
- The 5F model effectively predicts whether a new user who attends one session will return based on analysis of their contributions, how well they fit with the group linguistically, and other metrics.
What Sets Verified Users apart? Insights Into, Analysis of and Prediction of ...IIIT Hyderabad
Social network and publishing platforms, such as Twitter, support the concept of verification. Veri-
fied accounts are deemed worthy of platform-wide public interest and are separately authenticated by the platform itself. There have been repeated assertions by these platforms about verification not being tan-
tamount to endorsement. However, a significant body of prior work suggests that possessing a verified
status symbolizes enhanced credibility in the eyes of the platform audience. As a result, such a station
is highly coveted among public figures and influencers. Hence, we attempt to characterize the network
of verified users on Twitter and compare the results to similar analyses performed for the entire Twit-
ter network. We extracted the whole graph of verified users on Twitter (as of July 2018) and obtained
231,246 English user-profiles and 79,213,811 connections. Subsequently, in the network analysis, we
found that the sub-graph of verified users mirrors the full Twitter users graph in some aspects, such as
possessing a short diameter. However, our findings contrast with earlier results on multiple fronts, such
as the possession of a power-law out-degree distribution, slight dissortativity, and a significantly higher
reciprocity rate, as elucidated in the paper. Moreover, we attempt to gauge the presence of salient com-
ponents within this sub-graph and detect the absence of homophily with respect to popularity, which
again is in stark contrast to the full Twitter graph. Finally, we demonstrate stationarity in the time series
of verified user activity levels.
It is in this backdrop that we attempt to deconstruct the extent to which Twitter’s verification policy
mingles the notions of authenticity and authority. To this end, we seek to unravel the aspects of a user’s
profile, which likely engender or preclude verification. The aim of the paper is two-fold: First, we test
if discerning the verification status of a handle from profile metadata and content features is feasible.
Second, we unravel the characteristics which have the most significant bearing on a handle’s verification
status. We augmented our dataset with all the 494 million tweets of the aforementioned users over a one
year collection period along with their temporal social reach and activity characteristics. Our proposed
models are able to reliably identify verification status (Area under curve AUC > 99%). We show that
the number of public list memberships, presence of neutral sentiment in tweets and an authoritative
language style are the most pertinent predictors of verification status.
To the best of our knowledge, this work represents the first quantitative attempt at characterizing
verified users on Twitter and also the first attempt at discerning and classifying verification worthy users
on Twitter.
This document discusses predicting new friendships in social networks using temporal information. It describes research on predicting new links in social networks over time using supervised learning models trained on temporal features from past network interactions. The researchers used anonymized Facebook data over 28 months to train decision tree and neural network classifiers to predict new relationships, finding models using temporal information performed better than those without it.
Entity Annotation WordPress Plugin using TAGME TechnologyTELKOMNIKA JOURNAL
The development of internet technology makes more information can be accessed. It makes
information need to be organized in order to be easily managed. One solution can be used is by using the
entity annotation approach which generates tags to represent that document. In this study, TAGME
technology is implemented on a WordPress plugin, which is used to manage a blog. Moreover, information
on Wikipedia ‘Bahasa Indonesia’ is processed to generate an anchor dictionary which is required by the
technology that is implemented. This plugin performs entity annotation by giving tag suggestion for posts in
a blog. Testing is carried out by measuring the precision, recall, and of tag suggestions given by the
plugin. The result shows that the plugin can give tag suggestions with precision 0.7638, recall 0.5508, and
0.59.
Social Trust-aware Recommendation System: A T-Index ApproachNima Dokoohaki
"Social Trust-aware Recommendation System: A T-Index Approach"
Workshop on Web Personalization, Reputation and Recommender Systems (WPRRS09)
Held in conjunction with 2009 IEEE/ WIC/ ACM International Conference on Web Intelligence (WI 2009) and Intelligent Agent Technology,
http://www.wprrs.scitech.qut.edu.au/
Università degli Studi di Milano Bicocca, Milano, Italy
September 15–18, 2009
Sunbelt 2013 conference presentation Hamburg, Bas ReusBas Reus
There is an advance in online collaboration tools, such as online collaboration platforms, in knowledge intensive organizations where people organize themselves to work towards a collective goal by means of online groups. We study the relationship between the structural position of ego in and between two online groups and the behavior ego exhibits in and between both groups. Using theories of structural holes, structural equivalence and structural cohesion, and Simmelian ties, we propose three structural positions of ego where two groups overlap that influences the role(s) that can be played by ego in and between both online groups. Being active in multiple online groups can foster the sharing of information between these groups, however, we argue that in certain circumstances it can work counterproductive. Social network analysis theory lacks theory on the effects of multiple group membership. In order to better understand the effect of multiple group membership on information sharing in organizational online environments, we focus on the role of ego as an active member of two online groups. We will use the term ‘bridging member’ for this scenario. We use communicative genres as organizing structures on online communities in order to determine the behavior ego plays in each group, and the effect when ego is and is not the only bridging member between the two groups. We find that the level of constrain for ego depends on the structural position of ego between two groups.
The Web Science MacroScope: Mixed-methods Approach for Understanding Web Acti...Markus Luczak-Rösch
Invited talk given at the QUEST (Qualitative Experise at Southampton, http://www.quest.soton.ac.uk/) group event (http://www.quest.soton.ac.uk/training/) on Qualitative Methods and Big Data.
AN GROUP BEHAVIOR MOBILITY MODEL FOR OPPORTUNISTIC NETWORKS csandit
Mobility is regarded as a network transport mechanism for distributing data in many networks.
However, many mobility models ignore the fact that peer nodes often carried by people and
thus move in group pattern according to some kind of social relation. In this paper, we propose
one mobility model based on group behavior character which derives from real movement
scenario in daily life. This paper also gives the character analysis of this mobility model and
compares with the classic Random Waypoint Mobility model.
The document discusses analyzing the temporal dynamics of hashtag diffusion on Twitter. It presents two methods: (1) Analyzing heterogeneity in hashtag popularity, which finds that a small number of hashtags are very popular while most are unpopular; (2) Performing a local analysis of hashtag spike trains to quantify non-stationarity using the Lv metric, which compares variations in the intervals between hashtag mentions. The analysis aims to characterize information diffusion and find differences between popular and unpopular hashtags.
The Semantic Evolution of Online CommunitiesMatthew Rowe
This paper studies the semantic evolution of online communities over time. It constructs semantic graphs based on concepts and entities discussed in community forums between given time intervals. It analyzes the macro evolution of these graphs across communities by measuring graph properties like node count, diameter, entropy, and specializations over time. It finds that for concept graphs, these measures tend to converge over time, while for entity graphs, node count increases linearly but other measures converge. This provides insights into how semantics in online communities develop and differ between communities.
This document summarizes Michael Davern's proposed research agenda for applying social network analysis to economic sociology. It begins by outlining four key components of social networks: 1) structural, 2) resource, 3) normative, and 4) dynamic. It then reviews existing literature in economic sociology that utilizes social networks, such as studies of job searching and interlocking directorships. Finally, it proposes new areas for social networks to provide insights into socioeconomic behavior, such as combining the structural, resource, and normative dimensions over time. The overall aim is to demonstrate how social network analysis can create a more complete social science by integrating sociological and economic theories.
Rostislav Yavorsky - Research Challenges of Dynamic Socio-Semantic NetworksWitology
This document presents a model for dynamic socio-semantic networks and identifies key research challenges. The model represents social networks as weighted multi-graphs of members and their relationships, and content as multi-graphs of elements and relations. Authorship links members and content. Network dynamics include changes to members, relationships, content, and context over time. Research challenges involve discovering influential members and texts from network evolution data using interdisciplinary approaches that combine social science, linguistics and machine learning.
This document discusses methods for discovering emerging topics in social streams using two approaches: NADS (Notice-Abnormality based Discovery of Subjects) and VFDT (Very Fast Decision Trees). It proposes a probability model that captures both the normal posting behavior of users as well as the frequency of users being mentioned in posts. This model is used to quantitatively measure the novelty and potential impact of a post based on user commenting behavior. The approaches can identify new topics as early or earlier than text-frequency based approaches, especially when topics are poorly represented by post texts alone. The document provides details on implementing the probability model, calculating text frequency scores, deriving anomaly scores, using change point detection to recognize emerging topics, and
TOPIC networking portfolio
ACADEMIC LEVEL Undergrad. (yrs 3-4)
DISCIPLINE Business Studies
DOCUMENT TYPE Term paper
SPACING DOUBLE
CITATION STYLE Harvard
Twitter: Social Network Or News Medium?Serge Beckers
This document analyzes Twitter as a social network and news media by studying its topological characteristics and information diffusion. The authors:
1) Crawled over 41 million user profiles, 1.47 billion social connections, and 106 million tweets to analyze Twitter's structure and behavior.
2) Found that Twitter has a non-power law distribution of followers, short paths of separation between users, and low reciprocity - distinguishing it from other social networks.
3) Ranked users by followers, PageRank and retweets, finding influence inferred from followers differs from popularity of tweets.
4) Analyzed trending topics and found most are news headlines that persist for days with participation from many users.
Text mining on Twitter information based on R platformFayan TAO
This document summarizes an analysis of tweets related to the hashtag "#prayforparis" following the November 2015 Paris attacks. The analysis was conducted using R for text mining. It preprocessed 3200 tweets by cleaning, stemming words, and building a term-document matrix. Frequent words and associations were identified. Tweets were clustered into 10 groups and sentiment analysis was performed, finding most expressed sadness, anger, and prayed for Paris with a positive attitude toward the attacks. Key text mining techniques like preprocessing, matrix building, clustering and sentiment analysis were implemented in R to analyze information from Twitter about this event.
The Mathematics of Social Network Analysis: Metrics for Academic Social NetworksEditor IJCATR
Social network analysis plays an important role in analyzing social relations and patterns of interaction among actors in a
social network. Such networks can be casual, like those on social media sites, or formal, like academic social networks. Each of these
networks is characterised by underlying data which defines various features of the network. Keeping in view the size and diversity of
these networks it may not be possible to dissect entire network with conventional means. Social network visualization can be used to
graphically represent these networks in a concise and easy to understand manner. Social network visualization tools rely heavily on
quantitative features to numerically define various attributes of the network. These features also referred to as social network metrics
used everyday mathematics as their foundations. In this paper we provide an overview of various social network analysis metrics that
are commonly used to analyse social networks. Explanation of these metrics and their relevance for academic social networks is also
outlined
The possibility of modeling and abstracting interaction has been the key driver in social network-based
research as it facilitates, among other things, the generation of recommendations which is vital for most
businesses. Being ubiquitous, learning activities also facilitate the formation of these networks. Thus, to
gain insights into the evolution of activities and interactions that occur during learning events, it is
important to understand these networks and their respective models. In this article, we present a survey of
the representative methods employed in modeling various interactions observed in learner-centered
networks. Finally, we comparatively analyze the respective models and identify which models perform
better in respective cases.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Spreading processes on temporal networksPetter Holme
This document discusses temporal networks and how temporal structures can impact dynamical processes on networks. It begins by describing different types of temporal networks including person-to-person communication, information dissemination, physical proximity, and cellular biology networks. It then discusses methods for analyzing temporal network structures like inter-event times and how bursty or heavy-tailed distributions can slow spreading compared to memory-less processes. The document also presents examples of how neutralizing temporal structures like inter-event times or beginning/end times can impact spreading simulations. Finally, it discusses how different temporal network datasets exhibit diverse temporal structures.
Feedback Effects Between Similarity And Social Influence In Online CommunitiesPaolo Massa
SoNet Research Meeting presentation
Feedback Effects Between Similarity And Social Influence In Online Communities.
Authors: David Crandall, Dan Cosley, Daniel Huttenlocher, Jon Kleinberg, Siddharth Suri
Cornell University Ithaca, NY
2008 KDD: Proceeding of the 14th ACM KDD international conference on Knowledge discovery and data mining
#citations at 2010/04/09 from Google Scholar:44
Presenter: Paolo Massa, SoNet group, http://sonet.fbk.eu
Evolving Swings (topics) from Social Streams using Probability ModelIJERA Editor
This document presents a probability model for detecting evolving topics from social media streams. It focuses on the social aspects of posts reflected in user mentioning behavior, rather than textual content. The model captures the number of mentions per post and frequency of mentioned users. It analyzes individual posting anomalies and aggregates anomaly scores. SDNML change point analysis and burst detection are then used to identify evolving topics from the aggregated scores. Experimental results show that link-based detection using this approach performs better than key-based detection using textual content alone. The model overcomes limitations of prior frequency-based approaches and can detect topics from both textual and non-textual social media posts.
This document discusses how rumors spread quickly through social networks. It simulates a simple rumor spreading process on real-world social networks like Twitter and Orkut as well as theoretical network models. The results show that rumors spread much faster in the structures of actual social networks and preferential attachment networks than in random or complete networks. Specifically, a rumor reaching 45.6 million Twitter users within 8 rounds of communication.
An updated look at social network extraction system a personal data analysis ...eSAT Publishing House
This document summarizes a study on analyzing personal social network data over time. The study extracted data from Facebook, calculated social network analysis metrics like degree distribution and betweenness centrality, and analyzed how the network changed dynamically over time. Key findings included identifying influential and non-influential users, detecting communities that formed within the network, and identifying the celebrity or most influential user within one person's local network. Analyzing how social networks and interactions change dynamically provides insights useful for applications like marketing and recommendations.
Networks & Health
This document provides an introduction and overview of social network analysis and its relevance to health research. It discusses key concepts such as what networks are, different types of network data including one-mode and two-mode data, and different levels of analysis including ego networks, partial networks, and complete networks. The document also discusses why networks matter for health through connectionist mechanisms like diffusion and positional mechanisms like social roles. Overall, the document serves as a high-level introduction to social network concepts and their application to health research.
Similar to Poster presentation 5th BENet (Belgium Network Research Meting), Namur (20)
CLASS 12th CHEMISTRY SOLID STATE ppt (Animated)eitps1506
Description:
Dive into the fascinating realm of solid-state physics with our meticulously crafted online PowerPoint presentation. This immersive educational resource offers a comprehensive exploration of the fundamental concepts, theories, and applications within the realm of solid-state physics.
From crystalline structures to semiconductor devices, this presentation delves into the intricate principles governing the behavior of solids, providing clear explanations and illustrative examples to enhance understanding. Whether you're a student delving into the subject for the first time or a seasoned researcher seeking to deepen your knowledge, our presentation offers valuable insights and in-depth analyses to cater to various levels of expertise.
Key topics covered include:
Crystal Structures: Unravel the mysteries of crystalline arrangements and their significance in determining material properties.
Band Theory: Explore the electronic band structure of solids and understand how it influences their conductive properties.
Semiconductor Physics: Delve into the behavior of semiconductors, including doping, carrier transport, and device applications.
Magnetic Properties: Investigate the magnetic behavior of solids, including ferromagnetism, antiferromagnetism, and ferrimagnetism.
Optical Properties: Examine the interaction of light with solids, including absorption, reflection, and transmission phenomena.
With visually engaging slides, informative content, and interactive elements, our online PowerPoint presentation serves as a valuable resource for students, educators, and enthusiasts alike, facilitating a deeper understanding of the captivating world of solid-state physics. Explore the intricacies of solid-state materials and unlock the secrets behind their remarkable properties with our comprehensive presentation.
Microbial interaction
Microorganisms interacts with each other and can be physically associated with another organisms in a variety of ways.
One organism can be located on the surface of another organism as an ectobiont or located within another organism as endobiont.
Microbial interaction may be positive such as mutualism, proto-cooperation, commensalism or may be negative such as parasitism, predation or competition
Types of microbial interaction
Positive interaction: mutualism, proto-cooperation, commensalism
Negative interaction: Ammensalism (antagonism), parasitism, predation, competition
I. Mutualism:
It is defined as the relationship in which each organism in interaction gets benefits from association. It is an obligatory relationship in which mutualist and host are metabolically dependent on each other.
Mutualistic relationship is very specific where one member of association cannot be replaced by another species.
Mutualism require close physical contact between interacting organisms.
Relationship of mutualism allows organisms to exist in habitat that could not occupied by either species alone.
Mutualistic relationship between organisms allows them to act as a single organism.
Examples of mutualism:
i. Lichens:
Lichens are excellent example of mutualism.
They are the association of specific fungi and certain genus of algae. In lichen, fungal partner is called mycobiont and algal partner is called
II. Syntrophism:
It is an association in which the growth of one organism either depends on or improved by the substrate provided by another organism.
In syntrophism both organism in association gets benefits.
Compound A
Utilized by population 1
Compound B
Utilized by population 2
Compound C
utilized by both Population 1+2
Products
In this theoretical example of syntrophism, population 1 is able to utilize and metabolize compound A, forming compound B but cannot metabolize beyond compound B without co-operation of population 2. Population 2is unable to utilize compound A but it can metabolize compound B forming compound C. Then both population 1 and 2 are able to carry out metabolic reaction which leads to formation of end product that neither population could produce alone.
Examples of syntrophism:
i. Methanogenic ecosystem in sludge digester
Methane produced by methanogenic bacteria depends upon interspecies hydrogen transfer by other fermentative bacteria.
Anaerobic fermentative bacteria generate CO2 and H2 utilizing carbohydrates which is then utilized by methanogenic bacteria (Methanobacter) to produce methane.
ii. Lactobacillus arobinosus and Enterococcus faecalis:
In the minimal media, Lactobacillus arobinosus and Enterococcus faecalis are able to grow together but not alone.
The synergistic relationship between E. faecalis and L. arobinosus occurs in which E. faecalis require folic acid
Candidate young stellar objects in the S-cluster: Kinematic analysis of a sub...Sérgio Sacani
Context. The observation of several L-band emission sources in the S cluster has led to a rich discussion of their nature. However, a definitive answer to the classification of the dusty objects requires an explanation for the detection of compact Doppler-shifted Brγ emission. The ionized hydrogen in combination with the observation of mid-infrared L-band continuum emission suggests that most of these sources are embedded in a dusty envelope. These embedded sources are part of the S-cluster, and their relationship to the S-stars is still under debate. To date, the question of the origin of these two populations has been vague, although all explanations favor migration processes for the individual cluster members. Aims. This work revisits the S-cluster and its dusty members orbiting the supermassive black hole SgrA* on bound Keplerian orbits from a kinematic perspective. The aim is to explore the Keplerian parameters for patterns that might imply a nonrandom distribution of the sample. Additionally, various analytical aspects are considered to address the nature of the dusty sources. Methods. Based on the photometric analysis, we estimated the individual H−K and K−L colors for the source sample and compared the results to known cluster members. The classification revealed a noticeable contrast between the S-stars and the dusty sources. To fit the flux-density distribution, we utilized the radiative transfer code HYPERION and implemented a young stellar object Class I model. We obtained the position angle from the Keplerian fit results; additionally, we analyzed the distribution of the inclinations and the longitudes of the ascending node. Results. The colors of the dusty sources suggest a stellar nature consistent with the spectral energy distribution in the near and midinfrared domains. Furthermore, the evaporation timescales of dusty and gaseous clumps in the vicinity of SgrA* are much shorter ( 2yr) than the epochs covered by the observations (≈15yr). In addition to the strong evidence for the stellar classification of the D-sources, we also find a clear disk-like pattern following the arrangements of S-stars proposed in the literature. Furthermore, we find a global intrinsic inclination for all dusty sources of 60 ± 20◦, implying a common formation process. Conclusions. The pattern of the dusty sources manifested in the distribution of the position angles, inclinations, and longitudes of the ascending node strongly suggests two different scenarios: the main-sequence stars and the dusty stellar S-cluster sources share a common formation history or migrated with a similar formation channel in the vicinity of SgrA*. Alternatively, the gravitational influence of SgrA* in combination with a massive perturber, such as a putative intermediate mass black hole in the IRS 13 cluster, forces the dusty objects and S-stars to follow a particular orbital arrangement. Key words. stars: black holes– stars: formation– Galaxy: center– galaxies: star formation
Sexuality - Issues, Attitude and Behaviour - Applied Social Psychology - Psyc...PsychoTech Services
A proprietary approach developed by bringing together the best of learning theories from Psychology, design principles from the world of visualization, and pedagogical methods from over a decade of training experience, that enables you to: Learn better, faster!
The binding of cosmological structures by massless topological defectsSérgio Sacani
Assuming spherical symmetry and weak field, it is shown that if one solves the Poisson equation or the Einstein field
equations sourced by a topological defect, i.e. a singularity of a very specific form, the result is a localized gravitational
field capable of driving flat rotation (i.e. Keplerian circular orbits at a constant speed for all radii) of test masses on a thin
spherical shell without any underlying mass. Moreover, a large-scale structure which exploits this solution by assembling
concentrically a number of such topological defects can establish a flat stellar or galactic rotation curve, and can also deflect
light in the same manner as an equipotential (isothermal) sphere. Thus, the need for dark matter or modified gravity theory is
mitigated, at least in part.
Immersive Learning That Works: Research Grounding and Paths ForwardLeonel Morgado
We will metaverse into the essence of immersive learning, into its three dimensions and conceptual models. This approach encompasses elements from teaching methodologies to social involvement, through organizational concerns and technologies. Challenging the perception of learning as knowledge transfer, we introduce a 'Uses, Practices & Strategies' model operationalized by the 'Immersive Learning Brain' and ‘Immersion Cube’ frameworks. This approach offers a comprehensive guide through the intricacies of immersive educational experiences and spotlighting research frontiers, along the immersion dimensions of system, narrative, and agency. Our discourse extends to stakeholders beyond the academic sphere, addressing the interests of technologists, instructional designers, and policymakers. We span various contexts, from formal education to organizational transformation to the new horizon of an AI-pervasive society. This keynote aims to unite the iLRN community in a collaborative journey towards a future where immersive learning research and practice coalesce, paving the way for innovative educational research and practice landscapes.
(June 12, 2024) Webinar: Development of PET theranostics targeting the molecu...Scintica Instrumentation
Targeting Hsp90 and its pathogen Orthologs with Tethered Inhibitors as a Diagnostic and Therapeutic Strategy for cancer and infectious diseases with Dr. Timothy Haystead.
EWOCS-I: The catalog of X-ray sources in Westerlund 1 from the Extended Weste...Sérgio Sacani
Context. With a mass exceeding several 104 M⊙ and a rich and dense population of massive stars, supermassive young star clusters
represent the most massive star-forming environment that is dominated by the feedback from massive stars and gravitational interactions
among stars.
Aims. In this paper we present the Extended Westerlund 1 and 2 Open Clusters Survey (EWOCS) project, which aims to investigate
the influence of the starburst environment on the formation of stars and planets, and on the evolution of both low and high mass stars.
The primary targets of this project are Westerlund 1 and 2, the closest supermassive star clusters to the Sun.
Methods. The project is based primarily on recent observations conducted with the Chandra and JWST observatories. Specifically,
the Chandra survey of Westerlund 1 consists of 36 new ACIS-I observations, nearly co-pointed, for a total exposure time of 1 Msec.
Additionally, we included 8 archival Chandra/ACIS-S observations. This paper presents the resulting catalog of X-ray sources within
and around Westerlund 1. Sources were detected by combining various existing methods, and photon extraction and source validation
were carried out using the ACIS-Extract software.
Results. The EWOCS X-ray catalog comprises 5963 validated sources out of the 9420 initially provided to ACIS-Extract, reaching a
photon flux threshold of approximately 2 × 10−8 photons cm−2
s
−1
. The X-ray sources exhibit a highly concentrated spatial distribution,
with 1075 sources located within the central 1 arcmin. We have successfully detected X-ray emissions from 126 out of the 166 known
massive stars of the cluster, and we have collected over 71 000 photons from the magnetar CXO J164710.20-455217.
PPT on Alternate Wetting and Drying presented at the three-day 'Training and Validation Workshop on Modules of Climate Smart Agriculture (CSA) Technologies in South Asia' workshop on April 22, 2024.
Alternate Wetting and Drying - Climate Smart Agriculture
Poster presentation 5th BENet (Belgium Network Research Meting), Namur
1. Temporal Patterns of
cedaysan@gmail.com
http://fcxn.wordpress.com
http://xn.unamur.be
e, the interpretation of the dynamic
eity of the beads in a critical limit
lp to characterize viral memes
#hashtags) in twitter.
Refs:
1 C. Sanlı et al. (arXiv - 2013).
2 L. Berthier (2011).
• A typical snapshot of an experiment:
The white spots indicate the positions
of the beads floating on surface
waves.
cedaysan@gmail.com
http://fcxn.wordpress.com!
Month 6 General Meeting
http://xn.unamur.be
result, the twitter users collectively advertise and
the beads form groups to move together. Both
systems self-organize and create dynamic
heterogeneity.
Therefore, the interpretation of the dynamic
heterogeneity of the beads in a critical limit
would help to characterize viral memes
(#hashtags) in twitter.
Refs:
1 C. Sanlı et al. (arXiv - 2013).
2 L. Berthier (2011).
Refs:
1 H. Simon (1971).
2 L. Weng et al. (2012).
3 J. P. Gleeson et al. (2014).
0 12 24 36 48 60 72 84
0
time (hours)
nu
Communication
Spike Trains:
How often, who interacts with whom?
fcxn.wordpress.com
cedaysan@gmail.com
@CeydaSanli
Frontiers in Physics 3(79), 2015.
PLoS ONE 10(7): e0131704, 2015.
@RenaudLambiotte
compleXity !
networks
Sanli and Lambiotte Temporal pattern of online communication
accurately described by models on static networks and
consequently the process presents non-Markovian features
with strong influence on the time required to explore the
system [25, 26]. Furthermore, the dynamics drives a strong
heterogeneity observed in user activity [27, 28] and user/content
popularity [29–31]. Specifically, in Twitter, the heterogeneity in
popularity has been observed and quantified in different ways
by the size of retweet cascades, i.e., users re-transfer messages
to their own followers with or without modifying them [32–36]
or by the number of mentions of a user name, identified by the
symbol @, in other people’s tweets [37].
In this paper, we focus on the dynamics of social interactions
taking place when diffusing rumors about the discovery of the
Higgs boson on July 2012 in Twitter [38]. Our main goal is to find
connections between the statistical properties of user time series
established on the same subject, e.g., the announcement of the
discovery of the Higgs boson, and their activity and popularity.
To this end, we analyze tweets including social interactions, such
as retweets of a message (RT), mentions of a user name (@), and
replies to a message (RE). For each type of the interactions, a
user can either play an active, e.g., retweeting, or a passive, e.g.,
being retweeted, role. Therefore, we characterize each user by
8 time series: one active and one passive time series for each
of the 3 types of interaction as well as for the aggregation of
all interactions, as illustrated in Figure 1. Active time series are
denoted as WHO and passive time series are defined by WHOM.
We then investigate whether the statistical properties of each
signal is a good predictor for the activity and popularity of a user.
The following sections are organized as follows. In Section 2,
we describe the data set and provide basic statistical properties
of who and whom time series. In Section 3, we introduce a
technique dedicated to the analysis of non-stationary time series,
so-called local variation, originally established for neuron spike
trains [39–42] and recently applied to hashtag spike trains in
Twitter [43, 44]. In Section 4, we search for statistical relations
between local variation and measures of popularity of a user.
Finally, Section 5 summarizes the key results and raises open
questions.
2. Activity and Popularity of Users
Our aim is to examine the dynamics of user communications in
Twitter. We investigate how frequently users talk to each other
on a certain topic, e.g., the discovery of the Higgs boson, and
identify how complex dynamic patterns of the communications
evolve in time. To this end, we focus on the three different
types of interaction between users, retweet (RT), mention (@),
and reply (RE). Twitter users can adopt a tweet of someone and
use it again in their own tweet by RT or contact to other users
directly by typing user names in a message called @ or simply RE
to any tweets, e.g., regular tweets, retweets, and tweets/retweets
including @s. Typically, @s and REs are associated to personal
interactions between users, whereas RTs are responsible for large-
scale information diffusion in the social network and for the
emergence of cascades. Here, we count all types of interaction as
a part of complex information diffusion in the network.
FIGURE 1 | Illustration of communications in Twitter. The sketch
summarizes the two positions of each user, e.g., active (who) and passive
(whom). Who interacts in time with any other whom by retweeting (RT) the
messages and mentioning (@) the user names of whom in a message and
replying (RE) to the messages from whom. Quantifying temporal patterns in
time series of who with various ranges of the activity of users aU and of whom
by increasing the popularity of users pU is the main scope of this paper.
Interactions in Twitter are performed between at least two
users (for instance, a user can mention several other users in
a single tweet). Each action is directed and characterized by its
timestamp. The users performing the action play active roles
(who users), the users receiving their attention play a passive
role (whom users), and each user can appear in both active and
passive roles described in Figure 1. Therefore, we construct active
and passive RT, @, and RE spike trains for each user.
2.1. Data Set
As a test bed, we consider the publicly available Higgs Twitter
data set [38, 45], first collected to track the spread of the rumor
on the discovery of the Higgs boson via RT, @, or RE. The data set
is composed of tweets containing one of the following keywords
or hashtags related to the discovery of the Higgs boson, “lhc,”
“cern,” “boson,” and “higgs.” The start date is the 1st July 2012,
00:00 a.m. and the final date is the 7th July 2012, 11:59 p.m.,
which covers the announcement date of the discovery, the 4th
July 2012, 08:00 a.m. All dates and timestamps in the data are
converted to the Greenwich mean time. Detailed information on
the data collection procedure and basic statistics can be found in
Domenico et al. [38].
In total, the data is composed of 456,631 users (nodes) and
563,069 interactions (edges). Among those, we detect 354,930 RT,
171,237 @, and 36,902 RE, which shows that RT is more popular
than the other communication channels. For RT interactions, we
find 228,560 users join in who, in contrast, only 41,400 users
appear in whom. These numbers are smaller for @, e.g., 102,802
who and 31,477 whom, and even smaller for RE, with 27,227
who and 18,578 whom. In each case, whom is much lower
than who, as expected because a small number of users tend to
attract a large fraction of attention in both friendship [46, 47] and
online social [48–52] networks. This observation is confirmed
in Figure 2, where we present Zipf plots associated to each
Frontiers in Physics | www.frontiersin.org 2 September 2015 | Volume 3 | Article 79
summary!
patterns!
tail analysis is required to resolve temporal correlations [31,
], bursts [19–22], and cascading [53] driven by circadian
ythm [23, 24], complex decision-making of individuals [3,
54], and external factors [6] such as the announcement of
coveries, as considered in the current data [38].
To uncover the dynamics of the communication spike trains
borately, we apply the local variation LV originally defined to
aracterize non-stationary neuron spike trains [39–42] and very
ently has been used to analyze hashtag spike trains [43, 44].
nlike the memory coefficient and burstiness parameter [15], LV
ovides a local temporal measurement, e.g., at τi of a successive
me sequence of a spike train . . ., τi−1, τi, τi+1, . . ., and so
mpares temporal variations with their local rates [41]
LV =
3
N − 2
N−1
i = 2
(τi+1 − τi) − (τi − τi−1)
(τi+1 − τi) + (τi − τi−1)
2
(1)
ere N is the total number of spikes. Equation (1) also takes the
m [41]
LV =
3
N − 2
N−1
i = 2
τi+1 − τi
τi+1 + τi
2
(2)
re, τi+1 = τi+1 − τi quantifies the forward delays and
i = τi − τi−1 represents the backward waiting times for
event at τi. Importantly, the denominator normalizes the
antity such as to account for local variations of the rate at
ich events take place. By definition, LV takes values in the
erval (0:3) [43]. It has been shown that helps at classifying
namical patterns successfully [39, 40, 42–44]. Following the
alysis of Gamma processes [39, 40, 43] conventional in neuron
ke analysis [42], it is known that LV = 1 for temporarily
correlated (Poisson random) irregular spike trains, and that
gher values are associated to a burstiness of the spike trains.
contrast, smaller values indicate a higher regularity of the time
ies.
We now perform an analysis of LV on the user communication
ke trains. Equation (2) is performed through the spike trains
th removing multiple spikes taking place within 1 s. Such
ents are rare and their impact on the value of LV has been
own to be limited [43]. Figure 3 describes the distribution of
, P(LV) of full spike trains all together with RT, @, and RE
the who (a, b) and whom (c, d). Grouping LV based on the
quency fU, e.g., the activity of the who aU and the popularity
the whom pU, we examine the temporal patterns of the trains
different classes of aU and pU. For the real data in (a, c),
Figure 3A, LV is always larger than 1 in any values of aU,
ggesting that all users playing a role in who contact to the
om in bursty communications. However, in Figure 3C, we
serve distinct behavior of the whom users and bursts present
ly for low pU. By increasing pU, LV ≈ 1 indicating that there
no temporal correlation among the who referring the whom
d LV is slightly smaller than 1 for the most popular users,
dicating a tendency toward regularity in the time series, as also
served for the hashtag spike trains [43]. These observations
September 2015 | Volume 3 | Article 79
local!
variation!
5mm
• Inset: The displacement
field demonstrates local
heterogeneities in the flow.
• A typical snapshot of an experiment:
The white spots indicate the positions
of the beads floating on surface
waves.
cedaysan@gmail.com
http://fcxn.wordpress.com!
Month 6 General Meeting
http://xn.unamur.be
Fluctuations drive viral memes in online social media:
Integrating criticality into network science
Ceyda Sanlı, Vsevolod Salnikov, Lionel Tabourier, and Renaud Lambiotte
CompleXity Networks, naXys, University of Namur, Belgium.
To spread our posts throughout online social network
such as Twitter:
• When do we need to post?
• How often should a #hashtag be posted?
These questions emphasize the time features of our
twitting activity. They would be controlled much more easily
compared to the followings: What we post and how many
number of followers we have.
To be mobile in dense granular media such as highly
packed beads on surface waves:
• Do single beads move independently or form a group?
• Is the trajectory of each bead regular in time?
The quantification of the bead dynamics shows that the
beads perform heterogenous motion with a distinct time
scale to characterize this heterogeneity.
restricted amount of attention restricted amount of space
• Restricted amount of sources forces social
and physical systems to present
emergence of order.
hypothesis
• Twitter users want to spread their messages and
beads under driving want to be mobile. As a
result, the twitter users collectively advertise and
the beads form groups to move together. Both
systems self-organize and create dynamic
heterogeneity.
The origin of the fluctuations in
dynamics would be the same origins:
Therefore, the interpretation of the dynamic
heterogeneity of the beads in a critical limit
would help to characterize viral memes
(#hashtags) in twitter.
Refs:
1 C. Sanlı et al. (arXiv - 2013).
2 L. Berthier (2011).
Refs:
1 H. Simon (1971).
2 L. Weng et al. (2012).
3 J. P. Gleeson et al. (2014).
0 12 24 36 48 60 72 84
0
10
20
30
40
time (hours)
numberoftweets/unittime
daily tweet cycles
propogations of #hashtags
0 10 20 30 40 50 60 70 80 90
0
5
10
15
20
25
χ4
(l=2R,τ)
τ (s)
φ=0.652
φ=0.725
φ=0.741
φ=0.749
φ=0.753
φ=0.755
φ=0.760
φ=0.761
φ=0.762
φ=0.766
φ=0.770
φ=0.771
(a)
τχ
4
(l, φ)
hχ
4
(l, φ)
mobility of beads
spatiotemporal granular flow
time
0.2
0.6
1
1.4
1.8
*
P(r=2R,t)MM
Twitter #hashtag analysis
• single beads: • groups:
perimeter
• quantifying
dynamic
heterogeneity:
time (s)
0 0.5 1 1.5 2
[Ref:2]
[Ref:2]
• #nice:• #pepsi:
• observation:• artificial representation:
0 10 20 30 40 50 60
time (hours)
0 1 2 3 4 5 6 7 8
time (hours)
• analysis:
time (hours)
cumulative
time (hours)
cumulative
5mm
• Inset: The displacement
field demonstrates local
heterogeneities in the flow.
• A typical snapshot of an experiment:
The white spots indicate the positions
of the beads floating on surface
waves.
cedaysan@gmail.com
http://fcxn.wordpress.com!
Month 6 General Meeting
http://xn.unamur.be
Fluctuations drive viral memes in online social media:
Integrating criticality into network science
Ceyda Sanlı, Vsevolod Salnikov, Lionel Tabourier, and Renaud Lambiotte
CompleXity Networks, naXys, University of Namur, Belgium.
To spread our posts throughout online social network
such as Twitter:
• When do we need to post?
• How often should a #hashtag be posted?
These questions emphasize the time features of our
twitting activity. They would be controlled much more easily
compared to the followings: What we post and how many
number of followers we have.
To be mobile in dense granular media such as highly
packed beads on surface waves:
• Do single beads move independently or form a group?
• Is the trajectory of each bead regular in time?
The quantification of the bead dynamics shows that the
beads perform heterogenous motion with a distinct time
scale to characterize this heterogeneity.
restricted amount of attention restricted amount of space
• Restricted amount of sources forces social
and physical systems to present
emergence of order.
hypothesis
• Twitter users want to spread their messages and
beads under driving want to be mobile. As a
result, the twitter users collectively advertise and
the beads form groups to move together. Both
systems self-organize and create dynamic
heterogeneity.
The origin of the fluctuations in
dynamics would be the same origins:
Therefore, the interpretation of the dynamic
heterogeneity of the beads in a critical limit
would help to characterize viral memes
(#hashtags) in twitter.
Refs:
1 C. Sanlı et al. (arXiv - 2013).
2 L. Berthier (2011).
Refs:
1 H. Simon (1971).
2 L. Weng et al. (2012).
3 J. P. Gleeson et al. (2014).
0 12 24 36 48 60 72 84
0
10
20
30
40
time (hours)
numberoftweets/unittime
daily tweet cycles
propogations of #hashtags
0 10 20 30 40 50 60 70 80 90
0
5
10
15
20
25
χ
4
(l=2R,τ)
τ (s)
φ=0.652
φ=0.725
φ=0.741
φ=0.749
φ=0.753
φ=0.755
φ=0.760
φ=0.761
φ=0.762
φ=0.766
φ=0.770
φ=0.771
(a)
τχ
4
(l, φ)
h
χ
4
(l, φ)
mobility of beads
spatiotemporal granular flow
time
0.2
0.6
1
1.4
1.8*
P(r=2R,t)MM
Twitter #hashtag analysis
• single beads: • groups:
perimeter
• quantifying
dynamic
heterogeneity:
time (s)
0 0.5 1 1.5 2
[Ref:2]
[Ref:2]
• #nice:• #pepsi:
• observation:• artificial representation:
0 10 20 30 40 50 60
time (hours)
0 1 2 3 4 5 6 7 8
time (hours)
• analysis:
time (hours)
cumulative
time (hours)
cumulative
real !
vs!
artificial!
Temporal pattern of online communication
dard Pearson
en from the
nt covers 3
d RT spike
lly RT and @,
or who (A,B)
e temporal
sses, the
coefficients
he average
that of @.
e three main
s, e.g., bursts
her/his own
or RE or RT
h that their
n a message
A B
C D
FIGURE 7 | Linear correlations of LV of the same users. The procedure
and representation of the coefficients follow the same strategy as introduced in
Figure 6. However, we now impose the same users in the same frequency
classes. Even though (A,C) present the agreement in the temporal patterns of
full and RT spike trains of the same users, with high correlation coefficients in
almost all frequency ranges, (B) indicates lower consistency between RT and
@ spike trains during entire activity ⟨aU⟩ and (D) provides a significant result.
While less temporal coherence is observed between RT and @ spike trains in
low popularity ⟨pU⟩, the correlation drastically increases with ⟨pU⟩.
boson on July 4, 2012 within a restricted time window, e.g., 6
days [38]. The main aim is to extract salient temporal patterns
of communication in various types of interaction observed in
Twitter such as retweet (RT), mention (@), and reply (RE).
Adopting the technique so-called local variation LV originally
introduced for neuron spike trains [39–42] and recently has
applied to hashtag spike trains in Twitter [43, 44], we perform
detailed analysis on user communication spike trains. Showing
strong influences of the frequency of the hashtag spike trains on
the resultant temporal patterns in the earlier work [43, 44], in
parallel we here examine the differences in the patterns induced
by the frequency of the user communication spike trains, fU.
We investigate user communication spike trains in two
categories, the first set of users are the active ones, who users,
and the other set is composed of the passive users, whom users,
in the communication, and each user can appear in both pools.
For who, f simply gives what extend users contact to whom
Sanli and Lambiotte Temporal pattern of online communication
A B
C D
FIGURE 3 | Probability density function of the local variation LV , P(LV )
of who (A,B) and whom (C,D) users in various ranges of the two
communication frequencies, e.g., aU and pU. (A,C) describe the results of
the real data. When we only observe bursty communication patters in who
independently of the average user activity frequency ⟨aU⟩ in (A), significant
variations in LV by increasing the average user popularity ⟨pU⟩ are clear in (C).
The results prove that popular users are addressed randomly in time and
slightly more regular patterns observed in the most popular users. On the
other hand, (B,D) present the statistics of artificially generated random spikes
serving as a null model and all frequency ranges give the distributions around
1, as expected for temporarily uncorrelated signals.
are significantly different for artificial spike trains constructed
by randomly permuting the real full spike train and so expected
to generate non-stationary Poisson processes. Therefore, all
distributions are centered around 1 in this case, independently
of aU and pU, as shown in Figures 3B,D. The randomization and
obtaining a null set follow the same procedure explained in detail
in Sanli and Lambiotte [43].
Even though Figure 3 represents P(LV) of full spike trains,
i.e., all interactions together, P(LV) of individual RT, @, and
RE communication spike trains describes very similar temporal
behavior for both the who and whom. Figure 4 summarizes the
detail of P(LV), the mean of LV, µ(LV) with the corresponding
standard deviations σ(LV) as error bars, comparatively. The
results highlight that to classify the communication temporal
patterns neither the position of the users, whether active or
passive, nor the types of the interaction, but the frequency
of the communication fU such as aU and pU plays a major
role. All Figures 4A–D, we observe three regions: Bursts in low
fU, log10⟨fU⟩ < 2.5, irregular uncorrelated (Poisson random)
dynamics in moderate and high fU, log10⟨fU⟩ ≈ 2.5–3, and
regular patterns in very high fU, log10⟨fU⟩ > 3. This conclusion
supports the importance of frequency so time parameter overall
human behavior [14, 16]. Applying standard linear fittings to the
underlying data of Figure 4, composed of 5104 data points for
whom, the understanding can be further proven. We observe the
significant negative trend of LV with increasing pU, i.e., the slope
is −0.32.
A B
C D
FIGURE 4 | Mean µ of the local variation LV of the user communication
spike trains vs. the logarithmic average frequency log10⟨fU⟩. The results
of who are represented by red squares and blue circles describe that of whom.
Types of the interaction are investigated in detail: (A) All communications of
retweet, RT, mention, @, and reply, RE. (B) Only RT. (C) Only @. (D) Only RE.
Independent of the types of the interaction, the frequency of communication,
e.g., the activity of users aU and the popularity of users pU, designs overall
communication patterns. While low fU gives bursty patterns with LV > 1,
moderate fU indicates irregular uncorrelated (Poisson random) signals, e.g.,
LV ≈ 1. For all high fU, LV < 1 presenting the regularity of the
communications. The error bars show the corresponding standard variations.
We now perform a more thorough comparison in Figure 5,
on the disparity of LV in different frequency ranges. To this end,
we calculate the standard z-values in two ways. First, to compare
LV of the full spike trains with LV of only RT and also with LV of
only @ spike trains, LRT
V and L@
V, respectively, we introduce
z(fU) =
µ(Lk
V) − µ0(LV)
σ(Lk
V)/ f k
U
(3)
Here, k in superscripts labels the interaction, e.g., either RT or
@. Precisely, Lk
V is determined based on a filtered spike train
composed of the user timestamps of either RT or @, as already
used in (Figures 4B,C). In addition, µk is the mean of Lk
V, also
presented in Figures 4B,C, and µ0 is the mean LV of the full spike
train, given in Figure 4A.
In Figure 5, black squares show z-values of RT and black
circles describe z-values of @. For who in Figure 5A where LV
only presents bursty patterns (orange shaded area) and low aU,
we have small z-values proving the agreement of the temporal
patterns suggested by LV in the same aU. However, for whom
in Figure 5B where we have rich values of pU compared to the
values of aU, while z-values are small in bursty patterns (low pU,
orange area) as also in who and in regular patterns (high pU,
yellow area), larger z−@ value (the black circle) is calculated in
uncorrelated Poisson dynamics (moderate pU, purple area). The
disagreement of LV with large z−@ indicates that even though
Frontiers in Physics | www.frontiersin.org 4 September 2015 | Volume 3 | Article 79
Sanli and Lambiotte Temporal pattern of online communication
A B
C D
FIGURE 3 | Probability density function of the local variation LV , P(LV )
of who (A,B) and whom (C,D) users in various ranges of the two
communication frequencies, e.g., aU and pU. (A,C) describe the results of
the real data. When we only observe bursty communication patters in who
independently of the average user activity frequency ⟨aU⟩ in (A), significant
variations in LV by increasing the average user popularity ⟨pU⟩ are clear in (C).
The results prove that popular users are addressed randomly in time and
slightly more regular patterns observed in the most popular users. On the
other hand, (B,D) present the statistics of artificially generated random spikes
serving as a null model and all frequency ranges give the distributions around
1, as expected for temporarily uncorrelated signals.
are significantly different for artificial spike trains constructed
by randomly permuting the real full spike train and so expected
to generate non-stationary Poisson processes. Therefore, all
distributions are centered around 1 in this case, independently
of aU and pU, as shown in Figures 3B,D. The randomization and
obtaining a null set follow the same procedure explained in detail
in Sanli and Lambiotte [43].
Even though Figure 3 represents P(LV) of full spike trains,
i.e., all interactions together, P(LV) of individual RT, @, and
RE communication spike trains describes very similar temporal
behavior for both the who and whom. Figure 4 summarizes the
detail of P(LV), the mean of LV, µ(LV) with the corresponding
standard deviations σ(LV) as error bars, comparatively. The
results highlight that to classify the communication temporal
patterns neither the position of the users, whether active or
passive, nor the types of the interaction, but the frequency
of the communication fU such as aU and pU plays a major
role. All Figures 4A–D, we observe three regions: Bursts in low
fU, log10⟨fU⟩ < 2.5, irregular uncorrelated (Poisson random)
dynamics in moderate and high fU, log10⟨fU⟩ ≈ 2.5–3, and
regular patterns in very high fU, log10⟨fU⟩ > 3. This conclusion
supports the importance of frequency so time parameter overall
human behavior [14, 16]. Applying standard linear fittings to the
underlying data of Figure 4, composed of 5104 data points for
whom, the understanding can be further proven. We observe the
significant negative trend of LV with increasing pU, i.e., the slope
is −0.32.
A B
C D
FIGURE 4 | Mean µ of the local variation LV of the user communication
spike trains vs. the logarithmic average frequency log10⟨fU⟩. The results
of who are represented by red squares and blue circles describe that of whom.
Types of the interaction are investigated in detail: (A) All communications of
retweet, RT, mention, @, and reply, RE. (B) Only RT. (C) Only @. (D) Only RE.
Independent of the types of the interaction, the frequency of communication,
e.g., the activity of users aU and the popularity of users pU, designs overall
communication patterns. While low fU gives bursty patterns with LV > 1,
moderate fU indicates irregular uncorrelated (Poisson random) signals, e.g.,
LV ≈ 1. For all high fU, LV < 1 presenting the regularity of the
communications. The error bars show the corresponding standard variations.
We now perform a more thorough comparison in Figure 5,
on the disparity of LV in different frequency ranges. To this end,
we calculate the standard z-values in two ways. First, to compare
LV of the full spike trains with LV of only RT and also with LV of
only @ spike trains, LRT
V and L@
V, respectively, we introduce
z(fU) =
µ(Lk
V) − µ0(LV)
σ(Lk
V)/ f k
U
(3)
Here, k in superscripts labels the interaction, e.g., either RT or
@. Precisely, Lk
V is determined based on a filtered spike train
composed of the user timestamps of either RT or @, as already
used in (Figures 4B,C). In addition, µk is the mean of Lk
V, also
presented in Figures 4B,C, and µ0 is the mean LV of the full spike
train, given in Figure 4A.
In Figure 5, black squares show z-values of RT and black
circles describe z-values of @. For who in Figure 5A where LV
only presents bursty patterns (orange shaded area) and low aU,
we have small z-values proving the agreement of the temporal
patterns suggested by LV in the same aU. However, for whom
in Figure 5B where we have rich values of pU compared to the
values of aU, while z-values are small in bursty patterns (low pU,
orange area) as also in who and in regular patterns (high pU,
yellow area), larger z−@ value (the black circle) is calculated in
uncorrelated Poisson dynamics (moderate pU, purple area). The
disagreement of LV with large z−@ indicates that even though
Frontiers in Physics | www.frontiersin.org 4 September 2015 | Volume 3 | Article 79
Spike Trains
C. Sanli, CompleXity Networks, UNamur
time
count
t t0 f
VARIABLE OF A TIME SERIES
es in social system include interaction among agents. Considering online social
h as Twitter, we address self-organized optimizing of popularity of information.
we create time series of #hashtag propogation, user activity, and user #hashtag
series, if a time delay between successive events, inter-event interval ⌧, is a
ndependent events, the distrubution of inter-event interval is Poissonian. If not,
events are observed and therefore forward propogation of a signal is a function
ral history. Thus, quantifying ⌧ is crucial.
iable Lv is an alternative way to characterize whether a time series is Poissonian
onian. For a stationarly process, Lv is a ratio of the di↵erence between the
nterval of forward event and the inter-event interval of backward event to the
inter-event intervals. Suppose that a signal propogates in distinct time such as
⌧i, ⌧i+1, . . . ⌧N . Then, at ⌧i, the inter-event interval of forward event is ⌧i+1 =
the inter-event interval of backward event is ⌧i = ⌧i ⌧i 1. Consequently, Lv
Lv =
3
N 2
N 1X
i=2
✓
(⌧i+1 ⌧i) (⌧i ⌧i 1)
(⌧i+1 ⌧i) + (⌧i ⌧i 1)
◆2
=
✓
⌧i+1 ⌧i
⌧i+1 + ⌧i
◆2
. (1)
he total appearance of a time series in distinct times. Multiple activity in same
.
1 the distribution of the inter-event interval of a time series is Poissonian. If a
onsiders significant amount of bursty activity, the distribution is non-Poissonian.
3 the distribution is automatically assumed to be Poissonian.
S OF Lv
time series can be defined as how many activity proceeded in distinct times ⌧i.
ur in multiple di↵erent ⌧i, N 3, the signal has high rank. If a time serie is
⇡ 3, the signal has low rank.
2
0 50 100 150 200 250 300 350
0
0.5
1
1.5
2
2.5
3
3.5
τ
h
(hour)
L
v
< r
h
>=91127
< r
h
>=18553
< r
h
>= 1678
< r
h
>= 318
< r
h
>= 174
< r
h
>= 117
< r
h
>= 86
< r
h
>= 68
< r
h
>= 56
< r
h
>= 47
< r
h
>= 41
< r
h
>= 35
me series versus life time (⌧h) of the corresponsing
Randomly selected #hashtag activity from real
10
−4
10
−2
10
0
10
2
10
4
10
0
10
1
10
2
10
3
10
4
10
5
10
6
τ
h
(hour)
r
h
r =2h
FIG. 2. Rank of #hashtag rh versus life time of #hashtag ⌧h.
2
. . .
10
−4
10
−2
10
0
10
2
10
4
10
0
10
1
10
2
10
3
10
4
10
5
10
6
τ
h
(hour)
r
h
r =2h
FIG. 2. Rank of #hashtag rh versus life time of #hashtag ⌧h.
2
00:0012:0000:0012:0000:0012:0000:0012:0000:0012:0000:0012:0000:00
0
10
20
30
40
50
60
hour
count/min.
#hollande
#sarkozy
#votehollande
#fh2012
#france2012
FIG. 1. ...
hpi =
p
2
Social Dynamic Behavior Patterns
= popularity
data set: Higgs boson
discovery, July 4, 2012.
spike trains: !
user communication in twitter
retweet (RT), reply (RE),
and mention (@).
active (WHO) and
passive (WHOM):
frequency dominates
to design online social
dynamic behavior.
real spikes present significantly
different dynamics, comparing to
artificial ones.
bursty who communicates to
popular whom randomly in time,
e.g. no temporal correlation while
addressing valorized whom.
RT and @ - dynamics is in an
alignment only for popular whom.
bursty!
regular!random!
a = activity !
bursty WHO!
popular WHOM
correlation of
LV provides a
comparison in
the patterns
between two
channels.
V
. It has been shown that helps at classifying
s successfully [39, 40, 42–44]. Following the
a processes [39, 40, 43] conventional in neuron
], it is known that LV = 1 for temporarily
son random) irregular spike trains, and that
associated to a burstiness of the spike trains.
r values indicate a higher regularity of the time
m an analysis of LV on the user communication
ion (2) is performed through the spike trains
ultiple spikes taking place within 1 s. Such
d their impact on the value of LV has been
ed [43]. Figure 3 describes the distribution of
spike trains all together with RT, @, and RE
and whom (c, d). Grouping LV based on the
the activity of the who aU and the popularity
we examine the temporal patterns of the trains
s of aU and pU. For the real data in (a, c),
is always larger than 1 in any values of aU,
users playing a role in who contact to the
ommunications. However, in Figure 3C, we
ehavior of the whom users and bursts present
y increasing pU, LV ≈ 1 indicating that there
rrelation among the who referring the whom
smaller than 1 for the most popular users,
ncy toward regularity in the time series, as also
hashtag spike trains [43]. These observations
September 2015 | Volume 3 | Article 79
dressed by who such that their
r name is mentioned in a message
om who.
and whom such as the following-
t is to quantify online user
To reduce the complexity in
tudied here consider only a unique
that is the discovery of the Higgs
in the communication, and each user can appear in both pools.
For who, fU simply gives what extend users contact to whom
and so it is the activity of who, aU. On the other hand, for
whom, the generated spike trains present how often who refers
the messages or the user names of whom and therefore, fU is
the popularity of whom, pU. Providing comparative statistics on
LV of who and whom with increasing aU and pU, respectively,
we observe quite distinct temporal behavior of online users.
First, we observe an asymmetry between active and passive
interactions, as only the former give rise to hubs, with few users
attracting a large share of the attention. Moreover, who constantly
presents bursts, LV > 1 for all values of aU, whereas whom
demonstrates various dynamic behavior patterns, depending on
rg 6 September 2015 | Volume 3 | Article 79
Sanli and Lambiotte
the popularity: The
bursty time series, p
contacted by tempo
Poisson random sp
users with the ma
e.g., LV < 1.
These scenarios a
e.g., who or whom,
RT or @, suggestin
dominates to design
is also supported
the user pairs in th
linear correlation o
patterns. There, we
dynamic behavior
both metrics are com
users.
The analysis c
communication sp
relation in Twitter,
of connected users.
period of the data
the announcement
days after this date
of the communicat
during the announ
investigated in our
of the other researc
of the frequency in
i