Formation of color-singlet gluon-clusters and inelastic diffractive scattering

This is the extensive follow-up report of a recent Letter in which the existence of self-organized criticality (SOC) in systems of interacting soft gluons is proposed, and its consequences for inelastic diffractive scattering processes are discussed. It is pointed out, that color-singlet gluon-clusters can be formed in hadrons as a consequence of SOC in systems of interacting soft gluons, and that the properties of such spatiotemporal complexities can be probed experimentally by examing inelastic diffractive scattering. Theoretical arguments and experimental evidences supporting the proposed picture are presented --- together with the result of a systematic analysis of the existing data for inelastic diffractive scattering processes performed at different incident energies, and/or by using different beam-particles. It is shown in particular that the size- and the lifetime-distributions of such gluon-clusters can be directly extracted from the data, and the obtained results exhibit universal power-law behaviors --- in accordance with the expected SOC-fingerprints. As further consequences of SOC in systems of interacting soft gluons, the $t$-dependence and the $(M_x^2/s)$-dependence of the double differential cross-sections for inelastic diffractive scattering off proton-target are discussed. Here $t$ stands for the four-momentum-transfer squared, $M_x$ for the missing mass, and $\sqrt{s}$ for the total c.m.s. energy. It is shown, that the space-time properties of the color-singlet gluon-clusters due to SOC, discussed above, lead to simple analytical formulae for $d^2\sigma/dt d(M_x^2/s)$ and for $d\sigma/dt$, and that the obtained results are in good agreement with the existing data. Further experiments are suggested.Comment: 67 pages, including 11 figure

Resiliently evolving supply-demand networks

Peer reviewedPublisher PD

Bidirectional PageRank Estimation: From Average-Case to Worst-Case

We present a new algorithm for estimating the Personalized PageRank (PPR) between a source and target node on undirected graphs, with sublinear running-time guarantees over the worst-case choice of source and target nodes. Our work builds on a recent line of work on bidirectional estimators for PPR, which obtained sublinear running-time guarantees but in an average-case sense, for a uniformly random choice of target node. Crucially, we show how the reversibility of random walks on undirected networks can be exploited to convert average-case to worst-case guarantees. While past bidirectional methods combine forward random walks with reverse local pushes, our algorithm combines forward local pushes with reverse random walks. We also discuss how to modify our methods to estimate random-walk probabilities for any length distribution, thereby obtaining fast algorithms for estimating general graph diffusions, including the heat kernel, on undirected networks.Comment: Workshop on Algorithms and Models for the Web-Graph (WAW) 201

Aspect-Based Sentiment Analysis Using a Two-Step Neural Network Architecture

The World Wide Web holds a wealth of information in the form of unstructured texts such as customer reviews for products, events and more. By extracting and analyzing the expressed opinions in customer reviews in a fine-grained way, valuable opportunities and insights for customers and businesses can be gained. We propose a neural network based system to address the task of Aspect-Based Sentiment Analysis to compete in Task 2 of the ESWC-2016 Challenge on Semantic Sentiment Analysis. Our proposed architecture divides the task in two subtasks: aspect term extraction and aspect-specific sentiment extraction. This approach is flexible in that it allows to address each subtask independently. As a first step, a recurrent neural network is used to extract aspects from a text by framing the problem as a sequence labeling task. In a second step, a recurrent network processes each extracted aspect with respect to its context and predicts a sentiment label. The system uses pretrained semantic word embedding features which we experimentally enhance with semantic knowledge extracted from WordNet. Further features extracted from SenticNet prove to be beneficial for the extraction of sentiment labels. As the best performing system in its category, our proposed system proves to be an effective approach for the Aspect-Based Sentiment Analysis

Non-perturbative corrections to mean-field behavior: spherical model on spider-web graph

