Multiplex congruence network of natural numbers

Congruence theory has many applications in physical, social, biological and technological systems. Congruence arithmetic has been a fundamental tool for data security and computer algebra. However, much less attention was devoted to the topological features of congruence relations among natural numbers. Here, we explore the congruence relations in the setting of a multiplex network and unveil some unique and outstanding properties of the multiplex congruence network. Analytical results show that every layer therein is a sparse and heterogeneous subnetwork with a scale-free topology. Counterintuitively, every layer has an extremely strong controllability in spite of its scale-free structure that is usually difficult to control. Another amazing feature is that the controllability is robust against targeted attacks to critical nodes but vulnerable to random failures, which also differs from ordinary scale-free networks. The multi-chain structure with a small number of chain roots arising from each layer accounts for the strong controllability and the abnormal feature. The multiplex congruence network offers a graphical solution to the simultaneous congruences problem, which may have implication in cryptography based on simultaneous congruences. Our work also gains insight into the design of networks integrating advantages of both heterogeneous and homogeneous networks without inheriting their limitations.

[1]  Marián Boguñá,et al.  Complex architecture of primes and natural numbers. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[3]  Michael Schroeder.  Number theory in science and communication : With applications in cryptog-raphy , 1997 .

[4]  Tao Zhou,et al.  Topological properties of integer networks , 2006 .

[5]  Praveen Gauravaram,et al.  Cryptographic Hash Functions , 2010, Encyclopedia of Information Assurance.

[6]  C. Ding.  Chinese remainder theorem , 1996 .

[7]  Cunlai Pu,et al.  Robustness analysis of network controllability , 2012 .

[8]  Lucas Lacasa,et al.  Number theoretic example of scale-free topology inducing self-organized criticality. , 2008, Physical review letters.

[9]  G. Ambika,et al.  Divisibility patterns of natural numbers on a complex network , 2015, Scientific Reports.

[10]  Fred Guterl.  Suddenly, Number Theory Makes Sense to Industry , 1994 .

[11]  Ginestra Bianconi,et al.  Network controllability is determined by the density of low in-degree and out-degree nodes. , 2014, Physical review letters.

[12]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

[13]  Gilberto Corso.  Families and clustering in a natural numbers network. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Thilo Gross,et al.  All scale-free networks are sparse. , 2011, Physical review letters.

[15]  Matilde Marcolli,et al.  Number Theory in Physics , 2006 .

[16]  A. Salomaa,et al.  Chinese remainder theorem: applications in computing, coding, cryptography , 1996 .

[17]  M. Schroeder.  Number Theory in Science and Communication , 1984 .

[18]  Albert-László Barabási,et al.  Control Centrality and Hierarchical Structure in Complex Networks , 2012, PloS one.

[19]  Jennifer Seberry,et al.  Public Key Cryptography , 2000, Lecture Notes in Computer Science.

[20]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[21]  Kevin Zhou.  Navigation in a small world , 2017 .

[22]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[23]  Hawoong Jeong,et al.  Fundamental structural constraint of random scale-free networks. , 2012, Physical review letters.

[24]  Ho Peng Yoke,et al.  Chinese Mathematics in the Thirteenth Century. , 1973 .

[25]  Xiaoyun Wang,et al.  How to Break MD5 and Other Hash Functions , 2005, EUROCRYPT.

[26]  Manfred R. Schroeder.  Number theory in science and communication - with applications in cryptography, physics, digital information, computing, and self-similarity, 4th Edition , 2006, Springer series in information sciences.

[27]  Ying-Cheng Lai,et al.  Exact controllability of multiplex networks , 2014 .

[28]  S. Redner,et al.  Network growth by copying. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Zhou Hui-jie.  Natural Number Network and Prime Number Theorem , 2010 .

[30]  Lam Lay Yong,et al.  Fleeting Footsteps: Tracing the Conception of Arithmetic and Algebra in Ancient China , 1992 .

[31]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[32]  Y. Lai,et al.  Optimizing controllability of complex networks by minimum structural perturbations. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  Song Y. Yan.  Number Theory for Computing , 2002, Springer Berlin Heidelberg.

[34]  Wen-Xu Wang,et al.  Exact controllability of complex networks , 2013, Nature Communications.

[35]  Albert-László Barabási,et al.  Controllability of complex networks , 2011, Nature.

[36]  Godfrey H. Hardy,et al.  An introduction to the theory of numbers (5. ed.) , 1995 .

[37]  Sorin Iftene,et al.  General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting , 2007, ICS@SYNASC.