Colouring random graphs and maximising local diversity

We study a variation of the graph colouring problem on random graphs of finite average connectivity. Given the number of colours, we aim to maximise the number of different colours at neighbouring vertices (i.e. one edge distance) of any vertex. Two efficient algorithms, belief propagation and Walksat are adapted to carry out this task. We present experimental results based on two types of random graphs for different system sizes and identify the critical value of the connectivity for the algorithms to find a perfect solution. The problem and the suggested algorithms have practical relevance since various applications, such as distributed storage, can be mapped onto this problem.Comment: 10 pages, 10 figure

From one solution of a 3-satisfiability formula to a solution cluster: Frozen variables and entropy

A solution to a 3-satisfiability (3-SAT) formula can be expanded into a cluster, all other solutions of which are reachable from this one through a sequence of single-spin flips. Some variables in the solution cluster are frozen to the same spin values by one of two different mechanisms: frozen-core formation and long-range frustrations. While frozen cores are identified by a local whitening algorithm, long-range frustrations are very difficult to trace, and they make an entropic belief-propagation (BP) algorithm fail to converge. For BP to reach a fixed point the spin values of a tiny fraction of variables (chosen according to the whitening algorithm) are externally fixed during the iteration. From the calculated entropy values, we infer that, for a large random 3-SAT formula with constraint density close to the satisfiability threshold, the solutions obtained by the survey-propagation or the walksat algorithm belong neither to the most dominating clusters of the formula nor to the most abundant clusters. This work indicates that a single solution cluster of a random 3-SAT formula may have further community structures.Comment: 13 pages, 6 figures. Final version as published in PR

Focused Local Search for Random 3-Satisfiability

A local search algorithm solving an NP-complete optimisation problem can be viewed as a stochastic process moving in an 'energy landscape' towards eventually finding an optimal solution. For the random 3-satisfiability problem, the heuristic of focusing the local moves on the presently unsatisfiedclauses is known to be very effective: the time to solution has been observed to grow only linearly in the number of variables, for a given clauses-to-variables ratio $\alpha$ sufficiently far below the critical satisfiability threshold $\alpha_c \approx 4.27$. We present numerical results on the behaviour of three focused local search algorithms for this problem, considering in particular the characteristics of a focused variant of the simple Metropolis dynamics. We estimate the optimal value for the ``temperature'' parameter $\eta$ for this algorithm, such that its linear-time regime extends as close to $\alpha_c$ as possible. Similar parameter optimisation is performed also for the well-known WalkSAT algorithm and for the less studied, but very well performing Focused Record-to-Record Travel method. We observe that with an appropriate choice of parameters, the linear time regime for each of these algorithms seems to extend well into ratios $\alpha > 4.2$ -- much further than has so far been generally assumed. We discuss the statistics of solution times for the algorithms, relate their performance to the process of ``whitening'', and present some conjectures on the shape of their computational phase diagrams.Comment: 20 pages, lots of figure

Fairness for Cooperative Multi-Agent Learning with Equivariant Policies

We study fairness through the lens of cooperative multi-agent learning. Our work is motivated by empirical evidence that naive maximization of team reward yields unfair outcomes for individual team members. To address fairness in multi-agent contexts, we introduce team fairness, a group-based fairness measure for multi-agent learning. We then incorporate team fairness into policy optimization -- introducing Fairness through Equivariance (Fair-E), a novel learning strategy that achieves provably fair reward distributions. We then introduce Fairness through Equivariance Regularization (Fair-ER) as a soft-constraint version of Fair-E and show that Fair-ER reaches higher levels of utility than Fair-E and fairer outcomes than policies with no equivariance. Finally, we investigate the fairness-utility trade-off in multi-agent settings.Comment: 15 pages, 4 figure

Lifelongα-tocopherol supplementation increases the median life span of C57BL/6 mice in the cold but has only minor effects on oxidative damage

The effects of dietary antioxidant supplementation on oxidative stress and life span are confused. We maintained C57BL/6 mice at 7 ± 2°C and supplemented their diet with α-tocopherol from 4 months of age. Supplementation significantly increased (p = 0.042) median life span by 15% (785 days, n = 44) relative to unsupplemented controls (682 days, n = 43) and also increased maximum life span (oldest 10%, p = 0.028). No sex or sex by treatment interaction effects were observed on life span, with treatment having no effect on resting or daily metabolic rate. Lymphocyte and hepatocyte oxidative DNA damage and hepatic lipid peroxidation were unaffected by supplementation, but hepatic oxidative DNA damage increased with age. Using a cDNA macroarray, genes associated with xenobiotic metabolism were significantly upregulated in the livers of female mice at 6 months of age (2 months supplementation). At 22 months of age (18 months supplementation) this response had largely abated, but various genes linked to the p21 signaling pathway were upregulated at this time. We suggest that α-tocopherol may initially be metabolized as a xenobiotic, potentially explaining why previous studies observe a life span extension generally when lifelong supplementation is initiated early in life. The absence of any significant effect on oxidative damage suggests that the life span extension observed was not mediated via any antioxidant properties of α-tocopherol. We propose that the life span extension observed following α-tocopherol supplementation may be mediated via upregulation of cytochrome p450 genes after 2 months of supplementation and/or upregulation of p21 signaling genes after 18 months of supplementation. However, these signaling pathways now require further investigation to establish their exact role in life span extension following α-tocopherol supplementation

Assessment of Pro Hepcidin and Related with Iron Profile on Hemodialysis Men Patients

Patients with renal failure in the final stages undergo the treatment by hemodialysis. Hemodialysis is used to reinstate the intracellular and extracellular fluid environment, by propagation of molecules in solution through a semipermeable membrane along an electrochemical concentration gradient. Blood catching in the dialysis machine and the recurrent phlebotomy may lead to losing about 1-3 g of iron per year. Prohepcidin hormone is an acute phase protein (type II) that plays a major role in the systemic iron irregularities as it is a mediator of anemia in inflammation and regulator of iron metabolism. This study aims to evaluate the effect of hemodialysis on iron hemostasis and its relationship with prohepcidin as an inflammatory marker. This study includes forty four adult male patients with end-stage renal failure (in pre and post –treated) by means of chronic hemodialysis-HD with mean age (53.27 ± 13.76 years). The following biochemical investigations have been studied: Prohepcidin, Iron, Ferritin, Transferrin, Total Iron-Binding Capacity (TIBC), The Unsaturated Total Iron Binding Capacity (UIBC), and transferrin saturation (TAST).Decrement of Prohepcidin level on hemodialysis patients in post dialysis with non-significantly compared to pre dialysis, while iron and ferritin was increment in post treated than pre- treated with non-significantly.Hemodialysis affects Prohepcidin levels as it was long duration and Glomerular Filtration rate GFR (cock croft equation) and prohepcidin level affect the iron profile related with the iron store depletion

The Complexity of Finding Reset Words in Finite Automata

We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word has length k is complete for the complexity class DP. This result answers a question posed by Volkov. For the search problems of finding a shortest reset word and the length of a shortest reset word, we establish membership in the complexity classes FP^NP and FP^NP[log], respectively. Moreover, we show that both these problems are hard for FP^NP[log]. Finally, we observe that computing a reset word of a given length is FNP-complete.Comment: 16 pages, revised versio