Related papers: Markovian explorations of random planar maps are r…
Simplified representations of macromolecules help in rationalising and understanding the outcome of atomistic simulations, and serve to the construction of effective, coarse-grained models. The number and distribution of coarse-grained…
We initiate the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of $\tilde{O}(\sqrt{n})$ for graphs on $n$ vertices. The constant-time…
In classical reinforcement learning, when exploring an environment, agents accept arbitrary short term loss for long term gain. This is infeasible for safety critical applications, such as robotics, where even a single unsafe action may…
For a class of flows on polytopes, including many examples from Evolutionary Game Theory, we describe a piecewise linear model which encapsulates the asymptotic dynamics along the heteroclinic network formed out of the polytope's vertexes…
Forward iteration of holomorphic self-maps generalizes the iteration of a single function in a natural way. This framework arises in complex dynamics, for instance in the study of wandering domains and in seeking suitable extensions of the…
This is a significantly expanded version of the survey paper "Mixing and decay of correlations in non-uniformly expanding maps: a survey of recent results" math/0301319. We discuss recent results on decay of correlations for non-uniformly…
A self-similar growth-fragmentation describes the evolution of particles that grow and split as time passes. Its genealogy yields a self-similar continuum tree endowed with an intrinsic measure. Extending results of Haas for pure…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
The classical method for deriving the macroscopic dynamics of a lattice Boltzmann system is to use a combination of different approximations and expansions. Usually a Chapman-Enskog analysis is performed, either on the continuous Boltzmann…
We investigate a piecewise-deterministic Markov process, evolving on a Polish metric space, whose deterministic behaviour between random jumps is governed by some semi-flow, and any state right after the jump is attained by a randomly…
SPM (Sand Pile Model) is a simple discrete dynamical system used in physics to represent granular objects. It is deeply related to integer partitions, and many other combinatorics problems, such as tilings or rewriting systems. The…
Pursuing the approach of Angel & Ray, we introduce and study a family of random infinite triangulations of the full-plane that satisfy a natural spatial Markov property. These new random lattices naturally generalize Angel & Schramm's…
We consider a Markovian growth process on a partially ordered set $\Lambda$, equivalent to last passage percolation (LPP) with independent (not necessarily identical) exponentially distributed weights on the elements of $\Lambda$. Such a…
We describe a novel algorithm for rounding packing integer programs based on multidimensional Brownian motion in $\mathbb{R}^n$. Starting from an optimal fractional feasible solution $\bar{x}$, the procedure converges in polynomial time to…
We discuss uniform sampling algorithms that are based on stochastic growth methods, using sampling of extreme configurations of polymers in simple lattice models as a motivation. We shall show how a series of clever enhancements to a…
This work deals with planar dynamical systems with and without noise. In the first part, we seek to gain a refined understanding of such systems by studying their differential-geometric transformation properties under an arbitrary smooth…
Within the study of uncertain dynamical systems, iterated random functions are a key tool. There, one samples a family of functions according to a stationary distribution. Here, we introduce an extension, where one sample functions…
Folding is emerging as a promising manufacturing process to transform flat materials into functional structures, offering efficiency by reducing the need for welding, gluing, and molding, while minimizing waste and enabling automation.…
We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm…
We consider a class of piecewise hyperbolic maps from the unit square to itself preserving a contracting foliation and inducing a piecewise expanding quotient map, with infinite derivative (like the first return maps of Lorenz like flows).…