Related papers: Novel scaling limits for critical inhomogeneous ra…

We propose a method to obtain an improved Hamiltonian (action) for the Ising universality class in three dimensions. The improved Hamiltonian has suppressed leading corrections to scaling. It is obtained by tuning models with two coupling…

Considered are the large $N$, or large intensity, forms of the distribution of the length of the longest increasing subsequences for various models. Earlier work has established that after centring and scaling, the limit laws for these…

We study the critical behavior for inhomogeneous versions of the Curie-Weiss model, where the coupling constant $J_{ij}(\beta)$ for the edge $ij$ on the complete graph is given by $J_{ij}(\beta)=\beta w_iw_j/(\sum_{k\in[N]}w_k)$. We call…

We consider the Erdos-Renyi random graph G(n,p) inside the critical window, that is when p=1/n+ lambda*n^{-4/3}, for some fixed lambda in R. Then, as a metric space with the graph distance rescaled by n^{-1/3}, the sequence of connected…

The question of understanding the scaling limit of metric graph critical loop soup clusters and its relation to loop soups in the continuum appears to be one of the subtle cases that reveal interesting new scenarios about scaling limits,…

Complex interactions leading to phase transitions continue to hold a due interest in the scientific community. We charactersize a phase transition in a coupled oscillators model where interactions are not local in nature. At a first order…

We consider critical multitype Bienaym\'e trees that are either irreducible or possess a critical irreducible component with attached subcritical components. These trees are studied under two distinct conditioning frameworks: first,…

We study the limiting behavior of singular values of a lag-$\tau$ sample auto-correlation matrix $\bf{R}_{\tau}^{\epsilon}$ of error term $\epsilon$ in the high-dimensional factor model. We establish the limiting spectral distribution (LSD)…

Let G_n be a sequence of finite transitive graphs with vertex degree d=d(n) and |G_n|=n. Denote by p^t(v,v) the return probability after t steps of the non-backtracking random walk on G_n. We show that if p^t(v,v) has quasi-random…

We consider the component structure of a recent model of random graphs on the hyperbolic plane that was introduced by Krioukov et al. The model exhibits a power law degree sequence, small distances and clustering, features that are…

We study the growth and isoperimetry of infinite clusters in slightly supercritical Bernoulli bond percolation on transitive nonamenable graphs under the $L^2$ boundedness condition ($p_c<p_{2\to 2}$). Surprisingly, we find that the volume…

In three dimensions, or more generally, below the upper critical dimension, scaling laws for critical phenomena seem well understood, for both infinite and for finite systems. Above the upper critical dimension of four, finite-size scaling…

Let ${Z_n}_{n\ge 0}$ be a random walk with a negative drift and i.i.d. increments with heavy-tailed distribution and let $M=\sup_{n\ge 0}Z_n$ be its supremum. Asmussen & Kl{\"u}ppelberg (1996) considered the behavior of the random walk…

We prove a refined version of the Aldous and Brown's exponential approximation of stationary hitting times. These are valid for all reversible Markov chains. We then specialise our estimates for vertex-transitive graphs, where we obtain…

As suggested by Itai Benjamini, we introduced a variant of the Erd\"os- R\'enyi random graph process with a forbidden degree $k$, in which every edge adjacent to a vertex $v$ is removed when the degree of $v$ reaches $k$ (but the removed…

We study a discrete model of coagulation, involving a large number $N$ of particles. Pairs of particles are given i.i.d exponential clocks with parameter $1/N$. When a clock rings, a link between the corresponding pair of particles is…

We consider the three-dimensional site-diluted Ising model with power-law correlated defects and study the critical behavior of the second-moment correlation length and the magnetic susceptibility in the high-temperature phase. By…

The clustering of a graph coloring is the maximum size of monochromatic components. This paper studies colorings with bounded clustering in graph classes with bounded layered treewidth, which include planar graphs, graphs of bounded Euler…

We perform an experimental study of the time behavior of the $\alpha$-wave events occuring in human electroencephalographic signals. We find that the fraction of the time spent in an $\alpha$-burst of time size $\tau$ exhibits a scaling…

We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its…