912 research outputs found
Dimers, Tilings and Trees
Generalizing results of Temperley, Brooks, Smith, Stone and Tutte and others
we describe a natural equivalence between three planar objects: weighted
bipartite planar graphs; planar Markov chains; and tilings with convex
polygons. This equivalence provides a measure-preserving bijection between
dimer coverings of a weighted bipartite planar graph and spanning trees on the
corresponding Markov chain. The tilings correspond to harmonic functions on the
Markov chain and to ``discrete analytic functions'' on the bipartite graph.
The equivalence is extended to infinite periodic graphs, and we classify the
resulting ``almost periodic'' tilings and harmonic functions.Comment: 23 pages, 5 figure
Element-centric clustering comparison unifies overlaps and hierarchy
Clustering is one of the most universal approaches for understanding complex
data. A pivotal aspect of clustering analysis is quantitatively comparing
clusterings; clustering comparison is the basis for many tasks such as
clustering evaluation, consensus clustering, and tracking the temporal
evolution of clusters. In particular, the extrinsic evaluation of clustering
methods requires comparing the uncovered clusterings to planted clusterings or
known metadata. Yet, as we demonstrate, existing clustering comparison measures
have critical biases which undermine their usefulness, and no measure
accommodates both overlapping and hierarchical clusterings. Here we unify the
comparison of disjoint, overlapping, and hierarchically structured clusterings
by proposing a new element-centric framework: elements are compared based on
the relationships induced by the cluster structure, as opposed to the
traditional cluster-centric philosophy. We demonstrate that, in contrast to
standard clustering similarity measures, our framework does not suffer from
critical biases and naturally provides unique insights into how the clusterings
differ. We illustrate the strengths of our framework by revealing new insights
into the organization of clusters in two applications: the improved
classification of schizophrenia based on the overlapping and hierarchical
community structure of fMRI brain networks, and the disentanglement of various
social homophily factors in Facebook social networks. The universality of
clustering suggests far-reaching impact of our framework throughout all areas
of science
An extensive English language bibliography on graph theory and its applications
Bibliography on graph theory and its application
Digraph based determination of Jordan block size structure of singular matrix pencils
AbstractThe generic Jordan block sizes corresponding to multiple characteristic roots at zero and at infinity of a singular matrix pencil will be determined graph-theoretically. An application of this technique to detect certain controllability properties of linear time-invariant differential algebraic equations is discussed
Morse theory on spaces of braids and Lagrangian dynamics
In the first half of the paper we construct a Morse-type theory on certain
spaces of braid diagrams. We define a topological invariant of closed positive
braids which is correlated with the existence of invariant sets of parabolic
flows defined on discretized braid spaces. Parabolic flows, a type of
one-dimensional lattice dynamics, evolve singular braid diagrams in such a way
as to decrease their topological complexity; algebraic lengths decrease
monotonically. This topological invariant is derived from a Morse-Conley
homotopy index and provides a gloablization of `lap number' techniques used in
scalar parabolic PDEs.
In the second half of the paper we apply this technology to second order
Lagrangians via a discrete formulation of the variational problem. This
culminates in a very general forcing theorem for the existence of infinitely
many braid classes of closed orbits.Comment: Revised version: numerous changes in exposition. Slight modification
of two proofs and one definition; 55 pages, 20 figure
- …