Fedor Nazarov

Learn More
We prove that in every bipartite Cayley graph of every non-amenable group, there is a perfect matching that is obtained as a factor of independent uniform random variables. We also discuss expansion properties of factors and improve the Hoffman spectral bound on independence number of finite graphs. A perfect matching in a graph is a set of its edges that(More)
Persistence and permanence are properties of dynamical systems that describe the long-term behavior of the solutions, and in particular specify whether positive solutions approach the boundary of the positive orthant. Mass-action systems (or more generally power-law systems) are very common in chemistry, biology, and engineering, and are often used to(More)
Background Joint work with Fedor Nazarov and Igor Verbitsky (preprint) Start with general functional analysis theorem: Background Joint work with Fedor Nazarov and Igor Verbitsky (preprint) Start with general functional analysis theorem: Given an integral operator T on a σ-finite measure space (Ω, ω) with kernel K : Background Joint work with Fedor Nazarov(More)
  • 1