相关论文: On the block size spectrum of a class of exchangea…
Coalescents with multiple collisions, also known as $\Lambda$-coalescents, were introduced by Pitman and Sagitov in 1999. These processes describe the evolution of particles that undergo stochastic coagulation in such a way that several…
$\Lambda$-coalescents model the evolution of a coalescing system in which any number of blocks randomly sampled from the whole may merge into a larger block. For the coalescent restricted to initially $n$ singletons we study the collision…
The Beta coalescents are stochastic processes modeling the genealogy of a population. They appear as the rescaled limits of the genealogical trees of numerous stochastic population models. In this article, we take interest in the number of…
We investigate random connected graphs from a block-stable class whose distribution is weighted based on the number of $2$-connected components, or blocks. This includes the class of planar graphs. For this, we develop a notion of a…
We show that the total number of collisions in the exchangeable coalescent process driven by the beta $(1,b)$ measure converges in distribution to a 1-stable law, as the initial number of particles goes to infinity. The stable limit law is…
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time…
We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…
Taylor's power law (or fluctuation scaling) states that on comparable populations, the variance of each sample is approximately proportional to a power of the mean of the population. It has been shown to hold by empirical observations in a…
One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…
We show that for all $d\in \{3,\ldots,n-1\}$ the size of the largest component of a random $d$-regular graph on $n$ vertices around the percolation threshold $p=1/(d-1)$ is $\Theta(n^{2/3})$, with high probability. This extends known…
We initiate a study of large deviations for block model random graphs in the dense regime. Following Chatterjee-Varadhan(2011), we establish an LDP for dense block models, viewed as random graphons. As an application of our result, we study…
An identifying code of a graph is a dominating set which uniquely determines all the vertices by their neighborhood within the code. Whereas graphs with large minimum degree have small domination number, this is not the case for the…
The analysis of the dynamics of a large class of excitable systems on locally tree-like networks leads to the conclusion that at $\lambda=1$ a continuous phase transition takes place, where $\lambda$ is the largest eigenvalue of the…
Structural properties of evolving random graphs are investigated. Treating linking as a dynamic aggregation process, rate equations for the distribution of node to node distances (paths) and of cycles are formulated and solved analytically.…
We propose a simple random process inducing various types of random graphs and the scale free random graphs among others. The model is of a threshold nature and differs from the preferential attachment approach discussed in the literature…
We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…
We show that in the random hyperbolic graph model as formalized by Gugelmann et al. in the most interesting range of $\frac12 < \alpha < 1$ the size of the second largest component is $\Theta((\log n)^{1/(1-\alpha)})$, thus answering a…
We consider weakly interacting jump processes on time-varying random graphs with dynamically changing multi-color edges. The system consists of a large number of nodes in which the node dynamics depends on the joint empirical distribution…
Random graphs are a central element of the study of complex dynamical networks such as the internet, the brain, or socioeconomic phenomena. New methods to generate random graphs can spawn new applications and give insights into more…
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…