Related papers: A Coupling, and the Darling-Erdos Conjectures
We consider a system of particles which interact through a jump process. The jump intensities are functions of the proximity rank of the particles, a type of interaction referred to as topological in the literature. Such interactions have…
The notion of a successful coupling of Markov processes, based on the idea that both components of the coupled system ``intersect'' in finite time with probability one, is extended to cover situations when the coupling is unnecessarily…
In this paper, we establish a new inequality tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We…
The maximal inequalities for diffusion processes have drawn increasing attention in recent years. However, the existing proof of the $L^p$ maximum inequalities for the Ornstein-Uhlenbeck process was dubious. Here we give a rigorous proof of…
This paper presents a self-contained account for coupling arguments and applications in the context of Markov processes. We first use coupling to describe the transport problem, which leads to the concepts of optimal coupling and…
We investigate the entanglement within a system undergoing a random, local process. We find that there is initially a phase of very fast generation and spread of entanglement. At the end of this phase the entanglement is typically maximal.…
New results on functional prediction of the Ornstein-Uhlenbeck process in an autoregressive Hilbert-valued and Banach-valued frameworks are derived. Specifically, consistency of the maximum likelihood estimator of the autocorrelation…
Given the observation of a high-dimensional Ornstein-Uhlenbeck (OU) process in continuous time, we proceed to the inference of the drift parameter under a row-sparsity assumption. Towards that aim, we consider the negative log-likelihood of…
We prove that the `Upper Matching Conjecture' of Friedland, Krop, and Markstr\"om and the analogous conjecture of Kahn for independent sets in regular graphs hold for all large enough graphs as a function of the degree. That is, for every…
In 1930s Paul Erdos conjectured that for any positive integer $C$ in any infinite $\pm 1$ sequence $(x_n)$ there exists a subsequence $x_d, x_{2d}, x_{3d},\dots, x_{kd}$, for some positive integers $k$ and $d$, such that $\mid \sum_{i=1}^k…
The running coupling is introduced into the equation for the odderon via the bootstrap relation. It is shown that the previously found odderon state with a maximal intercept, which is constructed from antisymmetric pomeron wave function,…
We investigate Eisenstein congruences between the so-called Euler systems of Garrett--Rankin--Selberg type. This includes the cohomology classes of Beilinson--Kato, Beilinson--Flach and diagonal cycles. The proofs crucially rely on…
By a classical result of Gray, Neuhoff and Shields (1975) the $\bar\varrho$ distance between stationary processes is identified with an optimal stationary coupling problem of the corresponding stationary measures on the infinite product…
Let $\{\xi(k), k \in \mathbb{Z} \}$ be a stationary sequence of random variables and let $\{S_n, n \in \mathbb{N}_+ \}$ be a transient random walk in the domain of attraction of a stable law. In the previous work \cite{Nicolas_Ahmad}, under…
We analyze almost sure asymptotic behavior of extreme values of a regenerative process. We show that under certain conditions a properly centered and normalized running maximum of a regenerative process satisfies a law of the iterated…
We generalize the optimal coupling theorem to multiple random variables: Given a collection of random variables, it is possible to couple all of them so that any two differ with probability comparable to the total-variation distance between…
We prove a conjecture of Boros, Caro, F\"uredi and Yuster on the maximum number of edges in a 2-connected graph without repeated cycle lengths, which is a restricted version of a longstanding problem of Erd\H{o}s. Our proof together with…
We describe a new general connection between $\Lambda$-coalescents and genealogies of continuous-state branching processes. This connection is based on the construction of an explicit coupling using a particle representation inspired by the…
In 1946 Erd\H os asked for the maximum number of unit distances, $u(n)$, among $n$ points in the plane. He showed that $u(n)> n^{1+c/\log\log n}$ and conjectured that this was the true magnitude. The best known upper bound is…
An iterative Monte Carlo inversion method for the calculation of particle pair potentials from given particle pair correlations is proposed in this paper. The new method, which is best referred to as Iterative Ornstein-Zernike Inversion,…