Related papers: A Unified Framework for Equilibrium Selection in D…
In this article, we study systems of $n \geq 1$, not necessarily linear, discrete differential equations (DDEs) of order $k \geq 1$ with one catalytic variable. We provide a constructive and elementary proof of algebraicity of the solutions…
Configurational entropy has been revealed as a reliable method for constraining some parameters of a given model [Phys. Rev. D \textbf{92} (2015) 126005, Eur. Phys. J. C \textbf{76} (2016) 100]. In this letter we calculate the…
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
One of the main aspects of switched affine systems that makes their stabilizability study intricate is the existence of (generally) infinitely many equilibrium points in the state space. Thus, prior to designing the switched control, the…
We introduce a new consistency-based approach for defining and solving nonnegative/positive matrix and tensor completion problems. The novelty of the framework is that instead of artificially making the problem well-posed in the form of an…
We establish a general equilibrium theory for systems of large language model (LLM) agents operating under centralized orchestration. The framework is a production economy in the sense of Arrow-Debreu (1954), extended to…
In this article, we present an extension of the formulation recently developed by the authors (A Framework for Data-Driven Computational Mechanics Based on Nonlinear Optimization, arXiv:1910.12736 [math.NA]) to the structural dynamics…
We consider the multiple products of relevant and marginal scalar composite operators at the Gaussian fixed-point in $D=4$ dimensions. This amounts to perturbative construction of the $\phi^4$ theory where the parameters of the theory are…
Motivated by Pryce's structural index reduction method for differential algebraic equations (DAEs), we show the complexity of the fixed-point iteration algorithm and propose a fixed-point iteration method with parameters. It leads to a…
The classical arguments employed when obtaining error estimates of Finite Element (FE) discretisations of elliptic problems lead to more restrictive assumptions on the regularity of the exact solution when applied to non-conforming methods.…
A finite element methodology for large classes of variational boundary value problems is defined which involves discretizing two linear operators: (1) the differential operator defining the spatial boundary value problem; and (2) a Riesz…
In recent years we have witnessed a growing interest in various non-equilibrium systems described in terms of stochastic non-linear field theories. In some of those systems like the KPZ and related models, the interesting behavior is in the…
We derive a system of fixed-point equations for the equilibrium transfers in a class of one-to-one matching models with linear transferable utility. We then show that, when the degree of substitution between alternatives is bounded from…
This work establishes a rigorous connection between stability properties of discrete-time algorithms (DTAs) and corresponding continuous-time dynamical systems derived through $ O(s^r) $-resolution ordinary differential equations (ODEs). We…
Under some initial conditions, it is shown that time consistency requirements prevent rational expectation equilibrium (REE) existence for dynamic stochastic general equilibrium models induced by consumer heterogeneity, in contrast to…
The deployment of Machine Learning (ML) models is a difficult and time-consuming job that comprises a series of sequential and correlated tasks that go from the data pre-processing, and the design and extraction of features, to the choice…
We review different (reduced) models for thin structures using bending as principal mechanism to undergo large deformations. Each model consists in the minimization of a fourth order energy, potentially subject to a nonconvex constraint.…
We conduct an exhaustive survey of adaptive selection of operators (AOS) in Evolutionary Algorithms (EAs). We simplified the AOS structure by adding more components to the framework to built upon the existing categorisation of AOS methods.…
We present a conceptual framework that unifies a variety of evaluation metrics for different structured prediction tasks (e.g. event and relation extraction, syntactic and semantic parsing). Our framework requires representing the outputs…
High-order finite volume and discontinuous Galerkin methods are often stabilized by separate nonlinear devices for admissibility, entropy control, and oscillation suppression. This separation hides a simple geometric fact: all three act on…