67 citations
10 papers
Eigenvalues and degree deviation in graphs
Vladimir Nikiforov
Given a graph G of order n and size m, let s(G)= sum|d(u)-2m/n|, where the sum is taken over all vertices u of G. We investigate upper and lower bounds on eigenvalues of G in terms…
Walks and the spectral radius of graphs
Vladimir Nikiforov
We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.
Continuum percolation with steps in an annulus
Paul Balister, Bela Bollobas, Mark Walters
Let A be the annulus in R^2 centered at the origin with inner and outer radii r(1-ε) and r, respectively. Place points {x_i} in R^2 according to a Poisson process with intensity 1…
A noncommutative version of the John-Nirenberg theorem
Marius Junge, Magdalena Musat
We prove a noncommutative version of the John-Nirenberg theorem for nontracial filtrations of von Neumann algebras. As an application, we obtain an analogue of the classical large…
Mixed norm and multidimensional Lorentz spaces
Sorina Barza, Anna Kaminska, Lars-Erik Persson +1
In the last decade, the problem of characterizing the normability of the weighted Lorentz spaces has been completely solved (\cite{Sa}, \cite{CaSoA}). However, the question for mul…
Ramsey-type theorems for metric spaces with applications to online problems
Yair Bartal, Bela Bollobas, Manor Mendel
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stud…