Related papers: Excursion Processes Associated with Elliptic Combi…

We investigate Newton's method applied to any odd or any even elliptic function with an arbitrary period lattice. For any function of this type whose set of poles coincides with its period lattice, we show that the Julia set of its Newton…

Let $q \ge 3$ be a period. There are at least two $(1,q)$-periodic trajectories inside any smooth strictly convex billiard table, and all of them have the same length when the table is an ellipse or a circle. We quantify the chaotic…

Lorentz lattice gases (LLGs) are discrete-time transport models in which a point particle moves ballistically between lattice sites and is scattered by randomly placed, quenched local scatterers such as ``rotators'' or ``mirrors.'' Despite…

In this paper, we consider the composition of two independent processes : one process corresponds to position and the other one to time. Such processes will be called iterated processes. We first propose an algorithm based on the Euler…

Enumeration of walks with small steps in the quadrant has been a topic of great interest in combinatorics over the last few years. In this article, it is shown how to compute exact asymptotics of the number of such walks with fixed start-…

A non-equilibrium particle transport model, the totally asymmetric exclusion process, is studied on a one-dimensional lattice with a hierarchy of fixed long-range connections. This model breaks the particle-hole symmetry observed on an…

We propose elliptical graphical models based on conditional uncorrelatedness as a general- ization of Gaussian graphical models by letting the population distribution be elliptical instead of normal, allowing the fitting of data with…

Minimizing the weight of an edge set satisfying parity constraints is a challenging branch of combinatorial optimization as witnessed by the binary hypergraph chapter of Alexander Schrijver's book ``Combinatorial Optimization" (Chapter 80).…

Let $\{(X(t), Y(s)): t\in T, s\in S\}$ be an $\mathbb{R}^2$-valued, centered, unit-variance smooth Gaussian vector field, where $T$ and $S$ are compact rectangles in $\mathbb{R}^N$. It is shown that, as $u\to \infty$, the joint excursion…

Let $X= \{X(p), p\in M\}$ be a centered Gaussian random field, where $M$ is a smooth Riemannian manifold. For a suitable compact subset $D\subset M$, we obtain the approximations to excursion probability $\mathbb{P}\{\sup_{p\in D} X(p) \ge…

We establish weak limits for the empirical entropy regularized optimal transport cost, the expectation of the empirical plan and the conditional expectation. Our results require only uniform boundedness of the cost function and no…

This paper is concerned with the limit laws of the extreme order statistics derived from a symmetric Laplace walk. We provide two different descriptions of the point process of the limiting extreme order statistics: a branching…

We study combinatorics of billiard partitions which arose recently in the description of periodic trajectories of ellipsoidal billiards in d-dimensional Euclidean and pseudo-Euclidean spaces. Such partitions uniquely codify the sets of…

We present a fast combinatorial $3/4$-approximation algorithm for the maximum asymmetric TSP with weights zero and one. The approximation factor of this algorithm matches the currently best one given by Bl\"aser in 2004 and based on linear…

This paper presents a topological framework for investigating the Birch and Swinnerton Dyer conjecture through four dimensional embeddings of elliptic curves. We propose a correspondence between the algebraic rank of an elliptic curve and…

We obtain new results concerning Lang-Trotter conjecture on Frobenius traces and Frobenius fields over single and double parametric families of elliptic curves. We also obtain similar results with respect to the Sato-Tate conjecture. In…

We study a non-Markovian random walk in dimension 1. It depends on two parameters eps_r and eps_l, the probabilities to go straight on when walking to the right, respectively to the left. The position x of the walk after n steps and the…

Elliptically symmetric distributions are widely used in portfolio modeling, as well as in signal processing applications for modeling impulsive background noises. Of particular interest are algorithms for covariance estimation and subspace…

Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…

We consider coherent exciton transport modeled by continuous-time quantum walks (CTQWs) on long-range interacting cycles (LRICs), which are constructed by connecting all the two nodes of distance $m$ in the cycle graph. LRIC has a symmetric…