检索结果-内蒙古大学图书馆

Cloaking the underlying long-range order of randomly perturbed lattices

Physical Review E 2020年第3期101卷 032118-032118页

作者： Michael A. Klatt Jaeuk Kim Salvatore Torquato Department of Physics Princeton University Princeton New Jersey 08544 USA Department of Chemistry Princeton Institute for the Science and Technology of Materials and Program in Applied and Computational Mathematics Princeton University Princeton New Jersey 08544 USA

Random, uncorrelated displacements of particles on a lattice preserve the hyperuniformity of the original lattice, that is, normalized density fluctuations vanish in the limit of infinite wavelengths. In addition to a diffuse contribution, the scattering intensity from the the resulting point pattern typically inherits the Bragg peaks (long-range order) of the original lattice. Here we demonstrate how these Bragg peaks can be hidden in the effective diffraction pattern of independent and identically distributed perturbations. All Bragg peaks vanish if and only if the sum of all probability densities of the positions of the shifted lattice points is a constant at all positions. The underlying long-range order is then “cloaked” in the sense that it cannot be reconstructed from the pair correlation function alone. On the one hand, density fluctuations increase monotonically with the strength of perturbations a, as measured by the hyperuniformity order metric Λ¯. On the other hand, the disappearance and reemergence of long-range order, depending on whether the system is cloaked as the perturbation strength increases, is manifestly captured by the τ order metric. Therefore, while the perturbation strength a may seem to be a natural choice for an order metric of perturbed lattices, the τ order metric is a superior choice. It is noteworthy that cloaked perturbed lattices allow one to easily simulate very large samples (with at least 106 particles) of disordered hyperuniform point patterns without Bragg peaks.

关键词： Classical statistical mechanics

来源：评论

学校读者我要写书评

暂无评论

Executive Summary of Dagstuhl Seminar on Structured Decompositions and Efficient Algorithms (08492)

Executive Summary of Dagstuhl Seminar on Structured Decompos...

引用

Structured Decompositions and Efficient Algorithms 2008

作者： Dahlke, Stephan Daubechies, Ingrid Elad, M. Kutyniok, Gitta Teschke, Gerd Philipps-Universität Marburg FB12 Mathematik und Informatik Hans-Meerwein Straße Lahnberge Marburg35032 Germany Princeton University Program in Applied and Computational Mathematics Fine Hall Washington Road PrincetonNJ08544-1000 United States Technion Computer Science Department Haifa Technion City32000 Israel Universität Osnabrück Institute of Mathematics Osnabrück49069 Germany Hochschule Neubrandenburg University of Applied Sciences Institute for Computational Mathematics in Science and Technology Brodaer Str. 2 Neubrandenburg17033 Germany

New emerging technologies such as high-precision sensors or new MRI machines drive us towards a challenging quest for new, more effective, and more daring mathematical models and algorithms. Therefore, in the last few years researchers have started to investigate different methods to efficiently represent or extract relevant information from complex, high dimensional and/or multimodal data. Efficiently in this context means a representation that is linked to the features or characteristics of interest, thereby typically providing a sparse expansion of such. Besides the construction of new and advanced ansatz systems the central question is how to design algorithms that are able to treat complex and high dimensional data and that efficiently perform a suitable approximation of the signal. One of the main challenges is to design new sparse approximation algorithms that would ideally combine, with an adjustable tradeoff, two properties: a provably good 'quality' of the resulting decomposition under mild assumptions on the analyzed sparse signal, and numerically efficient design. The topic is driven by applications as well as by theoretical questions. Therefore, the aim of this seminar was to bring together a good mixture of scientists with different backgrounds in order to discuss recent progress as well as new challenging perspectives. In particular, it was intended to strengthen the interaction of mathematicians and computer scientists. © 2009 Dagstuhl Seminar Proceedings. All Rights Reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

STEFAN PROBLEM WITH SURFACE TENSION: UNIQUENESS OF PHYSICAL SOLUTIONS UNDER RADIAL SYMMETRY

arXiv

引用

arXiv 2023年

作者： Guo, Yucheng Nadtochiy, Sergey Shkolnikov, Mykhaylo Department of Applied Mathematics Illinois Institute of Technology ChicagoIL60616 United States ORFE Department Bendheim Center for Finance Program in Applied & Computational Mathematics Princeton University PrincetonNJ08544 United States

We study the Stefan problem with surface tension and radially symmetric initial data. In this context, the notion of a so-called physical solution, which exists globally despite the inherent blow-ups of the melting rate, has been recently introduced in [NS23]. The paper at hand is devoted to the proof that the physical solution is unique, the first such result when the free boundary is not flat, or when two phases are present. The main argument relies on a detailed analysis of the hitting probabilities for a three-dimensional Brownian motion, as well as on a novel convexity property of the free boundary obtained by comparison techniques. In the course of the proof, we establish a wide variety of regularity estimates for the free boundary and for the temperature function, of interest in their own *** Codes 80A22, 35B44, 60H30, 35B05 Copyright © 2023, The Authors. All rights reserved.

