Related papers: Large Deviations in One-Dimensional Random Sequent…
We model the kinetics of ligand-receptor systems, where multiple ligands may bind and unbind to the receptor, either randomly or in a specific order. Equilibrium occupation and first occurrence of complete filling of the receptor are…
Irregular repetition slotted Aloha (IRSA) has shown significant advantages as a modern technique for uncoordinated random access with massive number of users due to its capability of achieving theoretically a throughput of $1$ packet per…
We study a particle system with hopping (random walk) dynamics on the integer lattice $\mathbb Z^d$. The particles can exist in two states, active or inactive (sleeping); only the former can hop. The dynamics conserves the number of…
We report on simulations of reversible random sequential adsorption of dimers on three different lattices: a one-dimensional lattice, a two-dimensional triangular lattice, and a two-dimensional triangular lattice with the nearest neighbors…
The present PhD dissertation focuses on modern random access (RA) techniques. In the first part an slot- and frame-asynchronous RA scheme adopting replicas, successive interference cancellation and combining techniques is presented and its…
Recovery of the initial state of a high-dimensional system can require a large number of measurements. In this paper, we explain how this burden can be significantly reduced when randomized measurement operators are employed. Our work…
We introduce a new approach for designing Random-order Contention Resolution Schemes (RCRS) via exact solution in continuous time. Given a function $c(y):[0,1] \rightarrow [0,1]$, we show how to select each element which arrives at time $y…
We model a dense wireless local area network where the access points (APs) employ carrier sense multiple access (CSMA)-type medium access control protocol. In our model, the spatial locations of the set of active APs are modeled using the…
To implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time linear to the uncertainty in the latency of the network for both read and write operations. Waiting only for one of them…
In this paper, we present DROP, high-Density Relocation-free sequential OPerations in automated valet parking. DROP addresses the challenges in high-density parking & vehicle retrieval without relocations. Each challenge is handled by…
We study a class of dynamically constructed point processes in which at every step a new point (particle) is added to the current configuration with a distribution depending on the local structure around a uniformly chosen particle. This…
We present an autodifferentiable rejection sampling algorithm termed Rejection Sampling with Autodifferentiation (RSA). In conjunction with reweighting, we show that RSA can be used for efficient parameter estimation and model exploration.…
Dynamic space packing (DSP) is a random process with sequential addition and removal of identical objects into space. In the lattice version, objects are particles occupying single lattice sites, and adding a particle to a lattice site…
Given an overcomplete dictionary $A$ and a signal $b$ that is a linear combination of a few linearly independent columns of $A$, classical sparse recovery theory deals with the problem of recovering the unique sparse representation $x$ such…
This paper investigates the second order properties of a stationary process after random sampling. While a short memory process gives always rise to a short memory one, we prove that long-memory can disappear when the sampling law has heavy…
R\'enyi's parking problem (or $1D$ sequential interval packing problem) dates back to 1958, when R\'enyi studied the following random process: Consider an interval $I$ of length $x$, and sequentially and randomly pack disjoint unit…
We consider the classic infinite occupancy scheme, where balls are thrown in boxes independently, with probability $p_j$ of hitting box $j$. Each time a box receives its first ball we speak of a record and, more generally, call an…
We introduce the problem of reconstructing a sequence of multidimensional real vectors where some of the data are missing. This problem contains regression and mapping inversion as particular cases where the pattern of missing data is…
We study the common continual learning setup where an overparameterized model is sequentially fitted to a set of jointly realizable tasks. We analyze forgetting, defined as the loss on previously seen tasks, after $k$ iterations. For…
This survey concerns probabilistic models motivated by cooperative sequential adsorption (CSA) models. CSA models are widely used in physics and chemistry for modelling adsorption processes in which adsorption rates depend on the spatial…