Related papers: Novel scaling limits for critical inhomogeneous ra…

We establish the global lower mass-bound property for the largest connected components in the critical window for the configuration model when the degree distribution has an infinite third moment. The scaling limit of the critical…

We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…

We consider a class of scale-free inhomogeneous random graphs, which includes some long-range percolation models. We study the maximum degree in such graphs in a growing observation window and show that its limiting distribution is Frechet.…

Bounded-size rules are dynamic random graph processes which incorporate limited choice along with randomness in the evolution of the system. One starts with the empty graph and at each stage two edges are chosen uniformly at random. One of…

The finite-size scaling theory for continuous phase transition plays an important role in determining critical point and critical exponents from the size-dependent behaviors of quantities in the thermodynamic limit. For percolation phase…

We develop a general universality technique for establishing metric scaling limits of critical random discrete structures exhibiting mean-field behavior that requires four ingredients: (i) from the barely subcritical regime to the critical…

Random graph models with limited choice have been studied extensively with the goal of understanding the mechanism of the emergence of the giant component. One of the standard models are the Achlioptas random graph processes on a fixed set…

We study first passage percolation on the configuration model. Assuming that each edge has an independent exponentially distributed edge weight, we derive explicit distributional asymptotics for the minimum weight between two randomly…

We present the results of a systematic survey of numerical solutions to the coagulation equation for a rate coefficient of the form A_ij \propto (i^mu j^nu + i^nu j^mu) and monodisperse initial conditions. The results confirm that there are…

We consider Brownian motions with one-sided collisions, meaning that each particle is reflected at its right neighbour. For a finite number of particles a Sch\"{u}tz-type formula is derived for the transition probability. We investigate an…

Sheffield (2011) introduced an inventory accumulation model which encodes a random planar map decorated by a collection of loops sampled from the critical Fortuin-Kasteleyn (FK) model. He showed that a certain two-dimensional random walk…

We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase…

We study the double- and triple-scaling limits of a complex multi-matrix model, with $\mathrm{U}(N)^2\times \mathrm{O}(D)$ symmetry. The double-scaling limit amounts to taking simultaneously the large-$N$ (matrix size) and large-$D$ (number…

We study the percolation configuration arising from the random current representation of the near-critical Ising model on the complete graph. We compute the scaling limit of the cluster size distribution for an arbitrary set of sources in…

The (two) core of a hypergraph is the maximal collection of hyperedges within which no vertex appears only once. It is of importance in tasks such as efficiently solving a large linear system over GF[2], or iterative decoding of low-density…

We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…

We study the component structure of the random graph $G=G_{n,m,d}$. Here $d=O(1)$ and $G$ is sampled uniformly from ${\mathcal G}_{n,m,d}$, the set of graphs with vertex set $[n]$, $m$ edges and maximum degree at most $d$. If $m=\mu n/2$…

Large scale simulations of two-dimensional bidisperse granular fluids allow us to determine spatial correlations of slow particles via the four-point structure factor $S_4(q,t)$. Both cases, elastic ($\varepsilon=1$) as well as inelastic…

We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d \geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In…

We use large-scale three-dimensional simulations of supersonic Euler turbulence to study the physics of a highly compressible cascade. Our numerical experiments describe non-magnetized driven turbulent flows with an isothermal equation of…