arXiv subjects

John A. Marsh

Publications and source records attributed to John A. Marsh.

6 recordsLinked to original sources

arXiv2021

Generalized Box-Muller method for generating q-Gaussian random deviates

Addendum: The generalized Box-Müller algorithm provides a methodology for generating q-Gaussian random variates. The parameter $-\infty<q\leq3$ is related to the shape of the tail decay; $q<1$ for compact-support including parabola $(q=0)$; $1<q\leq3$ for heavy-tail including Cauchy $(q=2)$. This addendum clarifies the transformation $q'=((3q-1)/(q+1))$ within the algorithm is due to a difference in the dimensions d of the generalized logarithm and the generalized distribution. The transformation is clarified by the decomposition of $q=1+2κ/(1+dκ)$, where the shape parameter $-1<κ\leq\infty$ quantifies the magnitude of the deformation from exponential. A simpler specification for the generalized Box- Müller algorithm is provided using the shape of the tail decay. Original: The q-Gaussian distribution is known to be an attractor of certain correlated systems, and is the distribution which, under appropriate constraints, maximizes the entropy Sq, basis of nonextensive statistical mechanics. This theory is postulated as a natural extension of the standard (Boltzmann-Gibbs) statistical mechanics, and may explain the ubiquitous appearance of heavy-tailed distributions in both natural and man-made systems. The q-Gaussian distribution is also used as a numerical tool, for example as a visiting distribution in Generalized Simulated Annealing. We develop and present a simple, easy to implement numerical method for generating random deviates from a q-Gaussian distribution based upon a generalization of the well known Box-Muller method. Our method is suitable for a larger range of q values, q<3, than has previously appeared in the literature, and can generate deviates from q-Gaussian distributions of arbitrary width and center. MATLAB code showing a straightforward implementation is also included.

cond-mat.stat-mech↗

arXiv2007

Optimal transport on wireless networks

We present a study of the application of a variant of a recently introduced heuristic algorithm for the optimization of transport routes on complex networks to the problem of finding the optimal routes of communication between nodes on wireless networks. Our algorithm iteratively balances network traffic by minimizing the maximum node betweenness on the network. The variant we consider specifically accounts for the broadcast restrictions imposed by wireless communication by using a different betweenness measure. We compare the performance of our algorithm to two other known algorithms and find that our algorithm achieves the highest transport capacity both for minimum node degree geometric networks, which are directed geometric networks that model wireless communication networks, and for configuration model networks that are uncorrelated scale-free networks.

physics.soc-ph↗

arXiv2007

Transport optimization on complex networks

We present a comparative study of the application of a recently introduced heuristic algorithm to the optimization of transport on three major types of complex networks. The algorithm balances network traffic iteratively by minimizing the maximum node betweenness with as little path lengthening as possible. We show that by using this optimal routing, a network can sustain significantly higher traffic without jamming than in the case of shortest path routing. A formula is proved that allows quick computation of the average number of hops along the path and of the average travel times once the betweennesses of the nodes are computed. Using this formula, we show that routing optimization preserves the small-world character exhibited by networks under shortest path routing, and that it significantly reduces the average travel time on congested networks with only a negligible increase in the average travel time at low loads. Finally, we study the correlation between the weights of the links in the case of optimal routing and the betweennesses of the nodes connected by them.

cond-mat.dis-nn↗

arXiv2006

Optimal routing on complex networks

We present a novel heuristic algorithm for routing optimization on complex networks. Previously proposed routing optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to queuing overload. By using the resulting routing table, a network can sustain significantly higher traffic without jamming than in the case of traditional shortest path routing.

cond-mat.stat-mech↗

arXiv2006

Influence of global correlations on central limit theorems and entropic extensivity

We consider probabilistic models of N identical distinguishable, binary random variables. If these variables are strictly or asymptotically independent, then, for N>>1, (i) the attractor in distribution space is, according to the standard central limit theorem, a Gaussian, and (ii) the Boltzmann-Gibbs-Shannon entropy is extensive, meaning that S_BGS(N) ~ N . If these variables have any nonvanishing global (i.e., not asymptotically independent) correlations, then the attractor deviates from the Gaussian. The entropy appears to be more robust, in the sense that, in some cases, S_BGS remains extensive even in the presence of strong global correlations. In other cases, however, even weak global correlations make the entropy deviate from the normal behavior. More precisely, in such cases the entropic form Sq can become extensive for some value of q different from unity . This scenario is illustrated with several new as well as previously described models. The discussion illuminates recent progress into q-describable nonextensive probabilistic systems, and the conjectured q-Central Limit Theorem (q-CLT) which posses a q-Gaussian attractor.

cond-mat.stat-mech↗

arXiv2006

Congestion-gradient driven transport on complex networks

We present a study of transport on complex networks with routing based on local information. Particles hop from one node of the network to another according to a set of routing rules with different degrees of congestion awareness, ranging from random diffusion to rigid congestion-gradient driven flow. Each node can be either source or destination for particles and all nodes have the same routing capacity, which are features of ad-hoc wireless networks. It is shown that the transport capacity increases when a small amount of congestion awareness is present in the routing rules, and that it then decreases as the routing rules become too rigid when the flow becomes strictly congestion-gradient driven. Therefore, an optimum value of the congestion awareness exists in the routing rules. It is also shown that, in the limit of a large number of nodes, networks using routing based on local information jam at any nonzero load. Finally, we study the correlation between congestion at node level and a betweenness centrality measure.

cond-mat.stat-mech↗