اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدClairvoyant embedding in one dimension
109
0
0.0
(
0
)
تأليف
Peter Gacs
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let v, w be infinite 0-1 sequences, and m a positive integer. We say that w is m-embeddable in v, if there exists an increasing sequence n_{i} of integers with n_{0}=0, such that 0< n_{i} - n_{i-1} < m, w(i) = v(n_i) for all i > 0. Let X and Y be independent coin-tossing sequences. We will show that there is an m with the property that Y is m-embeddable into X with positive probability. This answers a question that was open for a while. The proof generalizes somewhat the hierarchical method of an earlier paper of the author on dependent percolation.
قيم البحث
اقرأ أيضاً
We prove distributional convergence for a family of random processes on $mathbb{Z}$, which we call cooperative motions. The model generalizes the totally asymmetric hipster random walk introduced in [Addario-Berry, Cairns, Devroye, Kerriou and Mitche
ll, 2020]. We present a novel approach based on connecting a temporal recurrence relation satisfied by the cumulative distribution functions of the process to the theory of finite difference schemes for Hamilton-Jacobi equations [Crandall and Lyons, 1984]. We also point out some surprising lattice effects that can persist in the distributional limit, and propose several generalizations and directions for future research.
We prove a tropical mirror symmetry theorem for descendant Gromov-Witten invariants of the elliptic curve, generalizing a tropical mirror symmetry theorem for Hurwitz numbers of the elliptic curve. For the case of the elliptic curve, the tropical ver
sion of mirror symmetry holds on a fine level and easily implies the equality of the generating series of descendant Gromov-Witten invariants of the elliptic curve to Feynman integrals. To prove tropical mirror symmetry for elliptic curves, we investigate the bijection between graph covers and sets of monomials contributing to a coefficient in a Feynman integral. We also soup up the traditional approach in mathematical physics to mirror symmetry for the elliptic curve, involving operators on a Fock space, to give a proof of tropical mirror symmetry for Hurwitz numbers of the elliptic curve. In this way, we shed light on the intimate relation between the operator approach on a bosonic Fock space and the tropical approach.
We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation model. The main issue is whether a given infinite binary word appears w
ithin an iid Bernoulli sequence at locations that satisfy certain constraints. We settle the issue in some cases, and provide partial results in others.
For some m ge 4, let us color each column of the integer lattice L = Z^2 independently and uniformly into one of m colors. We do the same for the rows, independently from the columns. A point of L will be called blocked if its row and column have the
same color. We say that this random configuration percolates if there is a path in L starting at the origin, consisting of rightward and upward unit steps, and avoiding the blocked points. As a problem arising in distributed computing, it has been conjectured that for m ge 4, the configuration percolates with positive probability. This has now been proved (in a later paper), for large m. Here, we prove that the probability that there is percolation to distance n but not to infinity is not exponentially small in n. This narrows the range of methods available for proving the conjecture.
Let $G$ be a $3$-connected graph with $n$ vertices and $m$ edges. Let $mathbf{p}$ be a randomly chosen mapping of these $n$ vertices to the integer range $[1..2^b]$ for $bge m^2$. Let $mathbf{l}$ be the vector of $m$ Euclidean lengths of $G$s edges u
nder $mathbf{p}$. In this paper, we show that, WHP over $mathbf{p}$, we can efficiently reconstruct both $G$ and $mathbf{p}$ from $mathbf{l}$. In contrast to this average case complexity, this reconstruction problem is NP-HARD in the worst case. In fact, even the labeled version of this problem (reconstructing $mathbf{p}$ given both $G$ and $mathbf{l}$) is NP-HARD. We also show that our results stand in the presence of small amounts of error in $mathbf{l}$, and in the real setting with approximate length measurements. Our method is based on older ideas that apply lattice reduction to solve certain SUBSET-SUM problems, WHP. We also rely on an algorithm of Seymour that can efficiently reconstruct a graph given an independence oracle for its matroid.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
