Related papers: UST branches, martingales, and multiple SLE(2)

For any edge weight distribution, we consider the uniform spanning tree (UST) on finite graphs with i.i.d. random edge weights. We show that, for bounded degree expander graphs and finite boxes of ${\mathbb Z}^d$, the diameter of the UST is…

We prove that the scaling limit of loop-erased random walk in a simply connected domain $D$ is equal to the radial SLE(2) path in $D$. In particular, the limit exists and is conformally invariant. It follows that the scaling limit of the…

In this article we show the convergence of a loop ensemble of interfaces in the FK Ising model at criticality, as the lattice mesh tends to zero, to a unique conformally invariant scaling limit. The discrete loop ensemble is described by a…

The global structure of the minimal spanning tree (MST) is expected to be universal for a large class of underlying random discrete structures. However, very little is known about the intrinsic geometry of MSTs of most standard models, and…

In this dissertation, we investigate the approach of pure SU(2) lattice gauge theory to its continuum limit using the deconfinement temperature, six gradient scales, and six cooling scales. We find that cooling scales exhibit similarly good…

We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…

We consider the minimum spanning tree (MST) problem under the restriction that for every vertex v, the edges of the tree that are adjacent to v satisfy a given family of constraints. A famous example thereof is the classical…

We consider multiple radial SLE curves with various time parameterizations and possible spiraling behavior. We construct them by tilting independent radial SLEs with a suitable local martingale, generalizing the earlier construction by…

We consider a matrix branching random walk on the semi-group of nonnegative matrices, where we are able to derive, under general assumptions, an analogue of Biggins' martingale convergence theorem for the additive martingale $W_n$, a spinal…

We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the…

We construct a class of discontinuous superprocesses with dependent spatial motion and general branching mechanism. The process arises as the weak limit of critical interacting-branching particle systems where the spatial motions of the…

We generalize recent results of Haas and Miermont to obtain scaling limits of Markov branching trees whose size is specified by the number of nodes whose out-degree lies in a given set. We then show that this implies that the scaling limit…

We provide a conformal field theory (CFT) description of the probabilistic model of boundary effects in the wired uniform spanning tree (UST) and its algebraic content, concerning the entire first row of the Kac table with central charge…

We prove that the Minimal Spanning Tree and the Invasion Percolation Tree on a version of the triangular lattice in the complex plane have unique scaling limits, which are invariant under rotations, scalings, and, in the case of the MST,…

We define a minimization problem for paths on planar graphs that, on the honeycomb lattice, is equivalent to the exploration path of the critical site percolation and than has the same scaling limit of SLE_6. We numerically study this model…

In this paper we prove a functional limit theorem for the weighted profile of a $b$-ary tree. For the proof we use classical martingales connected to branching Markov processes and a generalized version of the profile-polynomial martingale.…

We study finite-horizon optimal switching with discrete intervention dates on a general filtration, allowing continuous-time observations between decision dates, and develop a deep-learning-based dual framework with computable upper bounds.…

A symbolic-computational algorithm, fully implemented in Maple, is described, that computes explicit expressions for generating functions that enable the efficient computations of the expectation, variance, and higher moments, of the random…

We review some of the recent progress on the scaling limit of two-dimensional critical percolation; in particular, the convergence of the exploration path to chordal SLE(6) and the "full" scaling limit of cluster interface loops. The…

We investigated two-dimensional brittle fragmentation with a flat impact experimentally, focusing on the low impact energy region near the fragmentation-critical point. We found that the universality class of fragmentation transition…