Displaying similar documents to “Monte Carlo simulation and analytic approximation of epidemic processes on large networks”

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...

Graph fibrations, graph isomorphism, and PageRank

Paolo Boldi, Violetta Lonati, Massimo Santini, Sebastiano Vigna (2006)

RAIRO - Theoretical Informatics and Applications

Similarity:

PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. We show that a deep connection relates fibrations and , a particular kind of Markov chains that include the PageRank one as a special case. This fact provides constraints on the values that PageRank...

Characterizing the complexity of boolean functions represented by well-structured graph-driven parity-FBDDs

Henrik Brosenne, Matthias Homeister, Stephan Waack (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We investigate well-structured graph-driven parity-FBDDs, which strictly generalize the two well-known models parity OBDDs and well-structured graph-driven FBDDs. The first main result is a characterization of the complexity of Boolean functions represented by well-structured graph-driven parity-FBDDs in terms of invariants of the function represented and the graph-ordering used. As a consequence, we derive a lower bound criterion and prove an exponential lower bound for certain linear...