相关论文: The beltway problem over orthogonal groups

We propose a method for solving statistical mechanics problems defined on sparse graphs. It extracts a small Feedback Vertex Set (FVS) from the sparse graph, converting the sparse system to a much smaller system with many-body and dense…

Despite the large research effort devoted to learning dependencies between time series, the state of the art still faces a major limitation: existing methods learn partial correlations but fail to discriminate across distinct frequency…

Let $G$ be a finite abelian group. Let $f: G \to {\mathbb C}$ be a signal (i.e. function). The classical uncertainty principle asserts that the product of the size of the support of $f$ and its Fourier transform $\hat f$, $\text{supp}(f)$…

Part 1 : We remark that the conjugacy problem for pairs of hyperbolic au- tomorphisms of a finitely presented group (typically a free group) is decidable. The solution that we propose uses the isomorphism problem for the suspensions, and…

Blind ptychography is a phase retrieval method using multiple coded diffraction patterns from different, overlapping parts of the unknown extended object illuminated with an unknown window function. The window function is also known as the…

Reconstructing continuous signals from a small number of discrete samples is a fundamental problem across science and engineering. In practice, we are often interested in signals with 'simple' Fourier structure, such as bandlimited,…

This paper considers the problem of sampling and reconstruction of a continuous-time sparse signal without assuming the knowledge of the sampling instants or the sampling rate. This topic has its roots in the problem of recovering multiple…

An exact, number-conserving solution to the generalized, orbit-dependent pairing problem is derived by introducing an infinite-dimensional algebra. A method for obtaining eigenvalues and eigenvectors of the corresponding Hamiltonian is also…

We study orbits near collision in a non-autonomous restricted planar four-body problem. This restricted problem consists of a massless particle moving under the gravitational influence due to three bodies following the figure-eight…

We study the problem of recovering a known cluster structure in a sparse network, also known as the planted partitioning problem, by means of statistical mechanics. We find a sharp transition from un-recoverable to recoverable structure as…

Dictionary learning is the task of determining a data-dependent transform that yields a sparse representation of some observed data. The dictionary learning problem is non-convex, and usually solved via computationally complex iterative…

Sparse recovery is widely applied in many fields, since many signals or vectors can be sparsely represented under some frames or dictionaries. Most of fast algorithms at present are based on solving $l^0$ or $l^1$ minimization problems and…

Probabilistic cross-identification has been successfully applied to a number of problems in astronomy from matching simple point sources to associating stars with unknown proper motions and even radio observations with realistic morphology.…

We study the auto-correlation measures of invariant random point processes in the hyperbolic plane which arise from various classes of aperiodic Delone sets. More generally, we study auto-correlation measures for large classes of Delone…

We consider a popular nonsmooth formulation of the real phase retrieval problem. We show that under standard statistical assumptions, a simple subgradient method converges linearly when initialized within a constant relative distance of an…

In imaging modalities recording diffraction data, the original image can be reconstructed assuming known phases. When phases are unknown, oversampling and a constraint on the support region in the original object can be used to solve a…

Ptychography has risen as a reference X-ray imaging technique: it achieves resolutions of one billionth of a meter, macroscopic field of view, or the capability to retrieve chemical or magnetic contrast, among other features. A…

Spectral clustering is a broad class of clustering procedures in which an intractable combinatorial optimization formulation of clustering is "relaxed" into a tractable eigenvector problem, and in which the relaxed solution is subsequently…

Holographic models for the pure gauge QCD vacuum are explored. The holographic renormalization of these models is considered as required by a phenomenological approach that takes the $\beta$-functions of the models as the only input. This…

We consider the control problem where, given an orthonormal tangent frame in the hyperbolic plane or three dimensional hyperbolic space, one is allowed to transport the frame a fixed distance $r > 0$ along the geodesic in direction of the…