GraphCombEx: A Software Tool for Exploration of Combinatorial Optimisation Properties of Large Graphs

We present a prototype of a software tool for exploration of multiple combinatorial optimisation problems in large real-world and synthetic complex networks. Our tool, called GraphCombEx (an acronym of Graph Combinatorial Explorer), provides a unified framework for scalable computation and presentation of high-quality suboptimal solutions and bounds for a number of widely studied combinatorial optimisation problems. Efficient representation and applicability to large-scale graphs and complex networks are particularly considered in its design. The problems currently supported include maximum clique, graph colouring, maximum independent set, minimum vertex clique covering, minimum dominating set, as well as the longest simple cycle problem. Suboptimal solutions and intervals for optimal objective values are estimated using scalable heuristics. The tool is designed with extensibility in mind, with the view of further problems and both new fast and high-performance heuristics to be added in the future. GraphCombEx has already been successfully used as a support tool in a number of recent research studies using combinatorial optimisation to analyse complex networks, indicating its promise as a research software tool

The Routing of Complex Contagion in Kleinberg's Small-World Networks

In Kleinberg's small-world network model, strong ties are modeled as deterministic edges in the underlying base grid and weak ties are modeled as random edges connecting remote nodes. The probability of connecting a node $u$ with node $v$ through a weak tie is proportional to $1/|uv|^\alpha$, where $|uv|$ is the grid distance between $u$ and $v$ and $\alpha\ge 0$ is the parameter of the model. Complex contagion refers to the propagation mechanism in a network where each node is activated only after $k \ge 2$ neighbors of the node are activated. In this paper, we propose the concept of routing of complex contagion (or complex routing), where we can activate one node at one time step with the goal of activating the targeted node in the end. We consider decentralized routing scheme where only the weak ties from the activated nodes are revealed. We study the routing time of complex contagion and compare the result with simple routing and complex diffusion (the diffusion of complex contagion, where all nodes that could be activated are activated immediately in the same step with the goal of activating all nodes in the end). We show that for decentralized complex routing, the routing time is lower bounded by a polynomial in $n$ (the number of nodes in the network) for all range of $\alpha$ both in expectation and with high probability (in particular, $\Omega(n^{\frac{1}{\alpha+2}})$ for $\alpha \le 2$ and $\Omega(n^{\frac{\alpha}{2(\alpha+2)}})$ for $\alpha > 2$ in expectation), while the routing time of simple contagion has polylogarithmic upper bound when $\alpha = 2$. Our results indicate that complex routing is harder than complex diffusion and the routing time of complex contagion differs exponentially compared to simple contagion at sweetspot.Comment: Conference version will appear in COCOON 201

Dynamics of bootstrap percolation

Bootstrap percolation transition may be first order or second order, or it may have a mixed character where a first order drop in the order parameter is preceded by critical fluctuations. Recent studies have indicated that the mixed transition is characterized by power law avalanches, while the continuous transition is characterized by truncated avalanches in a related sequential bootstrap process. We explain this behavior on the basis of a through analytical and numerical study of the avalanche distributions on a Bethe lattice.Comment: Proceedings of the International Workshop and Conference on Statistical Physics Approaches to Multidisciplinary Problems, IIT Guwahati, India, 7-13 January 200

Infinite-cluster geometry in central-force networks

We show that the infinite percolating cluster (with density P_inf) of central-force networks is composed of: a fractal stress-bearing backbone (Pb) and; rigid but unstressed ``dangling ends'' which occupy a finite volume-fraction of the lattice (Pd). Near the rigidity threshold pc, there is then a first-order transition in P_inf = Pd + Pb, while Pb is second-order with exponent Beta'. A new mean field theory shows Beta'(mf)=1/2, while simulations of triangular lattices give Beta'_tr = 0.255 +/- 0.03.Comment: 6 pages, 4 figures, uses epsfig. Accepted for publication in Physical Review Letter

Hysteresis in the Random Field Ising Model and Bootstrap Percolation

