Related papers: Convergence of Achlioptas processes via differenti…
Growth-fragmentation processes describe systems of particles in which each particle may grow larger or smaller, and divide into smaller ones as time proceeds. Unlike previous studies, which have focused mainly on the self-similar case, we…
The $N$ vertices of a quantum random graph are each a circle independently punctured at Poisson points of arrivals, with parallel connections derived through for each pair of these punctured circles by yet another independent Poisson…
We study a class of graphon particle systems with time-varying random coefficients. In a graphon particle system, the interactions among particles are characterized by the coupled mean field terms through an underlying graphon and the…
Numerous Optimization Algorithms have a time-varying update rule thanks to, for instance, a changing step size, momentum parameter or, Hessian approximation. In this paper, we apply unrolled or automatic differentiation to a time-varying…
Growth-fragmentation processes model systems of cells that grow continuously over time and then fragment into smaller pieces. Typically, on average, the number of cells in the system exhibits asynchronous exponential growth and, upon…
The Norros-Reittu model is a random graph with $n$ vertices and i.i.d. weights assigned to them. The number of edges between any two vertices follows an independent Poisson distribution whose parameter is increasing in the weights of the…
We consider a class of slow-fast processes on a connected complete Riemannian manifold $M$.The limiting dynamics as the scale separation goes to $\infty$ is governed by the averaging principle. Around this limit, we prove large deviation…
Consider a critical Erd\"os-R\'enyi random graph: $n$ is the number of vertices, each one of the $\binom{n}{2}$ possible edges is kept in the graph independently from the others with probability $n^{-1}+\lambda n^{-4/3}$, $\lambda$ being a…
Despite original claims of a first-order transition in the product rule model proposed by Achlioptas et al. [Science 323, 1453 (2009)], recent studies indicate that this percolation model, in fact, displays a continuous transition. The…
We describe the asymptotic behavior of the number $Z_n[a_n,\infty)$ of individuals with a large value in a stable bifurcating autoregressive process. The study of the associated first moment $\mathbb{E}(Z_n[a_n,\infty))$ is equivalent to…
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…
The Achlioptas process, which suppresses the aggregation of large-sized clusters, can exhibit an explosive percolation (EP) where the order parameter emerges abruptly yet continuously in the thermodynamic limit. It is known that EP is…
In 1998, Molloy and Reed showed that, under suitable conditions, if a sequence of degree sequences converges to a probability distribution $D$, then the size of the largest component in corresponding $n$-vertex random graph is…
We consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known…
We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…
We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…
Motivated by the importance of geometric information in real systems, a new model for long-range correlated percolation in link-adding networks is proposed with the connecting probability decaying with a power-law of the distance on the…
We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a…
The large deviation function obtained recently by Derrida and Lebowitz for the totally asymmetric exclusion process is generalized to the partially asymmetric case in the scaling limit. The asymmetry parameter rescales the scaling variable…
We show that singular numbers (also known as invariant factors or Smith normal forms) of products and corners of random matrices over $\mathbb{Q}_p$ are governed by the Hall-Littlewood polynomials, in a structurally identical manner to the…