相关论文: Condensation of degrees emerging through a first-o…
Majority bootstrap percolation is a model of infection spreading in networks. Starting with a set of initially infected vertices, new vertices become infected once half of their neighbours are infected. Balogh, Bollob\'{a}s and Morris…
To depict the complex relationship among nodes and the evolving process of a complex system, a Bose-Einstein hypernetwork is proposed in this paper. Based on two basic evolutionary mechanisms, growth and preference jumping, the distribution…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
We analyze the component evolution in inhomogeneous random intersection graphs when the average degree is close to 1. As the average degree increases, the size of the largest component in the random intersection graph goes through a phase…
We consider the degree distributions of preferential attachment random graph models with choice similar to those considered in recent work by Malyshkin and Paquette and Krapivsky and Redner. In these models a new vertex chooses $r$ vertices…
Condensation is the phenomenon whereby one of a sum of random variables contributes a finite fraction to the sum. It is manifested as an aggregation phenomenon in diverse physical systems such as coalescence in granular media, jamming in…
We study the evolution of the dynamics across a generic first order quantum phase transition in an interacting boson model of nuclei. The dynamics inside the phase coexistence region exhibits a very simple pattern. A classical analysis…
A single permutation, seen as union of disjoint cycles, represents a regular graph of degree two. Consider $d$ many independent random permutations and superimpose their graph structures. It is a common model of a random regular (multi-)…
Random graph models have played a dominant role in the theoretical study of networked systems. The Poisson random graph of Erdos and Renyi, in particular, as well as the so-called configuration model, have served as the starting point for…
Condensation phenomena are ubiquitous in nature and are found in condensed matter, disordered systems, networks, finance, etc. In the present work we investigate one of the best frameworks in which condensation phenomena take place, namely,…
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…
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…
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…
The problem of aligning Erd\"os-R\'enyi random graphs is a noisy, average-case version of the graph isomorphism problem, in which a pair of correlated random graphs is observed through a random permutation of their vertices. We study a…
In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…
We study a simple model of dynamic networks, characterized by a set preferred degree, $\kappa$. Each node with degree $k$ attempts to maintain its $\kappa$ and will add (cut) a link with probability $w(k;\kappa)$ ($1-w(k;\kappa)$). As a…
Recent studies have indicated that the coarse grained dynamics of a large class of traffic models and driven-diffusive systems may be described by urn models. We consider a class of one-dimensional urn models whereby particles hop from an…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
We investigate spatial random graphs defined on the points of a Poisson process in $d$-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point is assigned an independent weight. Given the…