We study hysteresis in the random-field Ising model with an asymmetric distribution of quenched fields, in the limit of low disorder in two and three dimensions. We relate the spin flip process to bootstrap percolation, and show that the characteristic length for self-averaging $L^*$ increases as $exp(exp (J/\Delta))$ in 2d, and as $exp(exp(exp(J/\Delta)))$ in 3d, for disorder strength $\Delta$ much less than the exchange coupling J. For system size $1 << L < L^*$, the coercive field $h_{coer}$ varies as $2J - \Delta \ln \ln L$ for the square lattice, and as $2J - \Delta \ln \ln \ln L$ on the cubic lattice. Its limiting value is 0 for L tending to infinity, both for square and cubic lattices. For lattices with coordination number 3, the limiting magnetization shows no jump, and $h_{coer}$ tends to J.Comment: 4 pages, 4 figure

Splanchnic metabolism of nutrients and hormones in steers fed alfalfa under conditions of increased absorption of ammonia and L-arginine supply across the portal-drained viscera

Effects of increased ammonia and/or arginine absorption on net splanchnic (portal-drained viscera [PDV] plus liver) metabolism of nonnitrogenous nutrients and hormones in cattle were examined. Six Hereford × Angus steers (501 ± 1 kg BW) prepared with vascular catheters for measurements of net flux across the splanchnic bed were fed a 75% alfalfa:25% (as-fed basis) corn and soybean meal diet (0.523 MJ of ME/[kg BW0.75.d]) every 2 h without (27.0 g of N/kg of DM) and with 20 g of urea/kg of DM (35.7 g of N/kg of DM) in a split-plot design. Net flux measurements were made immediately before and after a 72-h mesenteric vein infusion of L-arginine (15 mmol/h). There were no treatment effects onPDVor hepaticO2 consumption. Dietary urea had no effect on splanchnic metabolism of glucose or L-lactate, but arginine infusion decreased net hepatic removal of L-lactate when urea was fed (P < 0.01). Net PDV appearance of n-butyrate was increased by arginine infusion (P < 0.07), and both dietary urea (P < 0.09) and arginine infusion (P < 0.05) increased net hepatic removal of n-butyrate. Dietary urea also increased total splanchnic acetate output (P < 0.06), tended to increase arterial glucagon concentration (P < 0.11), and decreased arterial ST concentration (P < 0.03). Arginine infusion increased arterial concentration (P < 0.07) and net PDV release (P < 0.10) and tended to increase hepatic removal (P < 0.11) of insulin, as well as arterial concentration (P < 0.01) and total splanchnic output (P < 0.01) of glucagon. Despite changes in splanchnic N metabolism, increased ammonia and arginine absorption had little measurable effect on splanchnic metabolism of glucose and other nonnitrogenous components of splanchnic energy metabolism

Magnetic order in the Ising model with parallel dynamics

It is discussed how the equilibrium properties of the Ising model are described by an Hamiltonian with an antiferromagnetic low temperature behavior if only an heat bath dynamics, with the characteristics of a Probabilistic Cellular Automaton, is assumed to determine the temporal evolution of the system.Comment: 9 pages, 3 figure

Rigidity percolation in a field

Rigidity Percolation with g degrees of freedom per site is analyzed on randomly diluted Erdos-Renyi graphs with average connectivity gamma, in the presence of a field h. In the (gamma,h) plane, the rigid and flexible phases are separated by a line of first-order transitions whose location is determined exactly. This line ends at a critical point with classical critical exponents. Analytic expressions are given for the densities n_f of uncanceled degrees of freedom and gamma_r of redundant bonds. Upon crossing the coexistence line, n_f and gamma_r are continuous, although their first derivatives are discontinuous. We extend, for the case of nonzero field, a recently proposed hypothesis, namely that the density of uncanceled degrees of freedom is a ``free energy'' for Rigidity Percolation. Analytic expressions are obtained for the energy, entropy, and specific heat. Some analogies with a liquid-vapor transition are discussed. Particularizing to zero field, we find that the existence of a (g+1)-core is a necessary condition for rigidity percolation with g degrees of freedom. At the transition point gamma_c, Maxwell counting of degrees of freedom is exact on the rigid cluster and on the (g+1)-rigid-core, i.e. the average coordination of these subgraphs is exactly 2g, although gamma_r, the average coordination of the whole system, is smaller than 2g. gamma_c is found to converge to 2g for large g, i.e. in this limit Maxwell counting is exact globally as well. This paper is dedicated to Dietrich Stauffer, on the occasion of his 60th birthday.Comment: RevTeX4, psfig, 16 pages. Equation numbering corrected. Minor typos correcte