Related papers: Erdos-Renyi random graphs + forest fires = self-or…
Despite the recently exhibited importance of higher-order interactions for various processes, few flexible (null) models are available. In particular, most studies on hypergraphs focus on a small set of theoretical models. Here, we…
Random dynamical systems (RDS) evolve by a dynamical rule chosen independently with a certain probability, from a given set of deterministic rules. These dynamical systems in an interval reach a steady state with a unique well-defined…
We consider the canonical ensemble of $N$-vertex Erd\H{o}s-R\'enyi (ER) random topological graphs with quenched vertex degree, and with fugacity $\mu$ for each closed triple of bonds. We claim complete defragmentation of large-$N$ graphs…
We study the contact process on random graphs with low infection rate $\lambda$. For random $d$-regular graphs, it is known that the survival time is $O(\log n)$ below the critical $\lambda_c$. By contrast, on the Erd\H{o}s-R\'enyi random…
We consider a system of independent branching random walks on $\R$ which start off a Poisson point process with intensity of the form $e_{\lambda}(du)=e^{-\lambda u}du$, where $\lambda\in\R$ is chosen in such a way that the overall…
The sun provides an explosive, heavenly example of self-organized criticality. Sudden bursts of intense radiation emanate from rapid rearrangements of the magnetic field network in the corona. Avalanches are triggered by loops of flux that…
We extend the well-known Cont-Bouchaud model to include a hierarchical topology of agent's interactions. The influence of hierarchy on system dynamics is investigated by two models. The first one is based on a multi-level, nested…
A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this paper a model is developed in…
Consider a rooted $N$-ary tree. To every vertex of this tree, we attach an i.i.d. continuous random variable. A vertex is called accessible if along its ancestral line, the attached random variables are increasing. We keep accessible…
Two different models exhibiting self-organized criticality are analyzed by means of the dynamic renormalization group. Although the two models differ by their behavior under a parity transformation of the order parameter, it is shown that…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
We study the antiferromagnetic Potts model on the Poissonian Erd\"os-R\'enyi random graph. By identifying a suitable interpolation structure and an extended variational principle, together with a positive temperature second-moment analysis…
With a simple model, we study the evolution of random networks under attack and reconstruction. We introduce a new quality, invulnerability I(s), to describe the stability of the system. We find that the network can evolve to a stationary…
We consider the extinction time of the contact process on increasing sequences of finite graphs obtained from a variety of random graph models. Under the assumption that the infection rate is above the critical value for the process on the…
We consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erdos-Renyi random graphs, vertex random graphs are generalizations of geometric random graphs, and…
We analyze some local properties of sparse Erdos-Renyi graphs, where $d(n)/n$ is the edge probability. In particular we study the behavior of very short paths. For $d(n)=n^{o(1)}$ we show that $G(n,d(n)/n)$ has asymptotically almost surely…
The energy level statistics of uniform random graphs are studied, by treating the graphs as random tight-binding lattices. The inherent random geometry of the graphs and their dynamical spatial dimensionality, leads to various quantum…
We analyze maximum entropy random graph ensembles with constrained degrees, drawn from arbitrary degree distributions, and a tuneable number of 3-loops (triangles). We find that such ensembles generally exhibit two transitions, a clustering…
Bayesian network models (Erdos Renyi, stochastic block models, random dot product graphs, graphons) are widely used in neuroscience, epidemiology, and the social sciences, yet real networks are sparse, heterogeneous, and exhibit…
Avalanches in mean-field models can be mapped to memoryless branching processes defining a universality class. We present a reduced expression mapping a broad family of critical and subcriticial avalanches in mean-field models at the…