Related papers: On extreme points of the diffusion polytope
We consider the evolution of hypersurfaces in $\mathbb{R}^{n+1}$ with normal velocity given by a positive power of the mean curvature. The hypersurfaces under consideration are assumed to be strictly mean convex (positive mean curvature),…
The discrete moment problem is a foundational problem in distribution-free robust optimization, where the goal is to find a worst-case distribution that satisfies a given set of moments. This paper studies the discrete moment problems with…
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…
High frequency limit for most of wave phenomena is known as quasiclassical limit or ray optics limit. Propagation of waves in this limit is described in terms of wave fronts and rays. Wave front is a surface of constant phase whose points…
Biological cells can release compounds into their direct environment, generally inhomogeneously over their cell membrane, after which the compounds spread by diffusion. In mathematical modelling and simulation of a collective of such cells,…
We consider diffusion processes in media with pockets of large diffusivity. The asymptotic behavior of such processes is described when the diffusion coefficients in the pockets tend to infinity. The limiting process is identified as a…
An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…
Diffusion of molecules within biological cells and tissues is strongly influenced by crowding. A key quantity to characterize diffusion is the particle lifetime, which is the time taken for a diffusing particle to exit by hitting an…
We study extremal properties of spherical random polytopes, the convex hull of random points chosen from the unit Euclidean sphere in $\mathbb{R}^n$. The extremal properties of interest are the expected values of the maximum and minimum…
Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the curve passes through the point. We consider such coverings by…
We prove the central limit theorem for the volume and the $f$-vector of the Poisson random polytope $\Pi_{\eta}$ in a fixed convex polytope $P\subset\mathbb{R}^d$. Here, $\Pi_{\eta}$ is the convex hull of the intersection of a Poisson…
Given an undirected graph $G = (V,E)$, the cut polytope $\mathrm{CUT}(G)$ is defined as the convex hull of the incidence vectors of all cuts in $G$. The 1-skeleton of $\mathrm{CUT}(G)$ is a graph whose vertex set is the vertex set of the…
Through legislation and technical advances users gain more control over how their data is processed, and they expect online services to respect their privacy choices and preferences. However, data may be processed for many different…
Spiral waves are a ubiquitous feature of the nonequilibrium dynamics of a great variety of excitable systems. In the limit of a large separation in timescale between fast excitation and slow recovery, one can reduce the spiral problem to…
In this paper we study the subset sum problem with real numbers. Starting from the given problem, we formulate a quadratic maximization problem over a polytope, P, which is eventually written as a distance maximization to a fixed point over…
We consider a discrete-time model for random interface growth which admits exact formulas and converges to the Polynuclear growth model in a particular limit. The height of the interface is initially flat and the evolution involves the…
We consider the problem of learning the weighted edges of a balanced mixture of two undirected graphs from epidemic cascades. While mixture models are popular modeling tools, algorithmic development with rigorous guarantees has lagged.…
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…
The traveling waves for surface diffusion of plane curves are studied. We consider an evolving plane curve with two endpoints, which can move freely on the x-axis with generating constant contact angles. For the evolution of this plane…
We consider random instances of non-convex perceptron problems in the high-dimensional limit of a large number of examples $M$ and weights $N$, with finite load $\alpha = M/N$. We develop a formalism based on replica theory to predict the…