1,302 research outputs found

    Vibrational dynamics of confined granular material

    Get PDF
    By means of two-dimensional contact dynamics simulations, we analyze the vibrational dynamics of a confined granular layer in response to harmonic forcing. We use irregular polygonal grains allowing for strong variability of solid fraction. The system involves a jammed state separating passive (loading) and active (unloading) states. We show that an approximate expression of the packing resistance force as a function of the displacement of the free retaining wall from the jamming position provides a good description of the dynamics. We study in detail the scaling of displacements and velocities with loading parameters. In particular, we find that, for a wide range of frequencies, the data collapse by scaling the displacements with the inverse square of frequency, the inverse of the force amplitude and the square of gravity. Interestingly, compaction occurs during the extension of the packing, followed by decompaction in the contraction phase. We show that the mean compaction rate increases linearly with frequency up to a characteristic frequency and then it declines in inverse proportion to frequency. The characteristic frequency is interpreted in terms of the time required for the relaxation of the packing through collective grain rearrangements between two equilibrium states

    Addition-Deletion Networks

    Full text link
    We study structural properties of growing networks where both addition and deletion of nodes are possible. Our model network evolves via two independent processes. With rate r, a node is added to the system and this node links to a randomly selected existing node. With rate 1, a randomly selected node is deleted, and its parent node inherits the links of its immediate descendants. We show that the in-component size distribution decays algebraically, c_k ~ k^{-beta}, as k-->infty. The exponent beta=2+1/(r-1) varies continuously with the addition rate r. Structural properties of the network including the height distribution, the diameter of the network, the average distance between two nodes, and the fraction of dangling nodes are also obtained analytically. Interestingly, the deletion process leads to a giant hub, a single node with a macroscopic degree whereas all other nodes have a microscopic degree.Comment: 8 pages, 5 figure

    Entropic Tightening of Vibrated Chains

    Full text link
    We investigate experimentally the distribution of configurations of a ring with an elementary topological constraint, a ``figure-8'' twist. Using vibrated granular chains, which permit controlled preparation and direct observation of such a constraint, we show that configurations where one of the loops is tight and the second is large are strongly preferred. This agrees with recent predictions for equilibrium properties of topologically-constrained polymers. However, the dynamics of the tightening process weakly violate detailed balance, a signature of the nonequilibrium nature of this system.Comment: 4 pages, 4 figure

    Stochastic Aggregation: Rate Equations Approach

    Full text link
    We investigate a class of stochastic aggregation processes involving two types of clusters: active and passive. The mass distribution is obtained analytically for several aggregation rates. When the aggregation rate is constant, we find that the mass distribution of passive clusters decays algebraically. Furthermore, the entire range of acceptable decay exponents is possible. For aggregation rates proportional to the cluster masses, we find that gelation is suppressed. In this case, the tail of the mass distribution decays exponentially for large masses, and as a power law over an intermediate size range.Comment: 7 page

    Discrete Analog of the Burgers Equation

    Full text link
    We propose the set of coupled ordinary differential equations dn_j/dt=(n_{j-1})^2-(n_j)^2 as a discrete analog of the classic Burgers equation. We focus on traveling waves and triangular waves, and find that these special solutions of the discrete system capture major features of their continuous counterpart. In particular, the propagation velocity of a traveling wave and the shape of a triangular wave match the continuous behavior. However, there are some subtle differences. For traveling waves, the propagating front can be extremely sharp as it exhibits double exponential decay. For triangular waves, there is an unexpected logarithmic shift in the location of the front. We establish these results using asymptotic analysis, heuristic arguments, and direct numerical integration.Comment: 6 pages, 5 figure

    Scaling of Reaction Zones in the A+B->0 Diffusion-Limited Reaction

    Full text link
    We study reaction zones in three different versions of the A+B->0 system. For a steady state formed by opposing currents of A and B particles we derive scaling behavior via renormalization group analysis. By use of a previously developed analogy, these results are extended to the time-dependent case of an initially segregated system. We also consider an initially mixed system, which forms reaction zones for dimension d<4. In this case an extension of the steady-state analogy gives scaling results characterized by new exponents.Comment: 4 pages, REVTeX 3.0 with epsf, 2 uuencoded postscript figures appended, OUTP-94-33

    Dimensionamento optimizado de sistemas adutores elevatórios de água : uma ferramenta essencial para o planeamento e gestão dos sistemas de abastecimento de água

    Get PDF
    Neste trabalho divulga-se um algoritmo para a concepção e dimensionamento de sistemas de abastecimento de água que incorpora ferramentas de optimização. São caracterizados os elementos base, designadamente descreve-se o procedimento para calcular os custos de investimento e os encargos de exploração. Concebe-se a tarefa de dimensionamento como um procedimento de optimização. Apresenta-se a formulação matemática do problema. O objectivo consiste em determinar o diâmetro da adutora que maximiza os resultados e que respeite as restrições técnicas. A equação resultante para a função objectivo e as restrições são não-lineares. Referem-se os algoritmos de optimização que poderão ser usados para o cálculo diâmetro óptimo. Descreve-se a metodologia desenvolvida. O interesse da formulação proposta é demonstrado com exemplos de aplicação. Emprega-se a metodologia na definição de fórmulas de pré-dimensionamento e no estabelecimento de funções de custo que quantifiquem os investimentos e os encargos de exploração em função do caudal de projecto. Estes resultados são elementos indispensáveis para modelos de optimização que definam a implantação e as políticas de exploração de origens de abastecimento de água, ou seja para o planeamento e gestão de recursos hídricos

    Probabilistic ballistic annihilation with continuous velocity distributions

    Full text link
    We investigate the problem of ballistically controlled reactions where particles either annihilate upon collision with probability pp, or undergo an elastic shock with probability 1−p1-p. Restricting to homogeneous systems, we provide in the scaling regime that emerges in the long time limit, analytical expressions for the exponents describing the time decay of the density and the root-mean-square velocity, as continuous functions of the probability pp and of a parameter related to the dissipation of energy. We work at the level of molecular chaos (non-linear Boltzmann equation), and using a systematic Sonine polynomials expansion of the velocity distribution, we obtain in arbitrary dimension the first non-Gaussian correction and the corresponding expressions for the decay exponents. We implement Monte-Carlo simulations in two dimensions, that are in excellent agreement with our analytical predictions. For p<1p<1, numerical simulations lead to conjecture that unlike for pure annihilation (p=1p=1), the velocity distribution becomes universal, i.e. does not depend on the initial conditions.Comment: 10 pages, 9 eps figures include

    Scale-Free Networks are Ultrasmall

    Full text link
    We study the diameter, or the mean distance between sites, in a scale-free network, having N sites and degree distribution p(k) ~ k^-a, i.e. the probability of having k links outgoing from a site. In contrast to the diameter of regular random networks or small world networks which is known to be d ~ lnN, we show, using analytical arguments, that scale free networks with 2<a<3 have a much smaller diameter, behaving as d ~ lnlnN. For a=3, our analysis yields d ~ lnN/lnlnN, as obtained by Bollobas and Riordan, while for a>3, d ~ lnN. We also show that, for any a>2, one can construct a deterministic scale free network with d ~ lnlnN, and this construction yields the lowest possible diameter.Comment: Latex, 4 pages, 2 eps figures, small corrections, added explanation
    • …
    corecore