Related papers: Harmonic functions on mated-CRT maps
Benjamini and Schramm (1996) used circle packing to prove that every transient, bounded degree planar graph admits non-constant harmonic functions of finite Dirichlet energy. We refine their result, showing in particular that for every…
In this paper, we provide an application to the random distance-$t$ walk in finite planes and derive asymptotic formulas (as $q \to \infty$) for the probability of return to start point after $\ell$ steps based on the "vertical"…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We provide an explicit algorithm for sampling a uniform simple connected random graph with a given degree sequence. By products of this central result include: (i) continuum scaling limits of uniform simple connected graphs with given…
A detailed study is presented for a large class of uncoupled continuous-time random walks (CTRWs). The master equation is solved for the Mittag-Leffler survival probability. The properly scaled diffusive limit of the master equation is…
We compute a number of distance-dependent universal scaling functions characterizing the distance statistics of large maps of genus one. In particular, we obtain explicitly the probability distribution for the length of the shortest…
In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…
We consider a general discrete-time branching random walk on a countable set X. We relate local, strong local and global survival with suitable inequalities involving the first-moment matrix M of the process. In particular we prove that,…
Most approximation algorithms for #P-complete problems (e.g., evaluating the permanent of a matrix or the volume of a polytope) work by reduction to the problem of approximate sampling from a distribution $\pi$ over a large set $\S$. This…
We study random transformations built from intermittent maps on the unit interval that share a common neutral fixed point. We focus mainly on random selections of Pomeu-Manneville-type maps $T_\alpha$ using the full parameter range $0<…
We investigate the integrability of the discrete non-linear equation governing the dependence on geodesic distance of planar graphs with inner vertices of even valences. This equation follows from a bijection between graphs and blossom…
This work is motivated by the study of some two-dimensional random walks in random environment (RWRE) with transition probabilities independent of one coordinate of the walk. These are non-reversible models and can not be treated by…
A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the…
In the coordinated motion planning problem, we are given a graph together with the starting and destination vertices of $k$ robots. At each time step, any subset of robots may move, each traversing an edge of the graph, provided that no two…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
Random walks including non-nearest-neighbor jumps appear in many real situations such as the diffusion of adatoms and have found numerous applications including PageRank search algorithm, however, related theoretical results are much less…
We study the geometry of infinite random Boltzmann planar maps having weight of polynomial decay of order $k^{-2}$ for each vertex of degree $k$. These correspond to the dual of the discrete "stable maps" of Le Gall and Miermont [Scaling…
The aim of this paper is to represent any continuous local martingale as an almost sure limit of a nested sequence of simple, symmetric random walks, time changed by a discrete quadratic variation process. One basis of this is a similar…
In this work, we explore how conventional motion planning algorithms can be reapplied to contact-rich manipulation tasks. Rather than focusing solely on efficiency, we investigate how manipulation aspects can be recast in terms of…
We extend recent work of Gurel-Gurevich--Jerison--Nachmias (2020) and Bou-Rabee--Gwynne (2024) by showing that as the mesh of our lattice tends to $0$, we have a polynomial rate of convergence for the Dirichlet problem on orthodiagonal maps…