Questions tagged [ni.networking-internet]

Theoretical question related to networking and Internet architecture

Filter by
Sorted by
Tagged with
5 votes
1 answer
619 views

Pagerank in directed *acyclic* graphs (DAG)

I deal with pagerank computations on large directed acyclic graphs (DAG). I found no reference to work on this specific case, only some work on pagerank in more specific cases, e.g., PageRank of Scale ...
Matthieu Latapy's user avatar
-1 votes
1 answer
99 views

The Arrow of Time in a Non-Physical Realm [closed]

Could there be a logically consistent theory supporting the transmission of non-physical information to a point in time previous to the time it was sent using a computer network (quantum theory, etc)? ...
Manborg's user avatar
  • 11
5 votes
1 answer
1k views

HITS and PageRank, topic drift problem

Reading some papers and articles about PageRank and HITS algorithm, I've figured out that there's a problem called topic drift problem. Googling it, (since I wanted to know more about it) I only found ...
Gigili's user avatar
  • 133
8 votes
3 answers
448 views

Natural graphs that are not scale free

It is now a well known observation that many graphical structures that arise in natural settings tend to obey scale-free properties, such as the power law of degree distribution. Are there any good ...
2 votes
0 answers
165 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-...
Mustafa's user avatar
  • 121
3 votes
1 answer
650 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 ...
Theresa's user avatar
  • 31
6 votes
1 answer
227 views

What are good set size estimation algorithms for small sets (around 10-50 elements)?

I'm trying to implement an online distinct counting algorithm, and I have thousands of small sets of 32 bit IP addresses whose sizes I want to estimate with high accuracy (1-5%). I came across quite ...
nia's user avatar
  • 61
2 votes
1 answer
144 views

c factor in PageRank

In page 3 of PageRank paper is mentioned: let c be a factor used for normalization (so that the total rank of all web pages is constant). What is the use of c...
Real Dreams's user avatar
4 votes
0 answers
664 views

Convergence of HITS Algorithm in the absence of Normalization

Kleinberg's HITS Algorithm (Authoritative sources in a hyperlinked environment) requires the hub (/authority) vector to be normalized after each step of the iteration $x(k+1) = A.x(k)$, in order to ...
Chronoz's user avatar
  • 41
6 votes
2 answers
604 views

PageRank for a Non-Random Searcher

I'm looking to adapt the PageRank algorithm as a centrality measure in a network. This network however, unlike the "random surfer" of the original paper on PageRank, or the random library browser for ...
Fomite's user avatar
  • 143
10 votes
4 answers
683 views

Surveys on Network Coding

I want to start learning about Network Coding: http://en.wikipedia.org/wiki/Network_coding Do you know any good survey (e.g. from IEEE Surveys and Tutorials) on the above subjects. I found some ...
Vasilis's user avatar
  • 131