相关论文: STIT Process and Trees
We describe new classification results in the theory of generalized quadrangles (= Tits-buildings of rank $2$ and type $\mathbb{B}_2$), more precisely in the (large) sub theory of skew translation generalized quadrangles ("STGQs"). Some of…
Sequential processes in real-world often carry a combination of simple subsystems that interact with each other in certain forms. Learning such a modular structure can often improve the robustness against environmental changes. In this…
In this paper, we show that conditional inference trees and ensembles are suitable methods for modeling linguistic variation. As against earlier linguistic applications, however, we claim that their suitability is strongly increased if we…
We investigate the computation of minimum-cost spanning trees satisfying prescribed vertex degree constraints: Given a graph $G$ and a constraint function $D$, we ask for a (minimum-cost) spanning tree $T$ such that for each vertex $v$, $T$…
We prove that Simulated Annealing with an appropriate cooling schedule computes arbitrarily tight constant-factor approximations to the minimum spanning tree problem in polynomial time. This result was conjectured by Wegener (2005). More…
Sedimentation is extremely common in nature, occurring throughout the atmosphere and oceans, and in every laboratory centrifuge. The shape and mass distribution of a particle uniquely determines its motion at low Reynolds number, and…
We introduce a simple technique for proving the transience of certain processes defined on the random tree $\mathcal{G}$ generated by a supercritical branching process. We prove the transience for once-reinforced random walks on…
The literature on concept formation has demonstrated that humans are capable of learning concepts incrementally, with a variety of attribute types, and in both supervised and unsupervised settings. Many models of concept formation focus on…
We develop a recursive formula for the probability of a k-cluster in bootstrap percolation.
It is known that the Kesten-Stigum reconstruction bound is tight for roughly symmetric binary channels. In this paper, we will adopt a refined analysis of moment recursion on a weighted version of the magnetization, which is engaged in Sly…
We present explicit estimates of right and left tails and exact (up to universal, multiplicative constants) estimates of tails and moments of hitting times of Bessel processes. The latter estimates are obtained from more general estimates…
The East process is a 1D kinetically constrained interacting particle system, introduced in the physics literature in the early 90's to model liquid-glass transitions. Spectral gap estimates of Aldous and Diaconis in 2002 imply that its…
We present a verified computational model of the SH3 domain transition state (TS) ensemble. This model was built for three separate SH3 domains using experimental s in all-atom protein folding simulations. While averaging over all…
Let R^d -> A be a query problem over R^d for which there exists a data structure S that can compute P(q) in O(log n) time for any query point q in R^d. Let D be a probability measure over R^d representing a distribution of queries. We…
We resume our discussion of the new orbifold-string theories of permutation-type, focusing in the present series on the algebraic formulation of the general bosonic prototype and especially the target space-times of the theories. In this…
We consider a recent model of random walk that recursively grows the network on which it evolves, namely the Tree Builder Random Walk (TBRW). We introduce a bias $\rho \in (0,\infty)$ towards the root, and exhibit a phase transition for…
We introduce the Learning Hyperplane Tree (LHT), a novel oblique decision tree model designed for expressive and interpretable classification. LHT fundamentally distinguishes itself through a non-iterative, statistically-driven approach to…
We elaborate on an alternative representation of conditional probability to the usual tree diagram. We term the representation `turtleback diagram' for its resemblance to the pattern on turtle shells. Adopting the set theoretic view of…
This paper describes our submission to the First Workshop on Reordering for Statistical Machine Translation. We have decided to build a reordering system based on tree-to-string model, using only publicly available tools to accomplish this…
We suggest a general framework for simulation of the triplet $(X_T,\bar X_ T,\tau_T)$ (L\'evy process, its extremum, and hitting time of the extremum), and, separately, $X_T,\bar X_ T$ and pairs $(X_T,\bar X_ T)$, $(\bar X_ T,\tau_T)$,…