398 search results - page 1 / 80 » Critical exponents of graphs |
DLT
2006
13 years 6 months ago
2006
Let be an alphabet of size t, let f : be a non-erasing morphism, let w be an infinite fixed point of f, and let E(w) be the critical exponent of w. We prove that if E(w) is fi...
DMTCS
2007
13 years 4 months ago
2007
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
RSA
2011
12 years 11 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We introduce a model for directed scale-free graphs that grow with preferential attachment depending in a natural way on the in- and out-degrees. We show that the resulting in- an...