Related papers: The exploration process of critical Boltzmann plan…
In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced…
We investigate network exploration by random walks defined via stationary and adaptive transition probabilities on large graphs. We derive an exact formula valid for arbitrary graphs and arbitrary walks with stationary transition…
Conditional restricted Boltzmann machines are undirected stochastic neural networks with a layer of input and output units connected bipartitely to a layer of hidden units. These networks define models of conditional probability…
We study the random loop model with crosses and bars on sparse random graphs. Our main objective is to prove the existence of macroscopic loops, in the sense that a loop visits a positive proportion of the vertices. We develop a…
Maps are polygonal cellular networks on Riemann surfaces. This paper analyzes the construction of closed form general representations for the enumerative generating functions associated to maps of fixed but arbitrary genus. The method of…
We study the limit fluctuations of the rescaled occupation time process of a branching particle system in $\mathbb{R}^d$, where the particles are subject to symmetric $\alpha$-stable migration ($0<\alpha\leq2$), critical binary branching,…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
We study the $\beta$ analogue of the nonintersecting Poisson random walks. We derive a stochastic differential equation of the Stieltjes transform of the empirical measure process, which can be viewed as a dynamical version of the…
Takens constructed a residual subset of the state space consisting of initial points with historic behaviour for expanding maps on the circle. We prove that this statistical property of expanding maps on the circle is preserved under small…
We study the boundary effects in invasion percolation with and without trapping. We find that the presence of boundaries introduces a new set of surface critical exponents, as in the case of standard percolation. Numerical simulations show…
As a follow-up of previous work of the authors, we analyse the statistical mechanics model of random spanning forests on random planar graphs. Special emphasis is given to the analysis of the critical behaviour. Exploiting an exact relation…
Let $M_n$ be a simple triangulation of the sphere $S^2$, drawn uniformly at random from all such triangulations with n vertices. Endow $M_n$ with the uniform probability measure on its vertices. After rescaling graph distance on $V(M_n)$ by…
In this paper, we establish a coupling lemma for standard families in the setting of piecewise expanding interval maps with countably many branches. Our method merely requires that the expanding map satisfies Chernov's one-step expansion at…
We study the shape of the outer envelope of a branching Brownian motion (BBM) in $\mathbb{R}^d$, $d\geq 2$. We focus on the extremal particles: those whose norm is within $O(1)$ of the maximal norm amongst the particles alive at time $t$.…
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 a continuous time random walk on the rooted binary tree of depth $n$ with all transition rates equal to one and study its cover time, namely the time until all vertices of the tree have been visited. We prove that, normalized by…
Researching elliptic analogues for equalities and formulas is a new trend in enumerative combinatorics which has followed the previous trend of studying $q$-analogues. Recently Schlosser proposed a lattice path model in the square lattice…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
We characterize all translation invariant half planar maps satisfying a certain natural domain Markov property. For p-angulations with p \ge 3 where all faces are simple, we show that these form a one-parameter family of measures…
The truncated plurigaussian model is often used to simulate the spatial distribution of random categorical variables such as geological facies. The problems addressed in this paper are the estimation of parameters of the truncation map for…