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

We construct a zero-entropy weakly mixing finite-valued process with the exponential limit law for return resp. hitting times. This limit law is obtained in almost every point, taking the limit along the full sequence of cylinders around…

Routing games are amongst the most studied classes of games. Their two most well-known properties are that learning dynamics converge to equilibria and that all equilibria are approximately optimal. In this work, we perform a stress test…

Under very general conditions the hitting time of a set by a stochastic process is a stopping time. We give a new simple proof of this fact. The section theorems for optional and predictable sets are easy corollaries of the proof.

The theory of graphons comes with a natural sampling procedure, which results in an inhomogeneous variant of the Erd\H{o}s--R\'enyi random graph, called $W$-random graphs. We prove, via the method of moments, a limit theorem for the number…

We consider simple random walk on a realization of an Erd\H{o}s-R\'enyi graph that is asymptotically almost surely (a.a.s.) connected. We show a Central Limit Theorem (CLT) for the average starting hitting time, i.e. the expected time it…

Origami is the archetype of a structural material with unusual mechanical properties that arise almost exclusively from the geometry of its constituent folds and forms the basis for mechanical metamaterials with an extreme deformation…

We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential quantum-classical gap in the hitting time of discrete quantum…

Lagrangian motions of fluid particles in a general velocity field oscillating in time are studied with the use of the two-timing method. Our aims are: (i) to calculate systematically the most general and practically usable asymptotic…

We provide conditions that classify cover times for sequences of random walks on random graphs into two types: One type (Type 1) is the class of cover times that are of the order of the maximal hitting times scaled by the logarithm of the…

The main purpose of this paper is to introduce a new class of Hamiltonian scattering systems of the cone potential type that can be integrated via the asymptotic velocity. For a large subclass, the asymptotic data of the trajectories define…

The non-orientable 4-genus of a knot in the 3-sphere is defined as the smallest first Betti number of any non-orientable surface smoothly and properly embedded in the 4-ball, with boundary the given knot. We compute the non-orientable…

For a closed oriented 3-manifold $Y$ we define $n(Y)$ to be the minimal non-negative number such that in each homotopy class of non-singular vector fields of $Y$ there is a Morse-Smale vector field with less or equal to $n(Y)$ periodic…

Sinai chaos is characterized by exponential divergence between neighboring trajectories of a point billiard. If the repulsive potential of the finite-diameter fixed particle in the middle of the table is made smooth, the Sinai divergence…

This note gives an exponential tail approximation for the extinction time of a subcritical multitype branching process arising from the SIR epidemic model on a random graph with given degrees, where the type corresponds to the vertex…

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. Hitting times for discrete quantum walks on graphs give an average time before the walk…

Stability and diversity are two key properties that living entities share with spin glasses, where they are manifested through the breaking of the phase space into many valleys or local minima connected by saddle points. The topology of the…

Surfaces admitting flows all whose orbits are dense are called minimal. Minimal orientable surfaces were characterized by J.C. Beni\`{e}re in 1998, leaving open the nonorientable case. This paper fills this gap providing a characterization…

We propose a consistent analytic approach to the efficiency of collisional Penrose process in the vicinity of a maximally rotating Kerr black hole. We focus on a collision with arbitrarily high center-of-mass energy, which occurs if either…

Considering a critical branching random walk on the real line. In a recent paper, Aidekon [3] developed a powerful method to obtain the convergence in law of its minimum after a log-factor normalization. By an adaptation of this method, we…

We give an iterative algorithm for finding the maximum flow between a set of sources and sinks that lie on the boundary of a planar graph. Our algorithm uses only O(n) queries to simple data structures, achieving an O(n log n) running time…