arXiv subjects

Stefan Boettcher

Publications and source records attributed to Stefan Boettcher.

At least 55 records · Page 3Linked to original sources

arXiv2014

Renormalization Group Solution of the Chutes&Ladder Model

We analyze a semi-infinite one-dimensional random walk process with a biased motion that is incremental in one direction and long-range in the other. On a network with a fixed hierarchy of long-range jumps, we find with exact renormalization group calculations that there is a dynamical transition between a localized adsorption phase and an anomalous diffusion phase in which the mean-square displacement exponent depends non-universally on the Bernoulli coin. We relate these results to similar findings of unconventional phase behavior in hierarchical networks.

cond-mat.stat-mech↗

arXiv2014

One-Dimensional Coinless Quantum Walks

A coinless, discrete-time quantum walk possesses a Hilbert space whose dimension is smaller compared to the widely-studied coined walk. Coined walks require the direct product of the site basis with the coin space, coinless walks operate purely in the site basis, which is clearly minimal. These coinless quantum walks have received considerable attention recently because they have evolution operators that can be obtained by a graphical method based on lattice tessellations and they have been shown to be as efficient as the best known coined walks when used as a quantum search algorithm. We argue that both formulations in their most general form are equivalent. In particular, we demonstrate how to transform the one-dimensional version of the coinless quantum walk into an equivalent extended coined version for a specific family of evolution operators. We present some of its basic, asymptotic features for the one-dimensional lattice with some examples of tessellations, and analyze the mixing time and limiting probability distributions on cycles.

quant-ph↗

arXiv2014

Scaling of Clusters near Discontinuous Percolation Transitions in Hyperbolic Networks

We investigate the onset of the discontinuous percolation transition in small-world hyperbolic networks by studying the systems-size scaling of the typical largest cluster approaching the transition, $p\nearrow p_{c}$. To this end, we determine the average size of the largest cluster $\left\langle s_{\rm max}\right\rangle \sim N^{Ψ\left(p\right)}$ in the thermodynamic limit using real-space renormalization of cluster generating functions for bond and site percolation in several models of hyperbolic networks that provide exact results. We determine that all our models conform to the recently predicted behavior regarding the growth of the largest cluster, which found diverging, albeit sub-extensive, clusters spanning the system with finite probability well below $p_{c}$ and at most quadratic corrections to unity in $Ψ\left(p\right)$ for $p\nearrow p_{c}$. Our study suggest a large universality in the cluster formation on small-world hyperbolic networks and the potential for an alternative mechanism in the cluster formation dynamics at the onset of discontinuous percolation transitions.

cond-mat.stat-mech↗

arXiv2014

Weak Limit of the 3-State Quantum Walk on the Line

We revisit the one dimensional discrete time quantum walk with 3 states and the Grover coin. We derive analytic expressions for observed the localization, an long time approximation for the probability density function (PDF). We also connect the time averaged approximation to the PDF found by Inui et. al. to a spatial average of the walk. We show that this smooth approximation constitutes a proper PDF that predicts moments of the real PDF accurately.

quant-ph↗

arXiv2014

Temporal and spatial heterogeneity in aging colloids: a mesoscopic model

A coarse-grained model of dense hard sphere colloids building on simple notions of particle mobility and spatial coherence is presented and shown to reproduce results of experiments and simulations for key quantities such as the intermediate scattering function, the particle mean-square displacement and the $χ_{4}$ mobility correlation function. All results are explained by two emerging and interrelated dynamical properties: i) a rate of intermittent events, quakes, which decreases as the inverse of the system age t; ii) a length scale characterizing correlated domains, which increases linearly in log t. This leads to simple and accurate scaling forms expressed in terms of a single scaling variable Finally, we propose a method to experimentally extract the growing length scale of an aging colloid and suggest that a suitable scaling of the probability density function of particle displacement can experimentally reveal the rate of quakes.

cond-mat.soft↗

arXiv2013

Accumulation of beneficial mutations in one dimension

When beneficial mutations are relatively common, competition between multiple unfixed mutations can reduce the rate of fixation in well-mixed asexual populations. We introduce a one dimensional model with a steady accumulation of beneficial mutations. We find a transition between periodic selection and multiple-mutation regimes. In the multiple-mutation regime, the increase of fitness along the lattice bears a striking similarity to surface growth phenomena, with power law growth and saturation of the interface width. We also find significant differences compared to the well-mixed model. In our lattice model, the transition between regimes happens at a much lower mutation rate due to slower fixation times in one dimension. Also the rate of fixation is reduced with increasing mutation rate due to the more intense competition, and it saturates with large population size.

