Related papers: Double $\mathbf{k}$-Grid Method for Solving the Be…
We study the k-route cut problem: given an undirected edge-weighted graph G=(V,E), a collection {(s_1,t_1),(s_2,t_2),...,(s_r,t_r)} of source-sink pairs, and an integer connectivity requirement k, the goal is to find a minimum-weight subset…
We employ a scalar model to exemplify the use of contour deformations when solving Lorentz-invariant integral equations for scattering amplitudes. In particular, we calculate the onshell 2 -> 2 scattering amplitude for the scalar system.…
We study the problem of sampling k-bandlimited signals on graphs. We propose two sampling strategies that consist in selecting a small subset of nodes at random. The first strategy is non-adaptive, i.e., independent of the graph structure,…
Spectral clustering is a novel clustering method which can detect complex shapes of data clusters. However, it requires the eigen decomposition of the graph Laplacian matrix, which is proportion to $O(n^3)$ and thus is not suitable for…
The concept of pseudo-spin provides a general framework for describing physical systems featuring two-component spinors, including light polarization, sublattice degrees of freedom in bipartite lattices, and valley polarization in 2D…
Quantum Krylov algorithms have emerged as a promising approach for ground-state energy estimation in the near-term quantum computing era. A major challenge, however, lies in their inherently substantial sampling cost, primarily due to the…
Inversion of the K-fold stochastic autoconvolution integral equation is an elementary nonlinear problem, yet there are no de facto methods to solve it with finite statistics. To fix this problem, we introduce a novel inverse algorithm based…
To solve linear PDEs on metric graphs with standard coupling conditions (continuity and Kirchhoff's law), we develop and compare a spectral, a second-order finite difference, and a discontinuous Galerkin method. The spectral method yields…
Within the well-established optical response function formalism, a new strategy with the central idea of employing the forward-backward stochastic Schr\"{o}dinger equations in a segmented way to accurately obtain the two-dimensional (2D)…
In this work, we propose a hybrid Bayesian approach towards clock offset and skew estimation, thereby synchronizing large scale networks. In particular, we demonstrate the advantage of Bayesian Recursive Filtering (BRF) in alleviating…
We study penalization coupled with time discretization for decoupled Markovian doubly reflected BSDEs with obstacles \(p_b(t,X_t)\le Y_t\le p_w(t,X_t)\). The DRBSDE is approximated by a penalized BSDE with parameter \(\lambda\) and…
In Bipartite Correlation Clustering (BCC) we are given a complete bipartite graph $G$ with `+' and `-' edges, and we seek a vertex clustering that maximizes the number of agreements: the number of all `+' edges within clusters plus all `-'…
In this paper, a novel method is proposed, and employed to design a single diffractive optical element (DOE) for implementing spectrum-splitting and beam-concentration (SSBC) functions simultaneously. We develop an optimization algorithm,…
In this paper, we study and implement the structural iterative eigensolvers for the large-scale eigenvalue problem in the Bethe-Salpeter equation (BSE) based on the reduced basis approach via low-rank factorizations in generating matrices,…
In this work, we focus on the Bipartite Stochastic Block Model (BiSBM), a popular model for bipartite graphs with a community structure. We consider the high dimensional setting where the number $n_1$ of type I nodes is far smaller than the…
In some cases, computational benefit can be gained by exploring the hyper parameter space using a deterministic set of grid points instead of a Markov chain. We view this as a numerical integration problem and make three unique…
The K-Modes algorithm, developed for clustering categorical data, is of high algorithmic simplicity but suffers from unreliable performances in clustering quality and clustering efficiency, both heavily influenced by the choice of initial…
We consider a finite element method for elliptic equation with heterogeneous and possibly high-contrast coefficients based on primal hybrid formulation. A space decomposition as in FETI and BDCC allows a sequential computations of the…
In this paper, we present a novel local and parallel two-grid finite element scheme for solving the Stokes equations, and rigorously establish its a priori error estimates. The scheme admits simultaneously small scales of subproblems and…
In the $k$-Edge Connected Spanning Subgraph ($k$-ECSS) problem we are given a (multi-)graph $G=(V,E)$ with edge costs and an integer $k$, and seek a min-cost $k$-edge-connected spanning subgraph of $G$. The problem admits a…