Related papers: Limit Profiles for Separation Distance
Modeling of wall-bounded turbulent flows is still an open problem in classical physics, with only modest progress made in the last few decades beyond the so-called `log law', which describes only the intermediate region in wall-bounded…
Common measures of neural representational (dis)similarity are designed to be insensitive to rotations and reflections of the neural activation space. Motivated by the premise that the tuning of individual units may be important, there has…
We propose a method to outer bound forward reachable sets on finite horizons for uncertain nonlinear systems with polynomial dynamics. This method makes use of time-dependent polynomial storage functions that satisfy appropriate dissipation…
We introduce a new type of distinct distances result: a lower bound on the number of distances between points on a line and points on a two-dimensional strip. This can be seen as a generalization of the well-studied problems of distances…
In this paper, we derive new shape descriptors based on a directional characterization. The main idea is to study the behavior of the shape neighborhood under family of transformations. We obtain a description invariant with respect to…
The aim of this paper is to discuss the appropriate modelling of in- and outflow boundary conditions for nonlinear drift-diffusion models for the transport of particles including size exclusion and their effect on the behaviour of…
When a chordwise Reynolds number (Re) falls below about $10^5$ the performance of wings and aerodynamic sections become sensitive to viscous phenomena, including boundary layer separation and possible reattachment. Here, detailed…
In this paper we report some important results that help in analizing the border collision bifurcations that occur in n-dimensional discontinuous maps. For this purpose, we use the piecewise linear approximation in the neighborhood of the…
We address the scaling limits of random curves arising from, e.g., planar lattice models, especially in rough domains. The well-known precompactness conditions of Kemppainen and Smirnov show that certain crossing probability estimates…
We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…
Deterministic lateral displacement (DLD) is a popular technique for size-based separation of particles. One of the challenges in design of DLD chips is to eliminate the disturbance of fluid flow patterns caused by channel sidewalls…
Given a complex system with a given interface to the rest of the world, what does it mean for a the system to behave close to a simpler specification describing the behavior at the interface? We give several definitions for useful notions…
The Coherence Length Diagram and the related maps have been shown to represent a useful tool for image analysis. Setting threshold parameters is one of the most important issues when dealing with such applications, as they affect both the…
In topological data analysis, we want to discern topological and geometric structure of data, and to understand whether or not certain features of data are significant as opposed to simply random noise. While progress has been made on…
Motivated by Bourque and Pevzner's simulation study of the parsimony method for studying genome rearrangement, Berestycki and Durrett used techniques from random graph theory to prove that the minimum parsimony distance after iterating the…
In the millimeter waves (mmWave) bands considered for 5G and beyond, the use of very high frequencies results in the interruption of communication whenever there is no line of sight between the transmitter and the receiver. Blockages have…
We first consider interval partitions whose complements are Lebesgue-null and introduce a complete metric that induces the same topology as the Hausdorff distance (between complements). This is done using correspondences between intervals.…
This work considers the problem of estimating the distance between two covariance matrices directly from the data. Particularly, we are interested in the family of distances that can be expressed as sums of traces of functions that are…
In a companion report, we have derived a method for finding the impedance at high frequencies of vacuum chamber transitions that are short compared to the catch-up distance, in a frequency regime that (in analogy to geometric optics for…
We study the possible scaling limits of percolation interfaces in two dimensions on the triangular lattice. When one lets the percolation parameter p(N) vary with the size N of the box that one is considering, three possibilities arise in…