Questions tagged [networks]
Refers to network theory as part of the graph theory. For questions about neural networks, use our [neural-networks] tag.
0
votes
0answers
17 views
Visual representation of strong associations of two categorical variables
I have a dataset of one categoric variable "supermarket" for each individual person and multiple "product" categories per person and supermarket.
E.g.:
Person 1 went shopping in supermarket X and ...
0
votes
0answers
41 views
how to choose logarithm bin width [on hold]
I read resources about logarithm binning methods for power law distribution data. I am confusing about the choice of the width of logarithm binning.
the first resource:
This is known as ...
0
votes
0answers
21 views
Why does a minimum value cutoff in edge values create this shape in the log-log plot of the edge values aggregated to start nodes?
I have a weighted network dataset that looks like this:
The prev and curr values contain webpages, and n is the number of times users went from the prev webpage to curr webpage. So, each data row is ...
0
votes
0answers
12 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
13 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
1answer
17 views
Determining the closeness of nodes by their neighbours
Background
I have a directional network that is comprised of two types of nodes, business_sector nodes, and event_type nodes. ...
0
votes
0answers
6 views
How does Kamada & Kawai Force Directed layout algorithm interpret negative edge weights?
In Cytoscape, the Kamada & Kawai Force Directed layout algorithm is able to take negative weights between edges. Does anyone know how it's actually using the sign of these? Is it forcing ...
-1
votes
1answer
17 views
How to cluster a (directional) dissimilarity matrix with both positive and negative values?
I may be thinking of this incorrectly but what would be the best way to cluster a dissimilarity measure that has direction?
For example, if someone had condition A ...
0
votes
0answers
19 views
Predict node attribute from network variables
ERGM models the probability of a tie forming in a network. Is there a way of using ERGM, or an equivalent model, where the response variable is an attribute of the node, not a tie? Basically, turning ...
0
votes
0answers
13 views
How to interpret networks with multiple states (e.g. timeseries, conditions, etc.) that have same node set?
Apologies if this is too general but I have been thinking about it all weekend and wasn't sure how to move forward with the idea.
Here are the types of networks I am dealing with below:
I have 2 ...
0
votes
0answers
52 views
Compare the degree distribution of a real networks and multiple random networks
Before the paper real world networks are rarely scale free, studies used to (still do) check for the slope in degree distribution graphs and if the slope fell between 2 and 3, discern that the network ...
2
votes
1answer
21 views
shortest path optimization for multiple edge attributes
Say I have a network. The edges each have two attributes: age and height. How might I run a shortest path algorithm that optimizes on both age and height? And could I weight it so that it optimizes 0....
0
votes
0answers
15 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 ...
0
votes
0answers
29 views
Gephi and igraph eigenvector centrality algorithm
I am currently working with Gephi and igraph (R) visualizing my network and calculating some network metrics. Yet I noticed today, that the eigenvector centrality scores for the same directed network ...
1
vote
1answer
86 views
Centrality of a directed network with edge weights - Gephi
I have the following network of court judgments in the form of a big network.(50k+ nodes and 100k+ edges with weight values). The size is the number of citations. The idea is that court judgments work ...
0
votes
1answer
123 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 ...
0
votes
1answer
40 views
what's the theory foundation of the giant component strategy?
could anyone plz let me know what's the theoretical foundation of the giant component strategy?
I have used this technique to get the giant components of a not fully connected graph but i need the ...
1
vote
1answer
93 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 ...
0
votes
0answers
22 views
Investigating the change of a network / factorial structure over time
I have several variables (questions from a questionnaire) that regroup into several factors (using factor analysis). However, I would be interested in knowing how this factorial structure changes ...
1
vote
0answers
22 views
Community detection in a subgraph
I find myself in possession of a bipartite weighted graph $G=(V,E)$. Let $A,B$ be the partition of $V$, so that if $i\sim j\in E$ then either $i\in A,j\in B$ or $j\in A,i\in B$.
I am interested in ...
2
votes
0answers
29 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
1answer
22 views
How to Cluster Hierarchical Network Data
I have thousands of "small" networks that are strictly hierarchical in nature. Here is an example (some are much deeper, much wider etc) but this is the strict structure:
How can one cluster (e.g. k-...
0
votes
1answer
83 views
Bayesian Network: Calculate probabillity of child node given all probabillity tables
I have a Question about Bayesian Networks.
I have a network with many parent nodes and one child node.
I have the probabilities for the parents and for the child.
The child node is binary, so there ...
2
votes
1answer
33 views
degrees of freedom for t-statistic comparing two networks
I'm reading the following paper on non-parametric standard errors and tests for network statistics - https://www.stats.ox.ac.uk/~snijders/Snijders_Borgatti.pdf by Snijders & Borgatti.
When ...
1
vote
0answers
51 views
Quantifying information loss between a graph and a hypergraph
In some of the literature relating to hypergraph applications, there is an argument about information loss when representing data as a graph compared to a hypergraph.
For example, the well known ...
0
votes
0answers
58 views
Latentnet and ERGM packages in R — How to best design input networks in order to simulate networks with Homophily and Clustering?
In the ergm and latentnet packages, they allow us to input a network and specify covariates. Then, we can add in effects like ...
0
votes
0answers
18 views
Modelling product purchase history as a random walk in n-space
I have a large dataset of customers making monthly purchases of multiple products. Customers usually purchase between 3 and 10 products, from a large product list (1000s). I'm interested in clustering ...
0
votes
1answer
20 views
Difference between $2^{nd}$ order random walk and personalized pagerank
I've been recently working with graph sampling, and I can't seem to find useful explanation of the following two aspects. On one side there are pagerank-based algorithms, which converge to a ...
0
votes
0answers
50 views
Community Detection in Multilayered Network
I want to implement Community Detection on a complicated Multilayered network with not only inter-layer weights and intra-layer weights but also edges between two nodes of different layers (example: ...
1
vote
1answer
48 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
35 views
Connectivity vs. density for random, small world and scale-free networks
I am trying to understand a paper by reconstructing the the analyses discussed in the Validation study section, however, I am confused when it comes to how a network metric is used. Specifically, the ...
1
vote
0answers
69 views
Network modularity for exactly two communities
I have a number of empirical networks that tend to show bipolarization patterns, meaning that there are precisely two communities. In some networks, the two communities are very clearly separated (...
0
votes
0answers
22 views
Similarities between two networks
I am studying the similarities and differences between two research areas in terms of their descriptors (key words). I have two corpus corresponding to documents derived from both research areas. By ...
1
vote
1answer
43 views
Log-log plot comparison between a random and real world networks
I know that random networks have a bell curve (Poisson distribution) in their degree distribution and scale free networks have a straight line in their log-log plots. However, how do the log-log plots ...
1
vote
0answers
127 views
How to implement weighted centrality in NetworkX
I am using the following code to try implement eigen-vector centrality for a weighted graph G. The nodes represent search terms and the is an edge from node A to node B if someone searches for A and ...
0
votes
0answers
11 views
Can netlogit estimate data containing multiple networks?
I'm working on a data that contains country-level membership information on multiple regional trade agreements with overlapping membership and formed in different years (hence, the time-varying ...
0
votes
0answers
32 views
Rate equations for the evolution of densities
I don't quite understand how the authors of this paper find the equations based on the table. Excerpt:
[T]he social network connecting agents is a complete graph with the size of the network $N \to ...
0
votes
0answers
47 views
Statistical test for random graph's edges binomial distribution
I'm exploring random graph behaviour, and want to estimate the edge distribution.
...
0
votes
0answers
53 views
Intrusion detection datasets file preparing
I researched on intrusion detection. But I found that database files from some trusted sites. There is a separate archive format by date and .pcap file.
such as
First day: testbed-11jun.pcap (normal + ...
0
votes
0answers
48 views
Bootstrap network in R
I need to bootstrap a network in order to have more strength and betweenness' number of cases to perform t-tests on nodes as Kellermann et al.: https://www.ncbi.nlm.nih.gov/pubmed/25776901
I'm using ...
2
votes
1answer
323 views
Monte Carlo or Bootstrapping for network in R
I have a large network for which I'm using iGraph in R to handle.
However, I would like to take some small random samples of that network, and calculate for example the standard deviation of parallel ...
1
vote
0answers
122 views
Interpretation of Modularity in R
I used modularity maximization cluster method to make 3 different clusters (4, 5 and 6 clusters) from a network using "Igraph" in R. I found the modularity of the three networks are 0.15, 0.23, and 0....
1
vote
0answers
45 views
Transforming dissimilarity matrix for use as weights in network
I'm trying to identify communities or clusters in a network by optimizing the modularity function. The network is a fully connected network, with undirected edges that have weights based on a pairwise ...
4
votes
1answer
361 views
Clustering network usign modularity maximization algorithm
I have been working on a Network-based clustering approach. I used "cluster_optimal" of 'igraph' package in R for clustering. The function works by modularity maximization algorithm. I have ...
0
votes
0answers
23 views
Does sampling an arbitrary network in a biased way make it resemble a scale-free network?
There's a recent article on Quanta (https://www.quantamagazine.org/scant-evidence-of-power-laws-found-in-real-world-networks-20180215/) as well as the primary study on ArXiv (https://arxiv.org/abs/...
2
votes
0answers
159 views
Random Forest for financial networks modelling
One of the hottest topics in today econometrics is financial networks models where researches use vector autoregressive (VAR) models applied to time series of daily volatility measurements of ...
1
vote
0answers
43 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 ...
2
votes
1answer
38 views
To test for small-world property, does the random graph generated has to be completely connected?
For a small world property, the ratio of the average path length and the mean path length of random networks has to be close to one.
My question is: When generating a random graph using the Erdős-...
4
votes
1answer
51 views
Statistical test to identify enriched edges in a network
I have a network with N nodes and E directed edges. Each edge (Eij) is an integer that represents the number of connections between a source node (Ni) and a target node (Nj).
My null model is that ...
0
votes
1answer
34 views
What are some common properties usually associated with undirected complex networks?
I am aware of the "scale free", "existence of community structure" and"small world" phenomena that commonly occur in real world networks, but what are some other properties associated with these kinds ...
