Related papers: Gaussian to log-normal transition for independent …
Given a graph $G$, the hard-core model defines a probability distribution over its independent sets, assigning to each set of size $k$ a probability of $\frac{\lambda^k}{Z}$, where $\lambda>0$ is a parameter known as the \emph{fugacity} and…
We use a statistical model to discuss nonequilibrium fragmentation phenomena taking place in the stochastic dynamics of the log sector in log gravity. From the canonical Gibbs model, a combinatorial analysis reveals an important aspect of…
Motivated by problems on random differences in Szemer\'{e}di's theorem and on large deviations for arithmetic progressions in random sets, we prove upper bounds on the Gaussian width of point sets that are formed by the image of the…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We study discontinuous percolation transitions (PT) in the diffusion-limited cluster aggregation model of the sol-gel transition as an example of real physical systems, in which the number of aggregation events is regarded as the number of…
Transitions to chaos in archetypal low-dimensional nonlinear maps offer real and precise model systems in which to assess proposed generalizations of statistical mechanics. The known association of chaotic dynamics with the structure of…
The random intersection graph model $\mathcal G(n,m,p)$ is considered. Due to substantial edge dependencies, studying even fundamental statistics such as the subgraph count is significantly more challenging than in the classical binomial…
We consider a class of Gaussian Free Fields denoted by $(g_x)_{x \in {\cal V}_N}$, where $ {\cal V}_N = \{0,1\}^N$ and $N\in \mathbb{Z}_+$. These fields are related to a general class of $N$-dimensional random walks on the hypercube, which…
Open quantum systems have complex energy eigenvalues which are expected to follow non-Hermitian random matrix statistics when chaotic, or 2-dimensional (2d) Poisson statistics when integrable. We investigate the spectral properties of a…
We study random subgraphs of the $n$-cube $\{0,1\}^n$, where nearest-neighbor edges are occupied with probability $p$. Let $p_c(n)$ be the value of $p$ for which the expected cluster size of a fixed vertex attains the value $\lambda…
We introduce a very general model of an inhomogenous random graph with independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling corresponds to the p=c/n scaling for G(n,p)…
We determine critical parameter sets for transitions from gradual to explosive synchronization in coupled oscillator networks with higher-order coupling using self-consistency analysis. We obtain analytic bifurcation values for generic…
The nature of the superfluid-to-Bose-glass (SF-BG) quantum phase transition, occurring in systems of interacting bosons immersed in a disordered environment, remains elusive. One fundamental open question is whether or not the transition…
We study a random graph $G$ with given degree sequence $\boldsymbol{d}$, with the aim of characterising the degree sequence of the subgraph induced on a given set $S$ of vertices. For suitable $\boldsymbol{d}$ and $S$, we show that the…
Let each point of a homogeneous Poisson process in R^d independently be equipped with a random number of stubs (half-edges) according to a given probability distribution mu on the positive integers. We consider translation-invariant schemes…
The square lattice with central forces between nearest neighbors is isostatic with a subextensive number of floppy modes. It can be made rigid by the random addition of next-nearest neighbor bonds. This constitutes a rigidity percolation…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
Let $G_{n,p}^1$ be a superposition of the random graph $G_{n,p}$ and a one-dimensional lattice: the $n$ vertices are set to be on a ring with fixed edges between the consecutive vertices, and with random independent edges given with…
We study phase transition and percolation at criticality for three random graph models on the plane, viz., the homogeneous and inhomogeneous enhanced random connection models (RCM) and the Poisson stick model. These models are built on a…
In this paper a random graph model $G_{\mathbb{Z}^2_N,p_d}$ is introduced, which is a combination of fixed torus grid edges in $(\mathbb{Z}/N \mathbb{Z})^2$ and some additional random ones. The random edges are called long, and the…