| Time |
Event |
| 8:02a |
Explicit probabilistic models for databases and networks. (arXiv:0906.5148v1 [cs.AI])
Explicit probabilistic models for databases and networks. (arXiv:0906.5148v1 [cs.AI])
Authors: Tijl De Bie
Recent work in data mining and related areas has highlighted the importance
of the statistical assessment of data mining results. Crucial to this endeavour
is the choice of a non-trivial null model for the data, to which the found
patterns can be contrasted. The most influential null models proposed so far
are defined in terms of invariants of the null distribution. Such null models
can be used by computation intensive randomization approaches in estimating the
statistical significance of data mining results.
Here, we introduce a methodology to construct non-trivial probabilistic
models based on the maximum entropy (MaxEnt) principle. We show how MaxEnt
models allow for the natural incorporation of prior information. Furthermore,
they satisfy a number of desirable properties of previously introduced
randomization approaches. Lastly, they also have the benefit that they can be
represented explicitly. We argue that our approach can be used for a variety of
data types. However, for concreteness, we have chosen to demonstrate it in
particular for databases and networks.
read more at math updates on arXiv.org |
| 8:02a |
|
| 8:02a |
|
| 8:02a |
Nonlinear Integer Programming. (arXiv:0906.5171v1 [math.OC])
Nonlinear Integer Programming. (arXiv:0906.5171v1 [math.OC])
Authors: Raymond Hemmecke, Matthias Köppe, Jon Lee, Robert Weismantel
Research efforts of the past fifty years have led to a development of linear
integer programming as a mature discipline of mathematical optimization. Such a
level of maturity has not been reached when one considers nonlinear systems
subject to integrality requirements for the variables. This chapter is
dedicated to this topic.
The primary goal is a study of a simple version of general nonlinear integer
problems, where all constraints are still linear. Our focus is on the
computational complexity of the problem, which varies significantly with the
type of nonlinear objective function in combination with the underlying
combinatorial structure. Numerous boundary cases of complexity emerge, which
sometimes surprisingly lead even to polynomial time algorithms.
We also cover recent successful approaches for more general classes of
problems. Though no positive theoretical efficiency results are available, nor
are they likely to ever be available, these seem to be the currently most
successful and interesting approaches for solving practical problems.
It is our belief that the study of algorithms motivated by theoretical
considerations and those motivated by our desire to solve practical instances
should and do inform one another. So it is with this viewpoint that we present
the subject, and it is in this direction that we hope to spark further
research.
read more at math updates on arXiv.org |
| 8:02a |
|
| 8:02a |
Man and machine thinking about the smooth 4-dimensional Poincar\'e conjecture. (arXiv:0906.5177v1 [m
Man and machine thinking about the smooth 4-dimensional Poincar\'e conjecture. (arXiv:0906.5177v1 [math.GT])
Authors: Michael Freedman, Robert Gompf, Scott Morrison, Kevin Walker
While topologists have had possession of possible counterexamples to the
smooth 4-dimensional Poincar\'e conjecture (SPC4) for over 30 years, until
recently no invariant has existed which could potentially distinguish these
examples from the standard 4-sphere. Rassumsen's s-invariant, a slice
obstruction within the general framework of Khovanov homology, changes this
state of affairs. We describe knots K so that s(K) nonzero implies a
counterexample to SPC4. Computations are extremely costly and so far we have
only completed a single test. Unfortunately for that K the computation showed
that s was 0. Only a few of the relevant knots will be computationally
tractable and the effort to compute s for them is ongoing. Our perspective is
neutral, however, and in another section of this paper we explain that SPC4 is
equivalent to an appropriate generalization of Property R ("in S^3, only an
unknot can yield S^1 x S^2 under surgery"). We hope that this observation, and
the rich relations between Property R and ideas such as taut foliations,
contact geometry, and Heegaard Floer homology, will encourage three manifold
topologists to look at SPC4.
read more at math updates on arXiv.org |
| 8:02a |
|
| 8:02a |
Superbimatrices and their generalizations. (arXiv:0906.5143v1 [math.GM])
Superbimatrices and their generalizations. (arXiv:0906.5143v1 [math.GM])
Authors: W.B.Vasantha Kandasamy, Florentin Smarandache
In this book, the authors introduce the new notion of superbimatrices and
generalize it to supertrimatrices and super n-matrices. Study of these
structures is not only interesting and innovative but is also best suited for
the computerize world. The main difference between simple bimatrices and super
bimatrices is that in case of simple bimatrices we have only one type of
product defined on them, whereas in case of superbimatrices we have different
types of products called minor and major defined using them.
This book has four chapters. Chapter one describes the basic concepts to make
this book a selfcontained one. Superbimatrices, semi superbimatrices, symmetric
superbimatrices are introduced in chapter two. Chapter three introduces the
notion of super trimatrices and the products defined using them. Chapter four
gives the most generalized form of the superbimatrix, viz. super n-matrix
read more at math updates on arXiv.org |
| 8:02a |
|
| 8:02a |
|
| 8:02a |
|
| 8:02a |
|
| 8:02a |
|
| 8:02a |
|
| 8:02a |
|
| 8:02a |
|
| 8:02a |
|
| 8:02a |
|
| 8:02a |
|
| 8:02a |
|
| 8:02a |
Testing for white noise under unknown dependence and its applications to goodness-of-fit for time se
Testing for white noise under unknown dependence and its applications to goodness-of-fit for time series models. (arXiv:0906.5179v1 [math.ST])
Authors: Xiaofeng Shao
Testing for white noise has been well studied in the literature of
econometrics and statistics. For most of the proposed test statistics, such as
the well-known Box-Pierce's test statistic with fixed lag truncation number,
the asymptotic null distributions are obtained under independent and
identically distributed assumptions and may not be valid for the dependent
white noise. Due to recent popularity of conditional heteroscedastic models
(e.g., GARCH models), which imply nonlinear dependence with zero
autocorrelation, there is a need to understand the asymptotic properties of the
existing test statistics under unknown dependence. In this paper, we showed
that the asymptotic null distribution of Box-Pierce's test statistic with
general weights still holds under unknown weak dependence so long as the lag
truncation number grows at an appropriate rate with increasing sample size.
Further applications to diagnostic checking of the ARMA and FARIMA models with
dependent white noise errors are also addressed. Our results go beyond earlier
ones by allowing non-Gaussian and conditional heteroscedastic errors in the
ARMA and FARIMA models and provide theoretical support for some empirical
findings reported in the literature.
read more at math updates on arXiv.org |
| 8:21p |
|
| 8:21p |
|
| 8:21p |
|
| 8:21p |
|
| 8:21p |
|
| 8:21p |
|
| 8:21p |
Componentwise and Cartesian decompositions of linear relations. (arXiv:0906.5406v1 [math.FA])
Componentwise and Cartesian decompositions of linear relations. (arXiv:0906.5406v1 [math.FA])
Authors: S. Hassi, H.S.V. de Snoo, F.H. Szafraniec
Let $A$ be a, not necessarily closed, linear relation in a Hilbert space
$\sH$ with a multivalued part $\mul A$. An operator $B$ in $\sH$ with $\ran
B\perp\mul A^{**}$ is said to be an operator part of $A$ when $A=B \hplus
(\{0\}\times \mul A)$, where the sum is componentwise (i.e. span of the
graphs). This decomposition provides a counterpart and an extension for the
notion of closability of (unbounded) operators to the setting of linear
relations. Existence and uniqueness criteria for the existence of an operator
part are established via the so-called canonical decomposition of $A$. In
addition, conditions are developed for the decomposition to be orthogonal
(components defined in orthogonal subspaces of the underlying space). Such
orthogonal decompositions are shown to be valid for several classes of
relations. The relation $A$ is said to have a Cartesian decomposition if
$A=U+\I V$, where $U$ and $V$ are symmetric relations and the sum is
operatorwise. The connection between a Cartesian decomposition of $A$ and the
real and imaginary parts of $A$ is investigated.
read more at math updates on arXiv.org |
| 8:21p |
The optimal strategy for symmetric rendezvous search on K3. (arXiv:0906.5447v1 [math.OC])
The optimal strategy for symmetric rendezvous search on K3. (arXiv:0906.5447v1 [math.OC])
Authors: Richard Weber
In the symmetric rendezvous search game played on Kn (the completely
connected graph on n vertices) two players are initially placed at two distinct
vertices (called locations). The game is played in discrete steps and at each
step each player can either stay where he is or move to a different location.
The players share no common labelling of the locations. They wish to minimize
the expected number of steps until they first meet. Rendezvous search games of
this type were first proposed by Steve Alpern in 1976. They are simple to
describe, and have received considerable attention in the popular press as they
model problems that are familiar in real life. They are notoriously difficult
to analyse. Our solution of the symmetric rendezvous game on K3 makes this the
first interesting game of its type to be solved, and establishes a 20 year old
conjecture that the Anderson-Weber strategy is optimal.
read more at math updates on arXiv.org |
| 8:21p |
On geometric problems related to Brown-York and Liu-Yau quasilocal mass. (arXiv:0906.5451v1 [math.DG
On geometric problems related to Brown-York and Liu-Yau quasilocal mass. (arXiv:0906.5451v1 [math.DG])
Authors: Pengzi Miao, Yuguang Shi, Luen-Fai Tam
We discuss some geometric problems related to the definitions of quasilocal
mass proposed by Brown-York \cite{BYmass1} \cite{BYmass2} and Liu-Yau
\cite{LY1} \cite{LY2}. Our discussion consists of three parts. In the first
part, we propose a new variational problem on compact manifolds with boundary,
which is motivated by the study of Brown-York mass. We prove that critical
points of this variation problem are exactly static metrics. In the second
part, we derive a derivative formula for the Brown-York mass of a smooth family
of closed 2 dimensional surfaces evolving in an ambient three dimensional
manifold. As an interesting by-product, we are able to write the ADM mass
\cite{ADM61} of an asymptotically flat 3-manifold as the sum of the Brown-York
mass of a coordinate sphere $S_r$ and an integral of the scalar curvature plus
a geometrically constructed function $\Phi(x)$ in the asymptotic region outside
$S_r $. In the third part, we prove that for any closed, spacelike, 2-surface
$\Sigma$ in the Minkowski space $\R^{3,1}$ for which the Liu-Yau mass is
defined, if $\Sigma$ bounds a compact spacelike hypersurface in $\R^{3,1}$,
then the Liu-Yau mass of $\Sigma$ is strictly positive unless $\Sigma$ lies on
a hyperplane. We also show that the examples given by \'{O} Murchadha, Szabados
and Tod \cite{MST} are special cases of this result.
read more at math updates on arXiv.org |
| 8:21p |
|
| 8:21p |
|
| 8:21p |
|
| 8:21p |
|
| 8:21p |
|
| 8:21p |
|
| 8:21p |
|
| 8:21p |
|
| 8:21p |
|
| 8:21p |
|
| 8:21p |
|
| 8:21p |
|