Related papers: The upper critical dimension of the negative-weigh…
We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…
We discuss the following type of results about critical Bernoulli percolation in high dimensions: The collection of clusters that do contain large (self-avoiding) loops in a large box is tight. The collection of these large loops has…
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 multifield extensions of Reggeon Field Theory (also equivalent to Directed Percolation model) at criticality in the perturbative epsilon-expansion below the upper critical dimension Dc=4 at one loop, for the special case when all…
First-passage percolation is the study of the metric space $(\mathbb{Z}^d,T)$, where $T$ is a random metric defined as the weighted graph metric using random edge-weights $(t_e)_{e\in \mathcal{E}^d}$ assigned to the nearest-neighbor edges…
We consider the bond percolation problem on a transient weighted graph induced by the excursion sets of the Gaussian free field on the corresponding cable system. Owing to the continuity of this setup and the strong Markov property of the…
Simplicial complexes are increasingly used to understand the topology of complex systems as different as brain networks and social interactions. It is therefore of special interest to extend the study of percolation to simplicial complexes.…
We study in this paper, the first passage percolation on a random graph model, the configuration model. We first introduce, the notions of weighted diameter, which is the maximum of the weighted lengths of all optimal paths between any two…
The statistics of a long closed self-avoiding walk (SAW) or polymer ring on a $ d $-dimensional lattice obeys hyperscaling. The combination $ p_N \left\langle R^2 \right\rangle^{ d/2}_N\mu^{ -N}, $ (where $ p_N $ is the number of…
P-time event graphs (P-TEGs) are specific timed discrete-event systems, in which the timing of events is constrained by intervals. An important problem is to check, for all natural numbers $d$, the existence of consistent $d$-periodic…
We show that the number of maximal paths in directed last-passage percolation on the hypercubic lattice ${\mathbb Z}^d$ $(d\geq2)$ in which weights take finitely many values is typically exponentially large.
We consider the random walk loop soup on the discrete half-plane and study the percolation problem, i.e. the existence of an infinite cluster of loops. We show that the critical value of the intensity is equal to 1/2. The absence of…
Entanglement transitions in quantum dynamics present a novel class of phase transitions in non-equilibrium systems. When a many-body quantum system undergoes unitary evolution interspersed with monitored random measurements, the…
On the $Z^2$ lattice, vertices are assigned random weights $W(i,j)$. The point-to-point last passage percolation (LPP) time $S_{M,N+1-M}$ between $(1,1)$ and $(M,N+1-M)$ is the maximum total weight among all upward/right-oriented paths…
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 investigate the critical behavior of three-dimensional antiferromagnetic CP(N-1) [ACP(N-1)] models in cubic lattices, which are characterized by a global U(N) symmetry and a local U(1) gauge symmetry. Assuming that critical fluctuations…
We present Monte Carlo estimates for site and bond percolation thresholds in simple hypercubic lattices with 4 to 13 dimensions. For d<6 they are preliminary, for d >= 6 they are between 20 to 10^4 times more precise than the best previous…
In three-dimensional critical percolation we study numerically the number of clusters, $N_{\Gamma}$, which intersect a given subset of bonds, $\Gamma$. If $\Gamma$ represents the interface between a subsystem and the environment, then…
For ordinary (independent) percolation on a large class of lattices it is well known that below the critical percolation parameter $p_c$ the cluster size distribution has exponential decay and that power-law behavior of this distribution…
In this paper we consider two-loop two-, three- and four-point diagrams with elliptic structure in the case of two different masses $m$ and $M$. The latter diagrams generally arise within NRQCD matching procedures and are relevant for…