Related papers: Inverting Ray-Knight identities on trees

We consider Sturm-Liouville operators on geometrical graphs without cycles (trees) with singular potentials from the class $W_2^{-1}$. We suppose that the potentials are known on a part of the graph, and study the so-called partial inverse…

This paper presents algorithms for local inversion of maps and shows how several important computational problems such as cryptanalysis of symmetric encryption algorithms, RSA algorithm and solving the elliptic curve discrete log problem…

We give a necessary and sufficient condition for a homogeneous Markov process taking values in $\R^n$ to enjoy the time-inversion property of degree $\alpha$. The condition sets the shape for the semigroup densities of the process and…

We prove the convergence of the law of grid-valued random walks, which can be seen as time-space Markov chains, to the law of a general diffusion process. This includes processes with sticky features, reflecting or absorbing boundaries and…

We consider loop ensembles on random trees. The loops are induced by a Poisson process of links sampled on the underlying tree interpreted as a metric graph. We allow two types of links, crosses and double bars. The crosses-only case…

Reflectance bounds the frequency spectrum of illumination in the object appearance. In this paper, we introduce the first stochastic inverse rendering method, which recovers the attenuated frequency spectrum of an illumination jointly with…

We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…

In this paper, we consider the shift-inverse method with Richardson iteration step for the eigenvalue problems. It will be shown that the convergence speed depends heavily on the eigenvalue gap between the desired eigenvalue and undesired…

We consider different methods, that do not rely on numerical simulations of the percolation process, to approximate percolation thresholds in networks. We perform a systematic analysis on synthetic graphs and a collection of 109 real…

The aim of inverse reinforcement learning (IRL) is to infer an agent's preferences from observing their behaviour. Usually, preferences are modelled as a reward function, $R$, and behaviour is modelled as a policy, $\pi$. One of the central…

For person re-identification, existing deep networks often focus on representation learning. However, without transfer learning, the learned model is fixed as is, which is not adaptable for handling various unseen scenarios. In this paper,…

In this paper we study a spectrally negative L\'evy process which is refracted at its running maximum and at the same time reflected from below at a certain level. Such a process can for instance be used to model an insurance surplus…

This paper focuses on $\alpha$-divergence minimisation methods for Variational Inference. More precisely, we are interested in algorithms optimising the mixture weights of any given mixture model, without any information on the underlying…

We give an alternative proof of the fact that the vertex reinforced jump process on Galton- Watson tree has a phase transition between recurrence and transience as a function of c, the initial local time, see [3]. Further, applying the…

We study a genealogical model for continuous-state branching processes with immigration with a (sub)critical branching mechanism. This model allows the immigrants to be on the same line of descent. The corresponding family tree is an…

In this article the authors continue the discussion in \cite{ALM} about inverse problems for second order elliptic and hyperbolic equations on metric trees from boundary measurements. In the present paper we prove the identifiability of…

We establish a recursive representation that fully decouples jumps from a large class of multivariate inhomogeneous stochastic differential equations with jumps of general time-state dependent unbounded intensity, not of L\'evy-driven type…

We give an intuitive method--using local, cyclic replica symmetry--to isolate exponential tree decay in truncated (connected) correlations. We give an expansion and use the symmetry to show that all terms vanish, except those displaying…

Individualization-Refinement (IR) algorithms form the standard method and currently the only practical method for symmetry computations of graphs and combinatorial objects in general. Through backtracking, on each graph an IR-algorithm…

The Skorokhod reflection was used in 1961 to create a reflected diffusion on the half-line. Later, it was used for processes with jumps such as reflected L\'evy processes. Like a Brownian motion, which is a weak limit of random walks,…