Related papers: On Martin's Pointed Tree Theorem
We study the time reversal of a general PDMP. The time reversed process is defined as $X_{(T-t)-}$, where $T$ is some given time and $X_t$ is a stationary PDMP. We obtain the parameters of the reversed process, like the jump intensity and…
The matrices of spanning rooted forests are studied as a tool for analysing the structure of networks and measuring their properties. The problems of revealing the basic bicomponents, measuring vertex proximity, and ranking from preference…
By the definition of an angle matrix, we investigate the inverse of the Hadamard product of a full rank and an angle matrices. Our proof involves standard matrix analysis. It enriches the algebra of Hadamard products.
In this paper, we consider the linearly reinforced and the once-reinforced random walk models in the transient phase on trees. We show the large deviations for the upper tails for both models. We also show the exponential decay for the…
The dual Drazin inverse is an important dual generalized inverse. In this paper, to extend it we introduce the weak dual Drazin inverse which is unique and exists for any square dual matrix. When the dual Drazin inverse exists, it coincides…
We analyse the friendship paradox on finite and infinite trees. In particular, we monitor the vertices for which the friendship-bias is positive, neutral and negative, respectively. For an arbitrary finite tree, we show that the number of…
In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave…
This paper develops robust test procedures for testing the intercept of a simple regression model when it is \textit{apriori} suspected that the slope has a specified value. Defining unrestricted test (UT), restricted test (RT) and pre-test…
We give a short, self-contained proof of the interior point method and its robust version.
We implemented a joint weak measurement of the trajectories of two photons in a photonic version of Hardy's experiment. The joint weak measurement has been performed via an entangled meter state in polarization degrees of freedom of the two…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
In this article we study the inverse problem of recovering a space-dependent coefficient of the Moore-Gibson-Thompson (MGT) equation, from knowledge of the trace of the solution on some open subset of the boundary. We obtain the Lipschitz…
The area of inverse problems in mathematics is highly interdisciplinary. In various fields of science, engineering, medicine, and industry, there arises a need to reconstruct information about unknown entities that cannot be directly…
The inverse problem of statistical mechanics involves finding the minimal Hamiltonian that is consistent with some observed set of correlation functions. This problem has received renewed interest in the analysis of biological networks; in…
We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…
Weak similarities form a special class of mappings between semimetric spaces. Two semimetric spaces $X$ and $Y$ are weakly similar if there exists a weak similarity $\Phi\colon X\to Y$. We find a structural characteristic of finite…
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…
Reverse Mathematics (RM hereafter) is a program in the foundations of mathematics where the aim is to identify the minimal axioms needed to prove a given theorem from ordinary, i.e. non-set theoretic, mathematics. This program has unveiled…
We study rotation-robust learning for image inputs using Convolutional Model Trees (CMTs) [1], whose split and leaf coefficients can be structured on the image grid and transformed geometrically at deployment time. In a controlled MNIST…
By considering the parity of the degrees and levels of nodes in increasing trees, a new combinatorial interpretation for the coefficients of the Taylor expansions of the Jacobi elliptic functions is found. As one application of this new…