Sciweavers

860 search results - page 58 / 172
» Biased Random Walks
Sort
View
RECOMB
2012
Springer
12 years 1 months ago
A Model for Biased Fractionation after Whole Genome Duplication
Background: Paralog reduction, the loss of duplicate genes after whole genome duplication (WGD) is a pervasive process. Whether this loss proceeds gene by gene or through deletion...
David Sankoff, Chunfang Zheng, Baoyong Wang
COCOON
2009
Springer
14 years 5 months ago
Sublinear-Time Algorithms for Tournament Graphs
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
Stefan S. Dantchev, Tom Friedetzky, Lars Nagel
CPC
2006
92views more  CPC 2006»
13 years 11 months ago
Waiting for a Bat to Fly By (in Polynomial Time)
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
Itai Benjamini, Gady Kozma, László L...
CN
2000
92views more  CN 2000»
13 years 11 months ago
What is this page known for? Computing Web page reputations
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
Davood Rafiei, Alberto O. Mendelzon
JCT
2010
109views more  JCT 2010»
13 years 9 months ago
Avoider-Enforcer: The rules of the game
An Avoider-Enforcer game is played by two players, called Avoider and Enforcer, on a hypergraph F ⊆ 2X . The players claim previously unoccupied elements of the board X in turns...
Dan Hefetz, Michael Krivelevich, Milos Stojakovic,...