Related papers: Shortest path and Schramm-Loewner Evolution
The Schramm-Loewner evolution (SLE) describes the continuum limit of domain walls at phase transitions in two dimensional statistical systems. We consider here the SLEs in the self-dual Z(N) spin models at the critical point. For N=2 and…
The nodal lines of random wave functions are investigated. We demonstrate numerically that they are well approximated by the so-called SLE_6 curves which describe the continuum limit of the percolation cluster boundaries. This result gives…
We present analytical results for the distribution of shortest path lengths (DSPL) in a network growth model which evolves by node duplication (ND). The model captures essential properties of the structure and growth dynamics of social…
We consider multiple chordal Schramm-Loewner evolution (SLE) with $\kappa\in (0,4]$. Under common-time parameterization, we show that the transition density of the driving function of multiple chordal SLEs can be given by the transition…
Real landscapes are usually characterized by long-range height-height correlations, which are quantified by the Hurst exponent $H$. We analyze the statistical properties of the isoheight lines for correlated landscapes of $H\in [-1,1]$. We…
Motivated by results of Henry, Pralat and Zhang (PNAS 108.21 (2011): 8605-8610), we propose a general scheme for evolving spatial networks in order to reduce their total edge lengths. We study the properties of the equilbria of two networks…
Spreading according to simple rules (e.g. of fire or diseases), and shortest-path distances are studied on d-dimensional systems with a small density p per site of long-range connections (``Small-World'' lattices). The volume V(t) covered…
Appreciation of Stochastic Loewner evolution (SLE$_\kappa$), as a powerful tool to check for conformal invariant properties of geometrical features of critical systems has been rising. In this paper we use this method to check conformal…
The Brownian loop measure is a conformally invariant measure on loops in the plane that arises when studying the Schramm-Loewner evolution (SLE). When an SLE curve in a domain evolves from an interior point, it is natural to consider the…
Schramm--Loewner evolution (SLE) has been one of the central topics in the probabilistic study of two-dimensional critical systems. It is a random curve in two dimensions to which a cluster interface in a critical lattice system is…
Linear least squares (LLS) is perhaps the most common method of data analysis, dating back to Legendre, Gauss and Laplace. Framed as linear regression, LLS is also a backbone of mathematical statistics. Here we report on an unexpected new…
In these Notes, a comprehensive description of the universal fractal geometry of conformally-invariant scaling curves or interfaces, in the plane or half-plane, is given. The present approach focuses on deriving critical exponents…
Recent advances in Schramm-Loewner evolution have driven increasing interest in non-standard Loewner flows. In this work, we propose a novel splitting algorithm to simulate random Loewner curves with rigorous convergence analysis in…
The scaling limit of the two-dimensional self-avoiding walk (SAW) is believed to be given by the Schramm-Loewner evolution (SLE) with the parameter kappa equal to 8/3. The scaling limit of the SAW has a natural parameterization and SLE has…
In last passage percolation models lying in the KPZ universality class, the energy of long energy-maximizing paths may be studied as a function of the paths' pair of endpoint locations. Scaled coordinates may be introduced, so that these…
We define a family of stochastic Loewner evolution-type processes in finitely connected domains, which are called continuous LERW (loop-erased random walk). A continuous LERW describes a random curve in a finitely connected domain that…
We study the probabilities with which chordal Schramm-Loewner Evolutions (SLE) visit small neighborhoods of boundary points. We find formulas for general chordal SLE boundary visiting probability amplitudes, also known as SLE boundary…
The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity in a given undirected graph. The problem is known to be NP-complete and W[2]-hard with respect to the desired eccentricity. We…
We enhance our quantitative comprehension of the complexity associated with both time-optimal and time sub-optimal quantum Hamiltonian evolutions that connect arbitrary source and target states on the Bloch sphere, as recently presented in…
Graph transformers extend global self-attention to graph-structured data, achieving notable success in graph learning. Recently, random walk structural encoding (RWSE) has been found to further enhance their predictive power by encoding…