15,377 research outputs found

    On the extra phase correction to the semiclassical spin coherent-state propagator

    Get PDF
    The problem of an origin of the Solary-Kochetov extra-phase contribution to the naive semiclassical form of a generalized phase-space propagator is addressed with the special reference to the su(2) spin case which is the most important in applications. While the extra-phase correction to a flat phase-space propagator can straightforwardly be shown to appear as a difference between the principal and the Weyl symbols of a Hamiltonian in the next-to-leading order expansion in the semiclassical parameter, the same statement for the semiclassical spin coherent-state propagator holds provided the Holstein-Primakoff representation of the su(2) algebra generators is employed.Comment: 19 pages, no figures; a more general treatment is presented, some references are added, title is slightly changed; submitted to JM

    On-Line End-to-End Congestion Control

    Full text link
    Congestion control in the current Internet is accomplished mainly by TCP/IP. To understand the macroscopic network behavior that results from TCP/IP and similar end-to-end protocols, one main analytic technique is to show that the the protocol maximizes some global objective function of the network traffic. Here we analyze a particular end-to-end, MIMD (multiplicative-increase, multiplicative-decrease) protocol. We show that if all users of the network use the protocol, and all connections last for at least logarithmically many rounds, then the total weighted throughput (value of all packets received) is near the maximum possible. Our analysis includes round-trip-times, and (in contrast to most previous analyses) gives explicit convergence rates, allows connections to start and stop, and allows capacities to change.Comment: Proceedings IEEE Symp. Foundations of Computer Science, 200

    Optimal Active Social Network De-anonymization Using Information Thresholds

    Full text link
    In this paper, de-anonymizing internet users by actively querying their group memberships in social networks is considered. In this problem, an anonymous victim visits the attacker's website, and the attacker uses the victim's browser history to query her social media activity for the purpose of de-anonymization using the minimum number of queries. A stochastic model of the problem is considered where the attacker has partial prior knowledge of the group membership graph and receives noisy responses to its real-time queries. The victim's identity is assumed to be chosen randomly based on a given distribution which models the users' risk of visiting the malicious website. A de-anonymization algorithm is proposed which operates based on information thresholds and its performance both in the finite and asymptotically large social network regimes is analyzed. Furthermore, a converse result is provided which proves the optimality of the proposed attack strategy

    The Giant Monopole Resonance in Pb isotopes

    Full text link
    The extraction of the nuclear incompressibility from the isoscalar giant monopole resonance (GMR) measurements is analysed. Both pairing and mutually enhanced magicity (MEM) effects play a role in the shift of the GMR energy between the doubly closed shell 208^{208}Pb nucleus and other Pb isotopes. Pairing effects are microscopically predicted whereas the MEM effect is phenomenologically evaluated. Accurate measurements of the GMR in open-shell Pb isotopes are called for.Comment: 4 page

    Seeded Graph Matching: Efficient Algorithms and Theoretical Guarantees

    Full text link
    In this paper, a new information theoretic framework for graph matching is introduced. Using this framework, the graph isomorphism and seeded graph matching problems are studied. The maximum degree algorithm for graph isomorphism is analyzed and sufficient conditions for successful matching are rederived using type analysis. Furthermore, a new seeded matching algorithm with polynomial time complexity is introduced. The algorithm uses `typicality matching' and techniques from point-to-point communications for reliable matching. Assuming an Erdos-Renyi model on the correlated graph pair, it is shown that successful matching is guaranteed when the number of seeds grows logarithmically with the number of vertices in the graphs. The logarithmic coefficient is shown to be inversely proportional to the mutual information between the edge variables in the two graphs

    Geometric-Phase-Effect Tunnel-Splitting Oscillations in Single-Molecule Magnets with Fourth-Order Anisotropy Induced by Orthorhombic Distortion

    Full text link
    We analyze the interference between tunneling paths that occurs for a spin system with both fourth-order and second-order transverse anisotropy. Using an instanton approach, we find that as the strength of the second-order transverse anisotropy is increased, the tunnel splitting is modulated, with zeros occurring periodically. This effect results from the interference of four tunneling paths connecting easy-axis spin orientations and occurs in the absence of any magnetic field.Comment: 6 pages, 5 eps figures. Version published in EPL. Expanded from v1: Appendix added, references added, 1 figure added, others modified cosmeticall
    • …
    corecore