Related papers: Limit Profiles for Separation Distance
Plaquette models are short range ferromagnetic spin models that play a key role in the dynamic facilitation approach to the liquid glass transition. In this paper we study the dynamics of the square plaquette model at the smallest of the…
Finite mixture models that allow for a broad range of potentially non-elliptical cluster distributions is an emerging methodological field. Such methods allow for the shape of the clusters to match the natural heterogeneity of the data,…
We study a family of maps from $S_n \to S_n$ we call fixed point homing shuffles. These maps generalize a few known problems such as Conway's Topswops, and a card shuffling process studied by Gweneth McKinley. We show that the iterates of…
Convergence of the solutions of nonhomogeneous linear singularly perturbed systems to that of the corresponding reduced singular system on the half-line [0, $\infty $) is considered. To include the situation on a neighborhood of initial…
How many shuffles are needed to mix up a deck of cards? This question may be answered in the language of a random walk on the symmetric group, $S_{52}$. This generalises neatly to the study of random walks on finite groups, themselves a…
Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We define two cyclic to random…
Multistable coupled map lattices typically support travelling fronts, separating two adjacent stable phases. We show how the existence of an invariant function describing the front profile, allows a reduction of the infinitely-dimensional…
By a well-known result of Bayer and Diaconis, the maximum entropy model of the common riffle shuffle implies that the number of riffle shuffles necessary to mix a standard deck of 52 cards is either 7 or 11--with the former number applying…
Repulsion between individuals within a finite radius is encountered in numerous applications, including cell exclusion, i.e. avoidance of overlapping cells, bird flocks, or microscopic pedestrian models. We define such individual based…
Many convolutional neural networks (CNNs) have a feed-forward structure. In this paper, a linear program that estimates the Lipschitz bound of such CNNs is proposed. Several CNNs, including the scattering networks, the AlexNet and the…
Graph comparison plays a major role in many network applications. We often need a similarity metric for comparing networks according to their structural properties. Various network features - such as degree distribution and clustering…
The use of a feedback motion plan instead of the decoupled scheme consisting of separate plan and control phases can facilitate the task of proving the properties of an autonomous system. The advantage of using a feedback motion plan is the…
This work briefly explores the possibility of approximating spatial distance (alternatively, similarity) between data points using the Isolation Forest method envisioned for outlier detection. The logic is similar to that of isolation: the…
A random surface scattering in a one-mode waveguide is studied in the case when the surface profile has long-range correlations along the waveguide. Analytical treatment of this problem shows that with a proper choice of the surface, one…
The characteristics of pressure-induced laminar separation bubbles (LSBs) over a partially-slip wall, compared with that over a canonical no-slip wall, are studied using direct numerical simulation. Three cases, two utilizing linear…
We derive Singleton-type bounds on the free distance and column distances of trellis codes. Our results show that, at a given time instant, the maximum attainable column distance of trellis codes can exceed that of convolutional codes.…
In this paper, we use the eigenvalues of the random to random card shuffle to prove a sharp upper bound for the total variation mixing time. Combined with the lower bound due to Subag, we prove that this walk exhibits cutoff at $\frac{3}{4}…
We prove central limit theorems for the number of descents and the number of inversions after a shelf-shuffle. In particular, we bound the convergence rate for the number of inversions independently of the number of shelves. Along the way,…
In this paper, we introduce a novel algorithm for segmentation of imperfect boundary probability maps (BPM) in connectomics. Our algorithm can be a considered as an extension of spectral clustering. Instead of clustering the diffusion maps…
We consider the evolution of a connected set on the plane carried by a periodic incompressible stochastic flow. While for almost every realization of the random flow at time t most of the particles are at a distance of order sqrt{t} away…