Leonid Bunimovich
Covering relations for coupled map networks.
Mon, 09/12/2011 - 15:01 — SomNambulAuthors: Leonid Bunimovich, Ming-Chia Li, Ming-Jiea Lyu
Subjects: Dynamical Systems
AbstractFollowing [6,12], we study coupled map networks over arbitrary finite graphs.
An estimate from below for a topological entropy of a perturbed coupled map
network via a topological entropy of an unperturbed network by making use of
the covering relations for coupled map networks is obtained. The result is
quite general, particularly no assumptions on hyperbolicity of a local dynamics
or linearity of coupling are made.The optimal sink and the best source in a Markov chain.
Wed, 07/14/2010 - 15:01 — SomNambulAuthors: Leonid Bunimovich, Yuri Bakhtin
Subjects: Probability
AbstractIt is well known that the distributions of hitting times in Markov chains are
quite irregular, unless the limit as time tends to infinity is considered. We
show that nevertheless for a typical finite irreducible Markov chain and for
nondegenerate initial distributions the tails of the distributions of the
hitting times for the states of a Markov chain can be ordered, i.e., they do
not overlap after a certain finite moment of time.Isospectral Graph Reductions.
Wed, 09/02/2009 - 12:02 — SomNambulAuthors: Leonid Bunimovich, Benjamin Webb
Subjects: Combinatorics
AbstractLet G be an arbitrary finite weighted digraph with weights in the set of
complex rational functions. A general procedure is proposed which allows for
the reduction of G to a smaller graph with a less complicated structure having
the same spectrum as of G (up to some set known in advance). The proposed
procedure has a lot of flexibility and could be used e.g. for design of
networks with prescribed spectral and dynamical properties.Isospectral Graph Reductions.
Wed, 09/02/2009 - 12:02 — SomNambulAuthors: Leonid Bunimovich, Benjamin Webb
Subjects: Combinatorics
AbstractLet G be an arbitrary finite weighted digraph with weights in the set of
complex rational functions. A general procedure is proposed which allows for
the reduction of G to a smaller graph with a less complicated structure having
the same spectrum as of G (up to some set known in advance). The proposed
procedure has a lot of flexibility and could be used e.g. for design of
networks with prescribed spectral and dynamical properties.
User login
