Related papers: Jamming coverage in competitive random sequential …
Adsorption of tetramer built of four identical spheres was studied numerically using the Random Sequential Adsorption (RSA) algorithm. Tetramers were adsorbed on a two dimensional, flat and homogeneous surface. Two different models of the…
Jamming and percolation transitions in the standard random sequential adsorption of particles on regular lattices are characterized by a universal set of critical exponents. The universality class is preserved even in the presence of…
We provide statistical learning guarantees for two unsupervised learning tasks in the context of compressive statistical learning, a general framework for resource-efficient large-scale learning that we introduced in a companion paper.The…
Criticality in statistical physics naturally emerges at isolated points in the phase diagram. Jamming of spheres is not an exception: varying density, it is the critical point that separates the unjammed phase where spheres do not overlap…
The discrete collisional breakage equation, which captures the dynamics of cluster growth when clusters encounter binary collisions with possible matter transfer, is discussed in this article. The existence of global mass-conserving…
In this letter, we investigate the anti-jamming defense problem in multi-user scenarios, where the coordination among users is taken into consideration. The Markov game framework is employed to model and analyze the anti-jamming defense…
This paper develops a new framework, \emph{simultaneous saturation}, designed to quantify the size of sets whose elements are simultaneously large. The framework establishes a correspondence between the magnitude of such sets and a system…
The paper considers sparse array design for receive beamforming achieving maximum signal-to-interference plus noise ratio (MaxSINR) for both single point source and multiple point sources, operating in an interference active environment.…
We investigate the fine-grained and the parameterized complexity of several generalizations of binary constraint satisfaction problems (BINARY-CSPs), that subsume variants of graph colouring problems. Our starting point is the observation…
Breaking the fronthaul capacity limitations is vital to make cloud radio access network (C-RAN) scalable and practical. One promising way is aggregating several remote radio units (RRUs) as a cluster to share a fronthaul link, so as to…
We study a random aggregation process involving rectangular clusters. In each aggregation event, two rectangles are chosen at random and if they have a compatible side, either vertical or horizontal, they merge along that side to form a…
We study a random partial covering model on the $(d-1)$-dimensional unit sphere, where $N$ spherical caps are placed independently and uniformly at random, each covering a surface fraction of $1/N$. This model provides a continuous…
We study a general stochastic ranking problem where an algorithm needs to adaptively select a sequence of elements so as to "cover" a random scenario (drawn from a known distribution) at minimum expected cost. The coverage of each scenario…
We study the performance of random linear network coding for time division duplexing channels with Poisson arrivals. We model the system as a bulk-service queue with variable bulk size. A full characterization for random linear network…
Range Minimum Query (RMQ) is an important building brick of many compressed data structures and string matching algorithms. Although this problem is essentially solved in theory, with sophisticated data structures allowing for constant time…
Packings of frictionless athermal particles that interact only when they overlap experience a jamming transition as a function of packing density. Such packings provide the foundation for the theory of jamming. This theory rests on the…
Constraint Satisfaction Problems are ubiquitous in fields ranging from the physics of solids to artificial intelligence. In many cases, such systems undergo a transition when the ratio of constraints to variables reaches some value…
Random constraint satisfaction problems (CSP) have been studied extensively using statistical physics techniques. They provide a benchmark to study average case scenarios instead of the worst case one. The interplay between statistical…
Computer simulation was used to study the random sequential adsorption of identical discorectangles onto a continuous plane . The problem was analyzed for a wide range of discorectangle aspect ratios ($\varepsilon \in [1;100]$). We studied…
Binary embedding is the problem of mapping points from a high-dimensional space to a Hamming cube in lower dimension while preserving pairwise distances. An efficient way to accomplish this is to make use of fast embedding techniques…