Related papers: Renormalization group analysis of the small-world …
We have investigated the anomalous scaling behaviour of the Ising model on small-world networks based on 2- and 3-dimensional lattices using Monte Carlo simulations. Our main result is that even at low $p$, the shift in the critical…
We investigate a network model based on an infinite regular square lattice embedded in the Euclidean plane where the node connection probability is given by the geometrical distance of nodes. We show that the degree distribution in the…
We present a self consistent method based on cluster algorithms and Renormalization Group on the lattice to study critical systems numerically. We illustrate it by means of the 2D Ising model. We compute the critical exponents $\nu$ and…
Recently, Watts and Strogatz introduced the so-called small-world networks in order to describe systems which combine simultaneously properties of regular and of random lattices. In this work we study diffusion processes defined on such…
We extend the real-space renormalization group (RG) approach to the study of the energy level statistics at the integer quantum Hall (QH) transition. Previously it was demonstrated that the RG approach reproduces the critical distribution…
The transverse-field Ising models with random exchange interactions in finite dimensions are investigated by means of a real-space renormalization-group method. The scheme yields the exact values of the critical point and critical exponent…
A regular lattice in which the sites can have long range connections at a distance l with a probabilty $P(l) \sim l^{-\delta}$, in addition to the short range nearest neighbour connections, shows small-world behaviour for $0 \le \delta <…
Much of social network analysis is - implicitly or explicitly - predicated on the assumption that individuals tend to be more similar to their friends than to strangers. Thus, an observed social network provides a noisy signal about the…
The social percolation model \citep{solomon-et-00} considers a 2-dimensional regular lattice. Each site is occupied by an agent with a preference $x_{i}$ sampled from a uniform distribution $U[0,1]$. Agents transfer the information about…
Critical phenomena on scale-free networks with a degree distribution $p_k \sim k^{-\lambda}$ exhibit rich finite-size effects due to its structural heterogeneity. We systematically study the finite-size scaling of percolation and identify…
We study first- and second-order phase transitions of ferromagnetic lattice models on scale-free networks, with a degree exponent $\gamma$. Using the example of the $q$-state Potts model we derive a general self-consistency relation within…
We employ the machinery of smooth scaling and coarse-graining of observables, developed recently by us in the context of so-called fluctuation operators (inspired by prior work of Verbeure et al) to make a rigorous renormalisation group…
In this work, we have employed Monte Carlo calculations to study the Ising model on a 2D additive small-world network with long-range interactions depending on the geometric distance between interacting sites. The network is initially…
We derive a new renormalization group to calculate a non-trivial critical exponent of the divergent correlation length which gives a universality classification of essential singularities in infinite-order phase transitions. This method…
We consider random networks whose dynamics is described by a rate equation, with transition rates $w_{nm}$ that form a symmetric matrix. The long time evolution of the system is characterized by a diffusion coefficient $D$. In one dimension…
We study the contact process on a class of evolving scale-free networks, where each node updates its connections at independent random times. We give a rigorous mathematical proof that there is a transition between a phase where for all…
Real-world networks, e.g. the social relations or world-wide-web graphs, exhibit both small-world and scale-free behaviour. We interpret lattice triangulations as planar graphs by identifying triangulation vertices with graph nodes and…
Zero-range processes, in which particles hop between sites on a lattice, are closely related to equilibrium networks, in which rewiring of links take place. Both systems exhibit a condensation transition for appropriate choices of the…
We present the analytical and numerical results of a random walk on the family of small-world graphs. The average access time shows a crossover from the regular to random behavior with increasing distance from the starting point of the…
We propose a dynamical process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of individuals are linked by a short chain of acquaintances computable…