Related papers: Scaling limits for critical inhomogeneous random g…

We study large deviations of the size of the largest connected component in a general class of inhomogeneous random graphs with iid weights, parametrized so that the degree distribution is regularly varying. We derive a large-deviation…

We establish that if a sequence of spaces equipped with resistance metrics and measures converge with respect to the Gromov-Hausdorff-vague topology, and a certain non-explosion condition is satisfied, then the associated stochastic…

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…

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 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 describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…

We propose a random bipartite graph with weights assigned to both parts of the vertex sets. Edges are formed independently with probabilities that depend on these weights. This bipartite graph naturally gives rise to a random intersection…

We prove a moderate deviations principles for the size of the largest connected component in a random $d$-uniform hypergraph. The key tool is a version of the exploration process, that is also used to investigate the giant component of an…

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…

This is the first of two complementary works in which we analyze the connected components of the degree-corrected stochastic block model (DCSBM). Our model is a random graph with an underlying community structure and degree in-homogeneity.…

We consider an exploration algorithm where at each step, a random number of items become active while related items get explored. Given an initial number of items $N$ growing to infinity and building on a strong homogeneity assumption, we…

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 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…

A uniformly random graph on $n$ vertices with a fixed degree sequence, obeying a $\gamma$ subpower law, is studied. It is shown that, for $\gamma>3$, in a subcritical phase with high probability the largest component size does not exceed…

We prove that the scaling limits of spin fluctuations in four-dimensional Ising-type models with nearest-neighbor ferromagnetic interaction at or near the critical point are Gaussian. A similar statement is proven for the $\lambda \phi^4$…

In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…

We study the finite-size scaling behaviour at the critical point, resulting from the addition of a homogeneous size-dependent perturbation, decaying as an inverse power of the system size. The scaling theory is first formulated in a general…

We study the Anderson transition in lattices with the connectivity of a random-regular graph. Our results indicate that fractal dimensions are continuous across the transition, but a discontinuity occurs in their derivatives, implying the…

We prove that random triangulations of types I, II, and III with a simple boundary under the critical Boltzmann weight converge in the scaling limit to the Brownian disk. The proof uses a bijection due to Poulalhon and Schaeffer between…

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…