Sampling in Potts Model on Sparse Random Graphs

We study the problem of sampling almost uniform proper q-colorings in sparse Erdos-Renyi random graphs G(n,d/n), a research initiated by Dyer, Flaxman, Frieze and Vigoda [Dyer et al., RANDOM STRUCT ALGOR, 2006]. We obtain a fully polynomial time almost uniform sampler (FPAUS) for the problem provided q>3d+4, improving the current best bound q>5.5d [Efthymiou, SODA, 2014]. Our sampling algorithm works for more generalized models and broader family of sparse graphs. It is an efficient sampler (in the same sense of FPAUS) for anti-ferromagnetic Potts model with activity 03(1-b)d+4. We further identify a family of sparse graphs to which all these results can be extended. This family of graphs is characterized by the notion of contraction function, which is a new measure of the average degree in graphs

Approximate Counting via Correlation Decay on Planar Graphs

We show for a broad class of counting problems, correlation decay (strong spatial mixing) implies FPTAS on planar graphs. The framework for the counting problems considered by us is the Holant problems with arbitrary constant-size domain and symmetric constraint functions. We define a notion of regularity on the constraint functions, which covers a wide range of natural and important counting problems, including all multi-state spin systems, counting graph homomorphisms, counting weighted matchings or perfect matchings, the subgraphs world problem transformed from the ferromagnetic Ising model, and all counting CSPs and Holant problems with symmetric constraint functions of constant arity. The core of our algorithm is a fixed-parameter tractable algorithm which computes the exact values of the Holant problems with regular constraint functions on graphs of bounded treewidth. By utilizing the locally tree-like property of apex-minor-free families of graphs, the parameterized exact algorithm implies an FPTAS for the Holant problem on these graph families whenever the Gibbs measure defined by the problem exhibits strong spatial mixing. We further extend the recursive coupling technique to Holant problems and establish strong spatial mixing for the ferromagnetic Potts model and the subgraphs world problem. As consequences, we have new deterministic approximation algorithms on planar graphs and all apex-minor-free graphs for several counting problems

A minimal model of peripheral clocks reveals differential circadian re-entrainment in aging

The mammalian circadian system comprises a network of cell-autonomous oscillators, spanning from the central clock in the brain to peripheral clocks in other organs. These clocks are tightly coordinated to orchestrate rhythmic physiological and behavioral functions. Dysregulation of these rhythms is a hallmark of aging, yet it remains unclear how age-related changes lead to more easily disrupted circadian rhythms. Using a two-population model of coupled oscillators that integrates the central clock and the peripheral clocks, we derive simple mean-field equations that can capture many aspects of the rich behavior found in the mammalian circadian system. We focus on three age-associated effects which have been posited to contribute to circadian misalignment: attenuated input from the sympathetic pathway, reduced responsiveness to light, and a decline in the expression of neurotransmitters. We find that the first two factors can significantly impede re-entrainment of the clocks following a perturbation, while a weaker coupling within the central clock does not affect the recovery rate. Moreover, using our minimal model, we demonstrate the potential of using the feed-fast cycle as an effective intervention to accelerate circadian re-entrainment. These results highlight the importance of peripheral clocks in regulating the circadian rhythm and provide fresh insights into the complex interplay between aging and the resilience of the circadian system

Automated Integration of Infrastructure Component Status for Real-Time Restoration Progress Control: Case Study of Highway System in Hurricane Harvey

Following extreme events, efficient restoration of infrastructure systems is critical to sustaining community lifelines. During the process, effective monitoring and control of the infrastructure restoration progress is critical. This research proposes a systematic approach that automatically integrates component-level restoration status to achieve real-time forecasting of overall infrastructure restoration progress. In this research, the approach is mainly designed for transportation infrastructure restoration following Hurricane Harvey. In detail, the component-level restoration status is linked to the restoration progress forecasting through network modeling and earned value method. Once the new component restoration status is collected, the information is automatically integrated to update the overall restoration progress forecasting. Academically, an approach is proposed to automatically transform the component-level restoration information to overall restoration progress. In practice, the approach expects to ease the communication and coordination efforts between emergency managers, thereby facilitating timely identification and resolution of issues for rapid infrastructure restoration

Complex Network Classification with Convolutional Neural Network

Classifying large scale networks into several categories and distinguishing them according to their fine structures is of great importance with several applications in real life. However, most studies of complex networks focus on properties of a single network but seldom on classification, clustering, and comparison between different networks, in which the network is treated as a whole. Due to the non-Euclidean properties of the data, conventional methods can hardly be applied on networks directly. In this paper, we propose a novel framework of complex network classifier (CNC) by integrating network embedding and convolutional neural network to tackle the problem of network classification. By training the classifiers on synthetic complex network data and real international trade network data, we show CNC can not only classify networks in a high accuracy and robustness, it can also extract the features of the networks automatically