Related papers: On the evolution of scale-free graphs
Recently, the scaling limit of cluster sizes for critical inhomogeneous random graphs of rank-1 type having finite variance but infinite third moment degrees was obtained (see previous work by Bhamidi, van der Hofstad and van Leeuwaarden).…
We extend the latent position random graph model to the line graph of a random graph, which is formed by creating a vertex for each edge in the original random graph, and connecting each pair of edges incident to a common vertex in the…
Connectivity correlations play an important role in the structure of scale-free networks. While several empirical studies exist, there is no general theoretical analysis that can explain the largely varying behavior of real networks. Here,…
We present a new family of graphs with remarkable properties. They are obtained by connecting the points of a random walk when their distance is smaller than a given scale. Their degree (number of neighbors) does not depend on the graph's…
We investigate the triggering of star formation and the formation of stellar clusters in molecular clouds that form as the ISM passes through spiral shocks. The spiral shock compresses gas into $\sim$100 pc long main star formation ridge,…
We study the typical structure and the number of triangle-free graphs with $n$ vertices and $m$ edges where $m$ is large enough so that a typical triangle-free graph has a cut containing nearly all of its edges, but may not be bipartite.…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
We investigate a system of interacting clusters evolving through mass exchange and supplemented by input of small clusters. Three possibilities depending on the rate of exchange generically occur when input is homogeneous: continuous…
We consider a large class of spatially-embedded random graphs that includes among others long-range percolation, continuum scale-free percolation and the age-dependent random connection model. We assume that the model is supercritical:…
Two distinct distribution functions $P_{sp}(m)$ and $P_{ns}(m)$ of the scaled largest cluster sizes $m$ are obtained at the percolation threshold by numerical simulations, depending on the condition whether the lattice is actually spanned…
Many networks exhibit scale free behavior where their degree distribution obeys a power law for large vertex degrees. Models constructed to explain this phenomena have relied on preferential attachment where the networks grow by the…
This paper introduces a novel technique to track structures in time evolving graphs. The method is based on a parameter free approach for three-dimensional co-clustering of the source vertices, the target vertices and the time. All these…
Using each node's degree as a proxy for its importance, the topological hierarchy of a complex network is introduced and quantified. We propose a simple dynamical process used to construct networks which are either maximally or minimally…
In this paper we examine the percolation properties of higher-order networks that have non-trivial clustering and subgraph-based assortative mixing (the tendency of vertices to connect to other vertices based on subgraph joint degree). Our…
We present an algorithm to grow a graph with scale-free structure of {\it in-} and {\it out-links} and variable wiring diagram in the class of the world-wide Web. We then explore the graph by intentional random walks using local…
Scale-free dynamics in physical and biological systems can arise from a variety of causes. Here, we explore a branching process which leads to such dynamics. We find conditions for the appearance of power laws and study quantitatively what…
Transient dynamics leading to the synchrony of pulse-coupled oscillators has previously been studied as an aggregation process of synchronous clusters, and a rate equation for the cluster size distribution has been proposed. However, the…
Graph generation is one of the most challenging tasks in recent years, and its core is to learn the ground truth distribution hiding in the training data. However, training data may not be available due to security concerns or unaffordable…
Clusters formed by fluctuations of two-dimensional (2D) directed interfaces around a threshold level have been extensively studied at equilibrium and in nonequilibrium steady states, but their coarsening dynamics remain poorly understood.…
An analytical approach to calculating bond percolation thresholds, sizes of $k$-cores, and sizes of giant connected components on structured random networks with non-zero clustering is presented. The networks are generated using a…