SearcharxivSearch

arXiv subjects

James Nolen

Publications and source records attributed to James Nolen.

At least 19 recordsLinked to original sources

On spectral interference of the short-time Fourier transform and its nonlinear variations

Spectral interference, the frequency counterpart of the beating phenomenon in the time domain, can severely distort time-frequency representations (TFRs) in physical applications. We study this phenomenon for the short-time Fourier transform (STFT) with a Gaussian window and for nonlinear refinements based on the reassignment method, with an emphasis on the synchrosqueezing transform (SST). Working with a two-component harmonic model, we quantify when STFT can (and cannot) resolve two nearby frequencies: a sharp transition occurs at a critical gap that scales inversely to kernel bandwidth and depends explicitly on the amplitude ratio. Below this threshold, the spectrogram ridges undergo bifurcation and form repeating time-frequency bubbles, which we describe asymptotically and, in the balanced-amplitude case, approximate closely by ellipses. We then analyze the STFT phase, showing a canonical winding behavior, and relate the complex-valued SST reassignment map to a holomorphic structure via the Bargmann transform. In the two-component setting the reassignment rule admits an explicit Mobius-geometry description, sending frequency lines to circular arcs in the complex plane. Finally, viewing SST and reassignment through a measure mapping perspective, we derive small-kernel asymptotics that explain when reassignment sharpens energy and when it produces distorted or misleading TFRs; we also introduce a generalized synchrosqueezing framework that isolates the role of STFT weighting and clarifies how alternative choices can mitigate interference in certain regimes.

math.CA

Residual Diffusivity for Expanding Bernoulli Maps

Consider a discrete time Markov process $X^ε$ on $\mathbf R^d$ that makes a deterministic jump based on its current location, and then takes a small Gaussian step of variance $ε^2$. We study the behavior of the asymptotic variance as $ε\to 0$. In some situations (for instance if there were no jumps), then the asymptotic variance vanishes as $ε\to 0$. When the jumps are "chaotic", however, the asymptotic variance may be bounded from above and bounded away from $0$, as $ε\to 0$. This phenomenon is known as residual diffusivity, and we prove this occurs when the jumps are determined by certain expanding Bernoulli maps.

math.PR

Residual Diffusivity for Noisy Bernoulli Maps

Consider a discrete time Markov process $X^\varepsilon$ on $\mathbb R^d$ that makes a deterministic jump prescribed by a map $φ\colon \mathbb R^d \to \mathbb R^d$, and then takes a small Gaussian step of variance $\varepsilon^2$. For certain chaotic maps $φ$, the effective diffusivity of $X^\varepsilon$ may be bounded away from $0$ as $\varepsilon \to 0$. This is known as residual diffusivity, and in this paper we prove residual diffusivity occurs for a class of maps $φ$ obtained from piecewise affine expanding Bernoulli maps.

math.DS

Using Bernoulli maps to accelerate mixing of a random walk on the torus

We study the mixing time of a random walk on the torus, alternated with a Lebesgue measure preserving Bernoulli map. Without the Bernoulli map, the mixing time of the random walk alone is $O(1/ε^2)$, where $ε$ is the step size. Our main results show that for a class of Bernoulli maps, when the random walk is alternated with the Bernoulli map $φ$ the mixing time becomes $O(|\ln ε|)$. We also study the \emph{dissipation time} of this process, and obtain $O(|\ln ε|)$ upper and lower bounds with explicit constants.

math.PR

The Fleming-Viot Process with McKean-Vlasov Dynamics

The Fleming-Viot particle system consists of $N$ identical particles diffusing in a domain $U \subset \mathbb{R}^d$. Whenever a particle hits the boundary $\partial U$, that particle jumps onto another particle in the interior. It is known that this system provides a particle representation for both the Quasi-Stationary Distribution (QSD) and the distribution conditioned on survival for a given diffusion killed at the boundary of its domain. We extend these results to the case of McKean-Vlasov dynamics. We prove that the law conditioned on survival of a given McKean-Vlasov process killed on the boundary of its domain may be obtained from the hydrodynamic limit of the corresponding Fleming-Viot particle system. We then show that if the target killed McKean-Vlasov process converges to a QSD as $t \rightarrow \infty$, such a QSD may be obtained from the stationary distributions of the corresponding $N$-particle Fleming-Viot system as $N\rightarrow\infty$.

math.PR

Brownian bees in the infinite swarm limit

