Related papers: The exploration process of critical Boltzmann plan…

Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…

Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…

A possible mechanism leading to anomalous diffusion is the presence of long-range correlations in time between the displacements of the particles. Fractional Brownian motion, a non-Markovian self-similar Gaussian process with stationary…

We first rephrase and unify known bijections between bipartite plane maps and labelled trees with the formalism of looptrees, which we argue to be both more relevant and technically simpler since the geometry of a looptree is explicitly…

We study the long-term behavior of the iteration of a random map consisting of Lipschitz transformations on a compact metric space, independently and randomly selected according to a fixed probability measure. Such a random map is said to…

We study the simple random walk on the Uniform Infinite Half-Plane Map, which is the local limit of critical Boltzmann planar maps with a large and simple boundary. We prove that the simple random walk is recurrent, and that the resistance…

This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of the map decorated with some dangling half-edges that enable to reconstruct its faces. Our…

Let $\left\{ Z_{n},n=0,1,2,...\right\} $ be a critical branching process in random environment and let $\left\{ S_{n},n=0,1,2,...\right\} $ be its associated random walk. It is known that if the increments of this random walk belong…

We consider an exploration algorithm where at each step, a random number of items become active while related items get explored. Given an initial number of items $N$ growing to infinity and building on a strong homogeneity assumption, we…

We study the random planar map obtained from a critical, finite variance, Galton-Watson plane tree by adding the horizontal connections between successive vertices at each level. This random graph is closely related to the well-known causal…

In this article, we study concave recursions on trees, which appear widely in information theory through algorithms such as belief propagation, and in statistical mechanics through models on tree-like graphs, including the Ising model,…

Consider Bernoulli(1/2) percolation on $\mathbb{Z}^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make…

We consider maps defined on the interior of a normal, closed cone in a real Banach space that are nonexpansive with respect to Thompson's metric. With mild compactness assumptions, we prove that the Krasnoselskii iterates of such maps…

We first establish new local limit estimates for the probability that a nondecreasing integer-valued random walk lies at time $n$ at an arbitrary value, encompassing in particular large deviation regimes. This enables us to derive scaling…

We analyze the statistical properties of a temporal point process driven by a confined fractional Brownian motion. The event count distribution and power spectral density of this non--Markovian point process exhibit power--law scaling. We…

The study of lattice walks restricted to the first quadrant has shed a lot of interest in the past twenty years. In particular, there has been an important effort to classify models of weighted walks with small steps with respect to the…

We study open-closed discrete mappings that satisfy the weighted estimate of the distortion of modulus of families of paths. It is proved that the mappings mentioned above have a continuous extension into the isolated point of the boundary,…

In this paper we explore the features of a graph generated by random walkers with nodes that have evolutionary attractiveness and Boltzmann-like transition probabilities that depend both on the euclidean distance between the nodes and on…

Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…

We use a growth procedure for binary trees due to Luczak and Winkler, a bijection between binary trees and irreducible quadrangulations of the hexagon due to Fusy, Poulalhon and Schaeffer, and the classical angular mapping between…