Related papers: Cutoff for the bidirectional East Process
We perform a two-loop calculation in Light Cone Perturbation Theory (LCPT) to evaluate the next-to-leading order nonsinglet splitting function. Our calculation demonstrates the methodology and feasibility of performing higher order…
We study rate-distortion problems of a Poisson process using a group theoretic approach. By describing a realization of a Poisson point process with either point timings or inter-event (inter-point) intervals and by choosing appropriate…
As the gap between compute and I/O performance tends to grow, modern High-Performance Computing (HPC) architectures include a new resource type: an intermediate persistent fast memory layer, called burst buffers. This is just one of many…
We study the mixing time of the averaging process on a large random $d$-regular graph, $d\ge 3$, and prove an $L^2$-cutoff with an explicit cutoff time. Somewhat surprisingly, we uncover a phase transition at the finite, fixed degree…
We study the last-passage growth model on the planar integer lattice with exponential weights. With boundary conditions that represent the equilibrium exclusion process as seen from a particle right after its jump we prove that the variance…
The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our…
We present a detailed calculation of next-to-leading order QCD corrections to the $tW$ associated production using the one cutoff phase space slicing method. Such QCD corrections have been calculated independently by two groups already,…
The characterization of quantum processes is a key tool in quantum information processing tasks for several reasons: on one hand, it allows to acknowledge errors in the implementations of quantum algorithms; on the other, it allows to…
For a broad class of planar Markov processes, viz. L\'evy processes satisfying certain conditions (valid \textit{eg} in the case of Brownian motion and L\'evy flights), we establish an exact, universal formula describing the shape of the…
We consider the reversible exclusion process with reservoirs on arbitrary networks. We characterize the spectral gap, mixing time, and mixing window of the process, in terms of certain simple statistics of the underlying network. Among…
We consider the semi-random graph model of [Makarychev, Makarychev and Vijayaraghavan, STOC'12], where, given a random bipartite graph with $\alpha$ edges and an unknown bipartition $(A, B)$ of the vertex set, an adversary can add arbitrary…
Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\times\chi_q)$ up to any specified precision. In the case when $q$ is…
We present the extension of two general algorithms for the treatment of infrared singularities arising in electroweak corrections to decay processes at next-to-leading order: the dipole subtraction formalism and the one-cutoff slicing…
We resolve the long-standing problem of elucidating the cutoff phenomenon for a vast and important class of Markov processes, namely Markov diffusions with non-negative Bakry-\'Emery curvature. More precisely, we prove that any sequence of…
We study Mandelbrot's percolation process in dimension $d \geq 2$. The process generates random fractal sets by an iterative procedure which starts by dividing the unit cube $[0,1]^d$ in $N^d$ subcubes, and independently retaining or…
We consider the $\mathcal{NP}$-hard problem $\mathrm{P} \mathbf{\vert} \mathrm{pmtn, setup=s_i} \mathbf{\vert} \mathrm{C_{\max}}$, the problem of scheduling $n$ jobs, which are divided into $c$ classes, on $m$ identical parallel machines…
Interval scheduling is a basic problem in the theory of algorithms and a classical task in combinatorial optimization. We develop a set of techniques for partitioning and grouping jobs based on their starting and ending times, that enable…
The fragmentation processes of exchangeable partitions have already been studied by several authors. In this paper, we examine rather fragmentation of exchangeable compositions, that means partitions of $\mathbb{N}$ where the order of the…
We study some fundamental properties, such as the transience, the recurrence, the first passage times and the zero-set of a certain type of sawtooth Markov processes, called extremal shot noise processes. The sets of zeros of the latter are…
Several long-time limit theorems of one-dimensional L\'evy processes weighted and normalized by functions of its supremum are studied. The long-time limits are taken via the families of exponential times and that of constant times, called…