Mixing time bounds via the spectral profile.
Goel, Sharad, Montenegro, Ravi, Tetali, Prasad (2006)
Electronic Journal of Probability [electronic only]
Similarity:
Goel, Sharad, Montenegro, Ravi, Tetali, Prasad (2006)
Electronic Journal of Probability [electronic only]
Similarity:
Woodard, Dawn B., Schmidler, Scott C., Huber, Mark (2009)
Electronic Journal of Probability [electronic only]
Similarity:
Dyer, Martin, Goldberg, Leslie Ann, Jerrum, Mark, Martin, Russell (2006)
Probability Surveys [electronic only]
Similarity:
Leese, R.A., Noble, S.D. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dohmen, Klaus, Tittmann, Peter (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rothbach, Brian (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Noble, S.D. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
T. Karthick, C.R. Subramanian (2013)
Discussiones Mathematicae Graph Theory
Similarity:
A star coloring of an undirected graph G is a coloring of the vertices of G such that (i) no two adjacent vertices receive the same color, and (ii) no path on 4 vertices is bi-colored. The star chromatic number of G, χs(G), is the minimum number of colors needed to star color G. In this paper, we show that if a graph G is either non-regular subcubic or cubic with girth at least 6, then χs(G) ≤ 6, and the bound can be realized in linear time.
Fulman, Jason (2005)
Electronic Journal of Probability [electronic only]
Similarity:
De Coster, C., Habets, P. (1996)
Portugaliae Mathematica
Similarity:
Presutti, Cathleen Battiste (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Wancang Ma, David Minda (1993)
Annales Polonici Mathematici
Similarity:
Recently, A. W. Goodman introduced the class UCV of normalized uniformly convex functions. We present some sharp coefficient bounds for functions f(z) = z + a₂z² + a₃z³ + ... ∈ UCV and their inverses . The series expansion for converges when , where depends on f. The sharp bounds on and all extremal functions were known for n = 2 and 3; the extremal functions consist of a certain function k ∈ UCV and its rotations. We obtain the sharp bounds on and all extremal functions for...
Jorge Cortés, Sonia Martínez, Francesco Bullo (2005)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed...