Skip to main content
OverflowAI is here! AI power for your Stack Overflow for Teams knowledge community. Learn more

Questions tagged [network-analysis]

The tag has no usage guidance.

18 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
7 votes
0 answers
218 views

Computing the "at least k friends in common" graph

Suppose we have the graph of a social network with symmetric connections (e.g. Facebook or LinkedIn). Suppose we would like to find all pairs of people who have at least k friends in common, in order ...
jkff's user avatar
  • 2,269
2 votes
0 answers
94 views

Does minimumm spanning tree always include the node with highest degree?

I want to know why the distances between nodes in a minimum spanning tree seems to be rooted to the node with highest degree. A bit of context here: I have spatial explicit weighted network that ...
carlos_ArT's user avatar
2 votes
1 answer
342 views

Finding maximal and average number of time slots in an Adaptive tree walk protocol

Tried to research here and on other sites with no luck regarding finding the maximal and average number of time slots in an Adaptive tree walk protocol. i'll explain what i mean here: In a simple(...
Networking's user avatar
2 votes
0 answers
326 views

What is the difference between multi-layer, multiplex and heterogeneous networks?

I know when we have multiple networks connected to each other, we can call every network a layer and the whole network is called multi-layer. But I don't know what is the difference between multi-...
user137927's user avatar
2 votes
0 answers
34 views

Are exponential random graph models based on Maximum Entropy Principle?

Can anyone shed light on whether or not ERGMs are network models based on the maximum entropy principle? Especially if we say that the available information about the network is in the form of network ...
Sal Jr's user avatar
  • 141
1 vote
1 answer
39 views

Path Through Graph That Minimizes Node Attributes

I have a directed graph (DAG) containing many nodes, all with various attributes (node attributes not edge attributes). I have a single target (finish) node and a set of source (start) nodes. I want ...
laurence 's user avatar
1 vote
0 answers
486 views

How can node2vec help find similar "roles" within a graph (nodes whose connections have similar structure within the graph)?

I have a question on the node2vec algorithm described in this paper. Node2vec is a deep learning algorithm that word2vec to graphs to learn embeddings. The authors claim that it can help find nodes ...
sharx's user avatar
  • 11
1 vote
0 answers
16 views

reference to model a network which nodes handle processing

does anybody have a basic reference (if it is possible) that explain how to mathematically model the state of a network. I assume that it goes like modeling a graph that is composed by nodes and edges....
Felipe's user avatar
  • 121
1 vote
0 answers
66 views

Identify community in a direct graph

I'm trying to identify communities in a direct graph. I only know how to use Spectral clustering and Girvan-Newman method but the both the methods work only with undirect graph. Am I wrong? So what ...
Timmy's user avatar
  • 111
1 vote
0 answers
95 views

Choosing edges to disconnect graph

I have an undirected simple graph and an integer x. My goal is to remove x edges from the graph so the largest connected component of the graph after the removal will be minimal. I tried to think how ...
ni6go's user avatar
  • 11
0 votes
0 answers
5 views

Relationship between Katz centrality and degree

Given an undirected graph, we know that the PageRank centrality without damping factor is proportional to the vertex degrees. Is that also true for Katz centrality?
Manolito Pérez's user avatar
0 votes
0 answers
18 views

Importance of an edge regarding distances

Given a graph $G=(V,E)$ and any edge $(u,v) \in E$, let us denote by $G_{(u,v)}=(V,E\setminus\{(u,v)\})$ obtained from $G$ by removing this edge. I am interested in the difference between the average ...
Matthieu Latapy's user avatar
0 votes
0 answers
75 views

Can anyone please help me understand the definition of Store-and-Forward delay from the Kurose and Ross Networking Book?

I have gone through the questions related to store-and-forward and transmission delays but they didn't answer my question. My question is directly related to one of the excerpts in the book (Computer ...
shiva's user avatar
  • 101
0 votes
0 answers
69 views

Score and bound in Goemans-Williamson algorithm

I am trying to have a deeper understanding of the following implementation of the Goemans-Williamson algorithm for solving the maxcut problem. ...
Omar Shehab's user avatar
0 votes
0 answers
9 views

What is the average time for a node to transmit on the shared medium for Ethernet? (IEEE 802.3)

Suppose a shared ethernet link L, in which for nodes T1-T4 and a router R are connected: ...
HelloWorld's user avatar
0 votes
0 answers
244 views

utilization of bitmap protocol

I am curious about utilization calculation in the bitmap protocol. especially if there's a difference between if only station 0 wants to broadcast(and the others doesn't) or only some other station ...
hps13's user avatar
  • 101
0 votes
0 answers
31 views

Affects of altering a line in "stop and wait" protocol(no noises)

what will happen if we change "to_physical_layer(&s)" to "to_physical_layer(&r)" in the following code(marked in the code where)? does it make the protocol fail? if so, show a scenario it ...
Network's user avatar
0 votes
0 answers
63 views

Changes in prefix/ASN (Autonomous System Number) pairs?

I am wondering if a pair prefix/AS may change often ? I mean let's say we have a list with many given prefixes (e.g. 4.6.20.0/24) that are mapped to ASN (e.g. 10753), this list is built on a given ...
user3106096's user avatar