We consider the spherical model on a spider-web graph. This graph is effectively infinite-dimensional, similar to the Bethe lattice, but has loops. We show that these lead to non-trivial corrections to the simple mean-field behavior. We first determine all normal modes of the coupled springs problem on this graph, using its large symmetry group. In the thermodynamic limit, the spectrum is a set of $\delta$-functions, and all the modes are localized. The fractional number of modes with frequency less than $\omega$ varies as $\exp (-C/\omega)$ for $\omega$ tending to zero, where $C$ is a constant. For an unbiased random walk on the vertices of this graph, this implies that the probability of return to the origin at time $t$ varies as $\exp(- C' t^{1/3})$, for large $t$, where $C'$ is a constant. For the spherical model, we show that while the critical exponents take the values expected from the mean-field theory, the free-energy per site at temperature $T$, near and above the critical temperature $T_c$, also has an essential singularity of the type $\exp[ -K {(T - T_c)}^{-1/2}]$.Comment: substantially revised, a section adde

Calculation of a Class of Three-Loop Vacuum Diagrams with Two Different Mass Values

We calculate analytically a class of three-loop vacuum diagrams with two different mass values, one of which is one-third as large as the other, using the method of Chetyrkin, Misiak, and M\"{u}nz in the dimensional regularization scheme. All pole terms in \epsilon=4-D (D being the space-time dimensions in a dimensional regularization scheme) plus finite terms containing the logarithm of mass are kept in our calculation of each diagram. It is shown that three-loop effective potential calculated using three-loop integrals obtained in this paper agrees, in the large-N limit, with the overlap part of leading-order (in the large-N limit) calculation of Coleman, Jackiw, and Politzer [Phys. Rev. D {\bf 10}, 2491 (1974)].Comment: RevTex, 15 pages, 4 postscript figures, minor corrections in K(c), Appendix B removed, typos corrected, acknowledgements change

Interference measurements of non-Abelian e/4 & Abelian e/2 quasiparticle braiding

The quantum Hall states at filling factors $\nu=5/2$ and $7/2$ are expected to have Abelian charge $e/2$ quasiparticles and non-Abelian charge $e/4$ quasiparticles. For the first time we report experimental evidence for the non-Abelian nature of excitations at $\nu=7/2$ and examine the fermion parity, a topological quantum number of an even number of non-Abelian quasiparticles, by measuring resistance oscillations as a function of magnetic field in Fabry-P\'erot interferometers using new high purity heterostructures. The phase of observed $e/4$ oscillations is reproducible and stable over long times (hours) near $\nu=5/2$ and $7/2$, indicating stability of the fermion parity. When phase fluctuations are observed, they are predominantly $\pi$ phase flips, consistent with fermion parity change. We also examine lower-frequency oscillations attributable to Abelian interference processes in both states. Taken together, these results constitute new evidence for the non-Abelian nature of $e/4$ quasiparticles; the observed life-time of their combined fermion parity further strengthens the case for their utility for topological quantum computation.Comment: A significantly revised version; 54 double-column pages containing 14 pages of main text + Supplementary Materials. The figures, which include a number of new figures, are now incorporated into the tex

Private Outsourcing of Polynomial Evaluation and Matrix Multiplication using Multilinear Maps

{\em Verifiable computation} (VC) allows a computationally weak client to outsource the evaluation of a function on many inputs to a powerful but untrusted server. The client invests a large amount of off-line computation and gives an encoding of its function to the server. The server returns both an evaluation of the function on the client's input and a proof such that the client can verify the evaluation using substantially less effort than doing the evaluation on its own. We consider how to privately outsource computations using {\em privacy preserving} VC schemes whose executions reveal no information on the client's input or function to the server. We construct VC schemes with {\em input privacy} for univariate polynomial evaluation and matrix multiplication and then extend them such that the {\em function privacy} is also achieved. Our tool is the recently developed {mutilinear maps}. The proposed VC schemes can be used in outsourcing {private information retrieval (PIR)}.Comment: 23 pages, A preliminary version appears in the 12th International Conference on Cryptology and Network Security (CANS 2013

Network Structure, Topology and Dynamics in Generalized Models of Synchronization

We explore the interplay of network structure, topology, and dynamic interactions between nodes using the paradigm of distributed synchronization in a network of coupled oscillators. As the network evolves to a global steady state, interconnected oscillators synchronize in stages, revealing network's underlying community structure. Traditional models of synchronization assume that interactions between nodes are mediated by a conservative process, such as diffusion. However, social and biological processes are often non-conservative. We propose a new model of synchronization in a network of oscillators coupled via non-conservative processes. We study dynamics of synchronization of a synthetic and real-world networks and show that different synchronization models reveal different structures within the same network

Enhancing complex-network synchronization

Heterogeneity in the degree (connectivity) distribution has been shown to suppress synchronization in networks of symmetrically coupled oscillators with uniform coupling strength (unweighted coupling). Here we uncover a condition for enhanced synchronization in directed networks with weighted coupling. We show that, in the optimum regime, synchronizability is solely determined by the average degree and does not depend on the system size and the details of the degree distribution. In scale-free networks, where the average degree may increase with heterogeneity, synchronizability is drastically enhanced and may become positively correlated with heterogeneity, while the overall cost involved in the network coupling is significantly reduced as compared to the case of unweighted coupling.Comment: 4 pages, 3 figure