Related papers: Is negative-weight percolation compatible with SLE…

We consider first-passage percolation on the $d$ dimensional cubic lattice for $d \geq 2$; that is, we assign independently to each edge $e$ a nonnegative random weight $t_e$ with a common distribution and consider the induced random graph…

The need to carry out analytical studies of wireless systems often motivates the usage of simplified models which, despite their tractability, can easily lead to an overestimation of the achievable performance. In the case of dense small…

We review some of the results that have been derived in the last years on conformal invariance, scaling limits and properties of some two-dimensional random curves. In particular, we describe the intuitive ideas that lead to the definition…

Simulations of the self-avoiding walk (SAW) are performed in a half-plane and a cut-plane (the complex plane with the positive real axis removed) using the pivot algorithm. We test the conjecture of Lawler, Schramm and Werner that the…

This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can be realized as unique shortest paths in a graph…

We summarize basic features associated to dynamical breaking of the electroweak symmetry. The knowledge of the phase diagram of strongly coupled theories as function of the number of colors, flavors and matter representation plays a…

We present a Monte Carlo study of the fractal geometry of clusters formed by discrete-time simple random walks (sRW) of $L^2$ steps on a periodic square $L\times L$ lattice. We verify with high precision that the asymptotic behavior of the…

This article gives a comprehensive description of the fractal geometry of conformally-invariant (CI) scaling curves, in the plane or half-plane. It focuses on deriving critical exponents associated with interacting random paths, by…

Percolation models with multiple percolating clusters have attracted much attention in recent years. Here we use Monte Carlo simulations to study bond percolation on $L_{1}\times L_{2}$ planar random lattices, duals of random lattices, and…

We use SLE(6) paths to construct a process of continuum nonsimple loops in the plane and prove that this process coincides with the full continuum scaling limit of 2D critical site percolation on the triangular lattice -- that is, the…

We present a simplified algorithm for solving the Negative-Weight Single-Source Shortest Paths (SSSP) problem, focusing on enhancing clarity and practicality over prior methods. Our algorithm uses graph diameter as a recursive parameter,…

Quantitative descriptions of network structure in big data can provide fundamental insights into the function of interconnected complex systems. Small-world structure, commonly diagnosed by high local clustering yet short average path…

For two-dimensional percolation on a domain with the topology of a disc, we introduce a nested-path operator (NP) and thus a continuous family of one-point functions $W_k \equiv \langle \mathcal{R} \cdot k^\ell \rangle $, where $\ell$ is…

Results are reported for the beta-function of weakly coupled conformal gauge theories on the lattice, SU(3) with Nf=14 fundamental and Nf=3 sextet fermions. The models are chosen to be close to the upper end of the conformal window where…

We explore a bond percolation model on slabs $\mathbb{S}^+_k=\mathbb{Z}_+\times \mathbb{Z}_+\times\{0,\dots,k\}$ featuring one-dimensional inhomogeneities. In this context, a vertical column on the slab comprises the set of vertical edges…

Let $G$ be a directed graph on finitely many vertices and edges, and assign a positive weight to each edge on $G$. Fix vertices $u$ and $v$ and consider the set of paths that start at $u$ and end at $v$, self-intersecting in any number of…

We present an algorithm, based on the iteration of conformal maps, that produces independent samples of self-avoiding paths in the plane. It is a discrete process approximating radial Schramm-Loewner evolution growing to infinity. We focus…

The goal of this paper is to prove that several variants of deciding whether a poset can be (weakly) embedded into a small Boolean lattice, or to a few consecutive levels of a Boolean lattice, are NP-complete, answering a question of Griggs…

We present first-principle lattice study of the two-dimensional SU(N) x SU(N) Principal Chiral Model (PCM) on the cylinder R x S1 with variable compactification length L0 of S1 and with both periodic and ZN-symmetric twisted boundary…

The shortest-path percolation (SPP) model aims at describing the consumption and eventual exhaustion of a network's resources. Starting from a network containing a macroscopic connected component, random pairs of nodes are sequentially…