相关论文: Many greedy cleaners in a Poisson environment
We consider a disordered asymmetric exclusion process in which randomly chosen sites do not conserve particle number. The model is motivated by features of many interacting molecular motors such as RNA polymerases. We solve the steady state…
Motivated by an application in kidney exchange, we study the following query-commit problem: we are given the set of vertices of a non-bipartite graph G. The set of edges in this graph are not known ahead of time. We can query any pair of…
Sequence models are a critical component of modern NLP systems, but their predictions are difficult to explain. We consider model explanations though rationales, subsets of context that can explain individual model predictions. We find…
We analyse the problem of controllability for parameter-dependent linear finite-dimensional systems. The goal is to identify the most distinguished realisations of those parameters so to better describe or approximate the whole range of…
In this paper, we study a matching market model on a bipartite network where agents on each side arrive and depart stochastically by a Poisson process. For such a dynamic model, we design a mechanism that decides not only which agents to…
Consider a stationary renewal point process on the real line and divide each of the segments it defines in a proportion given by \iid realisations of a fixed distribution $G$ supported by [0,1]. We ask ourselves for which interpoint…
We study {\sc greedy} routing over $n$ nodes placed in a ring, with the \emph{distance} between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social…
We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different speeds, and may interact, possibly randomly, when they meet.…
We introduce nonlinear attractive effects into a spatial Prisoner's Dilemma game where the players located on a square lattice can either cooperate with their nearest neighbors or defect. In every generation, each player updates its…
In the dynamic set cover problem, the input is a dynamic universe of elements and a fixed collection of sets. As elements are inserted or deleted, the goal is to efficiently maintain an approximate minimum set cover. While the past decade…
This paper proposes a greedy heuristic named as Big step greedy heuristic and investigates the application of Big step greedy heuristic for maximum k-coverage problem. Greedy algorithms construct the solution in multiple steps, the…
This paper proposes a new algorithm for multiple sparse regression in high dimensions, where the task is to estimate the support and values of several (typically related) sparse vectors from a few noisy linear measurements. Our algorithm is…
We study Poisson and operator algebras with the ''quasi-linear property'' from the Heisenberg picture point of view. This means that there exists a set of one-parameter groups yielding an explicit expression of dynamical variables…
For Schauder bases, Dilworth et al. introduced and characterized the partially greedy property, which is strictly weaker than the (almost) greedy property. Later, Berasategui et al. defined and studied the strong partially greedy property…
To provide a novel tool for the investigation of the energy landscape of the Edwards-Anderson spin-glass model we introduce an algorithm that allows an efficient execution of a greedy optimization based on data from a previously performed…
In 2003, S. J. Dilworth et al. ([8]) introduced the notion of almost-greedy (resp. partially-greedy) bases. These bases were characterized in terms of quasi-greediness and democracy (resp. conservativeness). In this paper we will show a new…
Chase-escape is a competitive growth process in which red particles spread to adjacent empty sites according to a rate-$\lambda$ Poisson process while being chased and consumed by blue particles according to a rate-$1$ Poisson process.…
Motivated by applications where impatience is pervasive and evaluation times are uncertain, we study a selection model where options may expire at an unknown point in time and evaluation times are stochastic. Initially, the decision-maker…
For two countable ordinals $\alpha$ and $\beta$, a basis of a Banach space $X$ is said to be $(\alpha, \beta)$-quasi-greedy if it is 1) quasi-greedy, 2) $\mathcal{S}_\alpha$-unconditional but not $\mathcal{S}_{\alpha+1}$-unconditional, and…
The maximization of submodular functions is an NP-Hard problem for certain subclasses of functions, for which a simple greedy algorithm has been shown to guarantee a solution whose quality is within 1/2 of the optimal. When this algorithm…