1949 search results - page 130 / 390 » Random graphs on surfaces |
122
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
129
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
130
click to vote
DM
2007
15 years 4 months ago
2007
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
162
click to vote
OPODIS
2004
15 years 5 months ago
2004
Abstract. It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on the...
125
click to vote
CPC
2006
15 years 4 months ago
2006
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...