English
Related papers

Related papers: The Steiner distance problem for large vertex subs…

200 papers

The Keller-Segel system describes the collective motion of cells that are attracted by a chemical substance and are able to emit it. In its simplest form, it is a conservative drift-diffusion equation for the cell density coupled to an…

Analysis of PDEs · Mathematics 2010-10-29 Adrien Blanchet , Jean Dolbeault , Miguel Escobedo , Javier Fernández

Persistence diagrams are a useful tool from topological data analysis which can be used to provide a concise description of a filtered topological space. What makes them even more useful in practice is that they come with a notion of a…

Computational Geometry · Computer Science 2018-11-05 Jesse J. Berwald , Joel M. Gottlieb , Elizabeth Munch

In this paper we describe the asymptotic behavior, in the exponential time scale, of solutions to quasi-linear parabolic equations with a small parameter at the second order term and the long time behavior of corresponding diffusion…

Probability · Mathematics 2012-07-03 M. Freidlin , L. Koralov

The paper deals with the Dirichlet problem for the nonstationary Stokes system in a three-dimensional cone. The auhors study the asymptotics of the solutions near the vertex of the cone.

Analysis of PDEs · Mathematics 2018-03-30 Vladimir Kozlov , Jürgen Rossmann

Generically, a fully measured elasticity tensor has no material symmetry. For single crystals with a cubic lattice, or for the aeronautics turbine blades superalloys such as Nickelbased CMSX-4, cubic symmetry is nevertheless expected. It is…

Optimization and Control · Mathematics 2022-03-29 Perla Azzi , Rodrigue Desmorat , Boris Kolev , Fabien Priziac

In this paper we deal with the restricted Block Relocation Problem. We present a new lower bound and a heuristic approach for the problem. The proposed lower bound can be computed in polynomial time and it is provably better than some…

Other Computer Science · Computer Science 2022-06-27 Tiziano Bacci , Sara Mattia , Paolo Ventura

Consider the random hypercube $H_2^n(p_n)$ obtained from the hypercube $H_2^n$ by deleting any given edge with probabilty $1-p_n$, independently of all the other edges. A diameter path in $H_2^n$ is a longest geodesic path in $H_2^n$.…

Probability · Mathematics 2012-09-05 Ross G. Pinsky

We address the problem, not of the determination -- which usually needs numerical methods -- but of an accurate analytical estimation of the distance of a raw elasticity tensor to cubic symmetry and to orthotropy. We point out that there…

Classical Physics · Physics 2022-06-08 Rodrigue Desmorat , Boris Kolev

A new non-perturbative method of solution of the nonlinear Heisenberg equations in the finite-dimensional subspace is illustrated. The method, being a counterpart of the traditional Schrodinger picture method, is based on a finite operator…

Quantum Physics · Physics 2016-09-08 L. Mista , R. Filip

In this paper hyperbolic partial differential equations with random coefficients are discussed. Such random partial differential equations appear for instance in traffic flow problems as well as in many physical processes in random media.…

Analysis of PDEs · Mathematics 2017-06-19 Andrea Barth , Franz G. Fuchs

We study nonparametric density estimation problems where error is measured in the Wasserstein distance, a metric on probability distributions popular in many areas of statistics and machine learning. We give the first minimax-optimal rates…

Statistics Theory · Mathematics 2020-04-30 Jonathan Niles-Weed , Quentin Berthet

Denote by Q_d the d-dimensional hypercube. Addressing a recent question we estimate the number of ways the vertex set of Q_d can be partitioned into vertex disjoint smaller cubes. Among other results, we prove that the asymptotic order of…

Combinatorics · Mathematics 2025-12-01 Noga Alon , Jozsef Balogh , Vladimir N. Potapov

The $n$-dimensional random twisted hypercube $\mathbf{G}_n$ is constructed recursively by taking two instances of $\mathbf{G}_{n-1}$, with any joint distribution, and adding a random perfect matching between their vertex sets. Benjamini,…

Combinatorics · Mathematics 2024-10-14 Lucas Aragão , Maurício Collares , Gabriel Dahia , João Pedro Marciano

This paper is devoted to the study of the large time behaviour of viscosity solutions of parabolic equations with Neumann boundary conditions. This work is the sequel of [13] in which a probabilistic method was developped to show that the…

Probability · Mathematics 2015-09-18 Ying Hu , Pierre-Yves Madec

In this paper, we propose a horizontal type method of lines numerical scheme for the unsteady Euler-Bernoulli beam equation. The problem is initially reformulated as a first order system of initial value problems and a suitable one-step…

Numerical Analysis · Mathematics 2025-06-05 Onur Baysal , Maria Aquilina

Understanding distance metrics in high-dimensional spaces is crucial for various fields such as data analysis, machine learning, and optimization. The Manhattan distance, a fundamental metric in multi-dimensional settings, measures the…

General Mathematics · Mathematics 2024-06-25 Ergon Cugler de Moraes Silva

We show that the d-cube is determined by the spectrum of its distance matrix.

Combinatorics · Mathematics 2016-04-29 Jack. H. Koolen , Sakander Hayat , Quaid Iqbal

The Snake-in-the-Box problem is that of finding a longest induced path in an $n$-dimensional hypercube. We prove new lower bounds for the values $n\in \{11,12,13\}$. The Coil-in-the-Box problem is that of finding a longest induced cycle in…

Combinatorics · Mathematics 2016-06-17 David Allison , Daniel Paulusma

Motivated by the omnipresence of extreme value distributions in limit theorems involving extremes of random processes, we adapt Stein's method to include these laws as possible target distributions. We do so by using the generator approach…

Probability · Mathematics 2025-07-02 Bruno Costacèque , Laurent Decreusefond

We study the $k$-center problem in a kinetic setting: given a set of continuously moving points $P$ in the plane, determine a set of $k$ (moving) disks that cover $P$ at every time step, such that the disks are as small as possible at any…

Computational Geometry · Computer Science 2021-07-13 Ivor van der Hoog , Marc van Kreveld , Wouter Meulemans , Kevin Verbeek , Jules Wulms