Related papers: The convex hull for a random acceleration process …
A random search of a partially absorbing target by a run-and-tumble particle in a confined one-dimensional space is investigated. We analytically obtain the mean searching time, which shows a non-monotonic behavior as a function of the…
This work presents a methodology to predict a near-optimal spacing function, which defines the element sizes, suitable to perform steady RANS turbulent viscous flow simulations. The strategy aims at utilising existing high fidelity…
This paper is devoted to a statistical analysis of the fluctuations of velocity and acceleration produced by a random distribution of point vortices in two-dimensional turbulence. We show that the velocity probability density function…
A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and…
Random acceleration is a fundamental stochastic process encountered in many applications. In the one-dimensional version of the process a particle is randomly accelerated according to the Langevin equation $\ddot{x}(t) = \sqrt{2D} \xi(t)$,…
In this paper we consider the convex hull of a spherically symmetric sample in $R^d$. Our main contributions are some new asymptotic results for the expectation of the number of vertices, number of facets, area and the volume of the convex…
In the random acceleration process, a point particle is accelerated according to $\ddot{x}=\eta(t)$, where the right hand side represents Gaussian white noise with zero mean. We begin with the case of a particle with initial position $x_0$…
We consider the moments of the volume of the symmetric convex hull of independent random points in an $n$-dimensional symmetric convex body. We calculate explicitly the second and fourth moments for $n$ points when the given body is $B_q^n$…
Given a probability measure $\mu$ on a set $\mathcal{X}$ and a vector-valued function $\varphi$, a common problem is to construct a discrete probability measure on $\mathcal{X}$ such that the push-forward of these two probability measures…
Gaussian processes can be treated as subsets of a standard Hilbert space, however, the volume size relation between the underlying index space of random processes and its convex hull is not clear. The understanding of such volume size…
Lagrangian acceleration statistics in a fully developed turbulent channel flow at $Re_\tau = 1440$ are investigated, based on tracer particle tracking in experiments and direct numerical simulations. The evolution with wall distance of the…
Monte Carlo dynamics of the lattice 48 monomers toy protein is interpreted as a random walk in an abstract (discrete) space of conformations. To test the geometry of this space, we examine the return probability $P(T)$, which is the…
We investigate the explicit convex relaxation of the ideal magnetohydrodynamics equations. We provide a non-trivial lower estimate on the lamination hull and an upper estimate on the $\Lambda$-convex hull, the latter providing inequalities…
Molecular dynamics simulation has been used to model pattern formation in three-dimensional Rayleigh--Benard convection at the discrete-particle level. Two examples are considered, one in which an almost perfect array of hexagonally-shaped…
This work studies the computational aspects of multivariate convex regression in dimensions $d \ge 5$. Our results include the \emph{first} estimators that are minimax optimal (up to logarithmic factors) with polynomial runtime in the…
In this article we prove a conjecture of Bezdek, Brass, and Harborth concerning the maximum volume of the convex hull of any facet-to-facet connected system of n unit hypercubes in the d-dimensional Euclidean space. For d=2 we enumerate the…
We present fast simulation methods for the self-assembly of complex shapes in two dimensions. The shapes are modeled via a general boundary curve and interact via a standard volume term promoting overlap and an interpenetration penalty. To…
We study $\mathbb{R}^2\oplus\mathbb{R}$-separately convex hulls of finite sets of points in $\mathbb{R}^3$, as in KirchheimMullerSverak2003. This notion of convexity, which we call $2+1$ convexity, corresponds to rank-one convex convexity,…
We consider the two-dimensional incompressible Euler equations. We construct vortex patches with smooth boundary on $T^2$ and $R^2$ whose perimeter grows with time. More precisely, for any constant $M > 0$, we construct a vortex patch in…
We study the Hausdorff distance between a random polytope, defined as the convex hull of i.i.d. random points, and the convex hull of the support of their distribution. As particular examples, we consider uniform distributions on convex…