Questions tagged [social-network]
Social network data consists of a collection of "nodes" (which can be any sort of entity - e.g. people, corporations) and "links" (which can be any sort of relationship - e.g. friend, sharing a board member).
0
votes
0answers
13 views
Understanding Assortativity in Networks
I'm not the best at math or graph theory and I'm trying to understand the formula for assortativity here
$$r=\frac{\sum_i e_{ii}-\sum_i a_i b_i}{1-\sum_i a_i b_i}$$
where $e(i,j)$ is the fraction of ...
0
votes
1answer
19 views
In the study of causal inference on networks, what implications does assuming unconfoundedness have on homophily?
I read in a book on causal inference on networks that:
The unconfoundedness assumption does not rule out the presence of
homophily, that is tendency of individuals who share similar
...
0
votes
0answers
18 views
Graph Theory - Network Homophily with continuous node attribute
I have a setup where I have a directed graph $G = (V,E)$ and a node attributes vector $\overrightarrow{x}$ with $|\overrightarrow{x}| = |V|$ and $\forall x_i \in \overrightarrow{x}$, it holds $x_i \in ...
0
votes
1answer
37 views
How can one apply differential privacy to this network dataset? [closed]
I've been reading up recently on differential privacy and I'm just starting to understand it. I've also read this paper that basically determined the sexual orientation of a user using Facebook ...
0
votes
0answers
11 views
measure for two different network
I want to distinguish two networks. One of two has some conspicuous hub node like that. The other is randomly conneted. In this case, is there appropriate measure to distinguish between two networks?
1
vote
1answer
25 views
“Multi-level” social network analysis?
I am very new to social network analysis and working on a project here that I am not sure what's possible to model.
I don't want to quite call this multi-level because I am not exactly looking at ...
1
vote
0answers
32 views
Text document clustering using community detection algorithms
I have a corpus of documents. I want to do clustering of similar documents by using community discovery algorithm. Initially I preprocessed the corpus by using nltk. Then each document is converted ...
1
vote
0answers
54 views
Maximum likelihood estimator of the parameter of randomness in Watts and Strogatz's model (1998)
According to the paper
Menezes, M. B., Kim, S., & Huang, R. (2017). Constructing a Watts-Strogatz network from a small-world network with symmetric degree distribution. PloS one, 12(6), e0179120,...
0
votes
0answers
25 views
Visualising a networkx graph with vosviewer
I am trying to export a networkx graph into a format that vosviewer can read. When I wrote my graph to gml and pajek via nx.write_gml(G, path) and nx.write_pajek(G, path), vosviewer did not accept the ...
0
votes
0answers
16 views
Combining centrality into one based on same data type
I'm working on a project that involves count data (specifically number of interactions) from multiple different districts in a specific area. Our team has been talking about calculating a few ...
0
votes
0answers
25 views
Optimization Technique Needed
I am trying to figure out an optimization technique to below:
For context, everything to the left of "New Upcoming Games" is historical data. In my actual dataset I have about 200-300 rows that will ...
1
vote
0answers
45 views
Social Network analysis to group people into houses?
I have a relationship database of circa 11,000,000 observations. These 11,000,000 observations relate to circa 4,000,000 individuals. Initially the idea was to group these individuals into households ...
0
votes
0answers
18 views
Compare treatment effects across Levels of aggregation
Suppose I am running an experiment to see if a treatment changes the mean weight of a group of people. Note that I am specifically interested in the mean weight: if half the people get heavier, and ...
1
vote
1answer
281 views
Assortativity coefficient in igraph
In the context of Social Network Analysis, I want to compute the homogeneity of different networks for specific attributes. For this case the igraph package contains the method assortativity() to ...
2
votes
1answer
166 views
Computation of Network Homophily / Heterogeneity
I am quite confused about the calculation of network homophily in network analysis. Right now I am computing the homophily using the following function, which has been written and also described by ...
2
votes
0answers
35 views
How to measure “cyclicity” of a directed weighted graph?
Say you have a weighted directed graph with (potentially) some cycles in it. You want to have some sort of a measure of how "cyclical" this graph is. The requirements are:
This measure C=0 on an ...
0
votes
0answers
30 views
Is there an alternative to NodeXL for identifying a Twitter user's follower network up to X levels?
Basically, I want to be able to automatically build following/follower networks for individual Twitter users up to a distance of X away from the individual in question. I know NodeXL can do this quite ...
0
votes
0answers
31 views
How does the $R^2$ between the degree distribution & the number of nodes for a network relate to the goodness of fit?
I understand that the coefficient of determination helps to explain the goodness of fit of the values on the X and Y axis. When we consider the degree distribution of a network with the degree on the ...
1
vote
1answer
62 views
How to generate networks of a certain density?
How can you generate small world or scale-free networks with a certain density, say .3?
In the case of random networks it seems easy because an edge is drawn based ...
0
votes
0answers
26 views
Determining the number of observations within the tail of a given distribution
I am wondering how to determine the number of observations that fall within the tail of a distribution. I am reading a paper and the authors use the assumption that 50 observations need to fall into ...
0
votes
0answers
43 views
What is the “distance” of a random walk on a graph?
What is the definition of the distance of a random walk? In the Statistical significance of a cluster of this paper, and this ...
0
votes
1answer
37 views
Measuring Facebook/Twitter/Instagram activity times [closed]
I recently got into a debate on how to best measure when my Facebook/Twitter/Instagram friends are most active. Imagine that I have the input data set that consists of (timestamp, user_id), where ...
1
vote
0answers
44 views
Graph Theory / Network Analysis - properties variation
I have a rather complex network (air travel in the US) with more than 500 nodes, and small-world, scale-free proprieties, spanning over 10 years, and with quarterly information.
As I'm trying to ...
5
votes
2answers
143 views
Why KL-divergence is not used as a measure to compare clusterings?
In the literature of community detection there are various measures bases on principles from information theory (Normalized mutual information, variation of information) that are used to compare ...
-2
votes
1answer
36 views
Are there community detection algorithms where number of communities is specified in advance?
I want to detect specific number of communities in networks, which require algorithms, where number of communities are specified in advance. Also if there are any, I would like to know how to ...
0
votes
1answer
517 views
How to detect k number of communities in a weighted graph/network?
I'm trying to find a fixed number of communities in a fully connected graph with weighted edges.
How to do community detection in a weighted social network/graph? suggests the use of iGraph's ...
1
vote
1answer
145 views
Any intuition for why eigenvector centrality relates to walks of infinite length?
Some centrality measures can be interpreted in terms of walks.
Degree centrality relates to a walk of length one: The more walks of length one reach a node, the higher this centrality measure.
...
1
vote
1answer
496 views
MAE has gotten worse but RMSE is better, how should I interpret it?
I am doing some testing in recommender systems with extended epinions dataset, I implemented two models, model A give me RMSE of 0.5387 and MAE of 0.3111 and model B gave me RMSE of 0.5121 and MAE of ...
0
votes
1answer
336 views
How should I use stochastic gradient descent when I have two sets of data?
In social recommender system problems, we have two sets of data, one the rating data denoted as $R$ and the other social data denoted as $T$, most of the papers end at an objective function over these ...
2
votes
2answers
55 views
Visualizing graph-based data (i.e., network)
I'm fascinated by the concept of graph, be it the social network, the book-topic relationship and others. By graph I mean something like this:
I want to know, how to visualize the data, and is there ...
0
votes
1answer
146 views
Combining heuristics when ranking news feed items
We have a news feed, and we want to surface items to the user based on a number of criteria. Certain items will be surfaced because of factor A, another because of factor B, and yet another because of ...
1
vote
1answer
2k views
Calculating Transitivity (Clustering Coefficient) from Adjacency Matrix, and igraph package
Suppose $G$ is a simple, undirected graph. The corresponding adjacency matrix, $A$ is binary, symmetric, and has all zeroes on the diagonal.
By definition (Networks: An Introduction, M.E.J Newman), ...
4
votes
1answer
157 views
Hawkes-Process for non binary events
I am currently using a univariate Hawkes-process for modeling the behaviour of agents in a social network. For example, the likelihood that a user will tweet in the next period is defined by the ...
3
votes
1answer
25 views
Best way to analyze if pairs of relocated endangered animals stick together after release?
I'm working on a conservation project that will soon release ~10 endangered fish that were bred in captivity into a pond. We're hoping this pond serves as a temporal home for a few years, while their ...
0
votes
1answer
43 views
Drawing a graph and grouping based on characteristics
Let's say that I have a list of my friends and each of them are tagged with some of their characteristics. That is,
...
1
vote
1answer
81 views
Measuring connectivity between clusters in an organizational network in R
I'm trying to conceptualize a network analysis problem and figure out where to start in terms of analysis techniques in R. Apologies as I'm fairly new to all this.
Basically, I have a employee ...
1
vote
0answers
21 views
Finding correlation between size, weight and location in a network graph
I have an undirected graph of students, their friendship ratings, and amount of effort paid in class in the following format:
...
1
vote
0answers
225 views
How to decide if a relationship network(graph) is directed or undirected?
I have a dataset that consist of the following information: Person_1 (from node), Person_2 (to_node), Home_Room_Location (of person_1), Time_Spent_Together (treating this as weight).
I've been ...
0
votes
1answer
70 views
Finding Balance in Network of Friendships
I have a couple of data points on a large group of high school students:
A: Who their Friends are
B: Strength of Friendship for each friend (out of 5, 5 being best friends and 1 being acquaintances)
...
2
votes
0answers
23 views
Model suggestion for “suspicious interactions finding”
Given: 10 nodes (people), it's known that 3 of them are criminals
There are n (< 10) matrices 10x10 of interaction of different type between each two people(some of them are cooperations of ...
2
votes
1answer
265 views
MCMC applied to networks
I was looking a paper, article, book... about MCMC (Markov Chain Monte Carlo) methods applied to networks (networks of people, computers,...)
I haven't found something "useful", but maybe I am making ...
2
votes
1answer
46 views
Difference between directed community indicators variational parameters in Airoldi et al 2009
In the paper by Airoldi, Blei, Fienberg, Xing, 2008, sometimes I see a distinction between $\phi_{p\rightarrow q}$ and $\phi_{q\leftarrow p}$ and sometimes not (the non-distinction in the generative ...
2
votes
1answer
79 views
Transform $z$-score to absolute value for visualization
I'm playing with within-module z-score (page 68) which is defined as
$$z_i = \frac{k_i - \overline{k}}{SD(k)}$$ where $k_i$ is degree of node $i$ within network module (community). I would like to ...
1
vote
2answers
217 views
Using personality to predict conflict via ERGMs
I am using ERGMs to test how different personality variables lead to conflict connections among group members. Specifically, I am assessing if differences in extraversion (Big Five) among team-member ...
1
vote
0answers
83 views
Network/Graph Analysis Beginner Resources
I am a beginner to Network/Graph Analysis. I have data in the following format:
Customer | CustomerSpend
Anna $10
Bob $30
Charlie $50
...
.....
3
votes
0answers
81 views
Social Network Analysis: Measuring the link between vertex values
I'm relatively new to social network analysis and from what I understand many of the common statistical technique do not work in social network analysis due to the non IID nature of networks. My ...
1
vote
1answer
46 views
location based social network model
I'll preface this by saying I have no knowledge in this area so apologize in advance if my question is bonkers!
Basically, I was hoping someone could point me in the right direction where to start ...
2
votes
0answers
64 views
Testing if a directed, bipartite network is non-random
I am struggling with finding a suitable approach to determine if a directed, bipartite network is non-random, i.e., if the relations between the nodes and edges of my empirical network are due to ...
3
votes
0answers
109 views
How to compare the assortativity of two distinct networks?
In the context of Social Network Analysis, I have two different social networks (in fact both are subgraphs of the same graph, but all the edges are distinct) and I would like to find a rigourous tool ...
2
votes
1answer
106 views
What is meant by random graph?
I have read the definitions and basics of random graphs, but I don't really understand what is a random graph, and what's a "non-random" graph.
A non mathematical explanation would be of great help.
