No abstract

Abstract. The number of self-adjoint extensions of a symmetric operator acting on a complex Hilbert space is characterized by its deficiency indices. Given a locally finite unoriented simple tree, we prove that the deficiency indices of any discrete Schrödinger operator are either null or infinite. We also prove that all deterministic discrete Schrödinger operators which act on a random tree are almost surely selfadjoint. Furthermore, we provide several criteria of essential self-adjointness. We also address some importance to the case of the adjacency matrix and conjecture that, given a locally finite unoriented simple graph, its deficiency indices are either null or infinite. Besides that, we consider some generalizations of trees and weighted graphs.

We develop a Glivenko-Cantelli theory for monotone, almost additive functions of i. i. d. sequences of random variables indexed by Z d . Under certain conditions on the random sequence, short range correlations are allowed as well. We have an explicit error estimate, consisting of a probabilistic and a geometric part. We apply the results to yield uniform convergence for several quantities arising naturally in statistical physics.

No abstract

Retargetable C compilers are nowadays widely used to quickly obtain compiler support for new embedded processors and to perform early processor architecture exploration. One frequent concern about retargetable compilers, though, is their lack of machine-specific code optimization techniques in order to achieve highest code quality. While this problem is partially inherent to the retargetable compilation approach, it can be circumvented by designing flexible, configurable code optimization techniques that apply to a certain range of target architectures. This paper focuses on target machines with SIMD instruction support which is widespread in embedded processors for multimedia applications. We present an efficient and quickly retargetable SIMD code optimization technique that is integrated into an industrial retargetable C compiler. Experimental results for the Philips Trimedia processor demonstrate that the proposed technique applies to real-life target machines and that it produces code quality improvements close to the theoretical limit.

In this paper we study spectral properties of self-adjoint operators on a large class of geometries given via sofic groups. We prove that the associated integrated densities of states can be approximated via finite volume analogues. This is investigated in the deterministic as well as in the random setting. In both cases we cover a wide range of operators including in particular unbounded ones. The large generality of our setting allows to treat applications from long-range percolation and the Anderson model. Our results apply to operators on Z d , amenable groups, residually finite groups and therefore in particular to operators on trees. All convergence results are established without any ergodic theorem at hand.

One of the main concerns about capitation-based reimbursement systems is that tertiary institutions may be underfunded due to insufficient reimbursements of more complicated cases. We test this hypothesis with a data set from New Zealand that, in 2003, introduced a capitation system where public healthcare provider funding is primarily based on the characteristics of the regional population. Investigating the funding for all cases from 2003 to 2011, we find evidence that tertiary providers are at a disadvantage compared with secondary providers. The reasons are that tertiary providers not only attract the most complicated, but also the highest number of cases. Our findings suggest that accurate risk adjustment is crucial to the success of a capitation-based reimbursement system. Copyright © 2017 John Wiley & Sons, Ltd.

No abstract