Related papers: Bounding the convergence time of local probabilist…
There has been a tremendous growth in publicly available digital video footage over the past decade. This has necessitated the development of new techniques in computer vision geared towards efficient analysis, storage and retrieval of such…
We bound the variance and other moments of a random vector based on the range of its realizations, thus generalizing inequalities of Popoviciu (1935) and Bhatia and Davis (2000) concerning measures on the line to several dimensions. This is…
Temporally modulated optical media are important in both abstract and applied applications, such as spacetime transformation optics, relativistic laser-plasma interactions, and dynamic metamaterials. Here we investigate the behaviour of…
We study the time evolution of quantum entanglement for a specific class of quantum dynamics, namely the locally scrambled quantum dynamics, where each step of the unitary evolution is drawn from a random ensemble that is invariant under…
We consider a diffusion on a bounded domain, assuming that the system is irreducible inside the domain and that the diffusion has varying degree of degeneracy on the domain's boundary. The long-term statistical properties of typical…
This work explores the implications of assuming time symmetry and applying bridge-type, time-symmetric temporal boundary conditions to deterministic laws of nature with random components. The analysis, drawing on the works of Kolmogorov and…
In this article we present a Bernstein inequality for sums of random variables which are defined on a graphical network whose nodes grow at an exponential rate. The inequality can be used to derive concentration inequalities in…
An incident wave at a temporal interface, created by an abrupt change in system parameters, generates time-refracted and time-reflected waves. We find topological characteristics associated with the temporal interface that separates…
We obtain the first probabilistic proof of continuous differentiability of time-dependent optimal boundaries in optimal stopping problems. The underlying stochastic dynamics is a one-dimensional, time-inhomogeneous diffusion. The gain…
We prove a sharp isoperimetric inequality for the class of metric measure spaces verifying the synthetic Ricci curvature lower bounds $MCP(0,N)$ and having Euclidean volume growth at infinity. We avoid the classical use of the…
We consider integer-valued random walks with independent but not identically distributed increments, and extend to this context several classical estimates, including a local limit theorem, precise small-ball estimates (both conditional on…
In the prediction of oscillating time series, the interest is in the turning points of successive oscillations rather than the samples themselves. For this purpose a scheme has been proposed; the state space reconstruction is limited to the…
The large-time asymptotics of the solutions to a class of degenerate parabolic cross-diffusion systems is analyzed. The equations model the interaction of an arbitrary number of population species in a bounded domain with no-flux boundary…
A finite dimensional abstract approximation and convergence theory is developed for estimation of the distribution of random parameters in infinite dimensional discrete time linear systems with dynamics described by regularly dissipative…
The ``evolving constants'' method of defining the quantum dynamics of time-reparametrization-invariant theories is investigated for a particular implementation of parametrized non-relativistic quantum mechanics (PNRQM). The wide range of…
The data processing inequality is central to information theory and motivates the study of monotonic divergences. However, it is not clear operationally we need to consider all such divergences. We establish a simple method for Pinsker…
We consider regular lattices of coupled chaotic maps. Depending on lattice size, there may exist a window in parameter space where complete synchronization is eventually attained after a transient regime. Close outside this window, an…
In a series of recent works, Boyd, Diaconis, and their co-authors have introduced a semidefinite programming approach for computing the fastest mixing Markov chain on a graph of allowed transitions, given a target stationary distribution.…
Population structure can be modelled by evolutionary graphs, which can have a substantial, but very subtle influence on the fate of the arising mutants. Individuals are located on the nodes of these graphs, competing with each other to…
Anytime approximation algorithms that compute the probabilities of queries over probabilistic databases can be of great use to statistical learning tasks. Those approaches have been based so far on either (i) sampling or (ii)…