Results 41 to 50 of about 149 (131)
Inference on Common Trends in a Cointegrated Nonlinear SVAR
ABSTRACT We consider the problem of performing inference on the number of common stochastic trends when data is generated by a cointegrated CKSVAR (a two‐regime, piecewise affine SVAR; Mavroeidis, 2021), using a modified version of the Breitung (2002) multivariate variance ratio test that is robust to the presence of nonlinear cointegration (of a known
James A. Duffy, Xiyu Jiao
wiley +1 more source
Self‐Similar Blowup for the Cubic Schrödinger Equation
ABSTRACT We give a rigorous proof for the existence of a finite‐energy, self‐similar solution to the focusing cubic Schrödinger equation in three spatial dimensions. The proof is computer‐assisted and relies on a fixed point argument that shows the existence of a solution in the vicinity of a numerically constructed approximation.
Roland Donninger, Birgit Schörkhuber
wiley +1 more source
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +1 more source
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) is said to be ( X , Y )‐embeddable if any set of induced edge lengths from an embedding of G into a ...
Sean Dewar +3 more
wiley +1 more source
ABSTRACT In this paper, we consider the optimal control problem for an unknown continuous‐time nonlinear system, and present a framework that integrates model‐based and model‐free methods to solve it. Each approach offers distinct advantages: model‐based techniques provide offline synthesis and data efficiency, while model‐free procedures excel at ...
Surabhi Athalye +2 more
wiley +1 more source
Geometric Planted Matchings Beyond the Gaussian Model
ABSTRACT We consider the problem of recovering an unknown matching between a set of n$$ n $$ randomly placed points in ℝd$$ {\mathbb{R}}^d $$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity resolution.
Lucas R. Schwengber, Roberto I. Oliveira
wiley +1 more source
Maximum Induced Trees and Forests of Bounded Degree in Random Graphs
ABSTRACT The asymptotic behavior of the maximum sizes of induced trees and forests has been studied extensively in the last few decades, though the overall picture is far from being complete. In this paper, we close several significant gaps: (1) We prove 2‐point concentration of the maximum sizes of an induced forest and an induced tree with maximum ...
Margarita Akhmejanova +2 more
wiley +1 more source
Low-rank Parareal: a low-rank parallel-in-time integrator. [PDF]
Carrel B, Gander MJ, Vandereycken B.
europepmc +1 more source
Robust Bernoulli Mixture Models for Credit Portfolio Risk
ABSTRACT This paper presents comparison results and establishes risk bounds for credit portfolios within classes of Bernoulli mixture models, assuming conditionally independent defaults that are stochastically increasing in a common risk factor. We provide simple and interpretable conditions on conditional default probabilities that imply a comparison ...
Jonathan Ansari, Eva Lütkebohmert
wiley +1 more source
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates. [PDF]
Boţ RI, Csetnek ER, Nguyen DK.
europepmc +1 more source

