Related papers: Novel scaling limits for critical inhomogeneous ra…
We describe the results of a systematic high-statistics Monte-Carlo study of finite-size effects at the phase transition of compact U(1) lattice gauge theory with Wilson action on a hypercubic lattice with periodic boundary conditions. We…
We consider a one-dimensional Brownian motion of fixed duration $T$. Using a path-integral technique, we compute exactly the probability distribution of the difference $\tau=t_{\min}-t_{\max}$ between the time $t_{\min}$ of the global…
We consider the most general scale invariant radial Hamiltonian allowing for anisotropic scaling between space and time. We formulate a renormalisation group analysis of this system and demonstrate the existence of a quantum phase…
Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation…
We provide large deviations estimates for the upper tail of the number of triangles in scale-free inhomogeneous random graphs where the degrees have power law tails with index $-\alpha, \alpha \in (1,2)$. We show that upper tail…
Enriquez, Faraud, and Lemaire (2023) have established process-level fluctuations for the giant of the dynamic Erd\H{o}s-R\'{e}nyi random graph above criticality and show that the limit is a centered Gaussian process with continuous sample…
Suppressing monopoles and vortices by introducing large chemical potentials for them in the Wilson action for the SU(2) lattice gauge theory, we study the nature of the deconfinement phase transition on N_sigma^3 X N_tau lattices for N_tau…
We consider the Graph Ornstein-Uhlenbeck (GrOU) process observed on a non-uniform discrete time grid and introduce discretised maximum likelihood estimators with parameters specific to the whole graph or specific to each component, or node.…
We consider an infinite spatial inhomogeneous random graph model with an integrable connection kernel that interpolates nicely between existing spatial random graph models. Key examples are versions of the weight-dependent random connection…
We consider a large class of spatially-embedded random graphs that includes among others long-range percolation, continuum scale-free percolation and the age-dependent random connection model. We assume that the model is supercritical:…
We consider TASEP with two types of particles starting at every second site. Particles to the left of the origin have jump rate $1$, while particles to the right have jump rate $\alpha$. When $\alpha<1$ there is a formation of a shock where…
Following a recent suggestion by Nielsen, Rugh, and Rugh, we study the energy scaling of the maximal Lyapunov exponent of classical Hamiltonian SU(2) lattice gauge theory. It is shown that the conjectured scaling behavior $\lambda_0\sim…
The vapor-liquid critical behavior of intrinsically asymmetric fluids is studied in finite systems of linear dimensions, $L$, focusing on periodic boundary conditions, as appropriate for simulations. The recently propounded ``complete''…
To understand mesoscopic scaling in networks, we study the hierarchical configuration model (HCM), a random graph model with community structure. The connections between the communities are formed as in a configuration model. We study the…
We consider the following random graph process: starting with n isolated vertices, add edges uniformly at random provided no such edge creates a copy of C_4. We show that, with probability tending to 1 as $n \to \infty$, the final graph…
We apply here methods of inhomogeneous random graphs to a class of random distance graphs. This provides an example outside of the rank 1 models which is still solvable as long as the largest connected component is concerned. In particular,…
We present a new algorithm for finding large independent sets in $3$-colorable graphs with small $1$-sided threshold rank. Specifically, given an $n$-vertex $3$-colorable graph whose uniform random walk matrix has at most $r$ eigenvalues…
Finite-size scaling above the upper critical dimension is a long-standing puzzle in the field of Statistical Physics. Even for pure systems various scaling theories have been suggested, partially corroborated by numerical simulations. In…
We analyze maximum entropy random graph ensembles with constrained degrees, drawn from arbitrary degree distributions, and a tuneable number of 3-loops (triangles). We find that such ensembles generally exhibit two transitions, a clustering…
We consider inhomogeneous Erd\H{o}s-R\'enyi graphs. We suppose that the maximal mean degree $d$ satisfies $d \ll \log n$. We characterize the asymptotic behavior of the $n^{1 - o(1)}$ largest eigenvalues of the adjacency matrix and its…