Related papers: Random Planar Lattices and Integrated SuperBrownia…
In a random linear graph, vertices are points on a line, and pairs of vertices are connected, independently, with a link probability that decreases with distance. We study the problem of reconstructing the linear embedding from the graph,…
We define a search problem on trees that closely captures the backtracking behavior of all current practical graph isomorphism algorithms. Given two trees with colored leaves, the goal is to find two leaves of matching color, one in each of…
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…
We consider a variant of the radial spanning tree introduced by Baccelli and Bordenave. Like the original model, our model is a tree rooted at the origin, built on the realization of a planar Poisson point process. Unlike it, the paths of…
We define two families of Poissonian soups of bidirectional trajectories on $\mathbb{Z}^2$, which can be seen to adequately describe the local picture of the trace left by a random walk on the two-dimensional torus $(\mathbb{Z}/N…
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we study the convergence of random tree sequences with given…
We present a modified Brownian motion model for random matrices where the eigenvalues (or levels) of a random matrix evolve in "time" in such a way that they never cross each other's path. Also, owing to the exact integrability of the level…
We study Bernoulli percolations on random lattices of the half-plane obtained as local limit of uniform planar triangulations or quadrangulations. Using the characteristic spatial Markov property or peeling process of these random lattices…
We construct a coupling between two seemingly very different constructions of the standard additive coalescent, which describes the evolution of masses merging pairwise at rates proportional to their sums. The first construction, due to…
We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…
Random walks are a series of up, down, and level steps that enumerate distinct paths from $(0,0)$ to $(2n,0)$, where $n$ is the semi-length of the path. We used these paths to analyze Catalan, Schr\"{o}der, and Motzkin number sequences…
We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…
This paper describes joint work with Oded Schramm and Wendelin Werner establishing the values of the planar Brownian intersection exponents from which one derives the Hausdorff dimension of certain exceptional sets of planar Brownian…
The object of the present investigation is an ensemble of self-avoiding and directed graphs belonging to eight-branching Cayley tree (Bethe lattice) generated by the Fucsian group of a Riemann surface of genus two and embedded in the…
We study geodesics in the random metric space called the Brownian map, which appears as the scaling limit of large planar maps. In particular, we completely describe geodesics starting from the distinguished point called the root, and we…
A book embedding of a complete graph is a spatial embedding whose planar projection has the vertices located along a circle, consecutive vertices are connected by arcs of the circle, and the projections of the remaining "interior" edges in…
We investigate a class of line ensembles whose local structure is described by independent geometric random walk bridges, which have been conditioned to interlace with each other. The latter arise naturally in the context Schur processes,…
Rapidly Exploring Random Trees (RRT) is one of the most widely used algorithms for motion planning in the field of robotics. To reduce the exploration time, RRT-Connect was introduced where two trees are simultaneously formed and eventually…
The probability distribution of the closest neighbor and farther neighbor spacings from a given level have been studied for interacting fermion/boson systems with and without spin degree of freedom constructed using an embedded GOE of one…
The $N$ vertices of a quantum random graph are each a circle independently punctured at Poisson points of arrivals, with parallel connections derived through for each pair of these punctured circles by yet another independent Poisson…