q-bio.PE↗

arXiv2012

Comment on "Numerical estimates of the spectrum for anharmonic PT symmetric potentials" by Bowen et al

The paper by Bowen, Mancini, Fessatidis, and Murawski (2012 Phys. Scr. {\bf 85}, 065005) demonstrates in a dramatic fashion the serious difficulties that can arise when one rushes to perform numerical studies before understanding the physics and mathematics of the problem at hand and without understanding the limitations of the numerical methods used. Based on their flawed numerical work, the authors conclude that the work of Bender and Boettcher is wrong even though it has been verified at a completely rigorous level. Unfortunately, the numerical procedures performed and described in the paper by Bowen et al are incorrectly applied and wrongly interpreted.

quant-ph↗

arXiv2012

Spatial Search Algorithms on Hanoi Networks

We use the abstract search algorithm and its extension due to Tulsi to analyze a spatial quantum search algorithm that finds a marked vertex in Hanoi networks of degree 4 faster than classical algorithms. We also analyze the effect of using non-Groverian coins that take advantage of the small world structure of the Hanoi networks. We obtain the scaling of the total cost of the algorithm as a function of the number of vertices. We show that Tulsi's technique plays an important role to speed up the searching algorithm. We can improve the algorithm's efficiency by choosing a non-Groverian coin if we do not implement Tulsi's method. Our conclusion is based on numerical implementations.

quant-ph↗

arXiv2012

Quantum Walks on Sierpinski Gaskets

We analyze discrete-time quantum walks on Sierpinski gaskets using a flip-flop shift operator with the Grover coin. We obtain the scaling of two important physical quantities: the mean-square displacement and the mixing time as function of the number of points. The Sierpinski gasket is a fractal that lacks translational invariance and the results differ from those described in the literature for ordinary lattices. We find that the displacement varies with the initial location. Averaged over all initial locations, our simulation obtain an exponent very similar to classical diffusion.

quant-ph↗

arXiv2012

Finite-Size Corrections for Ground States of Edwards-Anderson Spin Glasses

Extensive computations of ground state energies of the Edwards-Anderson spin glass on bond-diluted, hypercubic lattices are conducted in dimensions d=3,..,7. Results are presented for bond-densities exactly at the percolation threshold, p=p_c, and deep within the glassy regime, p>p_c, where finding ground-states becomes a hard combinatorial problem. Finite-size corrections of the form 1/N^w are shown to be consistent throughout with the prediction w=1-y/d, where y refers to the "stiffness" exponent that controls the formation of domain wall excitations at low temperatures. At p=p_c, an extrapolation for $d\to\infty$ appears to match our mean-field results for these corrections. In the glassy phase, w does not approach the value of 2/3 for large d predicted from simulations of the Sherrington-Kirkpatrick spin glass. However, the value of w reached at the upper critical dimension does match certain mean-field spin glass models on sparse random networks of regular degree called Bethe lattices.

cond-mat.dis-nn↗

arXiv2010

Optimization of transport protocols with path-length constraints in complex networks

We propose a protocol optimization technique that is applicable to both weighted or unweighted graphs. Our aim is to explore by how much a small variation around the Shortest Path or Optimal Path protocols can enhance protocol performance. Such an optimization strategy can be necessary because even though some protocols can achieve very high traffic tolerance levels, this is commonly done by enlarging the path-lengths, which may jeopardize scalability. We use ideas borrowed from Extremal Optimization to guide our algorithm, which proves to be an effective technique. Our method exploits the degeneracy of the paths or their close-weight alternatives, which significantly improves the scalability of the protocols in comparison to Shortest Paths or Optimal Paths protocols, keeping at the same time almost intact the length or weight of the paths. This characteristic ensures that the optimized routing protocols are composed of paths that are quick to traverse, avoiding negative effects in data communication due to path-length increases that can become specially relevant when information losses are present.

physics.soc-ph↗

arXiv2010

Simulations of Ground State Fluctuations in Mean-Field Ising Spin Glasses

