Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOptimal Vertex Cover for the Small-World Hanoi Networks
146
0
0.0
(
0
)
Authors
S. Boettcher
Ask ChatGPT about the research
No Arabic abstract
The vertex-cover problem on the Hanoi networks HN3 and HN5 is analyzed with an exact renormalization group and parallel-tempering Monte Carlo simulations. The grand canonical partition function of the equivalent hard-core repulsive lattice-gas problem is recast first as an Ising-like canonical partition function, which allows for a closed set of renormalization group equations. The flow of these equations is analyzed for the limit of infinite chemical potential, at which the vertex-cover problem is attained. The relevant fixed point and its neighborhood are analyzed, and non-trivial results are obtained both, for the coverage as well as for the ground state entropy density, which indicates the complex structure of the solution space. Using special hierarchy-dependent operators in the renormalization group and Monte-Carlo simulations, structural details of optimal configurations are revealed. These studies indicate that the optimal coverages (or packings) are not related by a simple symmetry. Using a clustering analysis of the solutions obtained in the Monte Carlo simulations, a complex solution space structure is revealed for each system size. Nevertheless, in the thermodynamic limit, the solution landscape is dominated by one huge set of very similar solutions.
rate research
Read More
It was recently claimed that on d-dimensional small-world networks with a density p of shortcuts, the typical separation s(p) ~ p^{-1/d} between shortcut-ends is a characteristic length for shortest-paths{cond-mat/9904419}. This contradicts an earlier argument suggesting that no finite characteristic length can be defined for bilocal observables on these systems {cont-mat/9903426}. We show analytically, and confirm by numerical simulation, that shortest-path lengths ell(r) behave as ell(r) ~ r for r < r_c, and as ell(r) ~ r_c for r > r_c, where r is the Euclidean separation between two points and r_c(p,L) = p^{-1/d} log(L^dp) is a characteristic length. This shows that the mean separation s between shortcut-ends is not a relevant length-scale for shortest-paths. The true characteristic length r_c(p,L) diverges with system size L no matter the value of p. Therefore no finite characteristic length can be defined for small-world networks in the thermodynamic limit.
We study the thermodynamic properties of spin systems on small-world hypergraphs, obtained by superimposing sparse Poisson random graphs with p-spin interactions onto a one-dimensional Ising chain with nearest-neighbor interactions. We use replica-symmetric transfer-matrix techniques to derive a set of fixed-point equations describing the relevant order parameters and free energy, and solve them employing population dynamics. In the special case where the number of connections per site is of the order of the system size we are able to solve the model analytically. In the more general case where the number of connections is finite we determine the static and dynamic ferromagnetic-paramagnetic transitions using population dynamics. The results are tested against Monte-Carlo simulations.
Two new classes of networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They consist of a one-dimensional lattice backbone overlayed by a hierarchical sequence of long-distance links. Both types of networks, one 3-regular and the other 4-regular, lead to distinct behaviors, as revealed by renormalization group studies. The 3-regular networks are planar, have a diameter growing as sqrt{N} with the system size N, and lead to super-diffusion with an exact, anomalous exponent d_w=1.3057581..., but possesses only a trivial fixed point T_c=0 for the Ising ferromagnet. In turn, the 4-regular networks are non-planar, have a diameter growing as ~2^[sqrt(log_2 N^2)], exhibit ballistic diffusion (d_w=1), and a non-trivial ferromagnetic transition, T_c>0. It suggest that the 3-regular networks are still quite geometric, while the 4-regular networks qualify as true small-world networks with mean-field properties. As an example of an application we discuss synchronization of processors on these networks.
We apply a novel method (presented in part I) to solve several small-world models for which the method can be applied analytically: the Viana-Bray model (which can be seen as a 0 or infinite dimensional small-world model), the one-dimensional chain small-world model, and the small-world spherical model in generic dimension. In particular, we analyze in detail the one-dimensional chain small-world model with negative short-range coupling showing that in this case, besides a second-order spin glass phase transition, there are two critical temperatures corresponding to first- or second-order phase transitions.
We present, as a very general method, an effective field theory to analyze models defined over small-world networks. Even if the exactness of the method is limited to the paramagnetic regions and to some special limits, it gives the exact critical behavior and the exact critical surfaces and percolation thresholds, and provide a clear and immediate (also in terms of calculation) insight of the physics. The underlying structure of the non random part of the model, i.e., the set of spins staying in a given lattice L_0 of dimension d_0 and interacting through a fixed coupling J_0, is exactly taken into account. When J_0geq 0, the small-world effect gives rise to the known fact that a second order phase transition takes place, independently of the dimension d_0 and of the added random connectivity c. However, when J_0<0, a completely different scenario emerges where, besides a spin glass transition, multiple first- and second-order phase transitions may take place.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
