Related papers: Loynes construction for the extended bipartite mat…
We consider a stochastic matching model with a general compatibility graph, as introduced in \cite{MaiMoy16}. We prove that most common matching policies (including FCFM, priorities and random) satisfy a particular sub-additive property,…
We introduce and study a new model that we call the {\em matching model}. Items arrive one by one in a buffer and depart from it as soon as possible but by pairs. The items of a departing pair are said to be {\em matched}. There is a finite…
By using extended bosonic coherent states, the solution to the Jaynes-Cummings model without the rotating-wave approximation can be mapped to that of a polynomial equation with a single variable. The solutions to this polynomial equation…
The model of FCFS infinite bipartite matching was introduced in caldentey-kaplan-weiss 2009. In this model there is a sequence of items that are chosen i.i.d. from $\mathcal{C}=\{c_1,\ldots,c_I\}$ and an independent sequence of items that…
Stationary states of stochastic models, which have $N$ states per site, in matrix product form are considered. First we give a necessary condition for the existence of a finite $M$-dimensional matrix product state for any ${N,M}$. Second,…
It is well-known that for expansive maps and continuous potential functions, the specification property (for the map) and the Bowen property (for the potential) together imply the existence of a unique equilibrium state. We consider…
As a common generalization of previously solved optimization problems concerning bipartite stable matchings, we describe a strongly polynomial network flow based algorithm for computing $\ell$ disjoint stable matchings with minimum total…
A complete characterization and quantification of entanglement, particularly the multipartite entanglement, remains an unfinished long-term goal in quantum information theory. As long as the multipartite system is concerned, the relation…
We consider a class of uncertain linear time-invariant overparametrized systems affected by bounded disturbances, which are described by a known exosystem with unknown initial conditions. For such systems an exponentially stable extended…
We introduce a general class of autoregressive models for studying the dynamic of multivariate binary time series with stationary exogenous covariates. Using a high-level set of assumptions, we show that existence of a stationary path for…
Score matching (SM) provides a compelling approach to learn energy-based models (EBMs) by avoiding the calculation of partition function. However, it remains largely open to learn energy-based latent variable models (EBLVMs), except some…
An alternative approach for minimum and mode-dependent dwell-time characterization for switched systems is derived. The proposed technique is related to Lyapunov looped-functionals, a new type of functionals leading to stability conditions…
Out of the recent advances in systems and control (S\&C)-based analysis of optimization algorithms, not enough work has been specifically dedicated to machine learning (ML) algorithms and its applications. This paper addresses this gap by…
This paper studies two-sided many-to-one matching in which firms have complementary preferences. We show that stable matchings exist under a balancedness condition that rules out a specific type of odd-length cycles formed by firms'…
We consider the problem of constructing Lyapunov functions for linear differential equations with delays. For such systems it is known that exponential stability implies the existence of a positive Lyapunov function which is quadratic on…
Model-based planning holds great promise for improving both sample efficiency and generalization in reinforcement learning (RL). We show that energy-based models (EBMs) are a promising class of models to use for model-based planning. EBMs…
We introduce a model of dynamic matching with transferable utility, extending the static model of Shapley and Shubik (1971). Forward-looking agents have individual states that evolve with current matches. Each period, a matching market with…
This paper reveals that a common and central role, played in many error bound (EB) conditions and a variety of gradient-type methods, is a residual measure operator. On one hand, by linking this operator with other optimality measures, we…
The latent block model (LBM) is a flexible probabilistic tool to describe interactions between node sets in bipartite networks, but it does not account for interactions of time varying intensity between nodes in unknown classes. In this…
We present in this paper a rigorous theoretical framework to show stability, convergence and accuracy of improved edge-based and face-based smoothed finite element methods (bESFEM and bFS-FEM) for nearly-incompressible elasticity problems.…