Related papers: Universal scaling in real dimension
The last decade has witnessed an experimental revolution in data science and machine learning, epitomised by deep learning methods. Indeed, many high-dimensional learning tasks previously thought to be beyond reach -- such as computer…
Droplet condensation on surfaces produces patterns, called breath figures. Their evolution into self-similar structures is a classical example of self-organization. It is described by a scaling theory with scaling functions whose…
The empirical spectral distribution of Hermitian $K \times K$-block random matrices converges to a deterministic density on the real line with a potential atom at the origin as the dimension of the blocks tends to infinity. In this model…
The charge on a conducting cylinder becomes uniformly distributed at large aspect ratios, albeit very slowly and with nonuniformity persisting near the ends. We show that the charge density and field magnitude are enhanced near the ends by…
Universal scaling laws only apply asymptotically near critical phase transitions. We propose a general scheme, based on normal form theory of renormalization group flows, for incorporating corrections to scaling that quantitatively describe…
Our conventional system of physical units is based on local or microscopic {\it dimensional} quantities which are {\it defined}, for convenience or otherwise aesthetic reasons, to be spacetime-independent. A more general choice of units may…
The goal of this paper is to show that there exists a simple, yet universal statistical logic of spectral graph analysis by recasting it into a nonparametric function estimation problem. The prescribed viewpoint appears to be good enough to…
Graphs (i.e., networks) have become an integral tool for the representation and analysis of relational data. Advances in data gathering have lead to multi-relational data sets which exhibit greater depth and scope. In certain cases, this…
Fractal curvatures of a subset F of R^d are roughly defined as suitably rescaled limits of the total curvatures of its parallel sets F_e as e tends to 0 and have been studied in the last years in particular for self-similar and…
The universality of the metal-insulator transition in three-dimensional disordered system is confirmed by numerical analysis of the scaling properties of the electronic wave functions. We prove that the critical exponent $\nu$ and the…
We discuss emergence of geometrical scaling as a consequence of the nonlinear evolution equations of QCD, which generate a new dynamical scale, known as the saturation momentum: Qs. In the kinematical region where no other energy scales…
We study $d$-dimensional scalar field theory in the Local Potential Approximation of the functional renormalization group. Sturm-Liouville methods allow the eigenoperator equation to be cast as a Schrodinger-type equation. Combining…
We study the average number of simplices $N'(r)$ at geodesic distance $r$ in the dynamical triangulation model of euclidean quantum gravity in four dimensions. We use $N'(r)$ to explore definitions of curvature and of effective global…
We consider decay of an initial density or current perturbation at finite temperature $T$ near a quantum critical point with emergent Lorentz invariance. We argue that decay of perturbations with wavenumbers $k \gg T$ (in natural units) is…
The unitary evolution maps in closed chaotic quantum graphs are known to have universal spectral correlations, as predicted by random matrix theory. In chaotic graphs with absorption the quantum maps become non-unitary. We show that their…
The hyperbolic random graph model (HRG) has proven useful in the analysis of scale-free networks, which are ubiquitous in many fields, from social network analysis to biology. However, working with this model is algorithmically and…
Let $\mathbf{p}$ be a configuration of $n$ points in $\mathbb{R}^d$ for some $n$ and some $d \ge 2$. Each pair of points has a Euclidean length in the configuration. Given some graph $G$ on $n$ vertices, we measure the point-pair lengths…
A $d$-dimensional bar-and-joint framework $(G,p)$ with underlying graph $G$ is called universally rigid if all realizations of $G$ with the same edge lengths, in all dimensions, are congruent to $(G,p)$. A graph $G$ is said to be…
The metric dimension of a graph $G$ is the minimum number of vertices in a subset $S$ of the vertex set of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $S$. In this paper we investigate the…
Gauging is a general procedure for mapping a quantum many-body system with a global symmetry to one with a local gauge symmetry. We consider a generalized gauging map that does not enforce gauge symmetry at all lattice sites, and show that…