The tag has no wiki summary.

learn more… | top users | synonyms

0
votes
0answers
22 views

Finding P(S1 = 1 | D1=1, D2=1) (Bayes Networks)

I'm scratching my head over something that is probably simple Probabilities, but I guess I can't see it. Essentially, I have the following table: ------ ------ ------ ------ | D1 | D2 | S1=1 | ...
0
votes
0answers
13 views

How to find giant(largest) component list at network data

If i have a network data as below 1 2 1 3 1 4 2 3 2 5 3 6 .. .. 1st column is node number and 2nd is too. and 1st and 2nd node are connected. (that is network datas) then we can find ...
1
vote
0answers
29 views

are graphs/networks additive

I was wondering if networks/graphs are the sum of their parts. Let's say you have a 15-node network. The spectral density of that network has X kurtosis and Y skewness. You also have a 20-node ...
0
votes
1answer
17 views

Measure for presence of several poorly interconnected components in undirected graph

Is there a measure to classify networks regarding whether or not they are composed of several (internally closely connected) groups which are poorly connected (i.e. few links between groups). That ...
0
votes
1answer
6 views

Scale free networks (power law)

I'm working with a dataset, of which I'm analysing the degree distribution. I'm finding that it obeys the famous power law/scale free degree distribution $\propto k^{-\gamma}$, but the value of ...
0
votes
0answers
7 views

Algorithm for creating a directed scale free network with a fixed amount of nodes

I'm trying to figure out an algorithm that produces a scale free, directed network, for which I can give the final amount of nodes as an input. Now, this is a little bit tricky for a few reasons, so ...
0
votes
0answers
11 views

what is the name or class of such graphs: the probability that two nodes are connected is decided a function of the distance

Random geometric graph is: Randomly place N nodes in a topologic space, if the distance between two nodes is smaller than a specific value, then these two nodes are connected. Now, slightly ...
0
votes
0answers
7 views

correlations between network parameters

I am calculating spectral densities for networks. Is there a reason why skewness and kurtosis would, in general, be correlated across many networks? That is, as a feature of networks rather than ...
0
votes
1answer
15 views

Bayesian Network vs Markov Decision Process

I am wondering if somebody can tell me anything about the practical differences between using Markov Decision Processes and and Bayesian Networks in reasoning about probabilistic processes?
0
votes
0answers
14 views

Techniques & Algorithms used to solve Shorted Hamilton Path, Hamilton Circuit Questions

I'm interested in knowing different techniques in approaching the following: Shortest Hamilton Path, Hamilton Circuit (when weights have been given for each edge) Hamilton Circuit - Current method ...
0
votes
1answer
13 views

partily undirected Bayesian Network

I am designing a Dynamic Bayesian Network, but I am a little confused about some definition of DBN and markov network. In my network ,the edges from the hidden nodes of last frame to the current frame ...
1
vote
0answers
22 views

median eigenvalue

When I look at the spectral density plots of my (usual) laplacian graphs, they spike at the median eigenvalue. But what significance for the graph/matrix (which originates from a network) does the ...
0
votes
0answers
8 views

PERT adjust most likely time with probability and duration time

I don't know if the name of the question is clear what I would like to do is : I need to adjust the most likely time for an activity of my project in purpose of the probability of any path through ...
0
votes
0answers
23 views

Prove a complex function to be convex

