1,166 research outputs found

    Distribution of Dangling Ends on the Incipient Percolation Cluster

    Full text link
    We study numerically and by scaling arguments the probability P(M)dM that a given dangling end of the incipient percolation cluster has a mass between M and M + dM. We find by scaling arguments that P(M) decays with a power law, P(M)~M^(-(1+k)), with an exponent k=dBf/df, where df and dBf are the fractal dimensions of the cluster and its backbone, respectively. Our numerical results yield k=0.83 in d=2 and k=0.74 in d=3 in very good agreement with theory.Comment: proceedings of the conference "Percolation and Disordered Systems: *Theory and Applications*", Giessen (Germany) 1998, see http://ory.ph.biu.ac.il/PERCOLATION98/ , 4 pages, 3 figures, in press, will be published in Physica

    Satellite antenna management system and method

    Get PDF
    The antenna management system and method allow a satellite to communicate with a ground station either directly or by an intermediary of a second satellite, thus permitting communication even when the satellite is not within range of the ground station. The system and method employ five major software components, which are the control and initialization module, the command and telemetry handler module, the contact schedule processor module, the contact state machining module, and the telemetry state machine module. The control and initialization module initializes the system and operates the main control cycle, in which the other modules are called. The command and telemetry handler module handles communication to and from the ground station. The contact scheduler processor module handles the contact entry schedules to allow scheduling of contacts with the second satellite. The contact and telemetry state machine modules handle the various states of the satellite in beginning, maintaining and ending contact with the second satellite and in beginning, maintaining and ending communication with the satellite

    First-order rigidity transition on Bethe Lattices

    Full text link
    Tree models for rigidity percolation are introduced and solved. A probability vector describes the propagation of rigidity outward from a rigid border. All components of this ``vector order parameter'' are singular at the same rigidity threshold, pcp_c. The infinite-cluster probability PP_{\infty} is usually first-order at pcp_c, but often behaves as PΔP+(ppc)1/2P_{\infty} \sim \Delta P_{\infty} + (p-p_c)^{1/2}, indicating critical fluctuations superimposed on a first order jump. Our tree models for rigidity are in qualitative disagreement with ``constraint counting'' mean field theories. In an important sub-class of tree models ``Bootstrap'' percolation and rigidity percolation are equivalent.Comment: RevTeX, 11 pages + 8 .gif figure

    A DECOMPOSED REGRESSION MODEL FOR MEASURING STRUCTURAL CHANGES IN THE FLOUR MILLING INDUSTRY

    Get PDF
    This paper presents a decomposed Poisson regression model based on count data that evaluates the size distribution, the changing number of flour mills for each size class, and the concentration of market power, simultaneously. This model also allows us to test dominant price leadership model.Agribusiness, Industrial Organization,

    Reply to the comment by Jacobs and Thorpe

    Full text link
    Reply to a comment on "Infinite-Cluster geometry in central-force networks", PRL 78 (1997), 1480. A discussion about the order of the rigidity percolation transition.Comment: 1 page revTe

    The Approximate Invariance of the Average Number of Connections for the Continuum Percolation of Squares at Criticality

    Full text link
    We perform Monte Carlo simulations to determine the average excluded area ofrandomlyorientedsquares,randomlyorientedwidthlesssticksandalignedsquaresintwodimensions.Wefindsignificantdifferencesbetweenourresultsforrandomlyorientedsquaresandpreviousanalyticalresultsforthesame.Thesourcesofthesedifferencesareexplained.Usingourresultsfor of randomly oriented squares, randomly oriented widthless sticks and aligned squares in two dimensions. We find significant differences between our results for randomly oriented squares and previous analytical results for the same. The sources of these differences are explained. Using our results for and Monte Carlo simulation results for the percolation threshold, we estimate the mean number of connections per object BcB_c at the percolation threshold for squares in 2-D. We study systems of squares that are allowed random orientations within a specified angular interval. Our simulations show that the variation in BcB_c is within 1.6% when the angular interval is varied from 0 to π/2\pi/2

    Universal Susceptibility Variations in 1+1 Dimensional Vortex Glass

    Full text link
    We model a planar array of fluxlines as a discrete solid-on-solid model with quenched disorder. Simulations at finite temperatures are made possible by a new algorithm which circumvents the slow glassy dynamics encountered by traditional Metropolis Monte Carlo algorithms. Numerical results on magnetic susceptibility variations support analytic predictions.Comment: 6 pages, elsart file enclosed, 4 figures. Comments can be sent to [email protected]
    corecore