The Brownian bees model is a branching particle system with spatial selection. It is a system of $N$ particles which move as independent Brownian motions in $\mathbb{R}^d$ and independently branch at rate 1, and, crucially, at each branching event, the particle which is the furthest away from the origin is removed to keep the population size constant. In the present work we prove that as $N \to \infty$ the behaviour of the particle system is well approximated by the solution of a free boundary problem (which is the subject of a companion paper), the hydrodynamic limit of the system. We then show that for this model the so-called selection principle holds, i.e. that as $N \to \infty$ the equilibrium density of the particle system converges to the steady state solution of the free boundary problem.

math.PR

A free boundary problem arising from branching Brownian motion with selection

We study a free boundary problem for a parabolic partial differential equation in which the solution is coupled to the moving boundary through an integral constraint. The problem arises as the hydrodynamic limit of an interacting particle system involving branching Brownian motion with selection, the so-called Brownian bees model which is studied in a companion paper. In this paper we prove existence and uniqueness of the solution to the free boundary problem, and we characterise the behaviour of the solution in the large time limit.

math.AP

Asymptotic behavior of branching diffusion processes in periodic media

We study the asymptotic behavior of branching diffusion processes in periodic media. For a super-critical branching process, we distinguish two types of behavior for the normalized number of particles in a bounded domain, depending on the distance of the domain from the region where the bulk of the particles is located. At distances that grow linearly in time, we observe intermittency (i.e., the $k$-th moment dominates the $k$-th power of the first moment for some $k$), while, at distances that grow sub-linearly in time, we show that all the moments converge. A key ingredient in our analysis is a sharp estimate of the transition kernel for the branching process, valid up to linear in time distances from the location of the initial particle.

math.PR

Quantitative Propagation of Chaos in the bimolecular chemical reaction-diffusion model

We study a stochastic system of $N$ interacting particles which models bimolecular chemical reaction-diffusion. In this model, each particle $i$ carries two attributes: the spatial location $X_t^i\in \mathbb{T}^d$, and the type $Ξ_t^i\in \{1,\cdots,n\}$. While $X_t^i$ is a standard (independent) diffusion process, the evolution of the type $Ξ_t^i$ is described by pairwise interactions between different particles under a series of chemical reactions described by a chemical reaction network. We prove that in the large particle limit the stochastic dynamics converges to a mean field limit which is described by a nonlocal reaction-diffusion partial differential equation. In particular, we obtain a quantitative propagation of chaos result for the interacting particle system. Our proof is based on the relative entropy method used recently by Jabin and Wang \cite{JW18}. The key ingredient of the relative entropy method is a large deviation estimate for a special partition function, which was proved previously by technical combinatorial estimates. We give a simple probabilistic proof based on a novel martingale argument.

math.AP

Anomalous diffusion in comb-shaped domains and graphs

