New Results of the Color Diversity Problem Jack Raymond (英偉文) and K. Y

Slides:



Advertisements
Similar presentations
Advanced Topics in Algorithms and Data Structures Lecture 7.2, page 1 Merging two upper hulls Suppose, UH ( S 2 ) has s points given in an array according.
Advertisements

Optimization in mean field random models Johan Wästlund Linköping University Sweden.
School of Information University of Michigan Network resilience Lecture 20.
Classification and Decision Boundaries
SASH Spatial Approximation Sample Hierarchy
Combinatorial optimization and the mean field model Johan Wästlund Chalmers University of Technology Sweden.
Regulatory Network (Part II) 11/05/07. Methods Linear –PCA (Raychaudhuri et al. 2000) –NIR (Gardner et al. 2003) Nonlinear –Bayesian network (Friedman.
Frequency-locking and pattern formation in the Kuramoto model with Manhattan delay Karol Trojanowski, Lech Longa Jagiellonian University Institute of Physics,
Polymer physics for route optimisation on the London underground Bill C. H. Yeung*, David Saad* and K.Y Michael Wong # *Nonlinearity and Complexity Research.
Integrated Social and Quality of Service Trust Management of Mobile Groups in Ad Hoc Networks Ing-Ray Chen, Jia Guo, Fenye Bao, Jin-Hee Cho Communications.
Relating computational and physical complexity Computational complexity: How the number of computational steps needed to solve a problem scales with problem.
Superglasses and the nature of disorder-induced SI transition
2 Introduction: phase transition phenomena Phase transition: qualitative change as a parameter crosses threshold Matter temperature magnetism demagnetism.
Shai Carmi Bar-Ilan, BU Together with: Shlomo Havlin, Chaoming Song, Kun Wang, and Hernan Makse.
Efficient Gathering of Correlated Data in Sensor Networks
Network Economics: two examples Marc Lelarge (INRIA-ENS) SIGMETRICS, London June 14, 2012.
Summary: Isolated Systems, Temperature, Free Energy Zhiyan Wei ES 241: Advanced Elasticity 5/20/2009.
Outline Review of extended ensemble methods (multi-canonical, Wang-Landau, flat-histogram, simulated tempering) Replica MC Connection to parallel tempering.
Proving Non-Reconstruction on Trees by an Iterative Algorithm Elitza Maneva University of Barcelona joint work with N. Bhatnagar, Hebrew University.
Percolation in self-similar networks Dmitri Krioukov CAIDA/UCSD M. Á. Serrano, M. Boguñá UNT, March 2011.
Dynamical Replica Theory for Dilute Spin Systems Jon Hatchett RIKEN BSI In collaboration with I. Pérez Castillo, A. C. C. Coolen & N. S. Skantzos.
1 Worm Algorithms Jian-Sheng Wang National University of Singapore.
Thermodynamics and dynamics of systems with long range interactions David Mukamel S. Ruffo, J. Barre, A. Campa, A. Giansanti, N. Schreiber, P. de Buyl,
Generative Topographic Mapping by Deterministic Annealing Jong Youl Choi, Judy Qiu, Marlon Pierce, and Geoffrey Fox School of Informatics and Computing.
On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing Argyrios Tasiopoulos MSc, student, AUEB Master Thesis presentation.
Glass Phenomenology from the connection to spin glasses: review and ideas Z.Nussinov Washington University.
International Workshop on Complex Networks, Seoul (23-24 June 2005) Vertex Correlations, Self-Avoiding Walks and Critical Phenomena on the Static Model.
Local Theory of BER for LDPC Codes: Instantons on a Tree Vladimir Chernyak Department of Chemistry Wayne State University In collaboration with: Misha.
自旋玻璃与消息传递算法 Spin Glass and Message-Passing Algorithms 周海军 中国科学院理论物理研究所.
Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.
Entropy and temperature Fundamental assumption : an isolated system (N, V and U and all external parameters constant) is equally likely to be in any of.
4  The Simplex Method: Standard Maximization Problems  The Simplex Method: Standard Minimization Problems  The Simplex Method: Nonstandard Problems.
Optimal Sampling Strategies for Multiscale Stochastic Processes Vinay Ribeiro Rolf Riedi, Rich Baraniuk (Rice University)
Workshop on Optimization in Complex Networks, CNLS, LANL (19-22 June 2006) Application of replica method to scale-free networks: Spectral density and spin-glass.
A Frequency-weighted Kuramoto Model Lecturer: 王瀚清 Adaptive Network and Control Lab Electronic Engineering Department of Fudan University.
KPS 2007 (April 19, 2007) On spectral density of scale-free networks Doochul Kim (Department of Physics and Astronomy, Seoul National University) Collaborators:
13. Extended Ensemble Methods. Slow Dynamics at First- Order Phase Transition At first-order phase transition, the longest time scale is controlled by.
On Reducing Mesh Delay for Peer- to-Peer Live Streaming Dongni Ren, Y.-T. Hillman Li, S.-H. Gary Chan Department of Computer Science and Engineering The.
1 Series Expansion in Nonequilibrium Statistical Mechanics Jian-Sheng Wang Dept of Computational Science, National University of Singapore.
@ 15/7/2003 Tokyo Institute of Technology 1 Propagating beliefs in spin- glass models Yoshiyuki Kabashima Dept. of Compt. Intel. & Syst.
CSC321: Introduction to Neural Networks and Machine Learning Lecture 15: Mixtures of Experts Geoffrey Hinton.
Bushy Binary Search Tree from Ordered List. Behavior of the Algorithm Binary Search Tree Recall that tree_search is based closely on binary search. If.
Distributed, Self-stabilizing Placement of Replicated Resources in Emerging Networks Bong-Jun Ko, Dan Rubenstein Presented by Jason Waddle.
Long-Range Frustration among Unfrozen Vertices in the Ground-State Configurations of a Spin-Glass System Haijun Zhou 海军 周 Institute of Theoretical Physics,
ICTP School and Workshop on Structure and Function of complex Networks (16-28 May 2005) Structural correlations and critical phenomena of random scale-free.
Networks interacting with matter Bartlomiej Waclaw Jagellonian University, Poland and Universität Leipzig, Germany.
Prediction of Interconnect Net-Degree Distribution Based on Rent’s Rule Tao Wan and Malgorzata Chrzanowska- Jeske Department of Electrical and Computer.
Mingze Zhang, Mun Choon Chan and A. L. Ananda School of Computing
Gibbs-Duhem and the Chemical Potential of Ideal Solutions
Chapter 2 Review Chapter 2 has taken a long time… you might want to get out your notes and a book to refer to 
Biointelligence Laboratory, Seoul National University
Statistical-Mechanical Approach to Probabilistic Image Processing -- Loopy Belief Propagation and Advanced Mean-Field Method -- Kazuyuki Tanaka and Noriko.
CSC321 Lecture 18: Hopfield nets and simulated annealing
Jamming at High Densities
Analysis of Node Localizability in Wireless Ad-hoc Networks
Surviving Holes and Barriers in Geographic Data Reporting for
Nithin Michael, Yao Wang, G. Edward Suh and Ao Tang Cornell University
ISP and Egress Path Selection for Multihomed Networks
Degree and Eigenvector Centrality
Effective Social Network Quarantine with Minimal Isolation Costs
NanoBPM Status and Multibunch Mark Slater, Cambridge University
Department of Computer Science University of York
REDUCESEARCH Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations Bart M. P. Jansen Astrid Pieterse ESA 2018 August.
COSC 4335: Other Classification Techniques
Phase Transitions in Biological Systems with Many Components
ERROR ENTROPY, CORRENTROPY AND M-ESTIMATION
Other Classification Models: Support Vector Machine (SVM)
Lecture 21 Network evolution
Adaptive Cooperative Systems Chapter 3 Coperative Lattice Systems
“Traditional” image segmentation
Presentation transcript:

New Results of the Color Diversity Problem Jack Raymond (英偉文) and K. Y New Results of the Color Diversity Problem Jack Raymond (英偉文) and K. Y. Michael Wong (王國彝) Hong Kong University of Science and Technology (1) Wong & Saad, J. Phys. A 41, 324023 (2008) (2) Raymond & Wong, to be published (2012)

Acknowledgement: Supported by the Research Grant Council of Hong Kong (grant numbers 604008 and 605010).

Outline Color diversity problem Cavity method Paramagnetic-glass transition Special ratios The many-state physical picture Conclusions

A Famous Problem How many colors are needed to color a map, so that all neighboring regions have different colors?

The Color Diversity Problem Task: maximize the number of colors within one link-distance of any node Compared with the graph coloring problem, one needs to consider next-nearest neighbor effects. When the connectivity increases, a phase transition from incomplete to complete phase takes place in large networks. Example: Q = 4 Fully diversified Not diversified enough

Applications Distributed data storage Files are divided into segments distributed over the network. Nodes requesting a file collect the required segments from neighboring nodes. If the neighborhood is not diversified enough, the left-out segments have to be retrieved from afar.

Phase Transitions There are parameter regions where all constraints can be satisfied, and there are parameter regions where the violation of constraints becomes unavoidable. When the connectivity changes, a phase transition from unsatisfied to satisfied phase takes place in large networks.

Linear Connectivity To study phase transitions, we consider ensembles of graphs with a linear mixture of two consecutive values of connectivity. For example, when C = 3.8, the fraction of nodes with connectivity 4 is 0.8, and the fraction of nodes with connectivity 3 is 0.2.

Simulations for 4 Colors Walksat [Bounkong et al, PRE 74, 057101 (2006)] Phase transition at C around and above 3.8 Slow convergence at C immediately below 3.8

Formulation Given a network with N nodes. Color of node i is qi = 1, …, Q. Minimize the energy For example, the colors of node i and its neighbors are g, b, b, b, y

Antiferromagnetism The quadratic cost function tends to equalize the colors around the neighborhood of a node. It is equivalent to the antiferromagnetic model (apart from constant factors) An auxiliary cost function is However, this cost function is less robust against noise disrupting the colors of the neighbors. Nearest neighbor (nn) Next nearest neighbor (nnn) Color count

The Cavity Method = k1 k2 b Fij(a,b) a i j q1 q2 Fjk1(b,q1) Fjk2(b,q2) In sparse networks, the neighborhood of a node is locally a tree. Each generation has C  1 branches. Consider the free energy of a tree when the colors of the vertex j and its ancestor i are b and a respectively. The free energy Fij(a,b) can be expressed as a function of the free energies of the descendents. = k1 k2 b Fij(a,b) a i j q1 q2 Fjk1(b,q1) Fjk2(b,q2)

Recursion Relation Expressing the free energy Fij(a,b) as a function of the free energies Fjk(b,qk) of the descendents, T   -1 = temperature T = 0 for optimisation

Parameters Average energy Edwards-Anderson order parameter: to see whether the system has frozen (like in glasses) or not qEA = 1: completely frozen; qEA = 0: paramagnetic Incomplete fraction

Paramagnetic and Potts Glass Phases Simulation: phase transition at C around and above 3.8!!! (Bounkong et al) glassy spinodal point paramagnetic For Q = 4, phase transition at C = 3.65 C above 3.65: paramagnetic; C below 3.65: glassy phase Glassy state ceases to exist for C above 3.65: spinodal point Wong & Saad, J. Phys. A 41, 324023 (2008)

Ising Model The case Q = 2 is equivalent to the Ising model with antiferromagnetic nn and nnn interactions. Cost function:  is the ratio of nn coupling to nnn coupling. Color diversity problem:  = 1

Special Ratios Rewrite the cost function as Number of dimers: X 1  = 1, ci = 3 At the special ratios Ci   = odd, the ground state is degenerate  higher entropy and lower energy Special ratio: unlocked interaction X 1 2  = 1, ci = 4 Zdeborova & Mezard, JStat P12004 (2008)

Energy at Special Ratios  = 1: even dominated graphs  = 2: odd dominated graphs

Entropy at Special Ratios  = 2: odd dominated graphs  = 1: even dominated graphs

Critical Temperature  = 1: even dominated graphs  = 2: odd dominated graphs

EA Parameter Contours ( = 1) Spin glass existence curve  = 1 Negative entropy Contours of EA parameters

EA Parameter Contours (C = 4) Negative entropy C = 4 Discon-tinuous transition Con-tinuous transition Contours of EA parameters

Why Negative Entropy? We have used a recursion relation based on the physical picture when the system is dominated by a single state (replica symmetric ansatz). The results show that the glassy state should be dominated by many states (replica symmetry-breaking).

The Physical Picture easy hard uncolorable E states E = 0 E > 0 many states connectivity Mulet et al, PRL 89, 268701 (2002)

The Cavity Method (Many States) The number of states grows exponentially with N: () is the complexity, or configurational entropy. When new nodes are added to the network, different initial states contribute to a final state of a given free energy. Hence () can be found by Legendre transformation of the “free energy” Note the reweighting factor

The Complexity ( = 1, c = 3)  = 1, c = 3 dynamical transition: optimization may be trapped unphysical branch nonzero ground state energy both quadratic and auxiliary cost functions have similar behaviors

The Complexity ( = 1) dynamical transition nonzero ground state entropy SG-PM transition  nonzero ground state energy

Comparison Spin Glass Single state (RS) 2.76C3.33 Many states (1RSB) 2.69C3.45 (stable) 2.65C2.69 (metastable) 3.45C3.56 (metastable) Many states (1RSB)

Simulation Fits 1RSB Better

Conclusions Special ratios: When the connectivity changes, there are phase transitions from the glass phase in odd-dominated regimes to the paramagnetic phase in even-dominated regimes. The glassy state is dominated by many states. This picture predicts a phase transition at c  2.69, agreeing with simulation results. Expect special ratio effects also for Q colors when C + 1 = multiple of Q, but maybe only modulation of glass temperature for Q  3.

Thank you!