We study spatial embeddings of random graphs in which nodes are randomly distributed in geographical space. We let the edge probability between any two nodes to be dependent on the spatial distance between them and demonstrate that this model captures many generic properties of social networks,...

Betweenness measures provide quantitative tools to pick out fine details from the massive amount of interaction data that is available from large complex networks. They allow us to study the extent to which a node takes part when information is passed around the network. Nodes with high...

Clusters of parallel spins in the square-lattice Ising model are defined as groups of traders acting together on the Cont-Bouchaud stock market model. As in the random percolation case, we see a crossover from a power-law behaviour to a more Gaussian distribution for the market fluctuations.

We present a complete analytical solution of a system of Potts spins on a random k-regular graph in both the canonical and microcanonical ensembles, using the Large Deviation Cavity Method (LDCM). The solution is shown to be composed of three different branches, resulting in a non-concave...

We investigate the finite size corrections to the equilibrium magnetization of an Ising model on a random graph with N nodes and Nγ edges, with 1γ≤2. By conveniently rescaling the coupling constant, the free energy is made extensive. As expected, the system displays a phase transition of the...

Most real-world networks exhibit a high clustering coefficient—the probability that two neighbors of a node are also neighbors of each other. We propose two algorithms, Conf and Throw, that take triangle and single edge degree sequences as input and generate a random graph with a target...

A preferential attachment model for a growing network incorporating the deletion of edges is studied and the expected asymptotic degree distribution is analyzed. At each time step t=1,2,…, with probability π10 a new vertex with one edge attached to it is added to the network and the edge is...

We consider the coherent exciton transport, modeled by continuous-time quantum walks, on Erdös–Rény graphs in the presence of a random distribution of traps. The role of trap concentration and of the substrate dilution is deepened showing that, at long times and for intermediate degree of...

The “clumpiness” matrix of a network is used to develop a method to identify its community structure. A “projection space” is constructed from the eigenvectors of the clumpiness matrix and a border line is defined using some kind of angular distance in this space. The community structure...

We discuss various ensembles of homogeneous complex networks and a Monte-Carlo method of generating graphs from these ensembles. The method is quite general and can be applied to simulate micro-canonical, canonical or grand-canonical ensembles for systems with various statistical weights. It can...