Stack Exchange Network

Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [network-modeling]

The tag has no usage guidance.

-1
votes
0answers
8 views

Incrementally Adding Nodes to GML network graph

So, I've been using the NetworkX python library to generate some random graphs with particular properties (in case I'm using the powerlaw cluster graph generator) and I want to incrementally expand it....
0
votes
0answers
46 views

A paradox in simulation of “Slotted Aloha” networks by Poisson model

As usual, in network theories (e.g book:Computers Networks-chap.4 by Tanenbaum), a "slotted Aloha" network is simulated by Poisson model. In Slotted Aloha,every station can send data only in the start ...
1
vote
1answer
105 views

Total flow using minimum number of edges on a bipartite network

If I have a set of sources $S$ with total capacity $C$ and a set of sinks $T$ with the same capacity $C$, but not necessarily the same cardinality, is there an efficient way to find the minimum number ...
1
vote
0answers
71 views

limit the total flow for some edges in an directed graph

How can I limit the total flow for some edges in an directed graph. We know that every edge can have an upper and lower bound solely. But apart from this sole upper and lower bounds for each edge, if ...
0
votes
1answer
423 views

What is “Synthetic Network” in Network Science?

I checked out several articles, books available, but didn't find what exactly is a "synthetic network".
0
votes
0answers
106 views

Efficiently generate a random subgraph (Gs) with maximum degree K, using only edges from an existing graph G

I am looking find a way of efficiently generating a random, undirected subgraph $G_s$ with $N$ vertices, using a subset of edges from an exisiting undirected graph $G$, also of size $N$, where the ...
3
votes
1answer
146 views

Does such model exists?

I have a problem on distributed graph, with the following model: 1. There is a Global Graph $G=(V,E)$ 2. There are $k$ computers. 3. Each computer $1 \leq i \leq k$ knows ALL the nodes of the graph,...
5
votes
1answer
111 views

Survivable networks, directed case

I have been working on a project that turns out to be a special case of the directed version of the survivable network problem. Iterative rounding gives a 2-approximation of the undirected case. I'm ...
2
votes
0answers
35 views

centralized deterministic Spanner construction with low degree and low stretch

Does there exist a centralized deterministic spanner construction with low degree and low stretch both independent of the graph diameter (no log D factor), but can be dependent on the number of nodes. ...
2
votes
0answers
54 views

An Exact Cover Variant encoded in a 4-Terminal Network

During research, I hit the following problem Exact Cover Variant (ECV) Input: Three set systems $S_1, S_2, S_3$ over a universe $U$, each closed with respect to $\cap$ and $\cup$. ...
1
vote
1answer
73 views

What does the contention-free communication assumption really mean in the context of DAG scheduling?

In many papers about DAG (directed-acyclic graph) scheduling in distributed systems, the authors make the assumption that the communication between the processors of the system where the DAG is ...
2
votes
0answers
96 views

What mathematical models can analyze and optimize such message passing system?

I look for a mathematical model that can accommodate, analyze and suggest optimizations for a system that can be humanly described as message passing black box programs to which where optimal message ...
4
votes
1answer
368 views

Bipartite scale-free networks

The Barabasi-Albert model describes a mechanism of generating random scale-free networks: Growth: Starting with a small number ($m_0$) of connected nodes, at every time step, we add a new node with $...
3
votes
0answers
187 views

Bipartite small-world networks

The Watts-Strogatz model describes a mechanism of generating small-world networks. The idea is to start from a ring network in which each node is connected a fixed number of its closest neighbors. ...
2
votes
0answers
151 views

Decomposing Graph Flow (Solution exists?)

I'm wondering if someone can point me towards understanding this problem better. Suppose I have the graph $G = \{V,E\}$ with vertices $v \in V$ and directed edges $e_{i,j} \in E$. Each node has an "in-...
3
votes
1answer
482 views

How do you initialize your seed in the preferential attachment model?

Suppose that we seed our network with $m$ vertices. Suppose that at each step we add a vertex and c edges adjacent to that vertex. Should these initial $m$ vertices have no edges at the start of the ...
7
votes
1answer
144 views

Is it possible to create a machine learning classifier to generate Mock interfaces for systems testing?

I'm investigating whether it is feasible to be able to learn a system interface by watching network traffic (assuming the usual problems are solved e.g. encryption etc) I haven't been able to find ...
3
votes
2answers
296 views

Algorithms for creating a directed network with a given 3-node motifs distribution

I am looking for algorithms to create directed networks with an arbitrary distribution of 3-node network motifs (i.e. subgraphs of the order 3), see this picture from O. Sporns, R. Kotter, Motifs in ...
1
vote
1answer
257 views

Theoretical proof of convergence of sequential weight update procedure (Neural Networks and Machine Learning)

My question is at the bottom. (Most of the descriptive words come from Chris. Bishop's Neural Networks for Pattern Recognition) let $w$ be the weight vector of the neural network and $E$ the error ...
1
vote
0answers
65 views

Strategies for preventing isolated nodes in a dynamically changing undirected cyclic graph

I'm building a mesh network where i need to detect the unexpected disappearance of a peer. Each node attempts to stay in communication with at least X peers. A node refuses connection from another ...
-2
votes
1answer
133 views

How to check if an algorithm in a distributed system worked within restraints?

I want to design a system in which a program is sent along with data and then it answers with the result. Is redundancy a must in this situation to check for correctness of the processed data? What is ...
7
votes
1answer
130 views

Complexity of selective network improvement problem

We have a network flow problem with a given directed graph $G=(V,E)$, for each arc $(i,j) \in E$, there is a cost $c_{ij}$ and upper and lower capacity $u_{ij}$ and $l_{ij}$ for the flow $f_{ij}$ ...
4
votes
1answer
197 views

Laying paths on a network using minimum number of links/edges

Consider an undirected graph G(V,E), where each edge $e\in E$ has capacity $c(e)$. Also given is a traffic matrix $T_{ij}$ representing the amount of traffic flowing from vertex $i$ to $j$. The goal ...
1
vote
0answers
279 views

Using Graphs/Graph Similarity as Features for a Learner

I'm working to construct a learner than can recognize whether two vertices in a property graph (digraph, vertices and edges can have arbitrary keys/values) modelling a social network in fact represent ...
4
votes
1answer
157 views

Given a network flow, are there bounds on the change in weight on nodes?

Here's my precise situation: I have a graph with nodes $V$ and edges $E$, and the nodes have some non-negative integer weights $w_i$. In one step of the protocol, I am now allowed to move weight ...
1
vote
0answers
133 views

Structured Graph Generation

I hope you can help. I am looking for the best way to generate random bipartite graphs with localised structure within one of the node types. Such that type A visits a local group of type B with a ...
15
votes
3answers
840 views

Super Mario Flows in NP?

One classical extension of the max-flow problem is the "max-flow over time" problem: you are given a digraph, two nodes of which are distinguished as the source and the sink, where each arc has two ...
5
votes
1answer
8k views

Queueing Theory: How to estimate steady-state queue length for single queue, N servers?

I have a real-life situation that can be solved using Queueing Theory. This should be easy for someone in the field. Any pointers would be appreciated. Scenario: There is a single Queue and N ...
4
votes
3answers
343 views

How can I model this usage scenario mathematically?

I want to create a fairly simple mathematical model that describes usage patterns and performance trade-offs in a system. The system behaves as follows: clients periodically issue multi-cast packets ...