相关论文: Cutoff for the bidirectional East Process

This article gives sharp estimates for the mixing time of the Burnside process for Sylow $p$-double cosets in the symmetric group $S_n$. This process is a Markov chain on $S_n$ which can be used to uniformly sample Sylow $p$-double cosets.…

We consider the classic problem of scheduling jobs on unrelated machines so as to minimize the weighted sum of completion times. Recently, for a small constant $\varepsilon >0 $, Bansal et al. gave a $(3/2-\varepsilon)$-approximation…

In this paper, we derive explicit sharp two-sided estimates for the Dirichlet heat kernels of a large class of symmetric (but not necessarily rotationally symmetric) L\'evy processes on half spaces for all $t>0$. These L\'evy processes may…

We consider boundary value problems for semilinear hyperbolic systems of the type $$ \partial_tu_j + a_j(x,\la)\partial_xu_j + b_j(x,\la,u) = 0, \; x\in(0,1), \;j=1,\dots,n $$ with smooth coefficient functions $a_j$ and $b_j$ such that…

We consider first-passage percolation on the $d$ dimensional cubic lattice for $d \geq 2$; that is, we assign independently to each edge $e$ a nonnegative random weight $t_e$ with a common distribution and consider the induced random graph…

The existence of a quantum butterfly effect in the form of exponential sensitivity to small perturbations has been under debate for a long time. Lately, this question gained increased interest due to the proposal to probe chaotic dynamics…

In this paper we introduce randomized pivots for the means of short and long memory linear processes. We show that, under the same conditions, these pivots converge in distribution to the same limit as that of their classical non-randomized…

This article establishes the cutoff phenomenon in the Wasserstein distance for systems of nonlinear ordinary differential equations with a unique coercive stable fixed point subject to general additive Markovian noise in the limit of small…

We study graph ordering problems with a min-max objective. A classical problem of this type is cutwidth, where given a graph we want to order its vertices such that the number of edges crossing any point is minimized. We give a $…

This article generalizes the small noise cutoff phenomenon to the strong solutions of the stochastic heat equation and the damped stochastic wave equation over a bounded domain subject to additive and multiplicative Wiener and L\'evy noises…

We present a simple and faster algorithm for computing fair cuts on undirected graphs, a concept introduced in recent work of Li et al. (SODA 2023). Informally, for any parameter $\epsilon>0$, a $(1+\epsilon)$-fair $(s,t)$-cut is an…

In an $r$-uniform hypergraph on $n$ vertices a tight Hamilton cycle consists of $n$ edges such that there exists a cyclic ordering of the vertices where the edges correspond to consecutive segments of $r$ vertices. We provide a first…

We present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time almost linear in $\sqrt{N \beta/{\cal Z}}$ and polynomial in…

A simple third order compact finite element method is proposed for one-dimensional Sturm-Liouville boundary value problems. The key idea is based on the interpolation error estimate, which can be related to the source term. Thus, a simple…

We study the problem of computing the minimum cut in a weighted distributed message-passing networks (the CONGEST model). Let $\lambda$ be the minimum cut, $n$ be the number of nodes in the network, and $D$ be the network diameter. Our…

We investigate the mixing time of the capacity $k$ simple exclusion process (also called the partial exclusion process) of Schultz and Sandow with $m$ particles on a segment of length $N$. We show that the $k$-SEP exhibits cutoff at time…

The paper deals with the asymptotic properties of a random jump process in a high contrast periodic medium in $\mathbb R^d$, $d\geq 1$. We show that if the coordinates of the random jump process in $\mathbb R^d$ are equipped with an extra…

We consider the zero-range process with arbitrary bounded monotone rates on the complete graph, in the regime where the number of sites diverges while the density of particles per site converges. We determine the asymptotics of the mixing…

We study algorithmic and structural aspects of connectivity in hypergraphs. Given a hypergraph $H=(V,E)$ with $n = |V|$, $m = |E|$ and $p = \sum_{e \in E} |e|$ the best known algorithm to compute a global minimum cut in $H$ runs in time…

I describe a subtraction scheme for the next-to-next-to-leading order calculation of single inclusive production at hadron colliders. Such processes include Drell-Yan, W^{+/-}, Z and Higgs Boson production. The key to such a calculation is…