English
Related papers

Related papers: Hitting time in regular sets and logarithm law for…

200 papers

Applying the time-dependent Ginzburg-Landau equations, transitions between metastable states of a superconducting ring are investigated in the presence of an external magnetic field. It is shown that if the ring exhibits several metastable…

Superconductivity · Physics 2009-11-07 D. Y. Vodolazov , F. M. Peeters

Let $\{(X_t)_{t\geq 0}, \mathbb{P}_{\delta_x}, x\in E\}$ be a supercritical branching Markov process (which is not necessary symmetric) on a locally compact metric measure space $(E,\mu)$ with spatially dependent local branching mechanism.…

Probability · Mathematics 2025-12-12 Haojie Hou , Yan-Xia Ren , Renming Song

Let be $X(t)= x - \mu t + \sigma B_t - N_t$ a L$\acute{\text{e}}$vy process starting from $x >0,$ where $ \mu \ge 0, \ \sigma \ge 0, \ B_t$ is a standard BM, and $N_t$ is a homogeneous Poisson process with intensity $ \theta >0,$ starting…

Probability · Mathematics 2018-03-13 Mario Abundo , Sara Furia

Consider a linear Boltzmann equation posed on the Euclidian plane with a periodic system of circular holes and for particles moving at speed 1. Assuming that the holes are absorbing -- i.e. that particles falling in a hole remain trapped…

Analysis of PDEs · Mathematics 2012-07-26 Etienne Bernard , Emanuele Caglioti , Francois Golse

We study random walks on dynamically evolving graphs, where the environment is given by a time-dependent subset of the edges of an underlying graph. Concretely, following the recently introduced framework of Lelli and Stauffer, we consider…

Probability · Mathematics 2026-05-08 Andreas Galanis , Leslie Ann Goldberg , Xandru Mifsud

The best known lower and upper bounds on the mixing time for the random-to-random insertions shuffle are $(1/2-o(1))n\log n$ and $(2+o(1))n\log n$. A long standing open problem is to prove that the mixing time exhibits a cutoff. In…

Probability · Mathematics 2015-03-19 Eliran Subag

We define a notion of isotropy for discrete set distributions. If $\mu$ is a distribution over subsets $S$ of a ground set $[n]$, we say that $\mu$ is in isotropic position if $P[e \in S]$ is the same for all $e\in [n]$. We design a new…

Data Structures and Algorithms · Computer Science 2020-04-21 Nima Anari , Michał Dereziński

A large number of NP-hard graph problems can be solved in $f(w)n^{O(1)}$ time and space when the input graph is provided together with a tree decomposition of width $w$, in many cases with a modest exponential dependence $f(w)$ on $w$.…

Data Structures and Algorithms · Computer Science 2026-03-26 Stefan Kratsch

An Euler-type framework with equidistant step sizes is proposed for a class of time-changed stochastic differential equations.We establish the strong convergence rate of the standard Euler--Maruyama method under the global Lipschitz…

Numerical Analysis · Mathematics 2026-03-12 Ruchun Zuo

We consider deterministic fast-slow dynamical systems on $\mathbb{R}^m\times Y$ of the form \[ \begin{cases} x_{k+1}^{(n)} = x_k^{(n)} + n^{-1} a(x_k^{(n)}) + n^{-1/\alpha} b(x_k^{(n)}) v(y_k)\;,\quad y_{k+1} = f(y_k)\;, \end{cases} \]…

Dynamical Systems · Mathematics 2020-10-30 Ilya Chevyrev , Peter K. Friz , Alexey Korepanov , Ian Melbourne

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena

In a recent work, Baladi and Demers constructed a measure of maximal entropy for finite horizon dispersing billiard maps and proved that it is unique, mixing and moreover Bernoulli. We show that this measure enjoys natural probabilistic…

Dynamical Systems · Mathematics 2023-12-01 Mark F. Demers , Alexey Korepanov

For a jointly measurable probability-preserving action $\tau:\mathbb{R}^D\curvearrowright (X,\mu)$ and a tuple of polynomial maps $p_i:\mathbb{R}\to \mathbb{R}^D$, $i=1,2,...,k$, the multiple ergodic averages \[ \frac{1}{T}\int_0^T…

Dynamical Systems · Mathematics 2016-07-04 Tim Austin

We discuss the generic definition of the $\tau$ function for the arbitrary Hamiltonian system. The different approaches concerning the deformations of the curves and surfaces are compared. It is shown that the Baker-Akhiezer function for…

High Energy Physics - Theory · Physics 2009-10-31 A. Gorsky

This paper is devoted to studying the averaging principle for stochastic differential equations with slow and fast time-scales, where the drift coefficients satisfy local Lipschitz conditions with respect to the slow and fast variables, and…

Probability · Mathematics 2020-08-19 Wei Liu , Michael Röckner , Xiaobin Sun , Yingchao Xie

Assign to each vertex of the one-dimensional torus i.i.d. weights with a heavy-tail of index $\tau-1>0$. Connect then each couple of vertices with probability roughly proportional to the product of their weights and that decays polynomially…

Probability · Mathematics 2021-11-10 Alessandra Cipriani , Michele Salvi

Subatomic systems were recently introduced to identify the structural principles underpinning the normalization of proofs. "Subatomic" means that we can reformulate logical systems in accordance with two principles. Their atomic formulas…

Logic in Computer Science · Computer Science 2018-04-24 Luca Roversi

We study the mixing time of the Swendsen-Wang dynamics for the ferromagnetic Ising and Potts models on the integer lattice ${\mathbb Z}^d$. This dynamics is a widely used Markov chain that has largely resisted sharp analysis because it is…

Probability · Mathematics 2021-03-25 Antonio Blanca , Pietro Caputo , Daniel Parisi , Alistair Sinclair , Eric Vigoda

Consider a diffusion-free passive scalar $\theta$ being mixed by an incompressible flow $u$ on the torus $\mathbb{T}^d$. Our aim is to study how well this scalar can be mixed under an enstrophy constraint on the advecting velocity field.Our…

Analysis of PDEs · Mathematics 2016-09-09 Gautam Iyer , Alexander Kiselev , Xiaoqian Xu

We present a new class of preconditioned iterative methods for solving linear systems of the form $Ax = b$. Our methods are based on constructing a low-rank Nystr\"om approximation to $A$ using sparse random matrix sketching. This…

Data Structures and Algorithms · Computer Science 2025-04-14 Michał Dereziński , Christopher Musco , Jiaming Yang
‹ Prev 1 4 5 6 7 8 10 Next ›