I have a function and want to prove that it is convex when $0 \leq x \leq 1$: \begin{equation} f(x)=\frac{b1g'(x) f_1(x)^{n-2}+g'(1) \gamma}{g'(1) ( \gamma+b1) } \end{equation} and \begin{equation} ...
0
votes
0answers
13 views

Activity on arrow network and block chart

I have to figure this out : ...
1
vote
1answer
44 views

Second-price sealed-bid auction uniformly independent with unknown value

a disclaimer before the question: this is a homework problem. I just want some help/push in the right direction, I'm kind of stuck! The problem is as follows: In a second-price sealed-bid auction for ...
0
votes
0answers
19 views

What series describes the feedback of a fully connected network with signal strength at each node converging to 1?

Take a fully connected network with $N$ nodes operating in lockstep. One and only one node will receive a signal from an external source at a time step $t$, but the node receiving it is random. The ...
1
vote
0answers
47 views

Representing distances in high-dimensional space

I have a set of n points $P_i$ $(i=1..n)$ in an d-dimensional space. I can calculate the distances of every point to each other point. What is the best way to represent the distances of these ...
0
votes
0answers
27 views

Clustering Coefficient of A Transitive Graph/Network

Whats the difference of a transitive network's clustering coefficient and a non-transitive networks coefficient? more precisely is the clustering coefficient of a transitive network is as high as ...
0
votes
0answers
15 views

Katz centrality and Node removal

I'm looking for any results about how Katz centrality changes when a given node is removed from a graph. For instance, if I define a function to be the average of the Katz centrality of the remaining ...
0
votes
1answer
47 views

Are minimum cut communities maximal?

I am looking at the paper Graph Clustering and Minimum Cut Trees by Flake et al. Let $G(V, E)$ be some undirected weighted graph. Definition. Let $s, t\in V$ be given. Let $(S, T)$ be the minimum ...
0
votes
0answers
18 views

Dominance Network Worded Problems

What are some methods to solve this? Normally for dominance I do as such: Write a matrix for one step dominance, then find total dominance by = D+D^2 - then sum each row of the matrix. Using this ...
0
votes
1answer
43 views

Problem Solving - Project Crashing Time

My working out: (EST,EFT) times for the activities: A: (0,0) B: (0,8) C: (3,3) D: (10,38) E: (10,18) F: (18,18) G: (25,33) H: (58,58) I: (25,33) J: (45,53) K: (118,118) Finish: (133,133) ...
0
votes
1answer
48 views

Algorithm for finding contradictions in a directed graph that represents implications

I need an algorithm that does this: For a directed graph where nodes represent boolean values and edges represent implication (implies TRUE and implies FALSE): If (arc exists between any ...
0
votes
0answers
20 views

Maximum Local Clustering Coefficient of any graph?

I am currently reading a programming book that shows a few graph analysis things, one of which is the local clustering coefficient of a graph that the author is working with. Then he has an example ...
1
vote
1answer
52 views

Average path length: can't figure out the meaning of $\large\frac{1}{n(n - 1)}$

I am doing a few tests with the Average Path Length formula. I am testing with a directed acyclic graph. I am generating all the shortest path using a breath first walk. Everything works fine. ...
0
votes
0answers
28 views

Successive shortest path with infite distances

I have some error in reasoning while trying to understand the successive shortest path algorithm as described in Ahuja, Magnanti, Orlin "Network flows". The algorithm starts with the zero flow and ...
0
votes
0answers
14 views

(Alternative) Notation for set of successors of a vertex in a directed graph

I am looking for the standard notation for the set of successors/predecessors of a vertex of a directed graph. I have seen $N^{+}(v)$ and $N^{-}(v)$ used to represent the set of direct successors and ...
0
votes
0answers
19 views

Resizing Edge Weights Bases on Node Sizes

I am new to graph theory and I and trying to create edge weights based on the sizes of the connecting nodes. My problem in particular is as such: I have a directed graph of e-mails that were sent ...
1
vote
3answers
58 views

Equivalence Graphs

On the basis of this definition: Two graphs are equivalent if they have the same set of edges (ex. (A,B),(A,C)) how would you determine equivalence for graphs that are not labelled: ex.
1
vote
0answers
53 views

Queueing Delay(W) for M/D/1 queue with different value of service times

I have a problem of calculate the queueing delay of M/D/1 queue. There are two different types of packets with different size. Such that, the arrival rate $\lambda$ and service times $\mu$ will not be ...
1
vote
0answers
29 views

Giant component of a network

Let v be the number of nodes that are not in the giant component. Then, u = v/n is the fraction of nodes that are not in the giant component. If a node is in the giant component, its k neighbors are ...
0
votes
1answer
140 views

network structure — k-cliques vs p-cliques

In network structure, what is the difference between k-cliques and p-cliques, can anyone give a brief explaination with examples? Thanks in advanced! ============================ EDIT: I found an ...
0
votes
0answers
38 views

How to calculate least moves of fruit.

I have a question, I'll try to abstract from the real problem to not lose people. What I'm really looking for is the name of the algorithm or class of problem to find my solution. I feel that this is ...
5
votes
0answers
94 views

Probability of transmission between two nodes in a neural network at exactly d timesteps

I have a network which is an Erdős–Rényi graph. It is a simple neural network with degree 0.7N where N is the number of nodes. Each weight between neurons is 1/N, meaning that if node n has fired the ...
2
votes
2answers
131 views

Shortest path between wikipedia articles

I'm trying to figure out whether it is possible (and if so how) to find the shortest path inside a network from one node to another. I know that there are different possible algorithms to do that the ...
0
votes
0answers
34 views

Prove a problem about Networks(in graph theory)

$S$ and $T$ are two subsets of $V(N)$, which is the set of vertices in network N. Let $S^c$ denotes the complement of $S$ and $[S,S^c]$ be the set of arcs starting in $S$ and finishing in $S^c$. If ...
0
votes
2answers
28 views

complex networks

I am just a bit curious about the following question. Following wiki, the definition of "complex networks" goes as follows: " Most social, biological, and technological networks display substantial ...
0
votes
1answer
63 views

what is difference between open and mixed queue

please consider this image: In this picture that I got it from Here write said that Network C is Open,B is Mixed and A is Closed. I want to know why C isn't mixed? ...
2
votes
1answer
29 views

what is and how to generate a Net representation for a given polyhedron?

The so called Net representation for a Tetrahedron is depicted in the following image ( link to wolfram ) : What is this for ? How to reason about this and how to generate this very same ...
0
votes
0answers
18 views

What is the implication of seeing a power law in real data?

I am studying a course named Networks. It is a question left in the lecture. Given a network, we define the degree distribution by $$ p_k:=\frac{\#\{\text{nodes of degree }k\}}{\#\{\text{number of ...
1
vote
0answers
25 views

Formulating an Equation for the sum of some functions

I am trying to calculate the sum of percentages of some groups: the network is composed of groups of networks, each group is composed of nodes, I am calculating the percentage of few nodes in the ...
0
votes
1answer
15 views

Mean number of FFL subgraphs with one output node

So, this is a Feed Forward Loop. It is a regularly occurring subgraph of a huge random graph. In the case of X,Y,Z being any nodes, we have that the mean number of times that a subgraph G appears is ...
0
votes
0answers
18 views

How to realize the simplest agreement protocol

Consider the simplest case: 1 o-----o 2 with x1 = 1 and x2 = 11 The agreement protocol is: I think we can realize it by the discrete case: In this ...
0
votes
1answer
32 views

Expected number of directed links in a network

Suppose we have a network with n nodes, in which every directed link exists with probability p (independent from each other). What would be the expected number of directed links if we express them in ...
0
votes
0answers
27 views

probability in graphs - degree distribution

I am reading this paper on networks which employs probability in analyzing graphs. Suppose that a graph has $n$ vertices. Furthermore, if each vertex has a probability $p_k$ of having $k$ neighbors, ...
1
vote
1answer
76 views

Probability that exists at least an edge in the configuration model

In this period, I am studying some topics on random networks to understand the modularity optimization used in community detection. In particular, I am trying to understand a model called ...
0
votes
0answers
26 views

Multiple Attachment to the Same Node in Barabasi-Albert Model

In the Barabasi-Albert Model, is a newly introduced node allowed to attach more than once to the same node? The master equation does not seem to include terms describing nodes gaining more than one ...
0
votes
2answers
197 views

Real world application of dominating set?

can anyone tell me about the application of vertex coloring problem and algorithm for vertex color problem in graph or networks.
0
votes
1answer
24 views

Return list of k-paths in a network

Consider a network $ G(V,E) $ with vertex set $V$ and number of edges $E$ being formed by a pre-defined formation process, with one edge being placed in each step. Now, a k-path is defined as $(i,j) ...