Displaying similar documents to “TPM: Transition probability matrix - Graph structural feature based embedding”

A method of constructing the frame of a directed graph

Ichiro Hofuku, Kunio Oshima (2013)

International Journal of Applied Mathematics and Computer Science

Similarity:

In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The World Wide Web can be expressed as an enormous directed graph. The purpose of...

Asymptotic spectral analysis of generalized Erdős-Rényi random graphs

Song Liang, Nobuaki Obata, Shuji Takahashi (2007)

Banach Center Publications

Similarity:

Motivated by the Watts-Strogatz model for a complex network, we introduce a generalization of the Erdős-Rényi random graph. We derive a combinatorial formula for the moment sequence of its spectral distribution in the sparse limit.