2,779 research outputs found

    Flows on Graphs with Random Capacities

    Full text link
    We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold that depends on the distribution of capacities. We then examine the maximal total flux from the root to the leaves. Our methods generalize to simple graphs with loops, e.g., to hierarchical lattices and to complete graphs.Comment: 8 pages, 6 figure

    Maximum relative height of one-dimensional interfaces : from Rayleigh to Airy distribution

    Full text link
    We introduce an alternative definition of the relative height h^\kappa(x) of a one-dimensional fluctuating interface indexed by a continuously varying real paramater 0 \leq \kappa \leq 1. It interpolates between the height relative to the initial value (i.e. in x=0) when \kappa = 0 and the height relative to the spatially averaged height for \kappa = 1. We compute exactly the distribution P^\kappa(h_m,L) of the maximum h_m of these relative heights for systems of finite size L and periodic boundary conditions. One finds that it takes the scaling form P^\kappa(h_m,L) = L^{-1/2} f^\kappa (h_m L^{-1/2}) where the scaling function f^\kappa(x) interpolates between the Rayleigh distribution for \kappa=0 and the Airy distribution for \kappa=1, the latter being the probability distribution of the area under a Brownian excursion over the unit interval. For arbitrary \kappa, one finds that it is related to, albeit different from, the distribution of the area restricted to the interval [0, \kappa] under a Brownian excursion over the unit interval.Comment: 25 pages, 4 figure

    VLT/NACO astrometry of the HR8799 planetary system. L'-band observations of the three outer planets

    Full text link
    HR8799 is so far the only directly imaged multiple exoplanet system. The orbital configuration would, if better known, provide valuable insight into the formation and dynamical evolution of wide-orbit planetary systems. We present L'-band observations of the HR8799 system obtained with NACO at VLT, adding to the astrometric monitoring of the planets HR8799b, c and d. We investigate how well the two simple cases of (i) a circular orbit and (ii) a face-on orbit fit the astrometric data for HR8799d over a total time baseline of ~2 years. The results indicate that the orbit of HR8799d is inclined with respect to our line of sight, and suggest that the orbit is slightly eccentric or non-coplanar with the outer planets and debris disk.Comment: 5 pages, 4 figures, 1 table, accepted for publication in A\&A. Updated version includes minor changes made in the proof

    Structure and magnetism of Cr2BP3O12: Towards the quantum-classical crossover in a spin-3/2 alternating chain

    Full text link
    Magnetic properties of the spin-3/2 Heisenberg system Cr2BP3O12 are investigated by magnetic susceptibility chi(T) measurements, electron spin resonance, neutron diffraction, and density functional theory (DFT) calculations, as well as classical and quantum Monte Carlo (MC) simulations. The broad maximum of chi(T) at 85K and the antiferromagnetic Weiss temperature of 139 K indicate low-dimensional magnetic behavior. Below TN = 28 K, Cr2BP3O12 is antiferromagnetically ordered with the k = 0 propagation vector and an ordered moment of 2.5 muB/Cr. DFT calculations, including DFT+U and hybrid functionals, yield a microscopic model of spin chains with alternating nearest-neighbor couplings J1 and J1' . The chains are coupled by two inequivalent interchain exchanges of similar strength (~1-2 K), but different sign (antiferromagnetic and ferromagnetic). The resulting spin lattice is quasi-one-dimensional and not frustrated. Quantum MC simulations show excellent agreement with the experimental data for the parameters J1 ~= 50 K and J1'/J1 ~= 0.5. Therefore, Cr2BP3O12 is close to the gapless critical point (J1'/J1 = 0.41) of the spin-3/2 bond-alternating Heisenberg chain. The applicability limits of the classical approximation are addressed by quantum and classical MC simulations. Implications for a wide range of low-dimensional S = 3/2 materials are discussed.Comment: Published version: 13 pages, 7 figures, 5 tables + Supplementary informatio

    The networked seceder model: Group formation in social and economic systems

    Full text link
    The seceder model illustrates how the desire to be different than the average can lead to formation of groups in a population. We turn the original, agent based, seceder model into a model of network evolution. We find that the structural characteristics our model closely matches empirical social networks. Statistics for the dynamics of group formation are also given. Extensions of the model to networks of companies are also discussed

    Probabilistic Analysis of Facility Location on Random Shortest Path Metrics

    Get PDF
    The facility location problem is an NP-hard optimization problem. Therefore, approximation algorithms are often used to solve large instances. Such algorithms often perform much better than worst-case analysis suggests. Therefore, probabilistic analysis is a widely used tool to analyze such algorithms. Most research on probabilistic analysis of NP-hard optimization problems involving metric spaces, such as the facility location problem, has been focused on Euclidean instances, and also instances with independent (random) edge lengths, which are non-metric, have been researched. We would like to extend this knowledge to other, more general, metrics. We investigate the facility location problem using random shortest path metrics. We analyze some probabilistic properties for a simple greedy heuristic which gives a solution to the facility location problem: opening the κ\kappa cheapest facilities (with κ\kappa only depending on the facility opening costs). If the facility opening costs are such that κ\kappa is not too large, then we show that this heuristic is asymptotically optimal. On the other hand, for large values of κ\kappa, the analysis becomes more difficult, and we provide a closed-form expression as upper bound for the expected approximation ratio. In the special case where all facility opening costs are equal this closed-form expression reduces to O(ln(n)4)O(\sqrt[4]{\ln(n)}) or O(1)O(1) or even 1+o(1)1+o(1) if the opening costs are sufficiently small.Comment: A preliminary version accepted to CiE 201

    Critical behaviour of combinatorial search algorithms, and the unitary-propagation universality class

    Full text link
    The probability P(alpha, N) that search algorithms for random Satisfiability problems successfully find a solution is studied as a function of the ratio alpha of constraints per variable and the number N of variables. P is shown to be finite if alpha lies below an algorithm--dependent threshold alpha\_A, and exponentially small in N above. The critical behaviour is universal for all algorithms based on the widely-used unitary propagation rule: P[ (1 + epsilon) alpha\_A, N] ~ exp[-N^(1/6) Phi(epsilon N^(1/3)) ]. Exponents are related to the critical behaviour of random graphs, and the scaling function Phi is exactly calculated through a mapping onto a diffusion-and-death problem.Comment: 7 pages; 3 figure

    Dynamic scaling regimes of collective decision making

    Full text link
    We investigate a social system of agents faced with a binary choice. We assume there is a correct, or beneficial, outcome of this choice. Furthermore, we assume agents are influenced by others in making their decision, and that the agents can obtain information that may guide them towards making a correct decision. The dynamic model we propose is of nonequilibrium type, converging to a final decision. We run it on random graphs and scale-free networks. On random graphs, we find two distinct regions in terms of the "finalizing time" -- the time until all agents have finalized their decisions. On scale-free networks on the other hand, there does not seem to be any such distinct scaling regions

    Astrometric and photometric monitoring of GQ Lup and its sub-stellar companion

    Full text link
    Neuhaeuser et al. (2005) presented direct imaging evidence for a sub-stellar companion to the young T Tauri star GQ Lup. Common proper motion was highly significant, but no orbital motion was detected. Faint luminosity, low gravity, and a late-M/early-L spectral type indicated that the companion is either a planet or a brown dwarf. We have monitored GQ Lup and its companion in order to detect orbital and parallactic motion and variability in its brightness. We also search for closer and fainter companions. We have taken six more images with the VLT Adaptive Optics instrument NACO from May 2005 to Feb 2007, always with the same calibration binary from Hipparcos for both astrometric and photometric calibration. By adding up all the images taken so far, we search for additional companions. The position of GQ Lup A and its companion compared to a nearby non-moving background object varies as expected for parallactic motion by about one pixel (2 \pi with parallax \pi). We could not find evidence for variability of the GQ Lup companion in the K-band (standard deviation being \pm 0.08 mag), which may be due to large error bars. No additional companions are found with deep imaging. There is now exceedingly high significance for common proper motion of GQ Lup A and its companion. In addition, we see for the first time an indication for orbital motion (about 2 to 3 mas/yr decrease in separation, but no significant change in the position angle), consistent with a near edge-on or highly eccentric orbit. We measured the parallax for GQ Lup A to be \pi = 6.4 \pm 1.9 mas (i.e. 156 \pm 50 pc) and for the GQ Lup companion to be 7.2 \pm 2.1 mas (i.e. 139 \pm 45 pc), both consistent with being in the Lupus I cloud and bound to each other.Comment: A&A in pres
    corecore