关键词： Surface tension

来源：评论

学校读者我要写书评

暂无评论

From point patterns to networks: to what extent does the Delaunay triangulation reproduce key spatial and density information?

arXiv

引用

arXiv 2025年

作者： Newby, Eli Shi, Wenlong Jiao, Yang Torquato, Salvatore Albert, Réka Department of Physics Pennsylvania State University University ParkPA16802 United States Department of Cardiovascular and Metabolic Sciences Lerner Research Institute Cleveland Clinic ClevelandOH44195 United States Arizona State University TempeAZ85287 United States Department of Chemistry Princeton University PrincetonNJ08544 United States Department of Physics Princeton University PrincetonNJ08544 United States Princeton Institute of Materials Princeton University PrincetonNJ08544 United States Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States Department of Biology Pennsylvania State University University ParkPA16802 United States

To be used as an analysis tool, it is important that a spatial network’s construction algorithm reproduces the structural properties of the original physical embedding. One method for converting a two-dimensional (2D) point pattern into a spatial network is the Delaunay triangulation. Here, we apply the Delaunay triangulation to seven different types of 2D point patterns, including hyperuniform systems. The latter are characterized by completely suppressed normalized infinite-wavelength density fluctuations. We demonstrate that the quartile coefficients of dispersion of multiple centrality measures are capable of rank-ordering hyperuniform and nonhyperuniform systems independently, but they cannot distinguish a system that is nearly hyperuniform from hyperuniform systems. Thus, in each system, we investigate the local densities of the point pattern ρP (ri;) and of the network ρG(ni;). We reveal that there is a strong correlation between ρP (ri;) and ρG(ni;) in nonhyperuniform systems, but there is no such correlation in hyperuniform systems. When calculating the pair-correlation function and local density covariance function on the point pattern and network, the point pattern and network functions are similar only in nonhyperuniform systems. In hyperuniform systems, the triangulation has a positive covariance of local network densities in pairs of nodes that are close together;such covariance is not present in the point patterns. Thus, we demonstrate that the Delaunay triangulation accurately captures the density fluctuations of the underlying point pattern only when the point pattern possesses a positive correlation between ρP (ri;) for points that are close together. Such positive correlation is seen in most real-world systems, so the Delaunay triangulation is generally an effective tool for building a spatial network from a 2D point pattern, but there are situations (i.e., disordered hyperuniform systems) where we caution that the Delaunay triangulation would not

关键词： Triangulation

来源：评论

学校读者我要写书评

暂无评论

Scaling limits of external multi-particle DLA on the plane and the supercooled stefan problem

arXiv

引用

arXiv 2021年

作者： Nadtochiy, Sergey Shkolnikov, Mykhaylo Zhang, Xiling Department of Applied Mathematics Illinois Institute of Technology ChicagoIL60616 United States ORFE Department Bendheim Center for Finance Program in Applied & Computational Mathematics Princeton University PrincetonNJ08544 United States

We consider (a variant of) the external multi-particle diffusion-limited aggregation (MDLA) process of Rosenstock and Marquardt on the plane. Based on the recent findings of [11], [10] in one space dimension it is natural to conjecture that the scaling limit of the growing aggregate in such a model is given by the growing solid phase in a suitable "probabilistic" formulation of the single-phase supercooled Stefan problem for the heat equation. To address this conjecture, we extend the probabilistic formulation from [10] to multiple space dimensions. We then show that the equation that characterizes the growth rate of the solid phase in the supercooled Stefan problem is satisfied by the scaling limit of the external MDLA process with an inequality, which can be strict in general. In the course of the proof, we establish two additional results interesting in their own right: (i) the stability of a "crossing property" of planar Brownian motion and (ii) a rigorous connection between the probabilistic solutions to the supercooled Stefan problem and its classical and weak *** Codes 82C22, 80A22, 60H30 Copyright © 2021, The Authors. All rights reserved.

关键词： Supercooling

来源：评论

学校读者我要写书评

暂无评论

Convergence acceleration of ensemble Kalman inversion in nonlinear settings

arXiv

引用

arXiv 2019年

作者： Chada, Neil K. Tong, Xin T. Applied Mathematics and Computational Science Program King Abdullah University of Science and Technology Thuwal23955 Saudi Arabia Department of Mathematics National University of Singapore 119077 Singapore

