Related papers: Exact Meander Asymptotics: a Numerical Check
Kernel techniques are among the most popular and flexible approaches in data science allowing to represent probability measures without loss of information under mild conditions. The resulting mapping called mean embedding gives rise to a…
Invariant manifolds of unstable periodic orbits organize the dynamics of chaotic orbits in phase space. They provide insight into the mechanisms of transport and chaotic advection and have important applications in physical situations…
Counting non-isomorphic tree-like multigraphs that include self-loops and multiple edges is an important problem in combinatorial enumeration, with applications in chemical graph theory, polymer science, and network modeling. Traditional…
Linear complementarity problems provide a powerful framework to model nonsmooth phenomena in a variety of real-world applications. In dynamical control systems, they appear coupled to a linear input-output system in the form of linear…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
Event-driven programming is a popular paradigm where the flow of execution is controlled by two features: (1) shared memory and (2) sending and receiving of messages between multiple handler threads (just called handler). Each handler has a…
In this paper, we propose a kernel method for exact tail asymptotics of a random walk to neighborhoods in the quarter plane. This is a two-dimensional method, which does not require a determination of the unknown generating function(s).…
Bloch-type equations for description of coherent transport in mesoscopic systems are applied for a study of the continuous measurement process. Both the detector and the measured system are described quantum mechanically. It is shown that…
We clarify how close a second order fully nonlinear equation can come to uniform ellipticity, through counting large eigenvalues of the linearized operator. This suggests an effective and novel way to understand the structure of fully…
Fully packed loop models describe the statistics of closely packed nested polygons on the square lattice. Many exact results can be obtained for these models, even for finite geometries, using their close relationship to alternating-sign…
We study the problem of sampling a uniformly random directed rooted spanning tree, also known as an arborescence, from a possibly weighted directed graph. Classically, this problem has long been known to be polynomial-time solvable; the…
In polymer physics it is typically assumed that excluded volume interactions are effectively screened in polymer melts. Hence, chains could be described by an effective random walk without excluded volume interactions. In this letter, we…
We consider 1-skeletons of the symmetric and asymmetric traveling salesperson polytopes whose vertices are all possible Hamiltonian tours in the complete directed or undirected graph, and the edges are geometric edges or one-dimensional…
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
We give asymptotic expressions for the number of commuting matrices over finite fields. For this, we use product expansions for the corresponding generating functions.
We show that a simple geometric result suffices to derive the form of the optimal solution in a large class of finite and infinite-dimensional maximum entropy problems concerning probability distributions, spectral densities and covariance…
This is the sequel to our first paper concerning the balanced embedding of a non-compact complex manifold into an infinite-dimensional projective space. We prove the uniqueness of such an embedding. The proof relies on fine estimates of the…
We consider linear dynamical systems under floating-point rounding. In these systems, a matrix is repeatedly applied to a vector, but the numbers are rounded into floating-point representation after each step (i.e., stored as a…
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…
We give detailed descriptions of gluing pseudoholomorphic maps in symplectic geometry, especially in the presence of an obstruction bundle. The main motivation is to try to compare the symplectic and enumerative invariants of algebraic…