相关论文: Exact Computations in the Burgers Problem
Burgers' equation is a well-studied model in applied mathematics with connections to the Navier-Stokes equations in one spatial direction and traffic flow, for example. Following on from previous work, we analyse solutions to Burgers'…
We propose the new method for finding the non-Gaussian tails of probability distribution function (PDF) for solutions of a stochastic differential equation, such as convection equation for a passive scalar, random driven Navier-Stokes…
A two-dimensional cellular automaton(CA) associated with a two-dimensional Burgers equation is presented. The 2D Burgers equation is an integrable generalization of the well-known Burgers equation, and is transformed into a 2D diffusion…
It is known that the distribution of nonreversible Markov processes breaking the detailed balance condition converges faster to the stationary distribution compared to reversible processes having the same stationary distribution. This is…
The feasibility of extrapolation of completely monotone functions can be quantified by examining the worst case scenario, whereby a pair of completely monotone functions agree on a given interval to a given relative precision, but differ as…
In this paper, we study the strong and weak convergence rates for multi-scale one-dimensional stochastic Burgers equation. Based on the techniques of Galerkin approximation, Kolmogorov equation and Poisson equation, we obtain the slow…
We consider the problem of approximating two, possibly unrelated probability distributions from a single complex-valued function $\psi$ and its Fourier transform. We show that this problem always has a solution within a specified degree of…
We consider the motion of an active Brownian particle with speed fluctuations in d-dimensions in the presence of both translational and orientational diffusion. We use an Ornstein-Uhlenbeck process for active speed generation. Using a…
We present a new approach to determine the small-scale statistical behavior of hydrodynamic turbulence by means of lattice simulations. Using the functional integral representation of the random-force-driven Burgers equation we show that…
This paper deals with the problem of analytically computing the largest Lyapunov exponent for many degrees of freedom Hamiltonian systems. This aim is succesfully reached within a theoretical framework that makes use of a geometrization of…
The randomly driven Burgers equation with pressure is considered as a 1D model of strong turbulence of compressible fluid. It is shown that infinitely small pressure provides a finite effect on the velocity and density statistics and this…
The Pandora's Box problem and its extensions capture optimization problems with stochastic input where the algorithm can obtain instantiations of input random variables at some cost. To our knowledge, all previous work on this class of…
We analyze stochastic partial differential equations (SPDEs) with quadratic nonlinearities close to a change of stability. To this aim we compute finite-time Lyapunov exponents (FTLEs), observing a change of sign based on the interplay…
We develop a new method to uniquely solve a large class of heat equations, so-called Kolmogorov equations in infinitely many variables. The equations are analyzed in spaces of sequentially weakly continuous functions weighted by proper…
Products of random $2\times 2$ matrices exhibit Gaussian fluctuations around almost surely convergent Lyapunov exponents. In this paper, the distribution of the random matrices is supported by a small neighborhood of order $\lambda>0$ of…
We examine fluctuations of vorticity excited by an external random force in two-dimensional fluid in the presence of a strong external shear flow. The problem is motivated by the analysis of big coherent vortices appearing as a consequence…
We present an exact method for calculating the large deviation function describing rare fluctuations in the number of particles for product-kernel aggregation. Starting from the master equation, we derive an exact integral representation…
We study the computational complexity of finding a solution for the straight-cut and square-cut pizza sharing problems. We show that computing an $\varepsilon$-approximate solution is PPA-complete for both problems, while finding an exact…
A rigorous study is carried out for the randomly forced Burgers equation in the inviscid limit. No closure approximations are made. Instead the probability density functions of velocity and velocity gradient are related to the statistics of…
We consider a class of nearest-neighbor weakly asymmetric mass conservative particle systems evolving on $\mathbb{Z}$, which includes zero-range and types of exclusion processes, starting from a perturbation of a stationary state. When the…