We introduce the notion of weak Lie 2-bialgebra. Roughly, a weak Lie
2-bialgebra is a pair of compatible 2-term $L_\infty$-algebra structures on a
vector space and its dual. The compatibility condition is described in terms of
the big bracket. We prove that (strict) Lie 2-bialgebras are in one-one
correspondence with crossed modules of Lie bialgebras.
This paper introduces a model based upon games on an evolving network, and
develops three clustering algorithms according to it. In the clustering
algorithms, data points for clustering are regarded as players who can make
decisions in games. On the network describing relationships among data points,
an edge-removing-and-rewiring (ERR) function is employed to explore in a
neighborhood of a data point, which removes edges connecting to neighbors with
small payoffs, and creates new edges to neighbors with larger payoffs. As such,
the connections among data points vary over time.
For any regular Courant algebroid, we construct a characteristic class a la
Chern-Weil. This intrinsic invariant of the Courant algebroid is a degree-3
class in its naive cohomology. When the Courant algebroid is exact, it reduces
to the Severa class (in H^3_{DR}(M)). On the other hand, when the Courant
algebroid is a quadratic Lie algebra g, it coincides with the class of the
Cartan 3-form (in H^3(g)). We also give a complete classification of regular
Courant algebroids and discuss its relation to the characteristic class.