Related papers: Renormalization of crossing probabilities in the p…
We study the renormalization group flow of $\mathbb{Z}_2$-invariant supersymmetric and non-supersymmetric scalar models in the local potential approximation using functional renormalization group methods. We focus our attention to the fixed…
Percolation clusters are probably the simplest example for scale--invariant structures which either are governed by isotropic scaling--laws (``self--similarity'') or --- as in the case of directed percolation --- may display anisotropic…
A crossing probability for the critical four-state Potts model on an $L\times M$ rectangle on a square lattice is numerically studied. The crossing probability here denotes the probability that spin clusters cross from one side of the…
The vulcanization transition - the crosslink-density-controlled equilibrium phase transition from the liquid to the amorphous solid state - is explored analytically from a renormalization group perspective. The analysis centers on a minimal…
We explore fundamental questions about the renormalization group through a detailed re-examination of Feigenbaum's period doubling route to chaos. In the space of one-humped maps, the renormalization group characterizes the behavior near…
In recent years, model collapse has become a critical issue in language model training, making it essential to understand the underlying mechanisms driving this phenomenon. In this paper, we investigate recursive parametric model training…
We study random two-dimensional spanning forests in the plane that can be viewed both in the discrete case and in their appropriately taken scaling limits as a uniformly chosen spanning tree with some Poissonian deletion of edges or points.…
We investigate the geometry of a typical spin cluster in random triangulations sampled with a probability proportional to the energy of an Ising configuration on their vertices, both in the finite and infinite volume settings. This model is…
Motivated by the success of a k-clique percolation method for the identification of overlapping communities in large real networks, here we study the k-clique percolation problem in the Erdos-Renyi graph. When the probability p of two nodes…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
Cross-classified data frequently arise in scientific fields such as education, healthcare, and social sciences. A common modeling strategy is to introduce crossed random effects within a regression framework. However, this approach often…
We prove that crossing probabilities for the critical planar Ising model with free boundary conditions are conformally invariant in the scaling limit, a phenomenon first investigated numerically by Langlands, Lewis and Saint-Aubin. We do so…
Recalibration of binary probabilistic classifiers to a target prior probability is an important task in areas like credit risk management. However, recalibration of a classifier learned on a training dataset to a target on a test dataset in…
The RP(2) gauge model is studied in 2D. We use Monte-Carlo renormalization techniques for blocking the mean spin-spin interaction, <A>, and the mean gauge field plaquette, <P>. The presence of the O(3) renormalized trajectory is verified…
We apply renormalized entropy as a complexity measure to the logistic and sine-circle maps. In the case of logistic map, renormalized entropy decreases (increases) until the accumulation point (after the accumulation point up to the most…
In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our…
We consider several aspects of the scaling limit of percolation on random planar triangulations, both finite and infinite. The equivalents for random maps of Cardy's formula for the limit under scaling of various crossing probabilities are…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
We provide (high probability) bounds on the condition number of random feature matrices. In particular, we show that if the complexity ratio $\frac{N}{m}$ where $N$ is the number of neurons and $m$ is the number of data samples scales like…
A field theoretic renormalization group method is presented which is capable of dealing with crossover problems associated with a change in the upper critical dimension. The method leads to flow functions for the parameters and coupling…