Locally and Globally Optimal Configurations of $N$ Particles on the Sphere with Applications in the Narrow Escape and Narrow Capture Problems
Wesley J. M. Ridgway, Alexei F. Cheviakov

TL;DR
This paper numerically determines optimal particle arrangements on a sphere for biophysical problems, providing extensive data on global and local minima up to N=120, extending beyond classical physics problems.
Contribution
It introduces numerical methods to find optimal configurations for narrow escape and capture problems, filling gaps in existing results for applied potentials.
Findings
Global energy minima tables for N≤120
Local minima data for N≤65
Exclusion of saddle points from results
Abstract
Determination of \emph{optimal} arrangements of particles on a sphere is a well-known problem in physics. A famous example of such is the Thomson problem of finding equilibrium configurations of electrical charges on a sphere. More recently however, similar problems involving other potentials and non-spherical domains have arisen in biophysical systems. Many optimal configurations have previously been computed, especially for the Thomson problem, however few results exist for potentials that correspond to more applied problems. Here we numerically compute optimal configurations corresponding to the \emph{narrow escape} and \emph{narrow capture} problems in biophysics. We provide comprehensive tables of global energy minima for and local energy minima for , and we exclude all saddle points. Local minima up to are available online.
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13
Figure 14
Figure 15
Figure 16
Figure 17
Figure 18
Figure 19
Figure 20
Figure 21
Figure 22| NE Energy | # of Local Minima | NE Energy | # of Local Minima | ||
| 4 | -1.6671799 | 1 | 63 | 311.6558511 | 1 |
| 5 | -2.0879876 | 1 | 64 | 324.0896299 | 1 |
| 6 | -2.5810055 | 1 | 65 | 336.7697094 | 1 |
| 7 | -2.7636584 | 1 | 66 | 349.6565931 | 2 |
| 8 | -2.9495765 | 1 | 67 | 362.7514093 | 1 |
| 9 | -2.9764336 | 1 | 68 | 376.2377825 | 3 |
| 10 | -2.8357352 | 1 | 69 | 389.9300126 | 4 |
| 11 | -2.4567341 | 1 | 70 | 403.8308809 | 5 |
| 12 | -2.1612842 | 1 | 71 | 418.0224191 | 1 |
| 13 | -1.3678269 | 1 | 72 | 432.3019807 | 4 |
| 14 | -0.5525928 | 1 | 73 | 447.2100228 | 2 |
| 15 | 0.4774376 | 1 | 74 | 462.2113780 | 9 |
| 16 | 1.6784049 | 2 | 75 | 477.3635907 | 3 |
| 17 | 3.0751594 | 1 | 76 | 492.8366797 | 6 |
| 18 | 4.6651247 | 1 | 77 | 508.4749290 | 4 |
| 19 | 6.5461714 | 1 | 78 | 524.4487720 | 4 |
| 20 | 8.4817896 | 1 | 79 | 540.7371289 | 5 |
| 21 | 10.7013196 | 1 | 80 | 557.2315390 | 7 |
| 22 | 13.1017418 | 2 | 81 | 574.1035388 | 7 |
| 23 | 15.8212821 | 1 | 82 | 591.1522915 | 13 |
| 24 | 18.5819815 | 1 | 83 | 608.4133589 | 16 |
| 25 | 21.7249125 | 1 | 84 | 625.9597981 | 17 |
| 26 | 25.0100312 | 1 | 85 | 643.7723346 | 10 |
| 27 | 28.4296992 | 1 | 86 | 661.8438907 | 22 |
| 28 | 32.1929330 | 1 | 87 | 680.1575495 | 20 |
| 29 | 36.2197826 | 1 | 88 | 698.7043251 | 18 |
| 30 | 40.3544394 | 1 | 89 | 717.5605772 | 15 |
| 31 | 44.7576167 | 1 | 90 | 736.6531884 | 24 |
| 32 | 49.2409494 | 2 | 91 | 756.0230290 | 23 |
| 33 | 54.2959715 | 1 | 92 | 775.6539262 | 24 |
| 34 | 59.3794885 | 1 | 93 | 795.5664664 | 23 |
| 35 | 64.7367107 | 2 | 94 | 815.6923218 | 32 |
| 36 | 70.2760966 | 1 | 95 | 836.1253560 | 22 |
| 37 | 76.0662374 | 2 | 96 | 856.7795176 | 21 |
| 38 | 82.0802998 | 2 | 97 | 877.7410951 | 8 |
| 39 | 88.3295602 | 2 | 98 | 898.9117217 | 13 |
| 40 | 94.8178306 | 3 | 99 | 920.4235474 | 10 |
| 41 | 101.5685414 | 2 | 100 | 942.1286420 | 24 |
| 42 | 108.5402790 | 1 | 101 | 964.1753574 | 40 |
| 43 | 115.7702833 | 1 | 102 | 986.4289369 | 56 |
| 44 | 123.1634320 | 1 | 103 | 1008.9408904 | 41 |
| 45 | 130.9053156 | 1 | 104 | 1031.6959327 | 53 |
| 46 | 138.9204719 | 3 | 105 | 1054.8551489 | 58 |
| 47 | 147.1503518 | 5 | 106 | 1078.1682359 | 66 |
| 48 | 155.4174211 | 1 | 107 | 1101.7749883 | 54 |
| 49 | 164.2174643 | 1 | 108 | 1125.5711591 | 57 |
| 50 | 173.0786752 | 1 | 109 | 1149.7450890 | 82 |
| 51 | 182.2666362 | 2 | 110 | 1174.1102793 | 92 |
| 52 | 191.7242791 | 3 | 111 | 1198.7086529 | 60 |
| 53 | 201.3847501 | 2 | 112 | 1223.6244989 | 87 |
| 54 | 211.2834897 | 4 | 113 | 1248.8814345 | 93 |
| 55 | 221.4638138 | 6 | 114 | 1274.3559709 | 118 |
| 56 | 231.8539755 | 3 | 115 | 1300.0999781 | 124 |
| 57 | 242.5180260 | 4 | 116 | 1326.1250674 | 186 |
| 58 | 253.4345983 | 8 | 117 | 1352.3413825 | 232 |
| 59 | 264.5718539 | 4 | 118 | 1378.8765253 | 282 |
| 60 | 275.9094151 | 5 | 119 | 1405.6502758 | 254 |
| 61 | 287.6211392 | 6 | 120 | 1432.6666276 | 208 |
| 62 | 299.4803100 | 2 |
| NE Energy | NE Energy | ||||
| 4 | -1.6671799 | 4+0+0+0+0 | 147.1833136 | 0+0+12+35+0 | |
| 5 | -2.0879876 | 2+3+0+0+0 | 147.2448260 | 0+0+12+35+0 | |
| 6 | -2.5810055 | 0+6+0+0+0 | 48 | 155.4174211 | 0+0+12+36+0 |
| 7 | -2.7636584 | 0+5+2+0+0 | 49 | 164.2174643 | 0+0+12+37+0 |
| 8 | -2.9495765 | 0+4+4+0+0 | 50 | 173.0786752 | 0+0+12+38+0 |
| 9 | -2.9764336 | 0+3+6+0+0 | 51 | 182.2666362 | 0+0+12+39+0 |
| 10 | -2.8357352 | 0+2+8+0+0 | 182.4052019 | 0+0+12+39+0 | |
| 11 | -2.4567341 | 0+2+8+1+0 | 52 | 191.7242791 | 0+0+12+40+0 |
| 12 | -2.1612842 | 0+0+12+0+0 | 191.7276751 | 0+0+12+40+0 | |
| 13 | -1.3678269 | 0+1+10+2+0 | 191.7432297 | 0+0+12+40+0 | |
| 14 | -0.5525928 | 0+0+12+2+0 | 53 | 201.3847501 | 0+0+12+41+0 |
| 15 | 0.4774376 | 0+0+12+3+0 | 201.3952021 | 0+0+12+41+0 | |
| 16 | 1.6784049 | 0+0+12+4+0 | 54 | 211.2834897 | 0+0+12+42+0 |
| 1.6888964 | 0+0+12+4+0 | 211.2881597 | 0+0+12+42+0 | ||
| 17 | 3.0751594 | 0+0+12+5+0 | 211.2946443 | 0+0+12+42+0 | |
| 18 | 4.6651247 | 0+2+8+8+0 | 211.2965687 | 0+0+12+42+0 | |
| 19 | 6.5461714 | 0+0+12+7+0 | 55 | 221.4638138 | 0+0+12+43+0 |
| 20 | 8.4817896 | 0+0+12+8+0 | 221.4688811 | 0+0+14+39+2 | |
| 21 | 10.7013196 | 0+1+10+10+0 | 221.4690985 | 0+0+12+43+0 | |
| 22 | 13.1017418 | 0+0+12+10+0 | 221.4816551 | 0+0+12+43+0 | |
| 13.1259621 | 0+0+12+10+0 | 221.4821066 | 0+0+12+43+0 | ||
| 23 | 15.8212821 | 0+0+12+11+0 | 221.4948761 | 0+0+12+43+0 | |
| 24 | 18.5819815 | 0+0+12+12+0 | 56 | 231.8539755 | 0+0+12+44+0 |
| 25 | 21.7249125 | 0+0+12+13+0 | 231.8541155 | 0+0+12+44+0 | |
| 26 | 25.0100312 | 0+0+12+14+0 | 231.8581363 | 0+0+12+44+0 | |
| 27 | 28.4296992 | 0+0+12+15+0 | 57 | 242.5180260 | 0+0+12+45+0 |
| 28 | 32.1929330 | 0+0+12+16+0 | 242.5606388 | 0+0+13+43+1 | |
| 29 | 36.2197826 | 0+0+12+17+0 | 242.5722866 | 0+0+12+45+0 | |
| 30 | 40.3544394 | 0+0+12+18+0 | 242.5742216 | 0+0+12+45+0 | |
| 31 | 44.7576167 | 0+0+12+19+0 | 58 | 253.4345983 | 0+0+12+46+0 |
| 32 | 49.2409494 | 0+0+12+20+0 | 253.4429647 | 0+0+12+46+0 | |
| 49.4893595 | 0+0+12+20+0 | 253.4438456 | 0+0+12+46+0 | ||
| 33 | 54.2959715 | 0+0+13+19+1 | 253.4451075 | 0+0+12+46+0 | |
| 34 | 59.3794885 | 0+0+12+22+0 | 253.4532446 | 0+0+12+46+0 | |
| 35 | 64.7367107 | 0+0+12+23+0 | 253.4574482 | 0+0+12+46+0 | |
| 64.7405651 | 0+0+12+23+0 | 253.4675340 | 0+0+12+46+0 | ||
| 36 | 70.2760966 | 0+0+12+24+0 | 253.5691064 | 0+0+14+42+2 | |
| 37 | 76.0662374 | 0+0+12+25+0 | 59 | 264.5718539 | 0+0+14+43+2 |
| 76.0768682 | 0+0+12+25+0 | 264.5733388 | 0+0+12+47+0 | ||
| 38 | 82.0802998 | 0+0+12+26+0 | 264.5850623 | 0+0+12+47+0 | |
| 82.0931587 | 0+0+12+26+0 | 264.5916096 | 0+0+12+47+0 | ||
| 39 | 88.3295602 | 0+0+12+27+0 | 60 | 275.9094151 | 0+0+12+48+0 |
| 88.3900685 | 0+0+12+27+0 | 275.9145551 | 0+0+12+48+0 | ||
| 40 | 94.8178306 | 0+0+12+28+0 | 275.9214751 | 0+0+12+48+0 | |
| 94.8756103 | 0+0+12+28+0 | 276.0688360 | 0+0+12+48+0 | ||
| 94.8953050 | 0+0+12+28+0 | 276.0811919 | 0+0+12+48+0 | ||
| 41 | 101.5685414 | 0+0+12+29+0 | 61 | 287.6211392 | 0+0+12+49+0 |
| 101.6395277 | 0+0+12+29+0 | 287.6322577 | 0+0+12+49+0 | ||
| 42 | 108.5402790 | 0+0+12+30+0 | 287.6359522 | 0+0+12+49+0 | |
| 43 | 115.7702833 | 0+0+12+31+0 | 287.6534930 | 0+0+12+49+0 | |
| 44 | 123.1634320 | 0+0+12+32+0 | 287.6561326 | 0+0+12+49+0 | |
| 45 | 130.9053156 | 0+0+12+33+0 | 287.6655546 | 0+0+12+49+0 | |
| 46 | 138.9204719 | 0+0+12+34+0 | 62 | 299.4803100 | 0+0+12+50+0 |
| 138.9242053 | 0+0+12+34+0 | 299.5177575 | 0+0+12+50+0 | ||
| 138.9260526 | 0+0+12+34+0 | 63 | 311.6558511 | 0+0+12+51+0 | |
| 47 | 147.1503518 | 0+0+12+35+0 | 64 | 324.0896299 | 0+0+12+52+0 |
| 147.1538854 | 0+0+12+35+0 | 65 | 336.7697094 | 0+0+12+53+0 | |
| 147.1659480 | 0+0+12+35+0 |
| Global NC Energy | Local Minima | Global NC Energy | Local Minima | ||
| 4 | 1.2753079 | 1 | 63 | 761.7365139 | 1 |
| 5 | 2.3325195 | 1 | 64 | 787.7433643 | 1 |
| 6 | 3.6573191 | 1 | 65 | 814.1954515 | 1 |
| 7 | 5.4188195 | 1 | 66 | 841.0627048 | 2 |
| 8 | 7.4781865 | 1 | 67 | 868.3435424 | 1 |
| 9 | 9.9113144 | 1 | 68 | 896.1835478 | 3 |
| 10 | 12.7273233 | 1 | 69 | 924.4370909 | 4 |
| 11 | 15.9633917 | 1 | 70 | 953.1053374 | 5 |
| 12 | 19.4448610 | 1 | 71 | 982.2534837 | 2 |
| 13 | 23.4988136 | 1 | 72 | 1011.7220316 | 5 |
| 14 | 27.8546601 | 1 | 73 | 1041.9378711 | 3 |
| 15 | 32.6249857 | 1 | 74 | 1072.4773046 | 9 |
| 16 | 37.7841349 | 2 | 75 | 1103.3861677 | 3 |
| 17 | 43.3480585 | 1 | 76 | 1134.7989611 | 6 |
| 18 | 49.3152900 | 1 | 77 | 1166.5921261 | 4 |
| 19 | 55.7454616 | 1 | 78 | 1198.9012840 | 4 |
| 20 | 62.4925763 | 1 | 79 | 1231.7114783 | 5 |
| 21 | 69.7021610 | 1 | 80 | 1264.9343750 | 8 |
| 22 | 77.3074771 | 2 | 81 | 1298.7071786 | 7 |
| 23 | 85.3990644 | 1 | 82 | 1332.8686991 | 13 |
| 24 | 93.7956788 | 1 | 83 | 1367.4479328 | 16 |
| 25 | 102.7220631 | 1 | 84 | 1402.5044669 | 17 |
| 26 | 112.0190373 | 1 | 85 | 1438.0212839 | 10 |
| 27 | 121.6815612 | 1 | 86 | 1473.9935322 | 23 |
| 28 | 131.8513551 | 1 | 87 | 1510.4080648 | 21 |
| 29 | 142.4737389 | 1 | 88 | 1547.2565862 | 19 |
| 30 | 153.4431719 | 1 | 89 | 1584.6017630 | 19 |
| 31 | 164.8676908 | 1 | 90 | 1622.3838285 | 26 |
| 32 | 176.6198170 | 2 | 91 | 1660.6362010 | 24 |
| 33 | 189.0434647 | 1 | 92 | 1699.3452879 | 28 |
| 34 | 201.7545872 | 1 | 93 | 1738.5291591 | 27 |
| 35 | 214.9282924 | 2 | 94 | 1778.1304687 | 39 |
| 36 | 228.4996702 | 1 | 95 | 1818.2268735 | 24 |
| 37 | 242.5158012 | 2 | 96 | 1858.7481974 | 23 |
| 38 | 256.9600891 | 2 | 97 | 1899.7641064 | 11 |
| 39 | 271.8381200 | 2 | 98 | 1941.1954839 | 18 |
| 40 | 287.1550632 | 3 | 99 | 1983.1491796 | 14 |
| 41 | 302.9272985 | 2 | 100 | 2025.5050024 | 27 |
| 42 | 319.1244788 | 1 | 101 | 2068.3830362 | 41 |
| 43 | 335.7734900 | 1 | 102 | 2111.6744155 | 60 |
| 44 | 352.8052329 | 1 | 103 | 2155.4211861 | 50 |
| 45 | 370.3587315 | 1 | 104 | 2199.6110343 | 61 |
| 46 | 388.3757521 | 3 | 105 | 2244.3738904 | 63 |
| 47 | 406.8113090 | 5 | 106 | 2289.5077641 | 73 |
| 48 | 425.5351845 | 1 | 107 | 2335.1252008 | 60 |
| 49 | 444.9188072 | 1 | 108 | 2381.1411090 | 65 |
| 50 | 464.6065564 | 1 | 109 | 2427.7106073 | 94 |
| 51 | 484.7997393 | 2 | 110 | 2474.6800384 | 101 |
| 52 | 505.4557374 | 4 | 111 | 2522.0823797 | 75 |
| 53 | 526.5221776 | 2 | 112 | 2569.9899275 | 107 |
| 54 | 548.0282546 | 4 | 113 | 2618.4209072 | 111 |
| 55 | 570.0046269 | 6 | 114 | 2667.2735190 | 140 |
| 56 | 592.3987462 | 3 | 115 | 2716.5898475 | 159 |
| 57 | 615.2584023 | 5 | 116 | 2766.3811001 | 215 |
| 58 | 638.5661060 | 8 | 117 | 2816.5721460 | 265 |
| 59 | 662.2992461 | 4 | 118 | 2867.2673880 | 320 |
| 60 | 686.4417704 | 5 | 119 | 2918.4018751 | 284 |
| 61 | 711.1280295 | 6 | 120 | 2969.9778301 | 238 |
| 62 | 736.1836003 | 3 |
| NC Energy | NC Energy | ||||
| 4 | 1.2753079 | 4+0+0+0+0 | 406.8826917 | 0+0+12+35+0 | |
| 5 | 2.3325195 | 2+3+0+0+0 | 48 | 425.5351845 | 0+0+12+36+0 |
| 6 | 3.6573191 | 0+6+0+0+0 | 49 | 444.9188072 | 0+0+12+37+0 |
| 7 | 5.4188195 | 0+5+2+0+0 | 50 | 464.6065564 | 0+0+12+38+0 |
| 8 | 7.4781865 | 0+4+4+0+0 | 51 | 484.7997393 | 0+0+12+39+0 |
| 9 | 9.9113144 | 0+3+6+0+0 | 484.9059577 | 0+0+12+39+0 | |
| 10 | 12.7273233 | 0+2+8+0+0 | 52 | 505.4557374 | 0+0+12+40+0 |
| 11 | 15.9633917 | 0+2+8+1+0 | 505.4584264 | 0+0+12+40+0 | |
| 12 | 19.4448610 | 0+0+12+0+0 | 505.4705912 | 0+0+12+40+0 | |
| 13 | 23.4988136 | 0+1+10+2+0 | 505.4723820 | 0+0+12+40+0 | |
| 14 | 27.8546601 | 0+0+12+2+0 | 53 | 526.5221776 | 0+0+12+41+0 |
| 15 | 32.6249857 | 0+0+12+3+0 | 526.5304615 | 0+0+12+41+0 | |
| 16 | 37.7841349 | 0+0+12+4+0 | 54 | 548.0282546 | 0+0+12+42+0 |
| 37.7913424 | 0+0+12+4+0 | 548.0313595 | 0+0+12+42+0 | ||
| 17 | 43.3480585 | 0+0+12+5+0 | 548.0367702 | 0+0+12+42+0 | |
| 18 | 49.3152900 | 0+2+8+8+0 | 548.0387819 | 0+0+12+42+0 | |
| 19 | 55.7454616 | 0+0+12+7+0 | 55 | 570.0046269 | 0+0+12+43+0 |
| 20 | 62.4925763 | 0+0+12+8+0 | 570.0081782 | 0+0+12+43+0 | |
| 21 | 69.7021610 | 0+1+10+10+0 | 570.0086879 | 0+0+14+39+2 | |
| 22 | 77.3074771 | 0+0+12+10+0 | 570.0189717 | 0+0+12+43+0 | |
| 77.3248232 | 0+0+12+10+0 | 570.0192368 | 0+0+12+43+0 | ||
| 23 | 85.3990644 | 0+0+12+11+0 | 570.0289506 | 0+0+12+43+0 | |
| 24 | 93.7956788 | 0+0+12+12+0 | 56 | 592.3987462 | 0+0+12+44+0 |
| 25 | 102.7220631 | 0+0+12+13+0 | 592.3992926 | 0+0+12+44+0 | |
| 26 | 112.0190373 | 0+0+12+14+0 | 592.4021497 | 0+0+12+44+0 | |
| 27 | 121.6815612 | 0+0+12+15+0 | 57 | 615.2584023 | 0+0+12+45+0 |
| 28 | 131.8513551 | 0+0+12+16+0 | 615.2702496 | 0+0+12+45+0 | |
| 29 | 142.4737389 | 0+0+12+17+0 | 615.2905050 | 0+0+13+43+1 | |
| 30 | 153.4431719 | 0+0+12+18+0 | 615.2995971 | 0+0+12+45+0 | |
| 31 | 164.8676908 | 0+0+12+19+0 | 615.2996416 | 0+0+12+45+0 | |
| 32 | 176.6198170 | 0+0+12+20+0 | 58 | 638.5661060 | 0+0+12+46+0 |
| 176.7944252 | 0+0+12+20+0 | 638.5724213 | 0+0+12+46+0 | ||
| 33 | 189.0434647 | 0+0+13+19+1 | 638.5731306 | 0+0+12+46+0 | |
| 34 | 201.7545872 | 0+0+12+22+0 | 638.5737991 | 0+0+12+46+0 | |
| 35 | 214.9282924 | 0+0+12+23+0 | 638.5790228 | 0+0+12+46+0 | |
| 214.9315690 | 0+0+12+23+0 | 638.5834576 | 0+0+12+46+0 | ||
| 36 | 228.4996702 | 0+0+12+24+0 | 638.5846113 | 0+0+12+46+0 | |
| 37 | 242.5158012 | 0+0+12+25+0 | 638.5919380 | 0+0+12+46+0 | |
| 242.5235820 | 0+0+12+25+0 | 59 | 662.2992461 | 0+0+14+43+2 | |
| 38 | 256.9600891 | 0+0+12+26+0 | 662.2999789 | 0+0+12+47+0 | |
| 256.9687260 | 0+0+12+26+0 | 662.3091948 | 0+0+12+47+0 | ||
| 39 | 271.8381200 | 0+0+12+27+0 | 662.3147258 | 0+0+12+47+0 | |
| 271.8830066 | 0+0+12+27+0 | 60 | 686.4417704 | 0+0+12+48+0 | |
| 40 | 287.1550632 | 0+0+12+28+0 | 686.4460598 | 0+0+12+48+0 | |
| 287.1986056 | 0+0+12+28+0 | 686.4520078 | 0+0+12+48+0 | ||
| 287.2116587 | 0+0+12+28+0 | 686.5639093 | 0+0+12+48+0 | ||
| 41 | 302.9272985 | 0+0+12+29+0 | 686.5741767 | 0+0+12+48+0 | |
| 302.9816133 | 0+0+12+29+0 | 61 | 711.1280295 | 0+0+12+49+0 | |
| 42 | 319.1244788 | 0+0+12+30+0 | 711.1365911 | 0+0+12+49+0 | |
| 43 | 335.7734900 | 0+0+12+31+0 | 711.1399905 | 0+0+12+49+0 | |
| 44 | 352.8052329 | 0+0+12+32+0 | 711.1533041 | 0+0+12+49+0 | |
| 45 | 370.3587315 | 0+0+12+33+0 | 711.1553205 | 0+0+12+49+0 | |
| 46 | 388.3757521 | 0+0+12+34+0 | 711.1624250 | 0+0+12+49+0 | |
| 388.3783317 | 0+0+12+34+0 | 62 | 736.1836003 | 0+0+12+50+0 | |
| 388.3791178 | 0+0+12+34+0 | 736.2003615 | 0+0+12+50+0 | ||
| 47 | 406.8113090 | 0+0+12+35+0 | 736.2121671 | 0+0+12+50+0 | |
| 406.8138763 | 0+0+12+35+0 | 63 | 761.7365139 | 0+0+12+51+0 | |
| 406.8222118 | 0+0+12+35+0 | 64 | 787.7433643 | 0+0+12+52+0 | |
| 406.8368865 | 0+0+12+35+0 | 65 | 814.1954515 | 0+0+12+53+0 |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Locally and Globally Optimal Configurations of Particles on the Sphere with Applications in the Narrow Escape and Narrow Capture Problems
Wesley J. M. Ridgway111Electronic mail: [email protected], Alexei F. Cheviakov 222Corresponding author. Electronic mail: [email protected]
Department of Mathematics and Statistics, University of Saskatchewan, Saskatoon, S7N 5E6 Canada
Abstract
Determination of optimal arrangements of particles on a sphere is a well-known problem in physics. A famous example of such is the Thomson problem of finding equilibrium configurations of electrical charges on a sphere. More recently however, similar problems involving other potentials and non-spherical domains have arisen in biophysical systems. Many optimal configurations have previously been computed, especially for the Thomson problem, however few results exist for potentials that correspond to more applied problems. Here we numerically compute optimal configurations corresponding to the narrow escape and narrow capture problems in biophysics.
We provide comprehensive tables of global energy minima for and local energy minima for , and we exclude all saddle points. Local minima up to are available online.
1 Introduction
The problem of optimally distributing points on the boundary of a bounded domain, , has many applications in physical systems (see e.g. Ref. [1] and numerous references therein). Here, optimal refers to an arrangement of points, particles, etc. on the boundary, , such that the configuration of particles minimizes the pairwise ‘potential energy’
[TABLE]
with the constraint where is the interaction energy between two particles. Such a configuration is called an optimal configuration. Note that optimal configurations include local minima of (1.1) as well as the global minimum. While a large number of algorithms have been used to seek global extrema of general or specific classes of functions [2, 3, 4, 5], very few algorithms exist for the study of local minima [6]. A large part of this paper is devoted to systematic computations of local minima which presents a difficult computational problem due to the number of local minima. In fact, it is believed that the number of local minima increases exponentially [6].
One example of a problem of practicle interest that yields the above-described optimization problem is the narrow escape problem in which a Brownian particle diffuses in a bounded domain . The boundary consists of reflecting and absorbing regions, denoted and respectively, where the absorbing regions are small windows or traps with measure , . The narrow escape problem consists of finding the mean first passage time (MFPT), defined as the expectation value of the time required for the Brownian particle to escape through in the limit where is asymptotically small. The narrow escape problem is a singular perturbation problem since the MFPT diverges in the limit as [7, 8].
When and the absorbing boundary consists of disjoint circular caps of a common (dimensionless) radius , , , the MFPT, , satisfies the boundary value problem
[TABLE]
where is the diffusivity of the Brownian motion. The situation is depicted in Figure 1. We remark that in 2D a heterogeneous Dirichlet-Neumann problem is also known as the Keldysh-Sedov problem, originally considered for the Laplace equation (see e.g. Refs [9, 10]).
The average MFPT for a uniform distribution of starting locations for the Brownian particle is computed from
[TABLE]
where is the volume of .
The narrow escape problem has application in biophysics where proteins, ions, etc. (modelled as Brownian particles) diffuse in a confining domain. Specific examples include virus transport inside cell nuclei, chemical reactions in microdomains, and the motion of calcium ions in dendritic spines (see Refs. [11, 12] therein). As there are usually many Brownian particles, the average MFPT, (1.3), acts as a timescale for these particles to exit the domain to accomplish some biological function. A natural problem arising out of this model is that of computing arrangements of traps that minimize the average MFPT. This constitutes a constrained optimization problem in which the objective function is of the form (1.1) and will be discussed in greater detail in the next section.
Another specific example is the narrow capture problem, similar to the narrow escape problem, which also has applications in biophysics (see Refs. [13, 14] and references therein). Here, there are disjoint interior absorbing traps, , each with a size parameter , and the boundary of is entirely reflecting [15]. The case where contains a single spherical trap () of radius centered at was studied in Ref. [14]. The boundary of the target sphere is reflecting except for disjoint circular absorbing nanotraps of a common radius, . That is, where and are the absorbing and reflecting regions respectively. The situation is depicted in Figure 2. The MFPT for a Brownian particle starting at , satisfies the boundary-value problem
[TABLE]
The average MFPT is computed using (1.3) but replacing with .
The narrow capture problem models some biophysical processes. For example, a cell transports proteins (again modelled by Brownian particles) between the cytoplasm and the cell nucleus which is roughly spherical in shape. Proteins are allowed to pass through the otherwise impermeable nuclear membrane via nuclear pore complexes (NPCs) distributed over the surface. There are near 2000 of these pores covering about 2% of the nuclear surface, each has a radius of about 25nm [14]. The average MFPT again provides a timescale for the large number of particles to escape the domain to accomplish a biological function.
Another practical problem is modelling the diffusion of nanoparticles in so-called inverse opals. Inverse opals are porous materials consisting of connected spherical cavities. These materials have several applications in engineering and are interesting from a material science perspective (see e.g. Refs. [16, 17] and references therein). Although diffusion in these structures has been studied experimentally and numerically (see e.g. Ref. [18]), development of a general model of the diffusion process that takes into account the geometric structure is an open problem. The MFPT for a spherical cavity with pores may provide a measure of the average ‘dwell’ time of a particle in each cavity. One would expect optimal configurations to maximize the diffusion which is desirable when designing materials for industrial processes. Thus the narrow escape problem and corresponding optimal configurations are relevant in the modelling of this problem.
Optimal configurations on the sphere in for the general pairwise potential (1.1) where in (1.1) is a continuous and monotonically decreasing function have previously been studied (e.g. Refs. [19, 20]). It is well known that the optimal configurations depend on the potential for all with a few exceptions (). The global mininima for these are optimal for every such and these configurations are termed universally optimal. The universal optima in consist of antipodal points (), an inscribed equilateral triangle (), a tetrahedron (), an octahedron (), and an icosahedron (). This is a complete list for [20].
It is also well known that it is geometrically impossible, in general, to evenly distribute points on a sphere. If is the coordination number (number of nearest neighbours) of particle , then the Euler’s formula for the sphere yields (e.g. [1])
[TABLE]
which shows that the total defect structure must always be 12. For example, a tessellation of the sphere with hexagons and pentagons must always contain exactly 12 pentagons. Our results are consistent with these facts. In light of equation (1.5), we define a scar as a collection of adjacent defects.
In this paper we compute local and global minima of some selected potentials that have applications in the narrow escape and narrow capture problems up to . The rest of the paper is organized as follows: first we summarize the results of Refs. [8, 14] and present the potentials that we will consider (Section 2). Then in Section 3 we describe briefly the optimization algorithm [21]. The remaining sections present the results with comprehensive tables of local and global minima as well as interpretation and comparison with previous work [22].
2 Asymptotic Formulas for the Average MFPT and Related Optimization Problems
The narrow escape problem for the unit sphere with identical ‘circular’ traps of radius was studied in [8]. The MFPT was computed using the method of matched asymptotic expansions using information about the surface Neumann Green’s function for the sphere. It was shown that the average MFPT has the following three-term expansion:
[TABLE]
where is the diffusivity of the Brownian motion, is the volume of the unit sphere, and the function is a discrete pairwise energy given by
[TABLE]
The first two terms are the usual Coulombic and logarithmic potentials respectively
[TABLE]
[TABLE]
Thus the configuration of traps that minimizes the MFPT is obtained by minimizing the discrete pairwise energy (2.7).
The narrow capture problem for interior targets was analyzed in Ref. [15] using the method of matched asymptotic expansions in order to arrive at a three-term expansion in for the MFPT. For a single target () the result for the average MFPT reduces to
[TABLE]
where is the regular part of the Neumann Green’s function for . The quantity , called the capacitance of the target sphere, is defined in terms of an electrostatic potential problem. When the target sphere consists of a reflecting boundary with absorbing patches as in [14], the capacitance is defined in terms of the boundary-value problem
[TABLE]
where is the magnified target sphere centered at the origin with unit radius and is a sphere of radius centered at the origin. The reflecting and absorbing areas on are denoted by and respectively. The far-field behaviour of the solution defines by
[TABLE]
where is the dipole moment corresponding to the magnified target sphere (c.f. Ref. [15]). In Ref. [14] it was shown that the capacitance for the target sphere is given by
[TABLE]
As is the case with the MFPT for the narrow escape problem, is a discrete energy-like function defined by
[TABLE]
Minimizing minimizes the average MFPT for the narrow capture problem. Equations (2.14) and (2.7) differ only in the sign of .
The main focus of this paper is to systematically compute optimal configurations of particles on the sphere that minimize (2.7) and (2.14) when . We will refer to these potentials as the narrow escape (NE) and narrow capture (NC) potentials respectively. Optimal configurations for the narrow escape potential have previously been computed, but only the global minima [8, 22]. In [23] optimal configurations were computed for the narrow escape potential with differently ’charged’ particles. Here we attempt to compute all local minima for identically charged particles in addition to the global minimum. The optimal configurations for the narrow capture potential have not previously been studied.
Optimal configurations for more common potentials, such as the Coulombic (2.8) and logarithmic (2.9) potentials, have been studied more extensively [21, 24, 25, 26, 27]. These potentials also have several physical applications and are used in benchmarking optimization software. For example, the determination of optimal configurations on the sphere for the Coulomb potential (2.8) constitutes the classic and well-known Thompson problem. The modelling of multi-electron bubbles in liquid helium is a modern example of the Thompson problem [28]. The logarithmic potential has applications in the modelling of vortex defects in superconductors [1].
Optimal configurations for inverse power law potentials relate closely to packing problems. Finding the most efficient packing of spherical caps on the surface of a sphere constitutes the best-packing problem for the sphere, also known as the Tammes problem. The solutions to this problem are given by optimal configurations of a short range power law
[TABLE]
The case where was examined numerically in Ref. [21]. Figure 3 compares various potential functions.
3 Numerical Computation of Optimal Configurations
In this section, we describe briefly the optimization algorithm employed to compute putatively optimal configurations. Details are given in Ref. [21]. The algorithm consists broadly of three steps.
Generation of initial configurations as starting points for optimization 2. 2.
Energy minimization via modified steepest descent 3. 3.
Removal of saddle-points
The algorithm generates -particle starting configurations by computing a triangulation of previously known -particle optimal configurations. The particle is inserted at the center of mass of one of the triangles on the convex hull of the triangulation and projected onto the surface of the sphere. This procedure is performed for each triangle center, thus for each triangle center one obtains a starting configuration. Due to the possible symmetry of the -particle configuration, some of the resulting starting configurations may be identical due to rotational and reflection invariance of the energy. The redundant configurations are identified and excluded by calculating pairwise distances between particles.
Local optimization is accomplished by a modified steepest descent algorithm. Define forces, acting on particle according to
[TABLE]
where is the gradient operator with respect to the coordinates of particle . At each step of the energy minimization, the position of the particle, is updated according to
[TABLE]
where is the component of in the tangential direction and is a constant given by
[TABLE]
The largest tangential force in the starting configuration is given by and is a characteristic distance related to the number of particles and is approximately half the distance between particles for large . The parameter is user-specified and here is chosen to be 0.5 based on several trial runs for smaller .
Occasionally the algorithm will find configurations which are saddle points. Remarkably, this is a common occurrence for this problem (cf. [24, 26, 27]). The Hessian matrix in the neighbourhood of these saddle points often has at least one small negative eigenvalue which slows the steepest descent procedure. In principle this can be solved by taking a larger descent step (choosing a larger ). However, the unstable directions are believed to be quite ‘narrow’ such that the forces have only a small component along the unstable directions. If the optimization algorithm is continued (ignoring the stopping condition) then it eventually finds the local minimum, however doing so is inefficient. Instead, the putative optimal configurations are tested by computing the eigenvalues of the Hessian matrix and excluding those with negative eigenvalues. Note that the Hessian matrix is semi-definate at every local minima due to the rotational and reflectional invariance. Thus we fix the position of one particle and the azimuth of a second when computing the Hessian.
Due to the symmetry of the optimal configurations, many of the generated starting configurations, and putative minima, are identical up to rotation and reflection. Thus we require a method to distinguish configurations to avoid unnecessary computation and to avoid errors in counting the number of minima. In principle, one can simply compute the energy of each configuration using any ‘potential energy’ function. However, for a given the optimal energies are typically very similar (see figures 5 and 9 in the next two sections). When this doesn’t pose a problem (see Ref. [21]). As increases it becomes more difficult to distinguish configurations using energy. Further, the energy is relatively insensitive to small changes in particle positions around local minima making it difficult to resolve differences between two configurations.
Identifying equivalent configurations is accomplished with the set of pairwise distances, which is invariant under rotation and reflection. Suppose we have configurations, let denote the particle in the configuration. The algorithm proceeds as follows:
Compute scalars , , and let these be the components of . 2. 2.
For each , sort in ascending order and then normalize such that for a given and . Denote the resulting vector by . 3. 3.
Compute the clustering tolerance
[TABLE]
where tol is user specified and was chosen as since this was found to give good results. 4. 4.
Cluster the using Euclidean distance and the tolerance in the previous step. This was implemented with the Statistics Toolbox in MATLAB.
All configurations within a cluster are identical up to rotation and reflection when an appropriate tolerance is chosen.
4 Results for the NE Potential up to
Putative globally optimal configurations on the sphere for the NE potential have been computed for by [8, 22]. In the latter study, globally optimal configurations for a few selected up to 1004 were found. Locally optimal configurations have not previously been computed to the authors’ knowledge. The current section is divided into three parts: First we present tables ofthe computed global minima and the corresponding energies. Then we give results for local minima, including energy spectra, tables up to , and scars. Finally, we compare the globally minimal energies with a previously derived asymptotic scaling law [8]. Data on the local minima for are available online but are not included here due to the amount of data (see the online description).
4.1 Global Minima
Table LABEL:table:ne_global gives the computed globally optimal energies for each along with the number of computed local minima. Each configuration was verified by computing the eigenvalues of the Hessian matrix.
The computation time for each increases rapidly due to the increase in local minima. The majority of the computation time was spent optimizing configurations for for which the number of starting configurations was between 25000 and 66000.
4.2 Local Minima
The number of computed local minima for the NE potential is shown in Figure 4. As the number of minima is expected to grow exponentially, we fit a curve of the form in the least squares sense. This is a non-linear curve fitting problem which is handled numerically with MATLAB’s lsqcurvefit() function. We find
[TABLE]
where is the best fit number of minima. The reasonable agreement supports the supposed exponential growth rate [6].
A total of 2780 putative minima and a few saddle points were discovered. A list of the local and global minima with their corresponding energies and geometric properties are given in Table LABEL:table:ne_local for . The remaining data for are available in a MATLAB file in the online material. The computed energies are presented as a spectrum in Figure 5. They become increasingly dense with .
Computation of optimal configurations for the NE potential were also performed by [22]. We obtain slightly lower energies for and more significantly lower energies for and . The other optimal energies agree with our results up to the given precision. Many of the energies obtained here are identical to those given in Table 4.2 of [8] to the given precision up to . Above the energies given here are slightly lower.
Some examples of computed local minima are given in Figure 6 showing the scar structure. In general, there appears to be little or no symmetry in this structure, especially for large . As a general observation, coordination numbers alone don’t provide enough information to distinguish configurations. This is also seen in columns 3 and 6 of Table LABEL:table:ne_local in which many minima have the same coordination numbers for a given . However configurations with very different scar structures are likely not equivalent geometrically (as in Figure 6).
4.3 A Scaling Law for the Minimal NE Energy
In this section, we compare the computed globally optimal energies with an asymptotic scaling law for the pairwise energy (2.7) valid in the limit . We rewrite equation (2.7) as
[TABLE]
where and are given in equations (2.8) and (2.9) respectively and
[TABLE]
We have the following results from [8] (note the factor of difference in our definition of , equation (2.9)):
[TABLE]
Substituting the above into (4.21) gives the desired scaling law (also derived in [8]): {IEEEeqnarray}RCL H_NE & ≈ N22(1-log2)-12N^3/2-N8logN-N8(1-4log2) +14N^1/2 +124logN
-(116+log26) +O(N^-1/2).
Figure 7 compares the scaling law (4.23) with the computed globally optimal energies.
5 Results for the NC Potential up to
Optimal configurations (both local and global) for the NC potential have not previously been computed to the authors’ knowledge. The current section is organized in the same way as the previous section. First present tables of the computed global minima and the corresponding energies. Then we give results for local minima for in a table and finally we present a previously derived scaling law [14]. Data on the local minima for cannot be included due to the amount of data and are available online (see the online description).
5.1 Global Minima
Table LABEL:table:nc_global gives the computed globally optimal energies for each along with the number of computed local minima. As with the NE potential, the computation time grows rapidly with . Between and the number of starting configurations grows from approximately 27000 to 62000, roughly the same as the NE potential.
5.2 Local Minima
A total of putative minima and a few saddle points were found. A list of minima and corresponding geometric properties for is given in Table LABEL:table:nc_local. A complete list up to is available online in a MATLAB file.
As with the NE potential, we fit a curve of the form to the number of local minima, where is the best fit number of minima. Using the same procedure as described in Section 4.2, we find
[TABLE]
Figure 8 shows the number of optimal configurations before and after removal of saddle points along with the best fit curve (5.24).
A spectrum plot of the locally optimal energies is given in Figure 9. The minima become increasingly dense as increases.
5.3 A Scaling Law for the Minimal NC Energy
We compare the computed globally optimal energies for the NC potential with an asymptotic scaling law for equation (2.14) valid in the limit . Using the same procedure as in Section 4.3, we write the NC energy as
[TABLE]
where , , and are defined in Eqs. (2.8), (2.9), and (4.22) respectively. Substituting Eqs. (4.23a) - (4.23c) into the above yields the scaling law (also derived in [14])
[TABLE]
Figure 11 compares the scaling law (5.26) with the computed globally optimal energies.
6 Discussion
In [21], putatively optimal configurations for the Coulombic, logarithmic, and inverse-square law potentials were computed for . Non-optimal saddle points were excluded by computing the eigenvalues of the Hessian matrix. The discovered minima were compared with previous literature [24, 26, 27] and it was found that nearly all of the optimal configurations were reproduced and that some of the previously identified minima are indeed saddle points. Here, we use the same method to compute putatively optimal configurations of the narrow escape and narrow capture potentials for .
It is interesting that many of the local minima for all five of these potentials look qualitatively similar with respect to their scar pictures. We compare local minima across these potentials to determine if any are identical. The configurations that are shared among these potentials are termed partially optimal and these include the universal optima. Following Section 3, we use pairwise distances to identify partially optimal configurations. In addition to the universal optima, we find that the and global minima are identical among all five potentials within a very small margin. We note that the second of these configurations is in a special class of icosadeltahedral configurations that occur when
[TABLE]
These configurations have 12 pentagonal defects arranged at the corners of an inscribed icosahedron. It was once believed that this class of configurations were universally optimal, however this is not the case despite the high degree of symmetry for these configurations [29]. The next of these arrangements occurs at and both the narrow escape and narrow capture potentials exhibit global minima with apparent icosadeltahedral symmetry upon visual inspection. However, the difference in pairwise distances indicate that these configurations are in fact different. The scar structure alone is not enough to distinguish configurations since different minima for a given typically have identical coordination numbers.
There are other for which the configurations are close but don’t appear partially optimal. The universal optima and the partial optima stated above agree to within a few decimal places of machine precision when compared with pairwise distances. Other configurations only agree to around to (e.g. when and shown in figure 12).
In future work it may be of practical interest to apply results from the narrow escape problem to modelling diffusion in inverse opals. The ‘dwell time’ (i.e. MFPT) of a diffusing particle in a single spherical cavity may be important for understanding diffusion in a connected network of such cavities. Inverse opals have been studied experimentally and numericlaly (e.g. Ref. [18]) but developing a quantitative theory of diffusion is still an open problem.
Acknowledgments
The authors are grateful to NSERC of Canada for support through a Discovery grant and a USRA fellowship.
Appendix: File Structure of Online Material
We provide MATLAB (.mat) files containing data on each computed local minimum and saddle point. There are two files for each potential (NE and NC). One contains data on the minima only and the other contains data on the minima and the saddle points.
The files with only the minima contain a cell array, ALL_LEVELS. Each row contains data on all the local minima for a given starting at up to . The data in each column contains, in order, , geometric and computational data for each -particle local minima, the number of -particle local minima, and the number of -particle starting configurations. The data in the second column are stored in a x6 cell array where is the number of local minima. Each row in this matrix corresponds to a single local minimum and the rows are sorted in order of increasing energy. The data in each column contains , the energy of the configuration, an matrix containing the particle coordinates , the lowest energy -particle local minimum from which the configuration was computed, the average number of iterations required to compute the configuration, and the number of particles in the configuration having 5 nearest neighbours (5-fold defects).
The files with the minima and the saddle points have the same structure as described above except the second column is a cell array. The additional two columns of this array contain the smallest eigenvalue of the Hessian matrix and the -norm of the derivative
[TABLE]
of the pairwise energy (1.1). Note that two azimuthal angles and one polar angle are fixed in the above and in the Hessian computation, as explained in Section 3.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. J. Bowick and L. Giomi, “Two-dimensional matter: order, curvature and defects,” Advances in Physics , vol. 58, no. 5, pp. 449–563, 2009.
- 2[2] J. D. Pintér, Global optimization in action: continuous and Lipschitz optimization: algorithms, implementations and applications , vol. 6. Springer Science & Business Media, 2013.
- 3[3] R. Horst and P. M. Pardalos, Handbook of global optimization , vol. 2. Springer Science & Business Media, 2013.
- 4[4] L. Davis, Handbook of genetic algorithms . CUMINCAD, 1991.
- 5[5] L. Ingber and B. Rosen, “Genetic algorithms and very fast simulated reannealing: A comparison,” Mathematical and computer modelling , vol. 16, no. 11, pp. 87–100, 1992.
- 6[6] D. Mehta, J. Chen, D. Z. Chen, H. Kusumaatmaja, and D. J. Wales, “Kinetic transition networks for the Thomson problem and Smale’s seventh problem,” Physical Review Letters , vol. 117, no. 2, p. 028301, 2016.
- 7[7] S. Pillay, M. J. Ward, A. Peirce, and T. Kolokolnikov, “An asymptotic analysis of the mean first passage time for narrow escape problems: Part I: Two-dimensional domains,” Multiscale Modeling & Simulation , vol. 8, no. 3, pp. 803–835, 2010.
- 8[8] A. F. Cheviakov, M. J. Ward, and R. Straube, “An asymptotic analysis of the mean first passage time for narrow escape problems: Part II: The sphere,” Multiscale Modeling & Simulation , vol. 8, no. 3, pp. 836–870, 2010.