In this paper we study the asymptotic behavior of Brownian motion in both comb-shaped planar domains, and comb-shaped graphs. We show convergence to a limiting process when both the spacing between the teeth \emph{and} the width of the teeth vanish at the same rate. The limiting process exhibits an anomalous diffusive behavior and can be described as a Brownian motion time-changed by the local time of an independent sticky Brownian motion. In the two dimensional setting the main technical step is an oscillation estimate for a Neumann problem, which we prove here using a probabilistic argument. In the one dimensional setting we provide both a direct SDE proof, and a proof using the trapped Brownian motion framework in Ben Arous \etal (Ann.\ Probab.\ '15).

math.PR

Accelerating Langevin Sampling with Birth-death

A fundamental problem in Bayesian inference and statistical machine learning is to efficiently sample from multimodal distributions. Due to metastability, multimodal distributions are difficult to sample using standard Markov chain Monte Carlo methods. We propose a new sampling algorithm based on a birth-death mechanism to accelerate the mixing of Langevin diffusion. Our algorithm is motivated by its mean field partial differential equation (PDE), which is a Fokker-Planck equation supplemented by a nonlocal birth-death term. This PDE can be viewed as a gradient flow of the Kullback-Leibler divergence with respect to the Wasserstein-Fisher-Rao metric. We prove that under some assumptions the asymptotic convergence rate of the nonlocal PDE is independent of the potential barrier, in contrast to the exponential dependence in the case of the Langevin diffusion. We illustrate the efficiency of the birth-death accelerated Langevin method through several analytical examples and numerical experiments.

stat.ML

Scaling limit of the Stein variational gradient descent: the mean field regime

We study an interacting particle system in $\mathbf{R}^d$ motivated by Stein variational gradient descent [Q. Liu and D. Wang, NIPS 2016], a deterministic algorithm for sampling from a given probability density with unknown normalization. We prove that in the large particle limit the empirical measure of the particle system converges to a solution of a non-local and nonlinear PDE. We also prove global existence, uniqueness and regularity of the solution to the limiting PDE. Finally, we prove that the solution to the PDE converges to the unique invariant solution in long time limit.

math.AP

Block size in Geometric(p)-biased permutations

Fix a probability distribution $\mathbf p = (p_1, p_2, \cdots)$ on the positive integers. The first block in a $\mathbf p$-biased permutation can be visualized in terms of raindrops that land at each positive integer $j$ with probability $p_j$. It is the first point $K$ so that all sites in $[1,K]$ are wet and all sites in $(K,\infty)$ are dry. For the geometric distribution $p_j= p(1-p)^{j-1}$ we show that $p \log K$ converges in probability to an explicit constant as $p$ tends to 0. Additionally, we prove that if $\mathbf p$ has a stretch exponential distribution, then $K$ is infinite with positive probability.

math.PR

Refined long time asymptotics for Fisher-KPP fronts

We study the one-dimensional Fisher-KPP equation, with an initial condition $u_0(x)$ that coincides with the step function except on a compact set. A well-known result of M. Bramson states that, as $t\to+\infty$, the solution converges to a traveling wave located at the position $X(t)=2t-(3/2)\log t+x_0+o(1)$, with the shift $x_0$ that depends on $u_0$. U. Ebert and W. Van Saarloos have formally derived a correction to the Bramson shift, arguing that $X(t)=2t-(3/2)\log t+x_0-3\sqrtπ/\sqrt{t}+O(1/t)$. Here, we prove that this result does hold, with an error term of the size $O(1/t^{1-γ})$, for any $γ>0$. The interesting aspect of this asymptotics is that the coefficient in front of the $1/\sqrt{t}$-term does not depend on $u_0$.

math.AP

Convergence to a single wave in the Fisher-KPP equation

We study the large time asymptotics of a solution of the Fisher-KPP reaction-diffusion equation, with an initial condition that is a compact perturbation of a step function. A well-known result of Bramson states that, in the reference frame moving as $2t - ({3}/{2}) \log t +x_\infty$, the solution of the equation converges as $t\to+\infty$ to a translate of the traveling wave corresponding to the minimal speed~$c_*=2$. The constant $x_\infty$ depends on the initial condition $u(0,x)$. The proof is elaborate, and based on probabilistic arguments. The purpose of this paper is to provide a simple proof based on PDE arguments.

math.AP

Sticky central limit theorems at isolated hyperbolic planar singularities

We derive the limiting distribution of the barycenter $b_n$ of an i.i.d. sample of $n$ random points on a planar cone with angular spread larger than $2π$. There are three mutually exclusive possibilities: (i) (fully sticky case) after a finite random time the barycenter is almost surely at the origin; (ii) (partly sticky case) the limiting distribution of $\sqrt{n} b_n$ comprises a point mass at the origin, an open sector of a Gaussian, and the projection of a Gaussian to the sector's bounding rays; or (iii) (nonsticky case) the barycenter stays away from the origin and the renormalized fluctuations have a fully supported limit distribution---usually Gaussian but not always. We conclude with an alternative, topological definition of stickiness that generalizes readily to measures on general metric spaces.

math.PR

Scaling limit of the corrector in stochastic homogenization

In the homogenization of divergence-form equations with random coefficients, a central role is played by the corrector. We focus on a discrete space setting and on dimension 3 and more. Completing the argument started in previous work, we identify the scaling limit of the corrector, which is akin to a Gaussian free field.

math.AP

A quantitative central limit theorem for the effective conductance on the discrete torus

We study a random conductance problem on a $d$-dimensional discrete torus of size $L > 0$. The conductances are independent, identically distributed random variables uniformly bounded from above and below by positive constants. The effective conductance $A_L$ of the network is a random variable, depending on $L$, and the main result is a quantitative central limit theorem for this quantity as $L \to \infty$. In terms of scalings we prove that this nonlinear nonlocal function $A_L$ essentially behaves as if it were a simple spatial average of the conductances (up to logarithmic corrections). The main achievement of this contribution is the precise asymptotic description of the variance of $A_L$.

math.PR