相关论文: STIT Process and Trees
We present a generic tree-interpolation algorithm in the SMT context with quantifiers. The algorithm takes a proof of unsatisfiability using resolution and quantifier instantiation and computes interpolants (which may contain quantifiers).…
The realistic modeling of STT-MRAM for the simulations of hybrid CMOS/Spintronics devices in comprehensive simulation environments require a full description of stochastic switching processes in state of the art STT-MRAM. Here, we derive an…
The time process of transport on randomly evolving trees is investigated. By introducing the notions of living and dead nodes a model of random tree evolution is constructed which describes the spreading in time of objects corresponding to…
Decision trees are popular in survival analysis for their interpretability and ability to model complex relationships. Survival trees, which predict the timing of singular events using censored historical data, are typically built through…
Dirichlet processes and their extensions have reached a great popularity in Bayesian nonparametric statistics. They have also been introduced for spatial and spatio-temporal data, as a tool to analyze and predict surfaces. A popular…
Several approaches for predicting large volatility matrices have been developed based on high-dimensional factor-based It\^o processes. These methods often impose restrictions to reduce the model complexity, such as constant eigenvectors or…
We construct an algorithm to simulate imaginary time evolution of translationally invariant spin systems with local interactions on an infinite, symmetric tree. We describe the state by symmetric iPEPS and use translation-invariant…
The decreasing Markov chain on \{1,2,3, \ldots\} with transition probabilities $p(j,j-i) \propto 1/i$ arises as a key component of the analysis of the beta-splitting random tree model. We give a direct and almost self-contained…
In this paper, we propose a probabilistic parsing model, which defines a proper conditional probability distribution over non-projective dependency trees for a given sentence, using neural representations as inputs. The neural network…
This paper develops some general calculus for GGC and Dirichlet process means functionals. It then proceeds via an investigation of positive Linnik random variables, and more generally random variables derived from compositions of a stable…
This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri nets. It is implemented as a collection of independent,…
We study the basic preferential attachment process, which generates a sequence of random trees, each obtained from the previous one by introducing a new vertex and joining it to one existing vertex, chosen with probability proportional to…
Probabilistic transition system specifications (PTSSs) in the $nt \mu f\theta / nt\mu x\theta$ format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and…
We propose a continuous model for evolutionary rate variation across sites and over the tree and derive exact transition probabilities under this model. Changes in rate are modelled using the CIR process, a diffusion widely used in…
We consider homogeneous STIT tessellations Y in the \ell-dimensional Euclidean space and show the triviality of the tail \sigma-algebra. This is a sharpening of the mixing result by Lachi\`eze-Rey.
In this paper, we prove a sufficient and necessary condition for the transition probability distribution of a general, time-inhomogeneous linear SDE to possess a density function and study the differentiability of the density function and…
In this article we describe the formalisation of the Bruhat-Tits tree - an important tool in modern number theory - in the Lean Theorem Prover. Motivated by the goal of connecting to ongoing research, we apply our formalisation to verify a…
A random planar quadrangulation process is introduced as an approximation for certain cellular automata in terms of random growth of rays from a given set of points. This model turns out to be a particular (rectangular) case of the…
The simulated tempering (ST) is an important method to deal with systems whose phase spaces are hard to sample ergodically. However, it uses accepting probabilities weights which often demand involving and time consuming calculations. Here…
In recent years, machine translation software has increasingly been integrated into our daily lives. People routinely use machine translation for various applications, such as describing symptoms to a foreign doctor and reading political…