37,621 research outputs found
Graphs Obtained From Collections of Blocks
Given a collection of -dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially. It is known that if , such block graphs can have arbitrarily large chromatic number. We prove that the chromatic number can be bounded with only a mild restriction on the sizes of the blocks. We also show that block graphs of block configurations arising from partitions of -dimensional hypercubes into sub-hypercubes are at least -connected. Bounds on the diameter and the hamiltonicity of such block graphs are also discussed
Graphs Obtained from Collections of Blocks
Given a collection of d-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially. It is known that if d ≥ 3, such block graphs can have arbitrarily large chromatic number. We prove that the chromatic number can be bounded with only a mild restriction on the sizes of the blocks. We also show that block graphs of block configurations arising from partitions of d-dimensional hypercubes into sub-hypercubes are at least d-connected. Bounds on the diameter and the hamiltonicity of such block graphs are also discusse
Multi-Scale Jacobi Method for Anderson Localization
A new KAM-style proof of Anderson localization is obtained. A sequence of
local rotations is defined, such that off-diagonal matrix elements of the
Hamiltonian are driven rapidly to zero. This leads to the first proof via
multi-scale analysis of exponential decay of the eigenfunction correlator (this
implies strong dynamical localization). The method has been used in recent work
on many-body localization [arXiv:1403.7837].Comment: 34 pages, 8 figures, clarifications and corrections for published
version; more detail in Section 4.
Topology of two-connected graphs and homology of spaces of knots
We propose a new method of computing cohomology groups of spaces of knots in
, , based on the topology of configuration spaces and
two-connected graphs, and calculate all such classes of order As a
byproduct we define the higher indices, which invariants of knots in
define at arbitrary singular knots. More generally, for any finite-order
cohomology class of the space of knots we define its principal symbol, which
lies in a cohomology group of a certain finite-dimensional configuration space
and characterizes our class modulo the classes of smaller filtration
Trivalent Graph isomorphism in polynomial time
It's important to design polynomial time algorithms to test if two graphs are
isomorphic at least for some special classes of graphs.
An approach to this was presented by Eugene M. Luks(1981) in the work
\textit{Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial
Time}. Unfortunately, it was a theoretical algorithm and was very difficult to
put into practice. On the other hand, there is no known implementation of the
algorithm, although Galil, Hoffman and Luks(1983) shows an improvement of this
algorithm running in .
The two main goals of this master thesis are to explain more carefully the
algorithm of Luks(1981), including a detailed study of the complexity and, then
to provide an efficient implementation in SAGE system. It is divided into four
chapters plus an appendix.Comment: 48 pages. It is a Master Thesi
Mixed membership stochastic blockmodels
Observations consisting of measurements on relationships for pairs of objects
arise in many settings, such as protein interaction and gene regulatory
networks, collections of author-recipient email, and social networks. Analyzing
such data with probabilisic models can be delicate because the simple
exchangeability assumptions underlying many boilerplate models no longer hold.
In this paper, we describe a latent variable model of such data called the
mixed membership stochastic blockmodel. This model extends blockmodels for
relational data to ones which capture mixed membership latent relational
structure, thus providing an object-specific low-dimensional representation. We
develop a general variational inference algorithm for fast approximate
posterior inference. We explore applications to social and protein interaction
networks.Comment: 46 pages, 14 figures, 3 table
- …