skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Minimizers for an Aggregation Model with Attractive–Repulsive Interaction
Abstract We solve explicitly a certain minimization problem for probability measures involving an interaction energy that is repulsive at short distances and attractive at large distances. We complement earlier works by showing that in an optimal part of the remaining parameter regime all minimizers are uniform distributions on a surface of a sphere, thus showing concentration on a lower dimensional set. Our method of proof uses convexity estimates on hypergeometric functions.  more » « less
Award ID(s):
1954995 2202877
PAR ID:
10571317
Author(s) / Creator(s):
;
Publisher / Repository:
Springer Science + Business Media
Date Published:
Journal Name:
Archive for Rational Mechanics and Analysis
Volume:
249
Issue:
2
ISSN:
0003-9527
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Freed, R; Harshaw, R; Genet, Russell M (Ed.)
    We report new measurements of the position angle and separation of the double star WDS 03245+5938 STI 450, based on our observations, Gaia EDR3, and historical data. We find that the position angle and separation are 209.7° and 7.68", respectively, showing slight changes from the previous values of 210° and 7.742". We also find that the distances between the two stars are far apart, suggesting that the system is an optical double, and therefore not gravitationally bound together. Furthermore, we find that the ratio of proper motion (rPM) metric of the system is distinct, indicating that the system is a chance alignment of two unrelated stars that are at different distances. 
    more » « less
  2. Hydrogen-containing materials are of fundamental as well as technological interest. An outstanding question for both is the amount of hydrogen that can be incorporated in such materials, because that determines dramatically their physical properties such as electronic and crystalline structure. The number of hydrogen atoms in a metal is controlled by the interaction of hydrogens with the metal and by the hydrogen–hydrogen interactions. It is well established that the minimal possible hydrogen–hydrogen distances in conventional metal hydrides are around 2.1 Å under ambient conditions, although closer H–H distances are possible for materials under high pressure. We present inelastic neutron scattering measurements on hydrogen in Z r V 2 H x showing nonexpected scattering at low-energy transfer. The analysis of the spectra reveals that these spectral features in part originate from hydrogen vibrations confined by neighboring hydrogen at distances as short as 1.6 Å. These distances are much smaller than those found in related hydrides, thereby violating the so-called Switendick criterion. The results have implications for the design and creation of hydrides with additional properties and applications. 
    more » « less
  3. Given samples from an unknown distribution p and a description of a distribution q, are p and q close or far? This question of “identity testing” has received significant attention in the case of testing whether p and q are equal or far in total variation distance. However, in recent work [VV11a, ADK15, DP17], the following questions have been been critical to solving problems at the frontiers of distribution testing: Alternative Distances: Can we test whether p and q are far in other distances, say Hellinger? Tolerance: Can we test when p and q are close, rather than equal? And if so, close in which distances? Motivated by these questions, we characterize the complexity of distribution testing under a variety of distances, including total variation, ℓ2, Hellinger, Kullback-Leibler, and χ2. For each pair of distances d1 and d2, we study the complexity of testing if p and q are close in d1 versus far in d2, with a focus on identifying which problems allow strongly sublinear testers (i.e., those with complexity O(n1–γ) for some γ > 0 where n is the size of the support of the distributions p and q). We provide matching upper and lower bounds for each case. We also study these questions in the case where we only have samples from q (equivalence testing), showing qualitative differences from identity testing in terms of when tolerance can be achieved. Our algorithms fall into the classical paradigm of χ2-statistics, but require crucial changes to handle the challenges introduced by each distance we consider. Finally, we survey other recent results in an attempt to serve as a reference for the complexity of various distribution testing problems. 
    more » « less
  4. We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers , which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work on distance preservers has exploited only a simple structural property of shortest paths, called consistency , stating that one can break shortest path ties such that no two paths intersect, split apart, and then intersect again later. We prove that consistency alone is not enough to understand distance preservers, by showing both a lower bound on the power of consistency and a new general upper bound that polynomially surpasses it. Specifically, our new upper bound is that any p demand pairs in an n -node undirected unweighted graph have a distance preserver on O( n 2/3 p 2/3 + np 1/3 edges. We leave a conjecture that the right bound is O ( n 2/3 p 2/3 + n ) or better. The second part of this paper leverages these distance preservers in a new construction of additive spanners , which are subgraphs that preserve all pairwise distances up to an additive error function. We give improved error bounds for spanners with relatively few edges; for example, we prove that all graphs have spanners on O(n) edges with + O ( n 3/7 + ε ) error. Our construction can be viewed as an extension of the popular path-buying framework to clusters of larger radii. 
    more » « less
  5. Humans typically walk at low speeds and run at higher speeds. Previous studies of transitions between walking and running were mostly on treadmills, but real-world locomotion allows more flexibility. Here, we study overground locomotion over long distances (800 or 2400 m) under time constraints, simulating everyday scenarios like traveling to an appointment. Unlike on treadmills, participants can vary both speed and gait during this task. Gait transition in this overground task occurs over a broad ‘gait transition regime’ spanning average speeds from 1.9 to 3.0 m s−1. In this regime, people use mixtures of walking and running on each travel bout: mostly walking at low average speeds (around 1.9 m s−1) and mostly running at high average speeds (3.0 m s−1). The walk–run fraction changes gradually between these speed limits and is 50% at about 2.5 m s−1. Within each walk–run mixture, walking is slower than running, with an unused gap between the two gait speeds. These gait mixtures and their speed dependence are predicted by energy optimality. These findings extend earlier results for shorter distances, showing that similar energetic principles govern longer, more physically and cognitively demanding tasks. Our results highlight the role of whole-task energy minimization including transients in shaping human locomotion and gait choice. 
    more » « less