Related papers: A product form for the general stochastic matching…
During bouts of evolutionary diversification, such as adaptive radiations, the emerging species cluster around different locations in phenotype space, How such multimodal patterns in phenotype space can emerge from a single ancestral…
Factorization machines (FMs) are a powerful tool for regression and classification in the context of sparse observations, that has been successfully applied to collaborative filtering, especially when side information over users or items is…
This paper explores a novel extension of dynamic matching theory by analyzing a three-way matching problem involving agents from three distinct populations, each with two possible types. Unlike traditional static or two-way dynamic models,…
This paper introduces Force Matching (ForM), a novel framework for generative modeling that represents an initial exploration into leveraging special relativistic mechanics to enhance the stability of the sampling process. By incorporating…
The conditional particle filter (CPF) is a promising algorithm for general hidden Markov model smoothing. Empirical evidence suggests that the variant of CPF with backward sampling (CBPF) performs well even with long time series. Previous…
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. In this context, the conventional factor graphs are referred…
The long-time behaviour of many dynamical systems may be effectively predicted by a low-dimensional model that describes the evolution of a reduced set of variables. We consider the question of how to equip such a low-dimensional model with…
A general class of mass transport models with Q species of conserved mass is considered. The models are defined on a lattice with parallel discrete time update rules. For one-dimensional, totally asymmetric dynamics we derive necessary and…
The problem of demand inversion - a crucial step in the estimation of random utility discrete-choice models - is equivalent to the determination of stable outcomes in two-sided matching models. This equivalence applies to random utility…
This contribution presents a derivation of the steady-state distribution of velocities and distances of vehicles in freeway traffic which has been suggested for the evaluation of interaction potentials among vehicles (see preprint…
This article is concerned with a mutualism ecological model with stochastic perturbations. the local existence and uniqueness of a positive solution are obtained with positive initial value, and the asymptotic behavior to the problem is…
Vehicle-sharing systems are becoming important for urban transportation. In these systems, users arrive at a station, pick up a vehicle, use it for a while and then return it to another station of their choice. Depending on the type of…
This article establishes general conditions for posterior consistency of Bayesian finite mixture models with a prior on the number of components. That is, we provide sufficient conditions under which the posterior concentrates on…
We consider the bipartite matching model of customers and servers introduced by Caldentey, Kaplan, and Weiss (Adv. Appl. Probab., 2009). Customers and servers play symmetrical roles. There is a finite set C resp. S, of customer, resp.…
We study the problem of an organization that matches agents to objects where agents have preference rankings over objects and the organization uses algorithms to construct a ranking over objects on behalf of each agent. Our new framework…
The graph matching problem aims to discover a latent correspondence between the vertex sets of two observed graphs. This problem has proven to be quite challenging, with few satisfying methods that are computationally tractable and widely…
In sustained growth with random dynamics stationary distributions can exist without detailed balance. This suggests thermodynamical behavior in fast growing complex systems. In order to model such phenomena we apply both a discrete and a…
The modeling and simulation of stochastic reaction-diffusion processes is a topic of steady interest that is approached with a wide range of methods. \rev{At the level of particle-resolved descriptions, where chemical reactions are coupled…
We introduce a new stochastic duration model for transaction times in asset markets. We argue that widely accepted rules for aggregating seemingly related trades mislead inference pertaining to durations between unrelated trades: while any…
We consider the one-dimensional stationary first-order mean-field game (MFG) system with the coupling between the Hamilton-Jacobi equation and the transport equation. In both cases that the coupling is strictly increasing and decreasing…