Related papers: Singularity of Nearcritical Percolation Exploratio…
An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the…
Let $\{N_t\}$ be a holomorphic family of degree $d\ge 3$ Newton maps. By studying the related Berkovich dynamics, we obtain an estimate of the weak limit of the maximal measures of $N_t$. Moreover, we give a complete description of the…
A wide array of random graph models have been postulated to understand properties of observed networks. Typically these models have a parameter $t$ and a critical time $t_c$ when a giant component emerges. It is conjectured that for a large…
The universal behaviour of the directed percolation universality class is well understood, both the critical scaling as well as finite size scaling. This article focuses on the block (finite size) scaling of the order parameter and its…
We study the two-dimensional domain morphology of twisted nematic liquid crystals during their phase-ordering kinetics [R. A. L. Almeida, Phys. Rev. Lett. 131 (2023) 268101], which is a physical candidate to self-generate critical clusters…
We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…
We study topological properties of random closed curves on an orientable surface $S$ of negative Euler characteristic. Letting $\gamma_{n}$ denote the conjugacy class of the $n^{th}$ step of a simple random walk on the Cayley graph driven…
We consider a model of loop-erased random walks on the finite pre-Sierpinski gasket which permits rigorous analysis. We prove the existence of the scaling limit and show that the path of the limiting process is almost surely self-avoiding,…
We introduce an algorithm that constructs a random uniform graph with prescribed degree sequence together with a depth first exploration of it. In the so-called supercritical regime where the graph contains a giant component, we prove that…
Chiral optical effects are generally quantified along some specific incident directions of exciting waves (especially for extrinsic chiralities of achiral structures) or defined as direction-independent properties by averaging the responses…
We reconsider the problem of percolation on an equilibrium random network with degree-degree correlations between nearest-neighboring vertices focusing on critical singularities at a percolation threshold. We obtain criteria for…
We show that oriented percolation occurs whenever a condition is satisfied called "exponential intersection tails". This condition says that a measure on paths exists for which the probability of two independent paths intersecting in more…
Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs.…
We prove a unified and general criterion for the uniqueness of critical points of a functional in the presence of constraints such as positivity, boundedness, or fixed mass. Our method relies on convexity properties along suitable paths and…
We determine the uniqueness on starlike obstacles by using the cross section data. We see cross section data as spectral measure in polar coordinate at far field. Cross section scattering data suffice to give the local behavior of the wave…
A singularly perturbed problem involving two singular perturbation parameters is discretized using the classical upwinded finite difference scheme on an appropriate piecewise-uniform Shishkin mesh. Scaled discrete derivatives (with scaling…
Minisuperspace models derived from Kaluza-Klein theories and low energy string theory are studied. They are equivalent to one and two minimally coupled scalar fields. The general classical and quantum solutions are obtained. Gaussian…
This work is the first in a series of papers devoted to the construction and study of scaling limits of dynamical and near-critical planar percolation and related objects like invasion percolation and the Minimal Spanning Tree. We show here…
We study the long range percolation model on $\mathbb{Z}$ where sites $i$ and $j$ are connected with probability $\beta |i-j|^{-s}$. Graph distances are now well understood for all exponents $s$ except in the case $s=2$ where the model…
Random developments of a path into a matrix Lie group $G_N$ have recently been used to construct signature-based kernels on path space. Two examples include developments into GL$(N;\mathbb{R})$ and $U(N;\mathbb{C})$, the general linear and…