Questions tagged [network-analysis]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
7
votes
2answers
196 views

Has this model of random directed graphs been studied?

Youtube recently added a feature called autoplay, where each clip is assigned a (presumably related) clip that follows it. This, in effect, defines a directed graph on the set of youtube clips, where ...
7
votes
0answers
189 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 ...
6
votes
2answers
97 views

Algorithm for finding “mean center” of unweighted graph

I have a large sparse unweighted undirected graph (20M vertices, 60M edges) and would like to find what I'm calling the "mean center" (the vertex w/ shortest mean distance to all other vertices. Does ...
4
votes
2answers
58 views

Is there a name for the problem of turning a bipartite graph into two graphs?

Is there a name for the problem of turning a bipartite graph into two graphs in the following way? We form one graph from the vertices on the left, such that two vertices are made adjacent if they ...
4
votes
0answers
44 views

Sample a scale free subnet from random network

I already have a network which is like random complex network. Is there any way I can delete some of nodes and reduce the network into a scale-free network? I notice there are some methods that can ...
3
votes
2answers
141 views

Correctness of the Betweenness centrality formula

Betweenness centrality is defined as the number of shortest paths that go through a node in the graph.The formula is: $$\sum_{s \neq v \neq t} \frac{\sigma_{st}(v)}{\sigma_{st}}$$ Where $\sigma_{st}$ ...
3
votes
1answer
318 views

How do we know to what community a vertex belongs to in the Girvan-Newman algorithm?

So I've been doing some reading on community detection in graphs as I'm planning on working on my thesis for it. I've been reviewing papers regarding the same and came across the Girvan-Newman ...
2
votes
2answers
401 views

Removing edges from a fully connected weighted graph

Given a fully connected graph $G(V,E)$ with associated edge weights and a set of constraints specifying distance $D(V_i, V_j) < M_{ij}$, where $\left\{V_{i..j}\right\} ⊂ V$, how can I go about ...
2
votes
1answer
32 views

Travelling Problem with Constraints

Consider a network with $N$ nodes $1,...,n$. Every node is connected to every node via a weighted edge, where the weight represents distance. You start your travel at a given node, say $1$, and end ...
1
vote
2answers
29 views

Representing a network with two types of connections: A fishing application

I want to represent a fishing network using a graph representation. My question surrounds how I can write the adjacency matrix if there are two types of connections, which I want to capture together. ...
1
vote
1answer
157 views

Optimal data structure for a time-windowed streaming graph in order to compute fast statistics

I apologize if this is the wrong place or too trivial a question for this community. What is the best data structure to store a time-windowed streaming graph in order to compute fast statistics over ...
1
vote
1answer
20 views

Source and Destination IP of TCP connection

Five Tuple Identifier of TCP connection is (TCP, local IP, local port, remote IP, remote port). I have made 3 computers in virtual box and set BOX1 for client, BOX2 for median, and BOX3 for server. ...
1
vote
1answer
22 views

Analyzing the railways network [closed]

I am studying complex networks and I have a question. Is it possible to use the tools and methods of the theory of complex network to study the properties of railways network? Are there any articles ...
1
vote
1answer
67 views

how to reduce the time complexity of this code?

I have a graph G=(V,E). A list of nodes NODE subset of V. I want to find out all the ...
1
vote
1answer
135 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(...
1
vote
0answers
26 views

(Formal) Proofs of Node Centrality Properties

Despite there being relatively frequent discourse regarding the usage and effectiveness of various node centralities when analysing the influential spreaders of a graph, I have thus far struggled to ...
1
vote
0answers
338 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 ...
1
vote
0answers
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....
1
vote
0answers
23 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 ...
1
vote
0answers
60 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 ...
1
vote
0answers
79 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 ...
0
votes
1answer
78 views

How to find the shortest route between (0,0) and (4,4) in a 5x5 matrix, given one horizontal or vertical translation per step

Consider the following matrix: Input: The entire list of coordinates ranging from (0,0) to (4,4). A list indicating certain coordinates which cannot be used to generate a path reached. So, each ...
0
votes
1answer
117 views

PERT Chart exercise - is there enough information to solve?

I'm posting this here as my question is from a computer science textbook. It is not a homework question as I am self-studying and I have the answers available. In the exercise below, I can't see how ...
0
votes
1answer
63 views

How do I see SSL/TLS packet data in clear? [closed]

Hey all I have a weird question (first time poster so forgive me if this is super newb)... I am wanting to see the inner workings of a SSL/TLS connection between a client and a server at the packet ...
0
votes
0answers
7 views

Community detections in networks using more than one factor?

all community detection algorithms in major python packages are using only edges & edge weights. Is there any algorithm that uses multiple attributes of nodes to detect communities? For ex, in ...
0
votes
0answers
14 views

What are the advantages of NHSX centralised protocol for Contact Tracing?

Apple and Google have published a protocol for privacy-presercing contact tracing - https://www.apple.com/covid19/contacttracing/ They use a decentralised approach where the 'matching' process take ...
0
votes
0answers
47 views

Stop and Wait protocol in a half duplex scheme

glad i found this site. would appreciate help with this: in picture i uploaded there's a state diagram of a "stop and wait" protocol in a half duplex channel. we assume current status is (10A). ...
0
votes
0answers
8 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: ...
0
votes
0answers
121 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 ...
0
votes
0answers
25 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 ...
0
votes
0answers
216 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-...
0
votes
0answers
49 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 ...
-1
votes
1answer
75 views

Probabilistic Analysis in real time network : Error in data and feedback channel. Two users communication

I'm studying probabilistic analysis in real time network. We have learned how many attempts in average are required to transmit a packet when there is no error on the feedback channel. With no error ...