Many data-science problems can be formulated as an inverse problem, where the parameters are estimated by minimizing a proper loss function. When complicated black-box models are involved, derivative-free optimization tools are often needed. The ensemble Kalman filter (EnKF) is a particle-based derivative-free Bayesian algorithm originally designed for data assimilation. Recently, it has been applied to inverse problems for computational efficiency. The resulting algorithm, known as ensemble Kalman inversion (EKI), involves running an ensemble of particles with EnKF update rules so they can converge to a minimizer. In this article, we investigate EKI convergence in general nonlinear settings. To improve convergence speed and stability, we consider applying EKI with non-constant step-sizes and covariance inflation. We prove that EKI can hit critical points with finite steps in non-convex settings. We further prove that EKI converges to the global minimizer polynomially fast if the loss function is strongly convex. We verify the analysis presented with numerical experiments on two inverse problems. Copyright © 2019, The Authors. All rights reserved.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

A Mathematical Model for Linguistic Universals

arXiv

引用

arXiv 2019年

作者： Weinan, E. Zhou, Yajun Department of Mathematics & Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States Beijing Institute of Big Data Research Beijing100871 China

Inspired by chemical kinetics and neurobiology, we propose a mathematical theory for pattern recurrence in text documents, applicable to a wide variety of languages. We present a Markov model at the discourse level for Steven Pinker’s "mentalese", or chains of mental states that transcend the spoken/written forms. Such (potentially) universal temporal structures of textual patterns lead us to a language-independent semantic representation, or a translationally-invariant word embedding, thereby forming the common ground for both comprehensibility within a given language and translatability between different languages. Applying our model to documents of moderate lengths, without relying on external knowledge bases, we reconcile Noam Chomsky’s "poverty of stimulus" paradox with statistical learning of natural languages. Copyright © 2019, The Authors. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube 99

A lower bound on the complexity of approximate nearest-neigh...

引用

Proceedings of the thirty-first annual ACM symposium on Theory of Computing

作者： Amit Chakrabarti Bernard Chazelle Benjamin Gum Alexey Lvov Department of Computer Science Princeton University Department of Computer Science Princeton University and NEC Research Institute Program in Applied and Computational Mathematics Princeton University

来源：评论

学校读者我要写书评

暂无评论

Artificial neural network approach for turbulence models: A local framework

引用

Physical Review Fluids 2021年第8期6卷 084612-084612页

作者： Chenyue Xie Xiangming Xiong Jianchun Wang Program in Applied and Computational Mathematics Princeton University Princeton New Jersey 08544 USA Department of Mechanics and Aerospace Engineering Southern University of Science and Technology Shenzhen 518055 People's Republic of China

A local artificial neural network (LANN) framework is developed for turbulence modeling. The Reynolds-averaged Navier-Stokes (RANS) unclosed terms are reconstructed by the artificial neural network based on the local coordinate system which is orthogonal to the curved walls. We verify the proposed model in the flows over periodic hills. The correlation coefficients of the RANS unclosed terms predicted by the LANN model can be made larger than 0.96 in an a priori analysis, and the relative error of the unclosed terms can be made smaller than 18%. In an a posteriori analysis, detailed comparisons are made on the results of RANS simulations using the LANN, global artificial neural network (GANN), Spalart-Allmaras (SA), and shear stress transport (SST) k−ω models. It is shown that the LANN model performs better than the GANN, SA, and SST k−ω models in the prediction of the average velocity, wall-shear stress, and average pressure, which gives the results that are essentially indistinguishable from the direct numerical simulation data. The LANN model trained at low Reynolds number, Re=2800, can be directly applied to the cases of high Reynolds numbers, Re=5600, 10 595, 19 000, and 37 000, with accurate predictions. Furthermore, the LANN model is verified for flows over periodic hills with varying slopes. These results suggest that the LANN framework has a great potential to be applied to complex turbulent flows with curved walls.

关键词： Compressible boundary layers Turbulence Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Coarse molecular-dynamics determination of the onset of structural transitions: Melting of crystalline solids

引用

Physical Review B 2006年第13期74卷 132201-132201页

作者： Miguel A. Amat Ioannis G. Kevrekidis Dimitrios Maroudas Department of Chemical Engineering University of Massachusetts Amherst Massachusetts 01003 USA Department of Chemical Engineering and Program in Applied and Computational Mathematics Princeton University Princeton New Jersey 08544 USA

Using a coarse molecular-dynamics (CMD) approach with an appropriate choice of coarse variable (order parameter), we map the underlying effective free-energy landscape for the melting of a crystalline solid. Implementation of this approach provides a means for constructing effective free-energy landscapes of structural transitions in condensed matter. The predictions of the approach for the thermodynamic melting point of a model silicon system are in excellent agreement with those of “traditional” techniques for melting-point calculations, as well as with literature values.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：