Stack Overflow
Stack Overflow

Questions tagged [complex-networks]

a complex network is a graph (network) with non-trivial topological features which occur rarely in random graphs but often in real-world graphs such as social networks

A complex network is a graph with certain patterns that have a low probability of occurring in a random graph, but are common in real-world graphs that model computer networks, social networks, biological phenomena, etc.

Some example of patterns are scale-freeness and small world properties.

63 questions
11
votes
3 answers

How can I check if a network is scale free?

Given an undirected NetworkX Graph graph, I want to check if it is scale free. To do this, as I understand, I need to find the degree k of each node, and the frequency of that degree P(k) within the entire network. This should represent a power law…
Mox
  • 564
  • 2
  • 8
  • 20
5
votes
1 answer

Ising model [Python]

I am trying to simulate Ising phase transition in a Barabasi-Albert network and trying to replicate results of some observables such as magnetization and energy as one would observe in an Ising grid simulation. However, I am having troubles…
jkrish
  • 427
  • 1
  • 5
  • 12
4
votes
1 answer

Graph tool - Stochastic Block Model vs Leiden

I'm calculating network communities for 4 networks using 2 methods: 'Leiden' method, which gives me 7 (a), 13 (b), 19 (c), 22 (d) communities. 'Stochastic block Model', also checking group membership of the nodes by inspecting levels of the…
8-Bit Borges
  • 9,643
  • 29
  • 101
  • 198
4
votes
2 answers

Networkx - entropy of subgraphs generated from detected communities

I have 4 functions for some statistical calculations in complex networks analysis. import networkx as nx import numpy as np import math from astropy.io import fits Degree distribution of graph: def degree_distribution(G): vk =…
8-Bit Borges
  • 9,643
  • 29
  • 101
  • 198
3
votes
1 answer

Need a graph partitioning technique

I have a graph G = (V,E), with V the set of nodes, and E the set of edges. I have two types of nodes: Source nodes, and Consumer nodes (the number of Source nodes are way lower than the Consumer nodes). The nodes have geographic positions. I want to…
Saeed Hajebi
  • 31
  • 1
3
votes
1 answer

the ncol format data in igraph package

In the documnt, http://igraph.sourceforge.net/doc/R/read.graph.html NCOL format This format is used by the Large Graph Layout program (http://bioinformatics.icmb.utexas.edu/lgl), and it is simply a symbolic weighted edge list. It is a simple text…
Ben
  • 665
  • 1
  • 10
  • 27
2
votes
1 answer

good graph/complex networks libraries

I am looking for good recommendation for graph analysis libraries or framework，better in C++ or java. I have found some graph libraries， https://stackoverflow.com/questions/3010805/scalable-parallel-large-graph-analysis-library This webpage gives…
Willwang
  • 31
  • 3
2
votes
1 answer

Extract the key of the largest value of the node attribute

In this example, after obtaining the largest value of the node's attribute, we want to put or add its key into a separate dictionary or list. For example, if among the nodes there is 1 node whose attribute value is the highest value, 1 itself will…
Alexander
  • 37
  • 5
2
votes
2 answers

Is there any faster method to solve differential equations with multidimensional array

I want a solve a complex network system involving higher-order interaction terms acting through a multidimensional array. I have written the corresponding code but it takes too much time to get my results. Is there any possible way to solve the…
MSA
  • 55
  • 3
2
votes
2 answers

Efficient way to speeding up graph theory and complex network algorithms on CPU/GPU using Python?

P.S.: I've mentioned possible solutions to my problem but have many confusions with them, please provide me suggestions on them. Also if this question is not good for this site, please point me to the correct site and I'll move the question there.…
thepunitsingh
  • 713
  • 1
  • 12
  • 30
2
votes
1 answer

calculate the fraction of nodes belonging to the giant component(python , networkx)

I have a file that contains information about airports. how do i find the fraction of the giant component in a graph? the data looks like 1 43 1 52 43 1 53 146 and so on, it just has source-target , i.e from one airport to another. Q. Randomly…
Chai
  • 69
  • 10
2
votes
1 answer

NetworkX: connect nodes of two separate graphs in Python

This question is about attempting to model interdependent networks with NetworkX. There are dedicated packages (such as Pymnet), but they don't seem as flexible as NetworkX. And by the way, I wanted to give NetworkX one last chance. So, let's say we…
FaCoffee
  • 7,609
  • 28
  • 99
  • 174
2
votes
1 answer

How to get the second smallest eigenvalue of laplacian matrix of a complex network with python?

I'm trying to compute the second smallest eigenvalue of the laplacian matrix of a complex network(with 10000 nodes) with python using the shift-invert mode, here is the code: import numpy as np import networkx as nx from scipy import sparse G =…
Shilun Zhang
  • 21
  • 2
2
votes
1 answer

Preferential Attachment, Complex Networks in Matlab

Hej everyone! I am right now working on a preferential attachment model in MATLAB and I have some troubles to understand the following: Assuming I have 4 nodes in the beginning, connected like this: time = 0 1 <-----> 2 3 <-----> 4 In the…
Maethor
  • 101
  • 3
  • 10
2
votes
1 answer

Error when running G= graph(s,t) in matlab

I want to calculate L = laplacian(G) from a graph dataset. I imported the dataset which contains two columns: FromNodeId and ToNodeId: # Nodes: 3997962 Edges: 34681189 # FromNodeId ToNodeId 0 1 0 2 0 31 0 73 0 80 0 113619 0 …
Kristofer
  • 1,457
  • 2
  • 19
  • 27
1
2 3 4 5