The scaling of fluctuations in the distribution of ground-state energies or costs with the system size N for Ising spin glasses is considered using an extensive set of simulations with the Extremal Optimization heuristic across a range of different models on sparse and dense graphs. These models exhibit very diverse behaviors, and an asymptotic extrapolation is often complicated by higher-order corrections. The clearest picture, in fact, emerges from the study of graph-bipartitioning, a combinatorial optimization problem closely related to spin glasses. Aside from two-spin interactions with discrete bonds, we also consider problems with Gaussian bonds and three-spin interactions, which behave differently to a significant degree.

cond-mat.dis-nn↗

arXiv2009

Conjecture on the maximum cut and bisection width in random regular graphs

Asymptotic properties of random regular graphs are object of extensive study in mathematics. In this note we argue, based on theory of spin glasses, that in random regular graphs the maximum cut size asymptotically equals the number of edges in the graph minus the minimum bisection size. Maximum cut and minimal bisection are two famous NP-complete problems with no known general relation between them, hence our conjecture is a surprising property of random regular graphs. We further support the conjecture with numerical simulations. A rigorous proof of this relation is obviously a challenge.

cond-mat.dis-nn↗

arXiv2009

Asymptotics of Lagged Fibonacci Sequences

Consider "lagged" Fibonacci sequences $a(n) = a(n-1)+a(\lfloor n/k\rfloor)$ for $k > 1$. We show that $\lim_{n\to\infty} a(kn)/a(n)\cdot\ln n/n = k\ln k$ and we demonstrate the slow numerical convergence to this limit and how to deal with this slow convergence. We also discuss the connection between two classical results of N.G. de Bruijn and K. Mahler on the asymptotics of $a(n)$.

math.CO↗

arXiv2009

Totally Asymmetric Exclusion Process with Hierarchical Long-Range Connections

A non-equilibrium particle transport model, the totally asymmetric exclusion process, is studied on a one-dimensional lattice with a hierarchy of fixed long-range connections. This model breaks the particle-hole symmetry observed on an ordinary one-dimensional lattice and results in a surprisingly simple phase diagram, without a maximum-current phase. Numerical simulations of the model with open boundary conditions reveal a number of dynamic features and suggest possible applications.

cond-mat.stat-mech↗

arXiv2008

The Peculiar Phase Structure of Random Graph Bisection

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over sparse random graphs, the phase structure of the graph bisection problem displays certain familiar properties, but also some surprises. It is known that when the mean degree is below the critical value of 2 log 2, the cutsize is zero with high probability. We study how the minimum cutsize increases with mean degree above this critical threshold, finding a new analytical upper bound that improves considerably upon previous bounds. Combined with recent results on expander graphs, our bound suggests the unusual scenario that random graph bisection is replica symmetric up to and beyond the critical threshold, with a replica symmetry breaking transition possibly taking place above the threshold. An intriguing algorithmic consequence is that although the problem is NP-hard, we can find near-optimal cutsizes (whose ratio to the optimal value approaches 1 asymptotically) in polynomial time for typical instances near the phase transition.

cond-mat.stat-mech↗

arXiv2008

Analysis of the Karmarkar-Karp Differencing Algorithm

The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and statistical physics. We analyze the performance of the differencing algorithm on random instances by mapping it to a nonlinear rate equation. Our analysis reveals strong finite size effects that explain why the precise asymptotics of the differencing solution is hard to establish by simulations. The asymptotic series emerging from the rate equation satisfies all known bounds on the Karmarkar-Karp algorithm and projects a scaling $n^{-c\ln n}$, where $c=1/(2\ln2)=0.7213...$. Our calculations reveal subtle relations between the algorithm and Fibonacci-like sequences, and we establish an explicit identity to that effect.

math.NA↗

arXiv2008

Local field distributions in spin glasses

Numerical results for the local field distributions of a family of Ising spin-glass models are presented. In particular, the Edwards-Anderson model in dimensions two, three, and four is considered, as well as spin glasses with long-range power-law-modulated interactions that interpolate between a nearest-neighbour Edwards-Anderson system in one dimension and the infinite-range Sherrington-Kirkpatrick model. Remarkably, the local field distributions only depend weakly on the range of the interactions and the dimensionality, and show strong similarities except for near zero local field.

cond-mat.dis-nn↗