Related papers: Hitting time of connectedness in the random hyperc…

In this paper, we study the classical problem of the first passage hitting density of an Ornstein--Uhlenbeck process. We give two complementary (forward and backward) formulations of this problem and provide semi-analytical solutions for…

In this note we shortly recall the importance of last-hitting times in theory and applications of optimal stopping. As a small contribution to this domain we then propose a concise proof of David Williams' decomposition of the Bessel…

We investigate temporal correlations in the simplest measurement scenario, i.e., that of a physical system on which the same measurement is performed at different times, producing a sequence of dichotomic outcomes. The resource for…

We propose that measurements of time-of-arrival correlations in multi-partite systems can sharply distinguish between different approaches to the time-of-arrival problem. To show this, we construct a Positive-Operator-Valued measure for two…

We show that the conditional min-entropy Hmin(A|B) of a bipartite state rho_AB is directly related to the maximum achievable overlap with a maximally entangled state if only local actions on the B-part of rho_AB are allowed. In the special…

In a recent study, (Jain et al 2007 Phys. Rev. Lett. 99 190601), a symmetric exclusion process with time-dependent hopping rates was introduced. Using simulations and a perturbation theory, it was shown that if the hopping rates at two…

We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph $G=\gc$. In this model $G$ is drawn uniformly from graphs with vertex set $[n]$, $m$ edges and minimum degree at least three. We focus on…

We study the optimal convergence rate for homogenization problem of convex Hamilton-Jacobi equations when the Hamitonian is periodic with respect to spatial and time variables, and notably time-dependent. We prove a result similar to that…

In optimal control problems of control-affine systems, whose solutions are bang-bang or singular type, verification of optimality using the Hamilton-Jacobi-Bellman (HJB) equation involves the computation of partial derivatives of switching…

Reliability assessment of interconnection networks is critical to the design and maintenance of multiprocessor systems. The $(n, k)$-enhanced hypercube $Q_{n,k}$, as a variation of the hypercube $Q_{n}$, was proposed by Tzeng and Wei in…

We prove that for $k+1\geq 3$ and $c>(k+1)/2$ w.h.p. the random graph on $n$ vertices, $cn$ edges and minimum degree $k+1$ contains a (near) perfect $k$-matching. As an immediate consequence we get that w.h.p. the $(k+1)$-core of $G_{n,p}$,…

Generally the convergence rate in exponential ergodicity $\lambda$ is an upper bound for the convergence rate $\kappa$ in uniform ergodicity for a Markov process, that is $\lambda\geqslant\kappa$. In this paper, we prove that…

We propose to explore the potential advantages of a new class of tracking algorithms loosely inspired by the Hough transform concept and where we include the time of arrival of each hit as an additional coordinate to be treated in the same…

We study a Hubbard hamiltonian, including a quite general nearest-neighbor interaction, parametrized by repulsion V, exchange interactions Jz, Jperp, bond-charge interaction X and hopping of pairs W. The case of correlated hopping, in which…

For fixed $r\geq 3$ and $n$ divisible by $r$, let ${\mathcal H}={\mathcal H}^r_{n,M}$ be the random $M$-edge $r$-graph on $V=\{1,\ldots ,n\}$; that is, ${\mathcal H}$ is chosen uniformly from the $M$-subsets of ${\mathcal K}:={V \choose r}$…

In this work we present a theoretical model supported with a physical reasoning leading to a relation which performs an excellent estimation for the tunneling time in attosecond and strong field experiments, where we address the important…

We study random walks on the giant component of Hyperbolic Random Graphs (HRGs), in the regime when the degree distribution obeys a power law with exponent in the range $(2,3)$. In particular, we first focus on the expected time for a…

Distributed consensus computation over random graph processes is considered. The random graph process is defined as a sequence of random variables which take values from the set of all possible digraphs over the node set. At each time step,…

We establish conditions on sequences of graphs which ensure that the mixing times of the random walks on the graphs in the sequence converge. The main assumption is that the graphs, associated measures and heat kernels converge in a…

We show that quantum probabilities can be derived from statistical mechanics of classical fields. We consider Brownian motion in the space of fields and show that such a random field interacting with threshold type detectors produces clicks…