相关论文: A genus 4 origami with minimal hitting time and an…

We consider a family of branching-selection particle systems in which particles branch at time dependent rate $r$ and are killed with a probability which is dependent on their rank via some function $\psi$. We show that, under fairly…

We continue our study of the fractal structure of escape-time plots for chaotic maps. In the preceding paper, we showed that the escape-time plot contains regular sequences of successive escape segments, called epistrophes, which converge…

In the problem of minimum connected dominating set with routing cost constraint, we are given a graph $G=(V,E)$, and the goal is to find the smallest connected dominating set $D$ of $G$ such that, for any two non-adjacent vertices $u$ and…

We study quantitative asymptotics of planar random walks that are spatially non-homogeneous but whose mean drifts have some regularity. Specifically, we study the first exit time $\tau_\alpha$ from a wedge with apex at the origin and…

Consider a smooth $4$-manifold $X$ and a diffeomorphism $f : X \to X$. We give an obstruction in the form of an adjunction inequality for an embedded surface in $X$ to be isotopic to its image under $f$. It follows that the minimal genus of…

In a lens space X of order r a knot K representing an element of the fundamental group pi_1 X = Z/rZ of order s <= r contains a connected orientable surface S properly embedded in its exterior X-N(K) such that the boundary of S intersects…

We consider a discrete-time process adapted to some filtration which lives on a (typically countable) subset of $\mathbb{R}^d$, $d\geq 2$. For this process, we assume that it has uniformly bounded jumps, is uniformly elliptic (can advance…

The present paper establishes upper and lower bounds on the speed of approximation in a wide range of natural Diophantine approximation problems. The upper and lower bounds coincide in many cases, giving rise to optimal results in…

A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain…

The low-energy theory of electrons interacting via repulsive short-range interactions on graphene's honeycomb lattice at half filling is presented. The exact symmetry of the Lagrangian with local quartic terms for the Dirac field dictated…

We consider the typical distance between vertices of the giant component of a random intersection graph having a power law (asymptotic) vertex degree distribution with infinite second moment. Given two vertices from the giant component we…

In this paper, we study the problem of finding an integral multiflow which maximizes the sum of flow values between every two terminals in an undirected tree with a nonnegative integer edge capacity and a set of terminals. In general, it is…

We study the optimal stopping of an American call option in a random time-horizon under exponential spectrally negative L\'evy models. The random time-horizon is modeled as the so-called Omega default clock in insurance, which is the first…

We study square loss in a realizable time-series framework with martingale difference noise. Our main result is a fast rate excess risk bound which shows that whenever a trajectory hypercontractivity condition holds, the risk of the…

It is known that w.h.p. the hitting time $\tau_{2\sigma}$ for the random graph process to have minimum degree $2\sigma$ coincides with the hitting time for $\sigma$ edge disjoint Hamilton cycles. In this paper we prove an online version of…

This work addresses potential theoretic questions for the standard nearest neighbor random walk on the hypercube $\{-1,+1\}^N$. For a large class of subsets $A\subset\{-1,+1\}^N$ we give precise estimates for the harmonic measure of $A$,…

In this paper we study the distribution of hitting times for a class of random dynamical systems. We prove that for invariant measures with super-polynomial decay of correlations hitting times to dynamically defined cylinders satisfy…

The famous pancake theorem states that for every finite set $X$ in the plane, there exist two orthogonal lines that divide $X$ into four equal parts. We propose an algorithm whose running time is linear in the number of points in $X$ and…

We consider the long time behavior of heterogeneously interacting diffusive particle systems and their large population limit. The interaction is of mean field type with weights characterized by an underlying graphon. The limit is given by…

Using the circle method in combination with lattice point counting arguments, we show that for almost all homogeneous diophantine equations of additive type and degree $k$ in more than $4k$ variables, the Local-Global principle holds true.…