WorldWideScience

Sample records for graphs feller brownian

  1. Feller processes: the next generation in modeling. Brownian motion, Lévy processes and beyond.

    Directory of Open Access Journals (Sweden)

    Björn Böttcher

    Full Text Available We present a simple construction method for Feller processes and a framework for the generation of sample paths of Feller processes. The construction is based on state space dependent mixing of Lévy processes. Brownian Motion is one of the most frequently used continuous time Markov processes in applications. In recent years also Lévy processes, of which Brownian Motion is a special case, have become increasingly popular. Lévy processes are spatially homogeneous, but empirical data often suggest the use of spatially inhomogeneous processes. Thus it seems necessary to go to the next level of generalization: Feller processes. These include Lévy processes and in particular brownian motion as special cases but allow spatial inhomogeneities. Many properties of Feller processes are known, but proving the very existence is, in general, very technical. Moreover, an applicable framework for the generation of sample paths of a Feller process was missing. We explain, with practitioners in mind, how to overcome both of these obstacles. In particular our simulation technique allows to apply Monte Carlo methods to Feller processes.

  2. Occupation times distribution for Brownian motion on graphs

    CERN Document Server

    Desbois, J

    2002-01-01

    Considering a Brownian motion on a general graph, we study the joint law for the occupation times on all the bonds. In particular, we show that the Laplace transform of this distribution can be expressed as the ratio of two determinants. We give two formulations, with arc or vertex matrices, for this result and discuss a simple example. (letter to the editor)

  3. Functionals of Brownian motion, localization and metric graphs

    International Nuclear Information System (INIS)

    Comtet, Alain; Desbois, Jean; Texier, Christophe

    2005-01-01

    We review several results related to the problem of a quantum particle in a random environment. In an introductory part, we recall how several functionals of Brownian motion arise in the study of electronic transport in weakly disordered metals (weak localization). Two aspects of the physics of the one-dimensional strong localization are reviewed: some properties of the scattering by a random potential (time delay distribution) and a study of the spectrum of a random potential on a bounded domain (the extreme value statistics of the eigenvalues). Then we mention several results concerning the diffusion on graphs, and more generally the spectral properties of the Schroedinger operator on graphs. The interest of spectral determinants as generating functions characterizing the diffusion on graphs is illustrated. Finally, we consider a two-dimensional model of a charged particle coupled to the random magnetic field due to magnetic vortices. We recall the connection between spectral properties of this model and winding functionals of planar Brownian motion. (topical review)

  4. Degree distributions of the visibility graphs mapped from fractional Brownian motions and multifractal random walks

    International Nuclear Information System (INIS)

    Ni Xiaohui; Jiang Zhiqiang; Zhou Weixing

    2009-01-01

    The dynamics of a complex system is usually recorded in the form of time series, which can be studied through its visibility graph from a complex network perspective. We investigate the visibility graphs extracted from fractional Brownian motions and multifractal random walks, and find that the degree distributions exhibit power-law behaviors, in which the power-law exponent α is a linear function of the Hurst index H of the time series. We also find that the degree distribution of the visibility graph is mainly determined by the temporal correlation of the original time series with minor influence from the possible multifractal nature. As an example, we study the visibility graphs constructed from three Chinese stock market indexes and unveil that the degree distributions have power-law tails, where the tail exponents of the visibility graphs and the Hurst indexes of the indexes are close to the α∼H linear relationship.

  5. Quasi-Feller Markov chains

    Directory of Open Access Journals (Sweden)

    Jean B. Lasserre

    2000-01-01

    Full Text Available We consider the class of Markov kernels for which the weak or strong Feller property fails to hold at some discontinuity set. We provide a simple necessary and sufficient condition for existence of an invariant probability measure as well as a Foster-Lyapunov sufficient condition. We also characterize a subclass, the quasi (weak or strong Feller kernels, for which the sequences of expected occupation measures share the same asymptotic properties as for (weak or strong Feller kernels. In particular, it is shown that the sequences of expected occupation measures of strong and quasi strong-Feller kernels with an invariant probability measure converge setwise to an invariant measure.

  6. Feller-buncher Operator Breaks Power Line

    Science.gov (United States)

    J. Thompson

    2014-01-01

    On a summer day in the South, a rubber-tired feller-buncher operator was performing a first thinning in a pine plantation. The feller-buncher was working in a new area of the stand, removing the take-down row and thinning the two rows on either side. The trees were approximately 15 years old, and there was a relatively thick layer of underbrush. The stand of timber...

  7. Statistical mixing and aggregation in Feller diffusion

    International Nuclear Information System (INIS)

    Anteneodo, C; Duarte Queirós, S M

    2009-01-01

    We consider Feller mean-reverting square-root diffusion, which has been applied to model a wide variety of processes with linearly state-dependent diffusion, such as stochastic volatility and interest rates in finance, and neuronal and population dynamics in the natural sciences. We focus on the statistical mixing (or superstatistical) process in which the parameter related to the mean value can fluctuate—a plausible mechanism for the emergence of heavy-tailed distributions. We obtain analytical results for the associated probability density function (both stationary and time-dependent), its correlation structure and aggregation properties. Our results are applied to explain the statistics of stock traded volume at different aggregation scales

  8. Brownian entanglement

    International Nuclear Information System (INIS)

    Allahverdyan, A.E.; Khrennikov, A.; Nieuwenhuizen, Th.M.

    2005-01-01

    For two classical Brownian particles an analog of continuous-variable quantum entanglement is presented: The common probability distribution of the two coordinates and the corresponding coarse-grained velocities cannot always be prepared via mixing of any factorized distributions referring to the two particles separately. This is possible for particles which have interacted in the past, but do not interact at present. Three factors are crucial for the effect: (1) separation of time scales of coordinate and momentum which motivates the definition of coarse-grained velocities; (2) the resulting uncertainty relations between the coordinate of the Brownian particle and the change of its coarse-grained velocity; (3) the fact that the coarse-grained velocity, though pertaining to a single Brownian particle, is defined on a common context of two particles. The Brownian entanglement is a consequence of a coarse-grained description and disappears for a finer resolution of the Brownian motion. Analogies with the quantum situation are discussed, as well as possibilities of experimental realization of the effect in examples of macroscopic Brownian motion

  9. On Feller's criterion for the law of the iterated logarithm

    Directory of Open Access Journals (Sweden)

    Deli Li

    1994-01-01

    Full Text Available Combining Feller's criterion with a non-uniform estimate result in the context of the Central Limit Theorem for partial sums of independent random variables, we obtain several results on the Law of the Iterated Logarithm. Two of these results refine corresponding results of Wittmann (1985 and Egorov (1971. In addition, these results are compared with the corresponding results of Teicher (1974, Tomkins (1983 and Tomkins (1990

  10. Population death sequences and Cox processes driven by interacting Feller diffusions

    CERN Document Server

    Wei Gang; Feng Jian Feng

    2002-01-01

    We carry out a complete study on the relationship between Cox processes driven by interacting Feller diffusions and death sequences of immigration-emigration linked population networks. It is first proved that the Cox process driven by a Feller diffusion is equivalent to the death sequence of a birth and death process. The conclusion is then generalized to the case of Cox processes driven by interacting Feller diffusions and death sequences of interacting populations.

  11. Population death sequences and Cox processes driven by interacting Feller diffusions

    International Nuclear Information System (INIS)

    Wei Gang; Clifford, Peter; Feng Jianfeng

    2002-01-01

    We carry out a complete study on the relationship between Cox processes driven by interacting Feller diffusions and death sequences of immigration-emigration linked population networks. It is first proved that the Cox process driven by a Feller diffusion is equivalent to the death sequence of a birth and death process. The conclusion is then generalized to the case of Cox processes driven by interacting Feller diffusions and death sequences of interacting populations

  12. Population death sequences and Cox processes driven by interacting Feller diffusions

    Energy Technology Data Exchange (ETDEWEB)

    Wei Gang [Department of Mathematics, Baptist University, Hong Kong (China); Clifford, Peter [Department of Statistics, 1 South Parks Road, Oxford (United Kingdom); Feng Jianfeng [COGS, Sussex University, Brighton (United Kingdom)

    2002-11-08

    We carry out a complete study on the relationship between Cox processes driven by interacting Feller diffusions and death sequences of immigration-emigration linked population networks. It is first proved that the Cox process driven by a Feller diffusion is equivalent to the death sequence of a birth and death process. The conclusion is then generalized to the case of Cox processes driven by interacting Feller diffusions and death sequences of interacting populations.

  13. Conception of Brownian coil

    OpenAIRE

    Zhang, Jiayuan

    2018-01-01

    This article proposes a conception of Brownian coil. Brownian coil is a tiny coil with the same size of pollen. Once immersed into designed magnetic field and liquid, the coil will be moved and deformed macroscopically, due to the microscopic thermodynamic molecular collisions. Such deformation and movement will change the magnetic flux through the coil, by which an ElectroMotive Force (EMF) is produced. In this work, Brownian heat exchanger and Brownian generator are further designed to tran...

  14. Brownian modulated optical nanoprobes

    International Nuclear Information System (INIS)

    Behrend, C.J.; Anker, J.N.; Kopelman, R.

    2004-01-01

    Brownian modulated optical nanoprobes (Brownian MOONs) are fluorescent micro- and nanoparticles that resemble moons: one hemisphere emits a bright fluorescent signal, while an opaque metal darkens the other hemisphere. Brownian motion causes the particles to tumble and blink erratically as they rotate literally through the phases of the moon. The fluctuating probe signals are separated from optical and electronic backgrounds using principal components analysis or images analysis. Brownian MOONs enable microrheological measurements on size scales and timescales that are difficult to study with other methods. Local chemical concentrations can be measured simultaneously, using spectral characteristics of indicator dyes embedded within the MOONs

  15. The Brownian loop soup

    OpenAIRE

    Lawler, Gregory F.; Werner, Wendelin

    2003-01-01

    We define a natural conformally invariant measure on unrooted Brownian loops in the plane and study some of its properties. We relate this measure to a measure on loops rooted at a boundary point of a domain and show how this relation gives a way to ``chronologically add Brownian loops'' to simple curves in the plane.

  16. Stochastic flows in the Brownian web and net

    Czech Academy of Sciences Publication Activity Database

    Schertzer, E.; Sun, R.; Swart, Jan M.

    2014-01-01

    Roč. 227, č. 1065 (2014), s. 1-160 ISSN 0065-9266 R&D Projects: GA ČR GA201/07/0237; GA ČR GA201/09/1931 Institutional support: RVO:67985556 Keywords : Brownian web * Brownian net * stochastic flow of kernels * measure-valued process * Howitt-Warren flow * linear system * random walk in random environment * finite graph representation Subject RIV: BA - General Mathematics Impact factor: 1.727, year: 2014 http://library.utia.cas.cz/separaty/2013/SI/swart-0396636.pdf

  17. Production and cost analysis of a feller-buncher in central Appalachian hardwood forest

    Science.gov (United States)

    Charlie Long; Jingxin Wang; Joe McNeel; John Baumgras; John Baumgras

    2002-01-01

    A time study was conducted to evaluate the productivity and cost of a feller-buncher operating in a Central Appalachian hardwood forest. The sites harvested during observation consisted of primarily red maple and black cherry. Trees felled in the study had an average diameter at breast height (DBH) of 16.1 in. and a total merchantable height of 16 ft. A Timbco 445C...

  18. Graph Aggregation

    NARCIS (Netherlands)

    Endriss, U.; Grandi, U.

    Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference

  19. Irreversible Brownian Heat Engine

    Science.gov (United States)

    Taye, Mesfin Asfaw

    2017-10-01

    We model a Brownian heat engine as a Brownian particle that hops in a periodic ratchet potential where the ratchet potential is coupled with a linearly decreasing background temperature. We show that the efficiency of such Brownian heat engine approaches the efficiency of endoreversible engine η =1-√{{Tc/Th}} [23]. On the other hand, the maximum power efficiency of the engine approaches η ^{MAX}=1-({Tc/Th})^{1\\over 4}. It is shown that the optimized efficiency always lies between the efficiency at quasistatic limit and the efficiency at maximum power while the efficiency at maximum power is always less than the optimized efficiency since the fast motion of the particle comes at the expense of the energy cost. If the heat exchange at the boundary of the heat baths is included, we show that such a Brownian heat engine has a higher performance when acting as a refrigerator than when operating as a device subjected to a piecewise constant temperature. The role of time on the performance of the motor is also explored via numerical simulations. Our numerical results depict that the time t and the external load dictate the direction of the particle velocity. Moreover, the performance of the heat engine improves with time. At large t (steady state), the velocity, the efficiency and the coefficient of performance of the refrigerator attain their maximum value. Furthermore, we study the effect of temperature by considering a viscous friction that decreases exponentially as the background temperature increases. Our result depicts that the Brownian particle exhibits a fast unidirectional motion when the viscous friction is temperature dependent than that of constant viscous friction. Moreover, the efficiency of this motor is considerably enhanced when the viscous friction is temperature dependent. On the hand, the motor exhibits a higher performance of the refrigerator when the viscous friction is taken to be constant.

  20. Meandering Brownian Donkeys

    Science.gov (United States)

    Eichhorn, R.; Reimann, P.

    2004-04-01

    We consider a Brownian particle whose motion is confined to a ``meandering'' pathway and which is driven away from thermal equilibrium by an alternating external force. This system exhibits absolute negative mobility, i.e. when an external static force is applied the particle moves in the direction opposite to that force. We reveal the physical mechanism behind this ``donkey-like'' behavior, and derive analytical approximations that are in excellent agreement with numerical results.

  1. Meandering Brownian Donkeys

    International Nuclear Information System (INIS)

    Eichhorn, R.; Reimann, P.

    2004-01-01

    We consider a Brownian particle whose motion is confined to a ''meandering'' pathway and which is driven away from thermal equilibrium by an alternating external force. This system exhibits absolute negative mobility, i.e. when an external static force is applied the particle moves in the direction opposite to that force. We reveal the physical mechanism behind this ''donkey-like'' behavior, and derive analytical approximations that are in excellent agreement with numerical results. (author)

  2. Graph sampling

    OpenAIRE

    Zhang, L.-C.; Patone, M.

    2017-01-01

    We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.

  3. Avaliação operacional e econômica do "feller-buncher" em dois subsistemas de colheita de florestas de eucalipto Technical and economic analysis of a feller-buncher in two harvest subsystems of eucalyptus forests

    Directory of Open Access Journals (Sweden)

    Fábio Murilo Tieghi Moreira

    2004-04-01

    Full Text Available O objetivo deste trabalho foi avaliar técnica e economicamente o feller-buncher em dois subsistemas de colheita em florestas de eucalipto. A análise técnica englobou um estudo de tempos e movimentos e de produtividade. A análise econômica englobou os parâmetros custo operacional, custo de produção e rendimento energético. O elemento parcial que consumiu a maior parte do tempo do ciclo operacional foi o busca e corte, com aproximadamente 50% do tempo total do ciclo nos dois subsistemas. Os elementos deslocamento vazio e descarregamento consumiram cerca de 39% do tempo total do ciclo do feller-buncher. O custo operacional do feller-buncher foi de US$55,27/he; os custos de produção foram de 1,69 e 1,55 US$/m³cc, nos subsistemas 1 e 2, respectivamente; e o rendimento energético foi de 4,45 e 4,09 g/kW*m³cc, nos subsistemas 1 e 2, respectivamente.This work aimed to evaluate a feller-buncher operationally and economically, under two eucalyptus forest harvest subsystems. The operational analysis included a productivity and motion and time study. The economic analysis included the parameters operational cost, production cost and energy consumption. Searching and cutting consumed most of the operational time, approximately 50% of the total cycle time in both subsystems. Empty displacement and unloading consumed together about 39% of the total feller-buncher cycle time. The feller-buncher operational cost was US$55.27/he. The production costs were US$1.69 and 1.55/m³cc in subsystems 1 and 2, respectively. The energy consumption rates were 4.45 and 4.09 g/kW*m³cc in subsystems 1 and 2, respectively.

  4. Constructive role of Brownian motion: Brownian motors and Stochastic Resonance

    Science.gov (United States)

    Hänggi, Peter

    2005-03-01

    Noise is usually thought of as the enemy of order rather as a constructive influence. For the phenomena of Stochastic Resonance [1] and Brownian motors [2], however, stochastic noise can play a beneficial role in enhancing detection and/or facilitating directed transmission of information in absence of biasing forces. Brownian motion assisted Stochastic Resonance finds useful applications in physical, technological, biological and biomedical contexts [1,3]. The basic principles that underpin Stochastic Resonance are elucidated and novel applications for nonlinear classical and quantum systems will be addressed. The presence of non-equilibrium disturbances enables to rectify Brownian motion so that quantum and classical objects can be directed around on a priori designed routes in biological and physical systems (Brownian motors). In doing so, the energy from the haphazard motion of (quantum) Brownian particles is extracted to perform useful work against an external load. This very concept together with first experimental realizations are discussed [2,4,5]. [1] L. Gammaitoni, P. Hä'nggi, P. Jung and F. Marchesoni, Stochastic Resonance, Rev. Mod. Phys. 70, 223 (1998).[2] R. D. Astumian and P. Hä'nggi, Brownian motors, Physics Today 55 (11), 33 (2002).[3] P. Hä'nggi, Stochastic Resonace in Physics and Biology, ChemPhysChem 3, 285 (2002).[4] H. Linke, editor, Special Issue on Brownian Motors, Applied Physics A 75, No. 2 (2002).[5] P. Hä'nggi, F. Marchesoni, F. Nori, Brownian motors, Ann. Physik (Leipzig) 14, xxx (2004); cond-mat/0410033.

  5. Compaction and soil fertility after eucalyptus harvesting using Feller Buncher and Skidder

    Directory of Open Access Journals (Sweden)

    Ana Lúcia Piedade Sodero Martins Pincelli

    2014-06-01

    Full Text Available This study analyzed, the impact of Feller Buncher and Skidder traffic in harvesting areas of eucalyptus in Mogi Guaçu, considering the compaction and fertilization effects in the range of soil next to the carrier during the cycle of forest growth. An increase in soil compaction, caused by machinery traffic in topsoil (0-10 cm, was observed in the area recently harvested. The soils of the study areas, with eucalyptus 1.4 and 6.0 years old, showed good fertility conditions, especially the older area, where decomposition of forest residues possibly contributed to such fertility.

  6. Parameter estimation from observations of first-passage times of the Ornstein-Uhlenbeck process and the Feller process

    DEFF Research Database (Denmark)

    Ditlevsen, Susanne Dalager; Ditlevsen, Ove Dalager

    2008-01-01

    a subjective graphical test of the applicability of the OU process or the Feller process when applied to a reasonably large sample of observed first-passage data. These non-stationary processes have several applications in biomedical research, for example as idealized models of the neuron membrane potential...... random time break through to the material surface and become observable. However, the OU process has as a model of physical phenomena the defect of not being bounded to the negative side. This defect is not present for the Feller process, which therefore may provide a useful modeling alternative...

  7. Graph spectrum

    NARCIS (Netherlands)

    Brouwer, A.E.; Haemers, W.H.; Brouwer, A.E.; Haemers, W.H.

    2012-01-01

    This chapter presents some simple results on graph spectra.We assume the reader is familiar with elementary linear algebra and graph theory. Throughout, J will denote the all-1 matrix, and 1 is the all-1 vector.

  8. Singular solution of the Feller diffusion equation via a spectral decomposition

    Science.gov (United States)

    Gan, Xinjun; Waxman, David

    2015-01-01

    Feller studied a branching process and found that the distribution for this process approximately obeys a diffusion equation [W. Feller, in Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability (University of California Press, Berkeley and Los Angeles, 1951), pp. 227-246]. This diffusion equation and its generalizations play an important role in many scientific problems, including, physics, biology, finance, and probability theory. We work under the assumption that the fundamental solution represents a probability density and should account for all of the probability in the problem. Thus, under the circumstances where the random process can be irreversibly absorbed at the boundary, this should lead to the presence of a Dirac delta function in the fundamental solution at the boundary. However, such a feature is not present in the standard approach (Laplace transformation). Here we require that the total integrated probability is conserved. This yields a fundamental solution which, when appropriate, contains a term proportional to a Dirac delta function at the boundary. We determine the fundamental solution directly from the diffusion equation via spectral decomposition. We obtain exact expressions for the eigenfunctions, and when the fundamental solution contains a Dirac delta function at the boundary, every eigenfunction of the forward diffusion operator contains a delta function. We show how these combine to produce a weight of the delta function at the boundary which ensures the total integrated probability is conserved. The solution we present covers cases where parameters are time dependent, thereby greatly extending its applicability.

  9. q-deformed Brownian motion

    CERN Document Server

    Man'ko, V I

    1993-01-01

    Brownian motion may be embedded in the Fock space of bosonic free field in one dimension.Extending this correspondence to a family of creation and annihilation operators satisfying a q-deformed algebra, the notion of q-deformation is carried from the algebra to the domain of stochastic processes.The properties of q-deformed Brownian motion, in particular its non-Gaussian nature and cumulant structure,are established.

  10. Radical Enformel in the Oeuvre of Ivo Gattin and Eugen Feller

    Directory of Open Access Journals (Sweden)

    Ješa Denegri

    2016-01-01

    Full Text Available The paper focuses on Ivo Gattin and Eugen Feller as prominent figures in the so-called “radical Enformel”, an artistic trend in Croatian painting during the late 1950s and early 1960s. Besides them, the representatives of radical Enformel include Vlado Kristl, Marijan Javšovar, and Đuro Seder, who likewise participated in the exhibition Informel 1956-1962 at Nova Gallery in 1977. The theoretical platform for this trend in painting was found in hypotheses presented in the influential text “Materia, tecnica e storia nell’informale” (1959 by the Italian artcritic Giulio Carlo Argan, which were adapted to the specific Croatian circumstances and examples.

  11. Numerical Treatment of Degenerate Diffusion Equations via Feller's Boundary Classification, and Applications

    Science.gov (United States)

    Cacio, Emanuela; Cohn, Stephen E.; Spigler, Renato

    2011-01-01

    A numerical method is devised to solve a class of linear boundary-value problems for one-dimensional parabolic equations degenerate at the boundaries. Feller theory, which classifies the nature of the boundary points, is used to decide whether boundary conditions are needed to ensure uniqueness, and, if so, which ones they are. The algorithm is based on a suitable preconditioned implicit finite-difference scheme, grid, and treatment of the boundary data. Second-order accuracy, unconditional stability, and unconditional convergence of solutions of the finite-difference scheme to a constant as the time-step index tends to infinity are further properties of the method. Several examples, pertaining to financial mathematics, physics, and genetics, are presented for the purpose of illustration.

  12. Avaliação de alguns fatores ergonômicos nos tratores "Feller-buncher" e "Skidder" utilizados na colheita de madeira Evaluation of some ergonomic factors in Feller-buncher and Skidder tractors used in wood harvesting

    Directory of Open Access Journals (Sweden)

    Julião Soares de Souza Lima

    2005-04-01

    Full Text Available Este trabalho foi realizado com tratores florestais utilizados em um sistema mecanizado de colheita de madeira em povoamento de eucalipto, tendo como objetivo avaliar quantiqualitativamente as dimensões de acesso, assento, comandos, campo visual, condições térmicas e vibração no posto dos operadores. O acesso ao posto do operador no trator "Feller-buncher" apresentou um grau de dificuldade, sendo classificado, na avaliação qualitativa, como médio e, no "Skidder", como bom. A abertura das portas de acesso apresenta ângulo menor que 90º, dificultando, assim, a entrada e saída do operador. O posto do operador do trator "Feller-buncher" foi classificado como médio na avaliação qualitativa, em virtude de o espaço livre da plataforma de apoio ser de 30% da área total e, no "Skidder", de 55% da área total, sendo classificado como bom. O campo visual frontal do "Feller-buncher", mesmo tendo uma área do pára-brisa maior, é limitado pela presença do cabeçote, tanto em operações diurnas quanto noturnas, sendo, portanto, inferior ao do "Skidder".This work was carried out in forest tractors used in a mechanized system for wood harvesting in a stand of eucalyptus, to evaluate quanti-qualitatively the dimensions of access, seat, commands, field view, thermal conditions and vibration in the operators' station. The access to the operator's station in the Feller-Buncher tractor presented a degree of difficulty classified in the qualitative evaluation as average and the Skidder as good. The opening of the access doors presents an angle smaller than 90º, thus rendering the entrance and exit of the operator more difficult. The operators station of the Feller-Buncher tractor was classified as medium in the qualitative evaluation, due to the free space of the support platform being 30% of the total area, and in the Skidder 55%, therefore being classified as good. The front field view in Feller-Buncher, even having a wider windscreen area, is

  13. Equipackable graphs

    DEFF Research Database (Denmark)

    Vestergaard, Preben Dahl; Hartnell, Bert L.

    2006-01-01

    There are many results dealing with the problem of decomposing a fixed graph into isomorphic subgraphs. There has also been work on characterizing graphs with the property that one can delete the edges of a number of edge disjoint copies of the subgraph and, regardless of how that is done, the gr...

  14. A hydrodynamic formalism for Brownian systems

    International Nuclear Information System (INIS)

    Pina, E.; Rosales, M.A.

    1981-01-01

    A formal hydrodynamic approach to Brownian motion is presented and the corresponding equations are derived. Hydrodynamic quantities are expressed in terms of the physical variables characterizing the Brownian systems. Contact is made with the hydrodynamic model of Quantum Mechanics. (author)

  15. Brownian dynamics with hydrodynamic interactions

    International Nuclear Information System (INIS)

    Ermak, D.L.; McCammon, J.A.

    1978-01-01

    A method for simulating the Brownian dynamics of N particles with the inclusion of hydrodynamic interactions is described. The particles may also be subject to the usual interparticle or external forces (e.g., electrostatic) which have been included in previous methods for simulating Brownian dynamics of particles in the absence of hydrodynamic interactions. The present method is derived from the Langevin equations for the N particle assembly, and the results are shown to be consistent with the corresponding Fokker--Planck results. Sample calculations on small systems illustrate the importance of including hydrodynamic interactions in Brownian dynamics simulations. The method should be useful for simulation studies of diffusion limited reactions, polymer dynamics, protein folding, particle coagulation, and other phenomena in solution

  16. Brownian movement and molecular reality

    CERN Document Server

    Perrin, Jean

    2005-01-01

    How do we know that molecules really exist? An important clue came from Brownian movement, a concept developed in 1827 by botanist Robert Brown, who noticed that tiny objects like pollen grains shook and moved erratically when viewed under a microscope. Nearly 80 years later, in 1905, Albert Einstein explained this ""Brownian motion"" as the result of bombardment by molecules. Einstein offered a quantitative explanation by mathematically estimating the average distance covered by the particles over time as a result of molecular bombardment. Four years later, Jean Baptiste Perrin wrote Brownia

  17. Entropic Approach to Brownian Movement.

    Science.gov (United States)

    Neumann, Richard M.

    1980-01-01

    A diffusional driving force, called the radial force, which is responsible for the increase with time of the scalar separation between a fixed point and a particle undergoing three-dimensional Brownian motion, is derived using Boltzmann's equation. (Author/HM)

  18. Quantum equations from Brownian motions

    International Nuclear Information System (INIS)

    Rajput, B.S.

    2011-01-01

    Classical Schrodinger and Dirac equations have been derived from Brownian motions of a particle, it has been shown that the classical Schrodinger equation can be transformed to usual Schrodinger Quantum equation on applying Heisenberg uncertainty principle between position and momentum while Dirac Quantum equation follows it's classical counter part on applying Heisenberg uncertainly principle between energy and time without applying any analytical continuation. (author)

  19. Interaction graphs

    DEFF Research Database (Denmark)

    Seiller, Thomas

    2016-01-01

    Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should...... be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define...... "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite...

  20. Introduction to graph theory

    CERN Document Server

    Trudeau, Richard J

    1994-01-01

    Preface1. Pure Mathematics Introduction; Euclidean Geometry as Pure Mathematics; Games; Why Study Pure Mathematics?; What's Coming; Suggested Reading2. Graphs Introduction; Sets; Paradox; Graphs; Graph diagrams; Cautions; Common Graphs; Discovery; Complements and Subgraphs; Isomorphism; Recognizing Isomorphic Graphs; Semantics The Number of Graphs Having a Given nu; Exercises; Suggested Reading3. Planar Graphs Introduction; UG, K subscript 5, and the Jordan Curve Theorem; Are there More Nonplanar Graphs?; Expansions; Kuratowski's Theorem; Determining Whether a Graph is Planar or

  1. Visibility graph approach to exchange rate series

    Science.gov (United States)

    Yang, Yue; Wang, Jianbo; Yang, Huijie; Mang, Jingshi

    2009-10-01

    By means of a visibility graph, we investigate six important exchange rate series. It is found that the series convert into scale-free and hierarchically structured networks. The relationship between the scaling exponents of the degree distributions and the Hurst exponents obeys the analytical prediction for fractal Brownian motions. The visibility graph can be used to obtain reliable values of Hurst exponents of the series. The characteristics are explained by using the multifractal structures of the series. The exchange rate of EURO to Japanese Yen is widely used to evaluate risk and to estimate trends in speculative investments. Interestingly, the hierarchies of the visibility graphs for the exchange rate series of these two currencies are significantly weak compared with that of the other series.

  2. Slow kinetics of Brownian maxima.

    Science.gov (United States)

    Ben-Naim, E; Krapivsky, P L

    2014-07-18

    We study extreme-value statistics of Brownian trajectories in one dimension. We define the maximum as the largest position to date and compare maxima of two particles undergoing independent Brownian motion. We focus on the probability P(t) that the two maxima remain ordered up to time t and find the algebraic decay P ∼ t(-β) with exponent β = 1/4. When the two particles have diffusion constants D(1) and D(2), the exponent depends on the mobilities, β = (1/π) arctan sqrt[D(2)/D(1)]. We also use numerical simulations to investigate maxima of multiple particles in one dimension and the largest extension of particles in higher dimensions.

  3. Brownian motion and stochastic calculus

    CERN Document Server

    Karatzas, Ioannis

    1998-01-01

    This book is designed as a text for graduate courses in stochastic processes. It is written for readers familiar with measure-theoretic probability and discrete-time processes who wish to explore stochastic processes in continuous time. The vehicle chosen for this exposition is Brownian motion, which is presented as the canonical example of both a martingale and a Markov process with continuous paths. In this context, the theory of stochastic integration and stochastic calculus is developed. The power of this calculus is illustrated by results concerning representations of martingales and change of measure on Wiener space, and these in turn permit a presentation of recent advances in financial economics (option pricing and consumption/investment optimization). This book contains a detailed discussion of weak and strong solutions of stochastic differential equations and a study of local time for semimartingales, with special emphasis on the theory of Brownian local time. The text is complemented by a large num...

  4. Graph theory

    CERN Document Server

    Diestel, Reinhard

    2017-01-01

    This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. From the reviews: “This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory.”Acta Scientiarum Mathematiciarum “Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity. ”Persi Diaconis & Ron Graham, SIAM Review “The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theo...

  5. Random motion and Brownian rotation

    International Nuclear Information System (INIS)

    Wyllie, G.

    1980-01-01

    The course is centred on the Brownian motion - the random movement of molecules arising from thermal fluctuations of the surrounding medium - and starts with the classical theory of A. Einstein, M.v. Smoluchowski and P. Langevin. The first part of this article is quite elementary, and several of the questions raised in it have been instructively treated in a much more sophisticated way in recent reviews by Pomeau and Resibois and by Fox. This simple material may nevertheless be helpful to some readers whose main interest lies in approaching the work on Brownian rotation reviewed in the latter part of the present article. The simplest, and most brutally idealised, problem in our field of interest is that of the random walk in one dimension of space. Its solution leads on, through the diffusivity-mobility relation of Einstein, to Langevin's treatment of the Brownian motion. The application of these ideas to the movement of a molecule in a medium of similar molecules is clearly unrealistic, and much energy has been devoted to finding a suitable generalisation. We shall discuss in particular ideas due to Green, Zwanzig and Mori. (orig./WL)

  6. Operator Fractional Brownian Motion and Martingale Differences

    Directory of Open Access Journals (Sweden)

    Hongshuai Dai

    2014-01-01

    Full Text Available It is well known that martingale difference sequences are very useful in applications and theory. On the other hand, the operator fractional Brownian motion as an extension of the well-known fractional Brownian motion also plays an important role in both applications and theory. In this paper, we study the relation between them. We construct an approximation sequence of operator fractional Brownian motion based on a martingale difference sequence.

  7. Thermodynamic and Quantum Thermodynamic Analyses of Brownian Movement

    OpenAIRE

    Gyftopoulos, Elias P.

    2006-01-01

    Thermodynamic and quantum thermodynamic analyses of Brownian movement of a solvent and a colloid passing through neutral thermodynamic equilibrium states only. It is shown that Brownian motors and E. coli do not represent Brownian movement.

  8. Graph theory

    CERN Document Server

    Gould, Ronald

    2012-01-01

    This introduction to graph theory focuses on well-established topics, covering primary techniques and including both algorithmic and theoretical problems. The algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as advanced undergraduates and graduate students of topology, algebra, and matrix theory. Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. S

  9. Graphs & digraphs

    CERN Document Server

    Chartrand, Gary; Zhang, Ping

    2010-01-01

    Gary Chartrand has influenced the world of Graph Theory for almost half a century. He has supervised more than a score of Ph.D. dissertations and written several books on the subject. The most widely known of these texts, Graphs and Digraphs, … has much to recommend it, with clear exposition, and numerous challenging examples [that] make it an ideal textbook for the advanced undergraduate or beginning graduate course. The authors have updated their notation to reflect the current practice in this still-growing area of study. By the authors' estimation, the 5th edition is approximately 50% longer than the 4th edition. … the legendary Frank Harary, author of the second graph theory text ever produced, is one of the figures profiled. His book was the standard in the discipline for several decades. Chartrand, Lesniak and Zhang have produced a worthy successor.-John T. Saccoman, MAA Reviews, June 2012 (This book is in the MAA's basic library list.)As with the earlier editions, the current text emphasizes clear...

  10. PRODUTIVIDADE E CUSTOS DO FELLER-BUNCHER E PROCESSADOR FLORESTAL EM POVOAMENTO DE EUCALIPTO DE PRIMEIRO CORTE

    Directory of Open Access Journals (Sweden)

    Danilo Simões

    2014-09-01

    Full Text Available http://dx.doi.org/10.5902/1980509815742A racionalização da colheita florestal e a minimização dos custos é uma busca constante por parte dos gestores envolvidos nesse processo, competindo a esses deliberar práticas economicamente viáveis para otimizar essa operação. O objetivo deste estudo foi avaliar técnica e economicamente a produtividade do feller-buncher e do processador florestal em povoamento de eucalipto em primeiro corte. A análise técnica englobou um estudo de tempos e movimentos, produtividade, eficiência operacional e disponibilidade mecânica. A análise econômica englobou os parâmetros do custo operacional, custo de colheita florestal e rendimento energético. Visando à otimização do custo de colheita florestal, o sistema composto pelo feller-buncher e processador florestal apresenta-se como uma alternativa viável tecnicamente e economicamente para a colheita em povoamentos de eucalipto de primeiro corte ou para povoamentos que não possuam árvores bifurcadas.

  11. Rotational and translational Brownian motion

    International Nuclear Information System (INIS)

    Coffey, W.T.; Salford Univ.

    1980-01-01

    In this review it is proposed to summarise the work on the theory of the translational and rotational Brownian movement which has been carried on over roughly the past 30 years. The review is intended to take the form of a tutorial paper rather than a list of the results obtained by the various investigators over the period in question. In this vein then it seems appropriate to firstly give a brief account of those parts of the theory of probability which are relevant to the problems under discussion. (orig.)

  12. Decay ratio for third order Brownian oscillators

    International Nuclear Information System (INIS)

    Konno, H.; Kanemoto, S.

    1998-01-01

    We have obtained the analytical expressions of the decay ratios for two types of third order Brownian oscillators which are generalizations of the second order Brownian oscillator driven by the Gaussian-white noise. The resulting expressions will provide us useful baseline information for more complicated practical problems and their applications

  13. Brownian Optimal Stopping and Random Walks

    International Nuclear Information System (INIS)

    Lamberton, D.

    2002-01-01

    One way to compute the value function of an optimal stopping problem along Brownian paths consists of approximating Brownian motion by a random walk. We derive error estimates for this type of approximation under various assumptions on the distribution of the approximating random walk

  14. Brownian motion of tethered nanowires.

    Science.gov (United States)

    Ota, Sadao; Li, Tongcang; Li, Yimin; Ye, Ziliang; Labno, Anna; Yin, Xiaobo; Alam, Mohammad-Reza; Zhang, Xiang

    2014-05-01

    Brownian motion of slender particles near a boundary is ubiquitous in biological systems and in nanomaterial assembly, but the complex hydrodynamic interaction in those systems is still poorly understood. Here, we report experimental and computational studies of the Brownian motion of silicon nanowires tethered on a substrate. An optical interference method enabled direct observation of microscopic rotations of the slender bodies in three dimensions with high angular and temporal resolutions. This quantitative observation revealed anisotropic and angle-dependent hydrodynamic wall effects: rotational diffusivity in inclined and azimuth directions follows different power laws as a function of the length, ∼ L(-2.5) and ∼ L(-3), respectively, and is more hindered for smaller inclined angles. In parallel, we developed an implicit simulation technique that takes the complex wire-wall hydrodynamic interactions into account efficiently, the result of which agreed well with the experimentally observed angle-dependent diffusion. The demonstrated techniques provide a platform for studying the microrheology of soft condensed matters, such as colloidal and biological systems near interfaces, and exploring the optimal self-assembly conditions of nanostructures.

  15. A multiscale guide to Brownian motion

    International Nuclear Information System (INIS)

    Grebenkov, Denis S; Belyaev, Dmitry; Jones, Peter W

    2016-01-01

    We revise the Lévy construction of Brownian motion as a simple though rigorous approach to operate with various Gaussian processes. A Brownian path is explicitly constructed as a linear combination of wavelet-based ‘geometrical features’ at multiple length scales with random weights. Such a wavelet representation gives a closed formula mapping of the unit interval onto the functional space of Brownian paths. This formula elucidates many classical results about Brownian motion (e.g., non-differentiability of its path), providing an intuitive feeling for non-mathematicians. The illustrative character of the wavelet representation, along with the simple structure of the underlying probability space, is different from the usual presentation of most classical textbooks. Similar concepts are discussed for the Brownian bridge, fractional Brownian motion, the Ornstein-Uhlenbeck process, Gaussian free fields, and fractional Gaussian fields. Wavelet representations and dyadic decompositions form the basis of many highly efficient numerical methods to simulate Gaussian processes and fields, including Brownian motion and other diffusive processes in confining domains. (topical review)

  16. Chromatic graph theory

    CERN Document Server

    Chartrand, Gary; Rosen, Kenneth H

    2008-01-01

    Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex coloring...

  17. Stock price prediction using geometric Brownian motion

    Science.gov (United States)

    Farida Agustini, W.; Restu Affianti, Ika; Putri, Endah RM

    2018-03-01

    Geometric Brownian motion is a mathematical model for predicting the future price of stock. The phase that done before stock price prediction is determine stock expected price formulation and determine the confidence level of 95%. On stock price prediction using geometric Brownian Motion model, the algorithm starts from calculating the value of return, followed by estimating value of volatility and drift, obtain the stock price forecast, calculating the forecast MAPE, calculating the stock expected price and calculating the confidence level of 95%. Based on the research, the output analysis shows that geometric Brownian motion model is the prediction technique with high rate of accuracy. It is proven with forecast MAPE value ≤ 20%.

  18. Brownian motion using video capture

    International Nuclear Information System (INIS)

    Salmon, Reese; Robbins, Candace; Forinash, Kyle

    2002-01-01

    Although other researchers had previously observed the random motion of pollen grains suspended in water through a microscope, Robert Brown's name is associated with this behaviour based on observations he made in 1828. It was not until Einstein's work in the early 1900s however, that the origin of this irregular motion was established to be the result of collisions with molecules which were so small as to be invisible in a light microscope (Einstein A 1965 Investigations on the Theory of the Brownian Movement ed R Furth (New York: Dover) (transl. Cowper A D) (5 papers)). Jean Perrin in 1908 (Perrin J 1923 Atoms (New York: Van Nostrand-Reinhold) (transl. Hammick D)) was able, through a series of painstaking experiments, to establish the validity of Einstein's equation. We describe here the details of a junior level undergraduate physics laboratory experiment where students used a microscope, a video camera and video capture software to verify Einstein's famous calculation of 1905. (author)

  19. An adjustable Brownian heat engine

    International Nuclear Information System (INIS)

    Asfaw, Mesfin; Bekele, Mulugeta

    2002-09-01

    A microscopic heat engine is modeled as a Brownian particle in a sawtooth potential (with load) moving through a highly viscous medium driven by the thermal kick it gets from alternately placed hot and cold heat reservoirs. We found a closed form expression for the current as a function of the parameters characterizing the model. Depending on the values these model parameters take, the engine is also found to function as a refrigerator. Expressions for the efficiency as well as for the refrigerator performance are also reported. Study of how these quantities depend on the model parameters enabled us in identifying the points in the parameter space where the engine performs either with maximum power or with optimized efficiency. The corresponding efficiencies of the engine are then compared with those of the endoreversible and Carnot engines. (author)

  20. The open quantum Brownian motions

    International Nuclear Information System (INIS)

    Bauer, Michel; Bernard, Denis; Tilloy, Antoine

    2014-01-01

    Using quantum parallelism on random walks as the original seed, we introduce new quantum stochastic processes, the open quantum Brownian motions. They describe the behaviors of quantum walkers—with internal degrees of freedom which serve as random gyroscopes—interacting with a series of probes which serve as quantum coins. These processes may also be viewed as the scaling limit of open quantum random walks and we develop this approach along three different lines: the quantum trajectory, the quantum dynamical map and the quantum stochastic differential equation. We also present a study of the simplest case, with a two level system as an internal gyroscope, illustrating the interplay between the ballistic and diffusive behaviors at work in these processes. Notation H z : orbital (walker) Hilbert space, C Z in the discrete, L 2 (R) in the continuum H c : internal spin (or gyroscope) Hilbert space H sys =H z ⊗H c : system Hilbert space H p : probe (or quantum coin) Hilbert space, H p =C 2 ρ t tot : density matrix for the total system (walker + internal spin + quantum coins) ρ-bar t : reduced density matrix on H sys : ρ-bar t =∫dxdy ρ-bar t (x,y)⊗|x〉 z 〈y| ρ-hat t : system density matrix in a quantum trajectory: ρ-hat t =∫dxdy ρ-hat t (x,y)⊗|x〉 z 〈y|. If diagonal and localized in position: ρ-hat t =ρ t ⊗|X t 〉 z 〈X t | ρ t : internal density matrix in a simple quantum trajectory X t : walker position in a simple quantum trajectory B t : normalized Brownian motion ξ t , ξ t † : quantum noises (paper)

  1. TECHNICAL AND ECONOMIC EVALUATION OF THE HARVEST OF EUCALYPTUS WITH FELLER-BUNCHER IN DIFFERENT OPERATING CONDITIONS

    Directory of Open Access Journals (Sweden)

    Danilo Simões

    2010-12-01

    Full Text Available This study aimed to technically and economically evaluate the Feller-buncher in different conditions of harvest in eucalyptus forests of second cut. The technical analysis included a study of time and movements by the method of continuous time, and operational performance was determined by volume in cubic meters of harvested wood. The economic analysis included the parameters of operational cost, harvest cost and energy consumption. The analysis of the data showed that the composition of main line harvesting and the arrangement of bundles of trees influenced operational performance. The average operational cost was US$ 86.26 per hour of actual work, which resulted in an average cost of forest harvesting of US$ 1.09 m-³.

  2. Brownian motion in a flowing fluid revisited

    International Nuclear Information System (INIS)

    Ramshaw, J.D.

    1981-01-01

    It is shown how the phenomenon of osmosis may be treated using the phenomenological theory of Brownian motion in a flowing fluid. The theory is also generalized to include viscous stresses in the particle and mixture momentum equations

  3. A multiscale approach to Brownian motors

    International Nuclear Information System (INIS)

    Pavliotis, G.A.

    2005-01-01

    The problem of Brownian motion in a periodic potential, under the influence of external forcing, which is either random or periodic in time, is studied in this Letter. Multiscale techniques are used to derive general formulae for the steady state particle current and the effective diffusion tensor. These formulae are then applied to calculate the effective diffusion coefficient for a Brownian particle in a periodic potential driven simultaneously by additive Gaussian white and colored noise. Our theoretical findings are supported by numerical simulations

  4. Biased Brownian dynamics for rate constant calculation.

    OpenAIRE

    Zou, G; Skeel, R D; Subramaniam, S

    2000-01-01

    An enhanced sampling method-biased Brownian dynamics-is developed for the calculation of diffusion-limited biomolecular association reaction rates with high energy or entropy barriers. Biased Brownian dynamics introduces a biasing force in addition to the electrostatic force between the reactants, and it associates a probability weight with each trajectory. A simulation loses weight when movement is along the biasing force and gains weight when movement is against the biasing force. The sampl...

  5. On some generalization of fractional Brownian motions

    International Nuclear Information System (INIS)

    Wang Xiaotian; Liang Xiangqian; Ren Fuyao; Zhang Shiying

    2006-01-01

    The multifractional Brownian motion (mBm) is a continuous Gaussian process that extends the classical fractional Brownian motion (fBm) defined by Barton and Vincent Poor [Barton RJ, Vincent Poor H. IEEE Trans Inform 1988;34(5):943] and Decreusefond and Ustuenel [Decreusefond L, Ustuenel AS. Potential Anal 1999;10:177]. In addition, an innovational representation of fBm is given

  6. Deep inelastic collisions viewed as Brownian motion

    International Nuclear Information System (INIS)

    Gross, D.H.E.; Freie Univ. Berlin

    1980-01-01

    Non-equilibrium transport processes like Brownian motion, are studied since perhaps 100 years and one should ask why does one not use these theories to explain deep inelastic collision data. These theories have reached a high standard of sophistication, experience, and precision that I believe them to be very usefull for our problem. I will try to sketch a possible form of an advanced theory of Brownian motion that seems to be suitable for low energy heavy ion collisions. (orig./FKS)

  7. Dissipation and decoherence in Brownian motion

    Energy Technology Data Exchange (ETDEWEB)

    Bellomo, Bruno [Dipartimento di Scienze Fisiche ed Astronomiche dell' Universita di Palermo, Via Archirafi, 36, 90123 Palermo (Italy); Barnett, Stephen M [Department of Physics, University of Strathclyde, Glasgow G4 0NG (United Kingdom); Jeffers, John [Department of Physics, University of Strathclyde, Glasgow G4 0NG (United Kingdom)

    2007-05-15

    We consider the evolution of a Brownian particle described by a measurement-based master equation. We derive the solution to this equation for general initial conditions and apply it to a Gaussian initial state. We analyse the effects of the diffusive terms, present in the master equation, and describe how these modify uncertainties and coherence length. This allows us to model dissipation and decoherence in quantum Brownian motion.

  8. Brownian quasi-particles in statistical physics

    International Nuclear Information System (INIS)

    Tellez-Arenas, A.; Fronteau, J.; Combis, P.

    1979-01-01

    The idea of a Brownian quasi-particle and the associated differentiable flow (with nonselfadjoint forces) are used here in the context of a stochastic description of the approach towards statistical equilibrium. We show that this quasi-particle flow acquires, at equilibrium, the principal properties of a conservative Hamiltonian flow. Thus the model of Brownian quasi-particles permits us to establish a link between the stochastic description and the Gibbs description of statistical equilibrium

  9. Area distribution of an elastic Brownian motion

    International Nuclear Information System (INIS)

    Rajabpour, M A

    2009-01-01

    We calculate the excursion and meander area distributions of the elastic Brownian motion by using the self-adjoint extension of the Hamiltonian of the free quantum particle on the half line. We also give some comments on the area of the Brownian motion bridge on the real line with the origin removed. We will focus on the power of self-adjoint extension to investigate different possible boundary conditions for the stochastic processes. We also discuss some possible physical applications.

  10. Graph visualization (Invited talk)

    NARCIS (Netherlands)

    Wijk, van J.J.; Kreveld, van M.J.; Speckmann, B.

    2012-01-01

    Black and white node link diagrams are the classic method to depict graphs, but these often fall short to give insight in large graphs or when attributes of nodes and edges play an important role. Graph visualization aims obtaining insight in such graphs using interactive graphical representations.

  11. Pragmatic Graph Rewriting Modifications

    OpenAIRE

    Rodgers, Peter; Vidal, Natalia

    1999-01-01

    We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified a...

  12. Graphs and matrices

    CERN Document Server

    Bapat, Ravindra B

    2014-01-01

    This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...

  13. Adaptive Graph Convolutional Neural Networks

    OpenAIRE

    Li, Ruoyu; Wang, Sheng; Zhu, Feiyun; Huang, Junzhou

    2018-01-01

    Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking data of arbitrary graph structure as input. In that way a task-driven adaptive graph is learned for eac...

  14. On middle cube graphs

    Directory of Open Access Journals (Sweden)

    C. Dalfo

    2015-10-01

    Full Text Available We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors.

  15. Static structure of active Brownian hard disks

    Science.gov (United States)

    de Macedo Biniossek, N.; Löwen, H.; Voigtmann, Th; Smallenburg, F.

    2018-02-01

    We explore the changes in static structure of a two-dimensional system of active Brownian particles (ABP) with hard-disk interactions, using event-driven Brownian dynamics simulations. In particular, the effect of the self-propulsion velocity and the rotational diffusivity on the orientationally-averaged fluid structure factor is discussed. Typically activity increases structural ordering and generates a structure factor peak at zero wave vector which is a precursor of motility-induced phase separation. Our results provide reference data to test future statistical theories for the fluid structure of active Brownian systems. This manuscript was submitted for the special issue of the Journal of Physics: Condensed Matter associated with the Liquid Matter Conference 2017.

  16. Reflection Negative Kernels and Fractional Brownian Motion

    Directory of Open Access Journals (Sweden)

    Palle E. T. Jorgensen

    2018-06-01

    Full Text Available In this article we study the connection of fractional Brownian motion, representation theory and reflection positivity in quantum physics. We introduce and study reflection positivity for affine isometric actions of a Lie group on a Hilbert space E and show in particular that fractional Brownian motion for Hurst index 0 < H ≤ 1 / 2 is reflection positive and leads via reflection positivity to an infinite dimensional Hilbert space if 0 < H < 1 / 2 . We also study projective invariance of fractional Brownian motion and relate this to the complementary series representations of GL 2 ( R . We relate this to a measure preserving action on a Gaussian L 2 -Hilbert space L 2 ( E .

  17. Eigenfunction expansion for fractional Brownian motions

    International Nuclear Information System (INIS)

    Maccone, C.

    1981-01-01

    The fractional Brownian motions, a class of nonstationary stochastic processes defined as the Riemann-Liouville fractional integral/derivative of the Brownian motion, are studied. It is shown that these processes can be regarded as the output of a suitable linear system of which the input is the white noise. Their autocorrelation is then derived with a study of their standard-deviation curves. Their power spectra are found by resorting to the nonstationary spectral theory. And finally their eigenfunction expansion (Karhunen-Loeve expansion) is obtained: the eigenfunctions are proved to be suitable Bessel functions and the eigenvalues zeros of the Bessel functions. (author)

  18. Price competition on graphs

    NARCIS (Netherlands)

    Soetevent, A.R.

    2010-01-01

    This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial

  19. Graphing Inequalities, Connecting Meaning

    Science.gov (United States)

    Switzer, J. Matt

    2014-01-01

    Students often have difficulty with graphing inequalities (see Filloy, Rojano, and Rubio 2002; Drijvers 2002), and J. Matt Switzer's students were no exception. Although students can produce graphs for simple inequalities, they often struggle when the format of the inequality is unfamiliar. Even when producing a correct graph of an…

  20. Similarity Measure of Graphs

    Directory of Open Access Journals (Sweden)

    Amine Labriji

    2017-07-01

    Full Text Available The topic of identifying the similarity of graphs was considered as highly recommended research field in the Web semantic, artificial intelligence, the shape recognition and information research. One of the fundamental problems of graph databases is finding similar graphs to a graph query. Existing approaches dealing with this problem are usually based on the nodes and arcs of the two graphs, regardless of parental semantic links. For instance, a common connection is not identified as being part of the similarity of two graphs in cases like two graphs without common concepts, the measure of similarity based on the union of two graphs, or the one based on the notion of maximum common sub-graph (SCM, or the distance of edition of graphs. This leads to an inadequate situation in the context of information research. To overcome this problem, we suggest a new measure of similarity between graphs, based on the similarity measure of Wu and Palmer. We have shown that this new measure satisfies the properties of a measure of similarities and we applied this new measure on examples. The results show that our measure provides a run time with a gain of time compared to existing approaches. In addition, we compared the relevance of the similarity values obtained, it appears that this new graphs measure is advantageous and  offers a contribution to solving the problem mentioned above.

  1. Distance-regular graphs

    NARCIS (Netherlands)

    van Dam, Edwin R.; Koolen, Jack H.; Tanaka, Hajime

    2016-01-01

    This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN'[Brouwer, A.E., Cohen, A.M., Neumaier,

  2. Fuzzy Graph Language Recognizability

    OpenAIRE

    Kalampakas , Antonios; Spartalis , Stefanos; Iliadis , Lazaros

    2012-01-01

    Part 5: Fuzzy Logic; International audience; Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.

  3. Spectra of Graphs

    NARCIS (Netherlands)

    Brouwer, A.E.; Haemers, W.H.

    2012-01-01

    This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association

  4. Relaxation property of the fractional Brownian particle

    International Nuclear Information System (INIS)

    Wang Litan; Lung, C.W.

    1988-08-01

    Dynamic susceptibility of a diffusion system associated with the fractional Brownian motion (fBm) was examined for the fractal property of the Non-Debye relaxation process. The comparisons between fBm and other approaches were made. Anomalous diffusion and the Non-Debye relaxation processes were discussed with this approach. (author). 8 refs, 1 fig

  5. Generalized Arcsine Laws for Fractional Brownian Motion.

    Science.gov (United States)

    Sadhu, Tridib; Delorme, Mathieu; Wiese, Kay Jörg

    2018-01-26

    The three arcsine laws for Brownian motion are a cornerstone of extreme-value statistics. For a Brownian B_{t} starting from the origin, and evolving during time T, one considers the following three observables: (i) the duration t_{+} the process is positive, (ii) the time t_{last} the process last visits the origin, and (iii) the time t_{max} when it achieves its maximum (or minimum). All three observables have the same cumulative probability distribution expressed as an arcsine function, thus the name arcsine laws. We show how these laws change for fractional Brownian motion X_{t}, a non-Markovian Gaussian process indexed by the Hurst exponent H. It generalizes standard Brownian motion (i.e., H=1/2). We obtain the three probabilities using a perturbative expansion in ϵ=H-1/2. While all three probabilities are different, this distinction can only be made at second order in ϵ. Our results are confirmed to high precision by extensive numerical simulations.

  6. Brownian coagulation at high particle concentrations

    NARCIS (Netherlands)

    Trzeciak, T.M.

    2012-01-01

    The process of Brownian coagulation, whereby particles are brought together by thermal motion and grow by collisions, is one of the most fundamental processes influencing the final properties of particulate matter in a variety of technically important systems. It is of importance in colloids,

  7. Graphs and Homomorphisms

    CERN Document Server

    Hell, Pavol

    2004-01-01

    This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colourings, and has applications in complexity theory, artificial intelligence, telecommunication, and, most recently, statistical physics.Based on the authors' lecture notes for graduate courses, this book can be used as a textbook for a second course in graph theory at 4th year or master's level an

  8. Simplicial complexes of graphs

    CERN Document Server

    Jonsson, Jakob

    2008-01-01

    A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.

  9. Introduction to quantum graphs

    CERN Document Server

    Berkolaiko, Gregory

    2012-01-01

    A "quantum graph" is a graph considered as a one-dimensional complex and equipped with a differential operator ("Hamiltonian"). Quantum graphs arise naturally as simplified models in mathematics, physics, chemistry, and engineering when one considers propagation of waves of various nature through a quasi-one-dimensional (e.g., "meso-" or "nano-scale") system that looks like a thin neighborhood of a graph. Works that currently would be classified as discussing quantum graphs have been appearing since at least the 1930s, and since then, quantum graphs techniques have been applied successfully in various areas of mathematical physics, mathematics in general and its applications. One can mention, for instance, dynamical systems theory, control theory, quantum chaos, Anderson localization, microelectronics, photonic crystals, physical chemistry, nano-sciences, superconductivity theory, etc. Quantum graphs present many non-trivial mathematical challenges, which makes them dear to a mathematician's heart. Work on qu...

  10. Graphing trillions of triangles.

    Science.gov (United States)

    Burkhardt, Paul

    2017-07-01

    The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.

  11. Introductory graph theory

    CERN Document Server

    Chartrand, Gary

    1984-01-01

    Graph theory is used today in the physical sciences, social sciences, computer science, and other areas. Introductory Graph Theory presents a nontechnical introduction to this exciting field in a clear, lively, and informative style. Author Gary Chartrand covers the important elementary topics of graph theory and its applications. In addition, he presents a large variety of proofs designed to strengthen mathematical techniques and offers challenging opportunities to have fun with mathematics. Ten major topics - profusely illustrated - include: Mathematical Models, Elementary Concepts of Grap

  12. Brownian motion, martingales, and stochastic calculus

    CERN Document Server

    Le Gall, Jean-François

    2016-01-01

    This book offers a rigorous and self-contained presentation of stochastic integration and stochastic calculus within the general framework of continuous semimartingales. The main tools of stochastic calculus, including Itô’s formula, the optional stopping theorem and Girsanov’s theorem, are treated in detail alongside many illustrative examples. The book also contains an introduction to Markov processes, with applications to solutions of stochastic differential equations and to connections between Brownian motion and partial differential equations. The theory of local times of semimartingales is discussed in the last chapter. Since its invention by Itô, stochastic calculus has proven to be one of the most important techniques of modern probability theory, and has been used in the most recent theoretical advances as well as in applications to other fields such as mathematical finance. Brownian Motion, Martingales, and Stochastic Calculus provides a strong theoretical background to the reader interested i...

  13. Fractional Brownian motion with a reflecting wall

    Science.gov (United States)

    Wada, Alexander H. O.; Vojta, Thomas

    2018-02-01

    Fractional Brownian motion, a stochastic process with long-time correlations between its increments, is a prototypical model for anomalous diffusion. We analyze fractional Brownian motion in the presence of a reflecting wall by means of Monte Carlo simulations. Whereas the mean-square displacement of the particle shows the expected anomalous diffusion behavior ˜tα , the interplay between the geometric confinement and the long-time memory leads to a highly non-Gaussian probability density function with a power-law singularity at the barrier. In the superdiffusive case α >1 , the particles accumulate at the barrier leading to a divergence of the probability density. For subdiffusion α implications of these findings, in particular, for applications that are dominated by rare events.

  14. Price Competition on Graphs

    OpenAIRE

    Adriaan R. Soetevent

    2010-01-01

    This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial discontinuities in firm-level demand may occur. I show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs. I conjecture that this non-existence result holds...

  15. Price Competition on Graphs

    OpenAIRE

    Pim Heijnen; Adriaan Soetevent

    2014-01-01

    This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. We derive an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. These graph models of price competition may lead to spatial discontinuities in firm-level demand. We show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs and conjecture that this non-existence result holds more general...

  16. Pattern graph rewrite systems

    Directory of Open Access Journals (Sweden)

    Aleks Kissinger

    2014-03-01

    Full Text Available String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the power of such rewrite systems can be greatly extended by introducing pattern graphs, which provide a means of expressing infinite families of rewrite rules where certain marked subgraphs, called !-boxes ("bang boxes", on both sides of a rule can be copied any number of times or removed. After reviewing the string graph formalism, we show how string graphs can be extended to pattern graphs and how pattern graphs and pattern rewrite rules can be instantiated to concrete string graphs and rewrite rules. We then provide examples demonstrating the expressive power of pattern graphs and how they can be applied to study interacting algebraic structures that are central to categorical quantum mechanics.

  17. Functions and graphs

    CERN Document Server

    Gelfand, I M; Shnol, E E

    1969-01-01

    The second in a series of systematic studies by a celebrated mathematician I. M. Gelfand and colleagues, this volume presents students with a well-illustrated sequence of problems and exercises designed to illuminate the properties of functions and graphs. Since readers do not have the benefit of a blackboard on which a teacher constructs a graph, the authors abandoned the customary use of diagrams in which only the final form of the graph appears; instead, the book's margins feature step-by-step diagrams for the complete construction of each graph. The first part of the book employs simple fu

  18. Creating more effective graphs

    CERN Document Server

    Robbins, Naomi B

    2012-01-01

    A succinct and highly readable guide to creating effective graphs The right graph can be a powerful tool for communicating information, improving a presentation, or conveying your point in print. If your professional endeavors call for you to present data graphically, here's a book that can help you do it more effectively. Creating More Effective Graphs gives you the basic knowledge and techniques required to choose and create appropriate graphs for a broad range of applications. Using real-world examples everyone can relate to, the author draws on her years of experience in gr

  19. Graph Generator Survey

    Energy Technology Data Exchange (ETDEWEB)

    Lothian, Joshua [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sullivan, Blair D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Baker, Matthew B. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Schrock, Jonathan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Poole, Stephen W. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2013-10-01

    The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of different application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.

  20. Loose Graph Simulations

    DEFF Research Database (Denmark)

    Mansutti, Alessio; Miculan, Marino; Peressotti, Marco

    2017-01-01

    We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all these notions, LGS allows us to express directly...... also problems which are “mixed” instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide formal translation of SGI, RLPM, and GS into LGSs, and we give...

  1. Graph Compression by BFS

    Directory of Open Access Journals (Sweden)

    Alberto Apostolico

    2009-08-01

    Full Text Available The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods.

  2. Current fluctuations of interacting active Brownian particles

    OpenAIRE

    Pre, Trevor Grand; Limmer, David T.

    2018-01-01

    We derive the distribution function for particle currents for a system of interacting active Brownian particles in the long time limit using large deviation theory and a weighted many body expansion. We find the distribution is non-Gaussian, except in the limit of passive particles. The non-Gaussian fluctuations can be understood from the effective potential the particles experience when conditioned on a given current. This potential suppresses fluctuations of the particle's orientation, and ...

  3. Time-averaged MSD of Brownian motion

    OpenAIRE

    Andreanov, Alexei; Grebenkov, Denis

    2012-01-01

    We study the statistical properties of the time-averaged mean-square displacements (TAMSD). This is a standard non-local quadratic functional for inferring the diffusion coefficient from an individual random trajectory of a diffusing tracer in single-particle tracking experiments. For Brownian motion, we derive an exact formula for the Laplace transform of the probability density of the TAMSD by mapping the original problem onto chains of coupled harmonic oscillators. From this formula, we de...

  4. Brownian motion, dynamical randomness and irreversibility

    International Nuclear Information System (INIS)

    Gaspard, Pierre

    2005-01-01

    A relationship giving the entropy production as the difference between a time-reversed entropy per unit time and the standard one is applied to stochastic processes of diffusion of Brownian particles between two reservoirs at different concentrations. The entropy production in the nonequilibrium steady state is interpreted in terms of a time asymmetry in the dynamical randomness between the forward and backward paths of the diffusion process

  5. Brownian motion in short range random potentials

    International Nuclear Information System (INIS)

    Romero, A.H.; Romero, A.H.; Sancho, J.M.

    1998-01-01

    A numerical study of Brownian motion of noninteracting particles in random potentials is presented. The dynamics are modeled by Langevin equations in the high friction limit. The random potentials are Gaussian distributed and short ranged. The simulations are performed in one and two dimensions. Different dynamical regimes are found and explained. Effective subdiffusive exponents are obtained and commented on. copyright 1998 The American Physical Society

  6. Frustrated Brownian Motion of Nonlocal Solitary Waves

    International Nuclear Information System (INIS)

    Folli, V.; Conti, C.

    2010-01-01

    We investigate the evolution of solitary waves in a nonlocal medium in the presence of disorder. By using a perturbational approach, we show that an increasing degree of nonlocality may largely hamper the Brownian motion of self-trapped wave packets. The result is valid for any kind of nonlocality and in the presence of nonparaxial effects. Analytical predictions are compared with numerical simulations based on stochastic partial differential equations.

  7. The quantum brownian particle and memory effects

    International Nuclear Information System (INIS)

    Britani, J.R.; Mizrahi, S.S.; Pimentel, B.M.

    1991-01-01

    The Quantum Brownian particle, immersed in a heat bath, is described by a statistical operator whose evolution is ruled by a Generalized Master Equation (GME). The heat bath degrees of freedom are considered to be either white noise or coloured noise correlated,while the GME is considered under either the Markov or Non-Markov approaches. The comparison between these considerations are fully developed and their physical meaning is discussed. (author)

  8. Optimum analysis of a Brownian refrigerator.

    Science.gov (United States)

    Luo, X G; Liu, N; He, J Z

    2013-02-01

    A Brownian refrigerator with the cold and hot reservoirs alternating along a space coordinate is established. The heat flux couples with the movement of the Brownian particles due to an external force in the spatially asymmetric but periodic potential. After using the Arrhenius factor to describe the behaviors of the forward and backward jumps of the particles, the expressions for coefficient of performance (COP) and cooling rate are derived analytically. Then, through maximizing the product of conversion efficiency and heat flux flowing out, a new upper bound only depending on the temperature ratio of the cold and hot reservoirs is found numerically in the reversible situation, and it is a little larger than the so-called Curzon and Ahlborn COP ε(CA)=(1/√[1-τ])-1. After considering the irreversible factor owing to the kinetic energy change of the moving particles, we find the optimized COP is smaller than ε(CA) and the external force even does negative work on the Brownian particles when they jump from a cold to hot reservoir.

  9. Analyzing animal movements using Brownian bridges.

    Science.gov (United States)

    Horne, Jon S; Garton, Edward O; Krone, Stephen M; Lewis, Jesse S

    2007-09-01

    By studying animal movements, researchers can gain insight into many of the ecological characteristics and processes important for understanding population-level dynamics. We developed a Brownian bridge movement model (BBMM) for estimating the expected movement path of an animal, using discrete location data obtained at relatively short time intervals. The BBMM is based on the properties of a conditional random walk between successive pairs of locations, dependent on the time between locations, the distance between locations, and the Brownian motion variance that is related to the animal's mobility. We describe two critical developments that enable widespread use of the BBMM, including a derivation of the model when location data are measured with error and a maximum likelihood approach for estimating the Brownian motion variance. After the BBMM is fitted to location data, an estimate of the animal's probability of occurrence can be generated for an area during the time of observation. To illustrate potential applications, we provide three examples: estimating animal home ranges, estimating animal migration routes, and evaluating the influence of fine-scale resource selection on animal movement patterns.

  10. Intrinsic and extrinsic measurement for Brownian motion

    International Nuclear Information System (INIS)

    Castro-Villarreal, Pavel

    2014-01-01

    Based upon the Smoluchowski equation on curved manifolds, three physical observables are considered for Brownian displacement, namely geodesic displacement s, Euclidean displacement δR, and projected displacement δR ⊥ . The Weingarten–Gauss equations are used to calculate the mean-square Euclidean displacements in the short-time regime. Our findings show that from an extrinsic point of view the geometry of the space affects the Brownian motion in such a way that the particle’s diffusion is decelerated, contrasting with the intrinsic point of view where dynamics is controlled by the sign of the Gaussian curvature (Castro-Villarreal, 2010 J. Stat. Mech. P08006). Furthermore, it is possible to give exact formulas for 〈δR〉 and 〈δR 2 〉 on spheres and minimal surfaces, which are valid for all values of time. In the latter case, surprisingly, Brownian motion corresponds to the usual diffusion in flat geometries, albeit minimal surfaces have non-zero Gaussian curvature. Finally, the two-dimensional case is emphasized due to its close relation to surface self-diffusion in fluid membranes. (paper)

  11. Interacting Brownian Swarms: Some Analytical Results

    Directory of Open Access Journals (Sweden)

    Guillaume Sartoretti

    2016-01-01

    Full Text Available We consider the dynamics of swarms of scalar Brownian agents subject to local imitation mechanisms implemented using mutual rank-based interactions. For appropriate values of the underlying control parameters, the swarm propagates tightly and the distances separating successive agents are iid exponential random variables. Implicitly, the implementation of rank-based mutual interactions, requires that agents have infinite interaction ranges. Using the probabilistic size of the swarm’s support, we analytically estimate the critical interaction range below that flocked swarms cannot survive. In the second part of the paper, we consider the interactions between two flocked swarms of Brownian agents with finite interaction ranges. Both swarms travel with different barycentric velocities, and agents from both swarms indifferently interact with each other. For appropriate initial configurations, both swarms eventually collide (i.e., all agents interact. Depending on the values of the control parameters, one of the following patterns emerges after collision: (i Both swarms remain essentially flocked, or (ii the swarms become ultimately quasi-free and recover their nominal barycentric speeds. We derive a set of analytical flocking conditions based on the generalized rank-based Brownian motion. An extensive set of numerical simulations corroborates our analytical findings.

  12. Quantum dynamical framework for Brownian heat engines

    Science.gov (United States)

    Agarwal, G. S.; Chaturvedi, S.

    2013-07-01

    We present a self-contained formalism modeled after the Brownian motion of a quantum harmonic oscillator for describing the performance of microscopic Brownian heat engines such as Carnot, Stirling, and Otto engines. Our theory, besides reproducing the standard thermodynamics results in the steady state, enables us to study the role dissipation plays in determining the efficiency of Brownian heat engines under actual laboratory conditions. In particular, we analyze in detail the dynamics associated with decoupling a system in equilibrium with one bath and recoupling it to another bath and obtain exact analytical results, which are shown to have significant ramifications on the efficiencies of engines involving such a step. We also develop a simple yet powerful technique for computing corrections to the steady state results arising from finite operation time and use it to arrive at the thermodynamic complementarity relations for various operating conditions and also to compute the efficiencies of the three engines cited above at maximum power. Some of the methods and exactly solvable models presented here are interesting in their own right and could find useful applications in other contexts as well.

  13. Properties of Brownian Image Models in Scale-Space

    DEFF Research Database (Denmark)

    Pedersen, Kim Steenstrup

    2003-01-01

    Brownian images) will be discussed in relation to linear scale-space theory, and it will be shown empirically that the second order statistics of natural images mapped into jet space may, within some scale interval, be modeled by the Brownian image model. This is consistent with the 1/f 2 power spectrum...... law that apparently governs natural images. Furthermore, the distribution of Brownian images mapped into jet space is Gaussian and an analytical expression can be derived for the covariance matrix of Brownian images in jet space. This matrix is also a good approximation of the covariance matrix......In this paper it is argued that the Brownian image model is the least committed, scale invariant, statistical image model which describes the second order statistics of natural images. Various properties of three different types of Gaussian image models (white noise, Brownian and fractional...

  14. Graph Theory. 1. Fragmentation of Structural Graphs

    Directory of Open Access Journals (Sweden)

    Lorentz JÄNTSCHI

    2002-12-01

    Full Text Available The investigation of structural graphs has many fields of applications in engineering, especially in applied sciences like as applied chemistry and physics, computer sciences and automation, electronics and telecommunication. The main subject of the paper is to express fragmentation criteria in graph using a new method of investigation: terminal paths. Using terminal paths are defined most of the fragmentation criteria that are in use in molecular topology, but the fields of applications are more generally than that, as I mentioned before. Graphical examples of fragmentation are given for every fragmentation criteria. Note that all fragmentation is made with a computer program that implements a routine for every criterion.[1] A web routine for tracing all terminal paths in graph can be found at the address: http://vl.academicdirect.ro/molecular_topology/tpaths/ [1] M. V. Diudea, I. Gutman, L. Jäntschi, Molecular Topology, Nova Science, Commack, New York, 2001, 2002.

  15. Time rescaling and Gaussian properties of the fractional Brownian motions

    International Nuclear Information System (INIS)

    Maccone, C.

    1981-01-01

    The fractional Brownian motions are proved to be a class of Gaussian (normal) stochastic processes suitably rescaled in time. Some consequences affecting their eigenfunction expansion (Karhunen-Loeve expansion) are inferred. A known formula of Cameron and Martin is generalized. The first-passage time probability density is found. The partial differential equation of the fractional Brownian diffusion is obtained. And finally the increments of the fractional Brownian motions are proved to be independent for nonoverlapping time intervals. (author)

  16. A graph rewriting programming language for graph drawing

    OpenAIRE

    Rodgers, Peter

    1998-01-01

    This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computationally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools are all text based. Recent developments in graph rewriting systems have produced computationally com...

  17. Brownian diode: Molecular motor based on a semi-permeable Brownian particle with internal potential drop

    International Nuclear Information System (INIS)

    Plyukhin, A.V.

    2013-01-01

    A model of an autonomous isothermal Brownian motor with an internal propulsion mechanism is considered. The motor is a Brownian particle which is semi-transparent for molecules of surrounding ideal gas. Molecular passage through the particle is controlled by a potential similar to that in the transition rate theory, i.e. characterized by two stationary states with a finite energy difference separated by a potential barrier. The internal potential drop maintains the diode-like asymmetry of molecular fluxes through the particle, which results in the particle's stationary drift.

  18. O'Connell's process as a vicious Brownian motion

    International Nuclear Information System (INIS)

    Katori, Makoto

    2011-01-01

    Vicious Brownian motion is a diffusion scaling limit of Fisher's vicious walk model, which is a system of Brownian particles in one dimension such that if two motions meet they kill each other. We consider the vicious Brownian motions conditioned never to collide with each other and call it noncolliding Brownian motion. This conditional diffusion process is equivalent to the eigenvalue process of the Hermitian-matrix-valued Brownian motion studied by Dyson [J. Math. Phys. 3, 1191 (1962)]. Recently, O'Connell [Ann. Probab. (to be published)] introduced a generalization of the noncolliding Brownian motion by using the eigenfunctions (the Whittaker functions) of the quantum Toda lattice in order to analyze a directed polymer model in 1 + 1 dimensions. We consider a system of one-dimensional Brownian motions with a long-ranged killing term as a generalization of the vicious Brownian motion and construct the O'Connell process as a conditional process of the killing Brownian motions to survive forever.

  19. Graph Transforming Java Data

    NARCIS (Netherlands)

    de Mol, M.J.; Rensink, Arend; Hunt, James J.

    This paper introduces an approach for adding graph transformation-based functionality to existing JAVA programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user’s own JAVA class

  20. Distance-transitive graphs

    NARCIS (Netherlands)

    Cohen, A.M.; Beineke, L.W.; Wilson, R.J.; Cameron, P.J.

    2004-01-01

    In this chapter we investigate the classification of distance-transitive graphs: these are graphs whose automorphism groups are transitive on each of the sets of pairs of vertices at distance i, for i = 0, 1,.... We provide an introduction into the field. By use of the classification of finite

  1. Adventures in graph theory

    CERN Document Server

    Joyner, W David

    2017-01-01

    This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants for graphs prepares the reader for the subsequent dive into the applications of graph theory. To pique the reader’s interest in areas of possible exploration, recent results in mathematics appear throughout the book, accompanied with examples of related graphs, how they arise, and what their valuable uses are. The consequences of graph theory covered by the authors are complicated and far-reaching, so topics are always exhibited in a user-friendly manner with copious graphs, exercises, and Sage code for the computation of equations. Samples of the book’s source code can be found at github.com/springer-math/adventures-in-graph-theory. The text is geared towards ad...

  2. Recognition of fractal graphs

    NARCIS (Netherlands)

    Perepelitsa, VA; Sergienko, [No Value; Kochkarov, AM

    1999-01-01

    Definitions of prefractal and fractal graphs are introduced, and they are used to formulate mathematical models in different fields of knowledge. The topicality of fractal-graph recognition from the point of view, of fundamental improvement in the efficiency of the solution of algorithmic problems

  3. Graph Colouring Algorithms

    DEFF Research Database (Denmark)

    Husfeldt, Thore

    2015-01-01

    This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...

  4. Packing Degenerate Graphs Greedily

    Czech Academy of Sciences Publication Activity Database

    Allen, P.; Böttcher, J.; Hladký, J.; Piguet, Diana

    2017-01-01

    Roč. 61, August (2017), s. 45-51 ISSN 1571-0653 R&D Projects: GA ČR GJ16-07822Y Institutional support: RVO:67985807 Keywords : tree packing conjecture * graph packing * graph processes Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics

  5. Generalized connectivity of graphs

    CERN Document Server

    Li, Xueliang

    2016-01-01

    Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.

  6. Autoregressive Moving Average Graph Filtering

    OpenAIRE

    Isufi, Elvin; Loukas, Andreas; Simonetto, Andrea; Leus, Geert

    2016-01-01

    One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which (i) are able to approximate any desired graph frequency response, and (ii) give exact solutions for tasks such as graph signal denoising and interpolation. The design phi...

  7. Subgraph detection using graph signals

    KAUST Repository

    Chepuri, Sundeep Prabhakar

    2017-03-06

    In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.

  8. Subgraph detection using graph signals

    KAUST Repository

    Chepuri, Sundeep Prabhakar; Leus, Geert

    2017-01-01

    In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.

  9. Langevin theory of anomalous Brownian motion made simple

    International Nuclear Information System (INIS)

    Tothova, Jana; Vasziova, Gabriela; Lisy, VladimIr; Glod, Lukas

    2011-01-01

    During the century from the publication of the work by Einstein (1905 Ann. Phys. 17 549) Brownian motion has become an important paradigm in many fields of modern science. An essential impulse for the development of Brownian motion theory was given by the work of Langevin (1908 C. R. Acad. Sci., Paris 146 530), in which he proposed an 'infinitely more simple' description of Brownian motion than that by Einstein. The original Langevin approach has however strong limitations, which were rigorously stated after the creation of the hydrodynamic theory of Brownian motion (1945). Hydrodynamic Brownian motion is a special case of 'anomalous Brownian motion', now intensively studied both theoretically and in experiments. We show how some general properties of anomalous Brownian motion can be easily derived using an effective method that allows one to convert the stochastic generalized Langevin equation into a deterministic Volterra-type integro-differential equation for the mean square displacement of the particle. Within the Gibbs statistics, the method is applicable to linear equations of motion with any kind of memory during the evolution of the system. We apply it to memoryless Brownian motion in a harmonic potential well and to Brownian motion in fluids, taking into account the effects of hydrodynamic memory. Exploring the mathematical analogy between Brownian motion and electric circuits, which are at nanoscales also described by the generalized Langevin equation, we calculate the fluctuations of charge and current in RLC circuits that are in contact with the thermal bath. Due to the simplicity of our approach it could be incorporated into graduate courses of statistical physics. Once the method is established, it allows bringing to the attention of students and effectively solving a number of attractive problems related to Brownian motion.

  10. Behavior of aerosols undergoing Brownian coagulation, Brownian diffusion and gravitational settling in a closed chamber

    International Nuclear Information System (INIS)

    Okuyama, Kikuo; Kousaka, Yasuo; Yoshida, Tetsuo

    1976-01-01

    The behavior of aerosols undergoing Brownian coagulation. Brownian diffusion and gravitational settling in a closed chamber was studied by solving the basic equation, the so-called population balance equation, numerically for a polydisperse aerosol system and analytically for a monodisperse system, and then the results were examined by experiment. In solving the basic equation, two dimensionless parameters, which are determined by the initial properties of an aerosol and the chamber dimension and also characterize the relative effects of Brownian coagulation and Brownian diffusion to gravitational settling, were introduced in order to generalize the behavior under arbitrary conditions. The calculated results, the time-dependent changes in particle number concentration and particle size distribution for a polydisperse system, were presented graphically by using the above two parameters. And further using these parameters, the domains of the three controlling factors were mapped to show the extent of each effect of these factors under various conditions for a monodisperse system. Some of the calculated results were compared with the experimental results obtained by the ultramicroscopic size analysis previously developed by the authors. (auth.)

  11. Extremal graph theory

    CERN Document Server

    Bollobas, Bela

    2004-01-01

    The ever-expanding field of extremal graph theory encompasses a diverse array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume, based on a series of lectures delivered to graduate students at the University of Cambridge, presents a concise yet comprehensive treatment of extremal graph theory.Unlike most graph theory treatises, this text features complete proofs for almost all of its results. Further insights into theory are provided by the numerous exercises of varying degrees of difficulty that accompany each chapter. A

  12. The relativistic Brownian motion: Interdisciplinary applications

    International Nuclear Information System (INIS)

    Aragones-Munoz, A; Sandoval-Villalbazo, A

    2010-01-01

    Relativistic Brownian motion theory will be applied to the study of analogies between physical and economic systems, emphasizing limiting cases in which Gaussian distributions are no longer valid. The characteristic temperatures of the particles will be associated with the concept of variance, and this will allow us to choose whether the pertinent distribution is classical or relativistic, while working specific situations. The properties of particles can be interpreted as economic variables, in order to study the behavior of markets in terms of Levy financial processes, since markets behave as stochastic systems. As far as we know, the application of the Juettner distribution to the study of economic systems is a new idea.

  13. Effective diffusion of confined active Brownian swimmers

    Science.gov (United States)

    Sandoval, Mario; Dagdug, Leonardo

    2014-11-01

    We find theoretically the effect of confinement and thermal fluctuations, on the diffusivity of a spherical active swimmer moving inside a two-dimensional narrow cavity of general shape. The explicit formulas for the effective diffusion coefficient of a swimmer moving inside two particular cavities are presented. We also compare our analytical results with Brownian Dynamics simulations and we obtain excellent agreement. L.D. thanks Consejo Nacional de Ciencia y Tecnologia (CONACyT) Mexico, for partial support by Grant No. 176452. M. S. thanks CONACyT and Programa de Mejoramiento de Profesorado (PROMEP) for partially funding this work under Grant No. 103.5/13/6732.

  14. Time-averaged MSD of Brownian motion

    International Nuclear Information System (INIS)

    Andreanov, Alexei; Grebenkov, Denis S

    2012-01-01

    We study the statistical properties of the time-averaged mean-square displacements (TAMSD). This is a standard non-local quadratic functional for inferring the diffusion coefficient from an individual random trajectory of a diffusing tracer in single-particle tracking experiments. For Brownian motion, we derive an exact formula for the Laplace transform of the probability density of the TAMSD by mapping the original problem onto chains of coupled harmonic oscillators. From this formula, we deduce the first four cumulant moments of the TAMSD, the asymptotic behavior of the probability density and its accurate approximation by a generalized Gamma distribution

  15. Eigenfunction statistics of Wishart Brownian ensembles

    International Nuclear Information System (INIS)

    Shukla, Pragya

    2017-01-01

    We theoretically analyze the eigenfunction fluctuation measures for a Hermitian ensemble which appears as an intermediate state of the perturbation of a stationary ensemble by another stationary ensemble of Wishart (Laguerre) type. Similar to the perturbation by a Gaussian stationary ensemble, the measures undergo a diffusive dynamics in terms of the perturbation parameter but the energy-dependence of the fluctuations is different in the two cases. This may have important consequences for the eigenfunction dynamics as well as phase transition studies in many areas of complexity where Brownian ensembles appear. (paper)

  16. Quantum Darwinism in Quantum Brownian Motion

    Science.gov (United States)

    Blume-Kohout, Robin; Zurek, Wojciech H.

    2008-12-01

    Quantum Darwinism—the redundant encoding of information about a decohering system in its environment—was proposed to reconcile the quantum nature of our Universe with apparent classicality. We report the first study of the dynamics of quantum Darwinism in a realistic model of decoherence, quantum Brownian motion. Prepared in a highly squeezed state—a macroscopic superposition—the system leaves records whose redundancy increases rapidly with initial delocalization. Redundancy appears rapidly (on the decoherence time scale) and persists for a long time.

  17. Time-averaged MSD of Brownian motion

    Science.gov (United States)

    Andreanov, Alexei; Grebenkov, Denis S.

    2012-07-01

    We study the statistical properties of the time-averaged mean-square displacements (TAMSD). This is a standard non-local quadratic functional for inferring the diffusion coefficient from an individual random trajectory of a diffusing tracer in single-particle tracking experiments. For Brownian motion, we derive an exact formula for the Laplace transform of the probability density of the TAMSD by mapping the original problem onto chains of coupled harmonic oscillators. From this formula, we deduce the first four cumulant moments of the TAMSD, the asymptotic behavior of the probability density and its accurate approximation by a generalized Gamma distribution.

  18. Laser light scattering in Brownian medium

    International Nuclear Information System (INIS)

    Suwono; Santoso, Budi; Baiquni, A.

    1983-01-01

    The principle of laser light scattering in Brownian medium and photon correlation spectroscopy are described in detail. Their application to the study of the behaviour of a polystyrene latex solution are discussed. The auto-correlation function of light scattered by the polystyrene latex solution in various angle, various temperature and in various sample times, have been measured. Information on the translation diffusion coefficient and size on the particle can be obtained from the auto-correlation function. Good agreement between the available data and experiment is shown. (author)

  19. Microscopic derivation of open quantum Brownian motion: a particular example

    International Nuclear Information System (INIS)

    Sinayskiy, Ilya; Petruccione, Francesco

    2015-01-01

    The microscopic derivation of a new type of Brownian motion, namely open quantum Brownian motion (OQBM) is presented. The quantum master equation for OQBM is derived for a weakly driven system interacting with a decoherent environment. Examples of the dynamics for initial Gaussian and non-Gaussian distributions are presented. Both examples demonstrate convergence of the OQBM dynamics to Gaussian distributions. (topical article)

  20. Quantum description of the Brownian movement in an external field

    International Nuclear Information System (INIS)

    Svin'in, I.R.

    1976-01-01

    The Schroedinger equation for brownian motion in an external field is obtained on the basis of the classical Langevin equation. The specific features of the approach proposed are illustrated by the example of the brownian motion of the quantum oscillator. The influence of the fluctuations on the various physical quantities is considered

  1. Presentation of quantum Brownian movement in the collective coordinate method

    International Nuclear Information System (INIS)

    Oksak, A.I.; Sukhanov, A.D.

    2003-01-01

    Two explicitly solved models of quantum randomized processes described by the Langevin equation, i. e. a free quantum Brownian particle and a quantum Brownian harmonic oscillator, are considered. The Hamiltonian (string) realization of the models reveals soliton-like structure of classical solutions. Accordingly, the method of zero mode collective coordinate is an adequate means for describing the models quantum dynamics [ru

  2. Diffusion in one dimensional random medium and hyperbolic Brownian motion

    International Nuclear Information System (INIS)

    Comtet, A.; Monthus, C.; Paris-6 Univ., 75

    1995-03-01

    Classical diffusion in a random medium involves an exponential functional of Brownian motion. This functional also appears in the study of Brownian diffusion on a Riemann surface of constant negative curvature. This relationship is analyzed in detail and various distributions are studied using stochastic calculus and functional integration. (author) 17 refs

  3. Simple Brownian diffusion an introduction to the standard theoretical models

    CERN Document Server

    Gillespie, Daniel T

    2013-01-01

    Brownian diffusion, the motion of large molecules in a sea of very many much smaller molecules, is topical because it is one of the ways in which biologically important molecules move about inside living cells. This book presents the mathematical physics that underlies the four simplest models of Brownian diffusion.

  4. Self-induced temperature gradients in Brownian dynamics

    Science.gov (United States)

    Devine, Jack; Jack, M. W.

    2017-12-01

    Brownian systems often surmount energy barriers by absorbing and emitting heat to and from their local environment. Usually, the temperature gradients created by this heat exchange are assumed to dissipate instantaneously. Here we relax this assumption to consider the case where Brownian dynamics on a time-independent potential can lead to self-induced temperature gradients. In the same way that externally imposed temperature gradients can cause directed motion, these self-induced gradients affect the dynamics of the Brownian system. The result is a coupling between the local environment and the Brownian subsystem. We explore the resulting dynamics and thermodynamics of these coupled systems and develop a robust method for numerical simulation. In particular, by focusing on one-dimensional situations, we show that self-induced temperature gradients reduce barrier-crossing rates. We also consider a heat engine and a heat pump based on temperature gradients induced by a Brownian system in a nonequilibrium potential.

  5. Downhill Domination in Graphs

    Directory of Open Access Journals (Sweden)

    Haynes Teresa W.

    2014-08-01

    Full Text Available A path π = (v1, v2, . . . , vk+1 in a graph G = (V,E is a downhill path if for every i, 1 ≤ i ≤ k, deg(vi ≥ deg(vi+1, where deg(vi denotes the degree of vertex vi ∈ V. The downhill domination number equals the minimum cardinality of a set S ⊆ V having the property that every vertex v ∈ V lies on a downhill path originating from some vertex in S. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number of a graph is at most half its order, and that the downhill domination number of a tree is at most one third its order. We characterize the graphs obtaining each of these bounds

  6. Tailored Random Graph Ensembles

    International Nuclear Information System (INIS)

    Roberts, E S; Annibale, A; Coolen, A C C

    2013-01-01

    Tailored graph ensembles are a developing bridge between biological networks and statistical mechanics. The aim is to use this concept to generate a suite of rigorous tools that can be used to quantify and compare the topology of cellular signalling networks, such as protein-protein interaction networks and gene regulation networks. We calculate exact and explicit formulae for the leading orders in the system size of the Shannon entropies of random graph ensembles constrained with degree distribution and degree-degree correlation. We also construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities which converges to a strictly uniform measure and is based on edge swaps that conserve all degrees. The acceptance probabilities can be generalized to define Markov chains that target any alternative desired measure on the space of directed or undirected graphs, in order to generate graphs with more sophisticated topological features.

  7. Cycles in graphs

    CERN Document Server

    Alspach, BR

    1985-01-01

    This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs. Leading researchers in this area present here 3 survey papers and 42 papers containing new results. There is also a collection of unsolved problems.

  8. Introduction to graph theory

    CERN Document Server

    Wilson, Robin J

    1985-01-01

    Graph Theory has recently emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. This book provides a comprehensive introduction to the subject.

  9. Hyperbolicity in median graphs

    Indian Academy of Sciences (India)

    mic problems in hyperbolic spaces and hyperbolic graphs have been .... that in general the main obstacle is that we do not know the location of ...... [25] Jonckheere E and Lohsoonthorn P, A hyperbolic geometry approach to multipath routing,.

  10. Comment on 'Finding viscosity of liquids from Brownian motion at students' laboratory' and 'Brownian motion using video capture'

    International Nuclear Information System (INIS)

    Greczylo, Tomasz; Debowska, Ewa

    2007-01-01

    The authors make comments and remarks on the papers by Salmon et al (2002 Eur. J. Phys. 23 249-53) and their own (2005 Eur. J. Phys. 26 827-33) concerning Brownian motion in two-dimensional space. New, corrected results of calculations and measurements for students' experiments on finding the viscosity of liquids from Brownian motion are presented. (letters and comments)

  11. Uniform Single Valued Neutrosophic Graphs

    Directory of Open Access Journals (Sweden)

    S. Broumi

    2017-09-01

    Full Text Available In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.

  12. Collective Rationality in Graph Aggregation

    NARCIS (Netherlands)

    Endriss, U.; Grandi, U.; Schaub, T.; Friedrich, G.; O'Sullivan, B.

    2014-01-01

    Suppose a number of agents each provide us with a directed graph over a common set of vertices. Graph aggregation is the problem of computing a single “collective” graph that best represents the information inherent in this profile of individual graphs. We consider this aggregation problem from the

  13. Classical dynamics on graphs

    International Nuclear Information System (INIS)

    Barra, F.; Gaspard, P.

    2001-01-01

    We consider the classical evolution of a particle on a graph by using a time-continuous Frobenius-Perron operator that generalizes previous propositions. In this way, the relaxation rates as well as the chaotic properties can be defined for the time-continuous classical dynamics on graphs. These properties are given as the zeros of some periodic-orbit zeta functions. We consider in detail the case of infinite periodic graphs where the particle undergoes a diffusion process. The infinite spatial extension is taken into account by Fourier transforms that decompose the observables and probability densities into sectors corresponding to different values of the wave number. The hydrodynamic modes of diffusion are studied by an eigenvalue problem of a Frobenius-Perron operator corresponding to a given sector. The diffusion coefficient is obtained from the hydrodynamic modes of diffusion and has the Green-Kubo form. Moreover, we study finite but large open graphs that converge to the infinite periodic graph when their size goes to infinity. The lifetime of the particle on the open graph is shown to correspond to the lifetime of a system that undergoes a diffusion process before it escapes

  14. Modern graph theory

    CERN Document Server

    Bollobás, Béla

    1998-01-01

    The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed ...

  15. Proxy Graph: Visual Quality Metrics of Big Graph Sampling.

    Science.gov (United States)

    Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra

    2017-06-01

    Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.

  16. On some covering graphs of a graph

    Directory of Open Access Journals (Sweden)

    Shariefuddin Pirzada

    2016-10-01

    Full Text Available For a graph $G$ with vertex set $V(G=\\{v_1, v_2, \\dots, v_n\\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\\{u\\in S : uv \\in E(G \\}\\cup \\{v\\}$ be the closed neighbourhood of the vertex $v$ with respect to $S.$ We define a square matrix $A_S(G= (a_{ij},$ by $a_{ij}=1,$ if $\\left |N_S[v_i]\\cap N_S[v_j] \\right| \\geq 1, i\

  17. Directed motion of a Brownian motor in a temperature gradient

    Science.gov (United States)

    Liu, Yibing; Nie, Wenjie; Lan, Yueheng

    2017-05-01

    Directed motion of mesoscopic systems in a non-equilibrium environment is of great interest to both scientists and engineers. Here, the translation and rotation of a Brownian motor is investigated under non-equilibrium conditions. An anomalous directed translation is found if the two heads of the Brownian motor are immersed in baths with different particle masses, which is hinted in the analytic computation and confirmed by the numerical simulation. Similar consideration is also used to find the directed movement in the single rotational and translational degree of freedom of the Brownian motor when residing in one thermal bath with a temperature gradient.

  18. Brownian motion probe for water-ethanol inhomogeneous mixtures

    Science.gov (United States)

    Furukawa, Kazuki; Judai, Ken

    2017-12-01

    Brownian motion provides information regarding the microscopic geometry and motion of molecules, insofar as it occurs as a result of molecular collisions with a colloid particle. We found that the mobility of polystyrene beads from the Brownian motion in a water-ethanol mixture is larger than that predicted from the liquid shear viscosity. This indicates that mixing water and ethanol is inhomogeneous in micron-sized probe beads. The discrepancy between the mobility of Brownian motion and liquid mobility can be explained by the way the rotation of the beads in an inhomogeneous viscous solvent converts the translational movement.

  19. Fractional Brownian motion and long term clinical trial recruitment.

    Science.gov (United States)

    Zhang, Qiang; Lai, Dejian

    2011-05-01

    Prediction of recruitment in clinical trials has been a challenging task. Many methods have been studied, including models based on Poisson process and its large sample approximation by Brownian motion (BM), however, when the independent incremental structure is violated for BM model, we could use fractional Brownian motion to model and approximate the underlying Poisson processes with random rates. In this paper, fractional Brownian motion (FBM) is considered for such conditions and compared to BM model with illustrated examples from different trials and simulations.

  20. Conformal geometry and invariants of 3-strand Brownian braids

    International Nuclear Information System (INIS)

    Nechaev, Sergei; Voituriez, Raphael

    2005-01-01

    We propose a simple geometrical construction of topological invariants of 3-strand Brownian braids viewed as world lines of 3 particles performing independent Brownian motions in the complex plane z. Our construction is based on the properties of conformal maps of doubly-punctured plane z to the universal covering surface. The special attention is paid to the case of indistinguishable particles. Our method of conformal maps allows us to investigate the statistical properties of the topological complexity of a bunch of 3-strand Brownian braids and to compute the expectation value of the irreducible braid length in the non-Abelian case

  1. Breaking the symmetry of a Brownian motor with symmetric potentials

    International Nuclear Information System (INIS)

    Hagman, H; Zelan, M; Dion, C M

    2011-01-01

    The directed transport of Brownian particles requires a system with an asymmetry and with non-equilibrium noise. Here we investigate numerically alternative ways of fulfilling these requirements for a two-state Brownian motor, realized with Brownian particles alternating between two phase-shifted, symmetric potentials. We show that, besides the previously known spatio-temporal asymmetry based on unequal transfer rates between the potentials, inequalities in the potential depths, the frictions, or the equilibrium temperatures of the two potentials also generate the required asymmetry. We also show that the effects of the thermal noise and the noise of the transfer's randomness depend on the way the asymmetry is induced.

  2. Fundamentals of algebraic graph transformation

    CERN Document Server

    Ehrig, Hartmut; Prange, Ulrike; Taentzer, Gabriele

    2006-01-01

    Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. Part I is an introduction to the classical case of graph and typed graph transformation. In Part II basic and advanced results are first shown for an abstract form of replacement systems, so-called adhesive high-level replacement systems based on category theory, and are then instantiated to several forms of graph and Petri net transformation systems. Part III develops typed attributed graph transformation, a technique of key relevance in the modeling of visual languages and in model transformation. Part IV contains a practical case study on model transformation and a presentation of the AGG (attributed graph grammar) tool envir...

  3. The STAPL Parallel Graph Library

    KAUST Repository

    Harshvardhan,

    2013-01-01

    This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable distributed graph container and a collection of commonly used parallel graph algorithms. The library introduces pGraph pViews that separate algorithm design from the container implementation. It supports three graph processing algorithmic paradigms, level-synchronous, asynchronous and coarse-grained, and provides common graph algorithms based on them. Experimental results demonstrate improved scalability in performance and data size over existing graph libraries on more than 16,000 cores and on internet-scale graphs containing over 16 billion vertices and 250 billion edges. © Springer-Verlag Berlin Heidelberg 2013.

  4. Parallel Molecular Distributed Detection With Brownian Motion.

    Science.gov (United States)

    Rogers, Uri; Koh, Min-Sung

    2016-12-01

    This paper explores the in vivo distributed detection of an undesired biological agent's (BAs) biomarkers by a group of biological sized nanomachines in an aqueous medium under drift. The term distributed, indicates that the system information relative to the BAs presence is dispersed across the collection of nanomachines, where each nanomachine possesses limited communication, computation, and movement capabilities. Using Brownian motion with drift, a probabilistic detection and optimal data fusion framework, coined molecular distributed detection, will be introduced that combines theory from both molecular communication and distributed detection. Using the optimal data fusion framework as a guide, simulation indicates that a sub-optimal fusion method exists, allowing for a significant reduction in implementation complexity while retaining BA detection accuracy.

  5. Communication: Memory effects and active Brownian diffusion

    Energy Technology Data Exchange (ETDEWEB)

    Ghosh, Pulak K. [Department of Chemistry, Presidency University, Kolkata 700073 (India); Li, Yunyun, E-mail: yunyunli@tongji.edu.cn [Center for Phononics and Thermal Energy Science, Tongji University, Shanghai 200092 (China); Marchegiani, Giampiero [Dipartimento di Fisica, Università di Camerino, I-62032 Camerino (Italy); Marchesoni, Fabio [Center for Phononics and Thermal Energy Science, Tongji University, Shanghai 200092 (China); Dipartimento di Fisica, Università di Camerino, I-62032 Camerino (Italy)

    2015-12-07

    A self-propelled artificial microswimmer is often modeled as a ballistic Brownian particle moving with constant speed aligned along one of its axis, but changing direction due to random collisions with the environment. Similarly to thermal noise, its angular randomization is described as a memoryless stochastic process. Here, we speculate that finite-time correlations in the orientational dynamics can affect the swimmer’s diffusivity. To this purpose, we propose and solve two alternative models. In the first one, we simply assume that the environmental fluctuations governing the swimmer’s propulsion are exponentially correlated in time, whereas in the second one, we account for possible damped fluctuations of the propulsion velocity around the swimmer’s axis. The corresponding swimmer’s diffusion constants are predicted to get, respectively, enhanced or suppressed upon increasing the model memory time. Possible consequences of this effect on the interpretation of the experimental data are discussed.

  6. Brownian Motion of Boomerang Colloidal Particles

    Science.gov (United States)

    Wei, Qi-Huo; Konya, Andrew; Wang, Feng; Selinger, Jonathan V.; Sun, Kai; Chakrabarty, Ayan

    2014-03-01

    We present experimental and theoretical studies on the Brownian motion of boomerang colloidal particles confined between two glass plates. Our experimental observations show that the mean displacements are biased towards the center of hydrodynamic stress (CoH), and that the mean-square displacements exhibit a crossover from short-time faster to long-time slower diffusion with the short-time diffusion coefficients dependent on the points used for tracking. A model based on Langevin theory elucidates that these behaviors are ascribed to the superposition of two diffusive modes: the ellipsoidal motion of the CoH and the rotational motion of the tracking point with respect to the CoH.

  7. Brownian motion with multiplicative noises revisited

    International Nuclear Information System (INIS)

    Kuroiwa, T; Miyazaki, K

    2014-01-01

    The Langevin equation with multiplicative noise and a state-dependent transport coefficient should always complemented with the proper interpretation rule of the noise, such as the Itô and Stratonovich conventions. Although the mathematical relationship between the different rules and how to translate from one rule to another are well established, the subject of which is a more physically natural rule still remains controversial. In this communication, we derive the overdamped Langevin equation with multiplicative noise for Brownian particles, by systematically eliminating the fast degrees of freedom of the underdamped Langevin equation. The Langevin equations obtained here vary depending on the choice of the noise conventions but they are different representations for an identical phenomenon. The results apply to multi-variable, nonequilibrium, non-stationary systems, and other general settings. (fast track communication)

  8. Factorization Procedure for Harmonically Bound Brownian Particle

    International Nuclear Information System (INIS)

    Omolo, JK.

    2006-01-01

    The method of factorization to solve the problem of the one-dimensional harmonically bound Brownian particle was applied. Assuming the the rapidily fluctuating random force is Gaussian and has an infinitely short correlation time, explicit expressions for the position-position,velocity-velocity, and the position-velocity correlation functions, which are also use to write down appropriate distribution functions were used. The correlation and distribution functions for the complex quantity (amplititude) which provides the expressions for the position and velocity of the particle are calculated. Finally, Fokker-Planck equations for the joint probability distribution functions for the amplititude and it's complex conjugate as well as for the position and velocity of the particle are obtained. (author)

  9. Yukawa Potential, Panharmonic Measure and Brownian Motion

    Directory of Open Access Journals (Sweden)

    Antti Rasila

    2018-05-01

    Full Text Available This paper continues our earlier investigation, where a walk-on-spheres (WOS algorithm for Monte Carlo simulation of the solutions of the Yukawa and the Helmholtz partial differential equations (PDEs was developed by using the Duffin correspondence. In this paper, we investigate the foundations behind the algorithm for the case of the Yukawa PDE. We study the panharmonic measure, which is a generalization of the harmonic measure for the Yukawa PDE. We show that there are natural stochastic definitions for the panharmonic measure in terms of the Brownian motion and that the harmonic and the panharmonic measures are all mutually equivalent. Furthermore, we calculate their Radon–Nikodym derivatives explicitly for some balls, which is a key result behind the WOS algorithm.

  10. Graphs, groups and surfaces

    CERN Document Server

    White, AT

    1985-01-01

    The field of topological graph theory has expanded greatly in the ten years since the first edition of this book appeared. The original nine chapters of this classic work have therefore been revised and updated. Six new chapters have been added, dealing with: voltage graphs, non-orientable imbeddings, block designs associated with graph imbeddings, hypergraph imbeddings, map automorphism groups and change ringing.Thirty-two new problems have been added to this new edition, so that there are now 181 in all; 22 of these have been designated as ``difficult'''' and 9 as ``unsolved''''. Three of the four unsolved problems from the first edition have been solved in the ten years between editions; they are now marked as ``difficult''''.

  11. Profinite graphs and groups

    CERN Document Server

    Ribes, Luis

    2017-01-01

    This book offers a detailed introduction to graph theoretic methods in profinite groups and applications to abstract groups. It is the first to provide a comprehensive treatment of the subject. The author begins by carefully developing relevant notions in topology, profinite groups and homology, including free products of profinite groups, cohomological methods in profinite groups, and fixed points of automorphisms of free pro-p groups. The final part of the book is dedicated to applications of the profinite theory to abstract groups, with sections on finitely generated subgroups of free groups, separability conditions in free and amalgamated products, and algorithms in free groups and finite monoids. Profinite Graphs and Groups will appeal to students and researchers interested in profinite groups, geometric group theory, graphs and connections with the theory of formal languages. A complete reference on the subject, the book includes historical and bibliographical notes as well as a discussion of open quest...

  12. Subdominant pseudoultrametric on graphs

    Energy Technology Data Exchange (ETDEWEB)

    Dovgoshei, A A; Petrov, E A [Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk (Ukraine)

    2013-08-31

    Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)→R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k≥2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.

  13. Quantitative graph theory mathematical foundations and applications

    CERN Document Server

    Dehmer, Matthias

    2014-01-01

    The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as:Comparative approaches (graph similarity or distance)Graph measures to characterize graphs quantitat

  14. Augmented marked graphs

    CERN Document Server

    Cheung, King Sing

    2014-01-01

    Petri nets are a formal and theoretically rich model for the modelling and analysis of systems. A subclass of Petri nets, augmented marked graphs possess a structure that is especially desirable for the modelling and analysis of systems with concurrent processes and shared resources.This monograph consists of three parts: Part I provides the conceptual background for readers who have no prior knowledge on Petri nets; Part II elaborates the theory of augmented marked graphs; finally, Part III discusses the application to system integration. The book is suitable as a first self-contained volume

  15. Graph Query Portal

    OpenAIRE

    Dayal, Amit; Brock, David

    2018-01-01

    Prashant Chandrasekar, a lead developer for the Social Interactome project, has tasked the team with creating a graph representation of the data collected from the social networks involved in that project. The data is currently stored in a MySQL database. The client requested that the graph database be Cayley, but after a literature review, Neo4j was chosen. The reasons for this shift will be explained in the design section. Secondarily, the team was tasked with coming up with three scena...

  16. Spectral radius of graphs

    CERN Document Server

    Stevanovic, Dragan

    2015-01-01

    Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. The primer begins with a brief classical review, in order to provide the reader with a foundation for the subsequent chapters. Topics covered include spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem. From this introduction, the

  17. Graph embedding with rich information through heterogeneous graph

    KAUST Repository

    Sun, Guolei

    2017-01-01

    Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most

  18. Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models

    Directory of Open Access Journals (Sweden)

    Tomasz Kajdanowicz

    2016-09-01

    Full Text Available Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdős–Renyi random graph model, Watts–Strogatz small world model, Albert–Barabási preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov–Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality. We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.

  19. Handbook of graph grammars and computing by graph transformation

    CERN Document Server

    Engels, G; Kreowski, H J; Rozenberg, G

    1999-01-01

    Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.The area of graph grammars and graph tran

  20. Topics in graph theory graphs and their Cartesian product

    CERN Document Server

    Imrich, Wilfried; Rall, Douglas F

    2008-01-01

    From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.

  1. Conformal correlation functions in the Brownian loop soup

    Science.gov (United States)

    Camia, Federico; Gandolfi, Alberto; Kleban, Matthew

    2016-01-01

    We define and study a set of operators that compute statistical properties of the Brownian loop soup, a conformally invariant gas of random Brownian loops (Brownian paths constrained to begin and end at the same point) in two dimensions. We prove that the correlation functions of these operators have many of the properties of conformal primaries in a conformal field theory, and compute their conformal dimension. The dimensions are real and positive, but have the novel feature that they vary continuously as a periodic function of a real parameter. We comment on the relation of the Brownian loop soup to the free field, and use this relation to establish that the central charge of the loop soup is twice its intensity.

  2. Conformal correlation functions in the Brownian loop soup

    Energy Technology Data Exchange (ETDEWEB)

    Camia, Federico, E-mail: federico.camia@nyu.edu [New York University Abu Dhabi (United Arab Emirates); VU University, Amsterdam (Netherlands); Gandolfi, Alberto, E-mail: albertogandolfi@nyu.edu [New York University Abu Dhabi (United Arab Emirates); Università di Firenze (Italy); Kleban, Matthew, E-mail: kleban@nyu.edu [New York University Abu Dhabi (United Arab Emirates); Center for Cosmology and Particle Physics, Department of Physics, New York University (United States)

    2016-01-15

    We define and study a set of operators that compute statistical properties of the Brownian loop soup, a conformally invariant gas of random Brownian loops (Brownian paths constrained to begin and end at the same point) in two dimensions. We prove that the correlation functions of these operators have many of the properties of conformal primaries in a conformal field theory, and compute their conformal dimension. The dimensions are real and positive, but have the novel feature that they vary continuously as a periodic function of a real parameter. We comment on the relation of the Brownian loop soup to the free field, and use this relation to establish that the central charge of the loop soup is twice its intensity.

  3. Conformal correlation functions in the Brownian loop soup

    Directory of Open Access Journals (Sweden)

    Federico Camia

    2016-01-01

    Full Text Available We define and study a set of operators that compute statistical properties of the Brownian loop soup, a conformally invariant gas of random Brownian loops (Brownian paths constrained to begin and end at the same point in two dimensions. We prove that the correlation functions of these operators have many of the properties of conformal primaries in a conformal field theory, and compute their conformal dimension. The dimensions are real and positive, but have the novel feature that they vary continuously as a periodic function of a real parameter. We comment on the relation of the Brownian loop soup to the free field, and use this relation to establish that the central charge of the loop soup is twice its intensity.

  4. An explicit local uniform large deviation bound for Brownian bridges

    NARCIS (Netherlands)

    Wittich, O.

    2005-01-01

    By comparing curve length in a manifold and a standard sphere, we prove a local uniform bound for the exponent in the Large Deviation formula that describes the concentration of Brownian bridges to geodesics.

  5. Near-Field, On-Chip Optical Brownian Ratchets.

    Science.gov (United States)

    Wu, Shao-Hua; Huang, Ningfeng; Jaquay, Eric; Povinelli, Michelle L

    2016-08-10

    Nanoparticles in aqueous solution are subject to collisions with solvent molecules, resulting in random, Brownian motion. By breaking the spatiotemporal symmetry of the system, the motion can be rectified. In nature, Brownian ratchets leverage thermal fluctuations to provide directional motion of proteins and enzymes. In man-made systems, Brownian ratchets have been used for nanoparticle sorting and manipulation. Implementations based on optical traps provide a high degree of tunability along with precise spatiotemporal control. Here, we demonstrate an optical Brownian ratchet based on the near-field traps of an asymmetrically patterned photonic crystal. The system yields over 25 times greater trap stiffness than conventional optical tweezers. Our technique opens up new possibilities for particle manipulation in a microfluidic, lab-on-chip environment.

  6. Manipulation and controlled amplification of Brownian motion of microcantilever sensors

    International Nuclear Information System (INIS)

    Mehta, Adosh; Cherian, Suman; Hedden, David; Thundat, Thomas

    2001-01-01

    Microcantilevers, such as those used in atomic force microscopy, undergo Brownian motion due to mechanical thermal noise. The root mean square amplitude of the Brownian motion of a cantilever typically ranges from 0.01--0.1 nm, which limits its use in practical applications. Here we describe a technique by which the Brownian amplitude and the Q factor in air and water can be amplified by three and two orders of magnitude, respectively. This technique is similar to a positive feedback oscillator, wherein the Brownian motion of the vibrating cantilever controls the frequency output of the oscillator. This technique can be exploited to improve sensitivity of microcantilever-based chemical and biological sensors, especially for sensors in liquid environments

  7. From a stochastic to a macroscopic approach to brownian motion

    International Nuclear Information System (INIS)

    Bocquet, L.

    1998-01-01

    In this lecture, we examine the dynamics of suspensions of mesoscopic (Brownian) particles in a molecular fluid, starting from first principles. We introduce the technique of multiple time-scales to derive the Fokker-Planck equation for a single, or for a set of interacting Brownian particles, starting from the Liouville equation for the full system (Brownian particles and discrete bath). The limitations of the Fokker-Planck equation will then be emphasized. In particular, we shall point out that under ''standard'' experimental conditions, the Fokker-Planck description cannot be correct and that non-Markovian effects are expected. A microscopic description in the true experimental limit confirms this breakdown and leads to a ''generalized'' (non-Markovian and non-local in velocity space) Fokker-Planck equation, which describes the thermalization of the Brownian particle. (author)

  8. Directed Transport of Brownian Particles in a Periodic Channel

    International Nuclear Information System (INIS)

    Jiang Jie; Ai Bao-Quan; Wu Jian-Chun

    2015-01-01

    The transport of Brownian particles in the infinite channel within an external force along the axis of the channel has been studied. In this paper, we study the transport of Brownian particle in the infinite channel within an external force along the axis of the channel and an external force in the transversal direction. In this more sophisticated situation, some property is similar to the simple situation, but some interesting property also appears. (paper)

  9. Volume of the domain visited by N spherical Brownian particles

    International Nuclear Information System (INIS)

    Berezhkovskii, A.M.

    1994-01-01

    The average value and variance of the volume of the domain visited in time t by N spherical Brownian particles starting initially at the same point are presented as quadratures of the solutions of simple diffusion problems of the survival of a point Brownian particle in the presence of one and two spherical traps. As an illustration, explicit time dependences are obtained for the average volume in one and three dimensions

  10. Fast orthogonal transforms and generation of Brownian paths.

    Science.gov (United States)

    Leobacher, Gunther

    2012-04-01

    We present a number of fast constructions of discrete Brownian paths that can be used as alternatives to principal component analysis and Brownian bridge for stratified Monte Carlo and quasi-Monte Carlo. By fast we mean that a path of length [Formula: see text] can be generated in [Formula: see text] floating point operations. We highlight some of the connections between the different constructions and we provide some numerical examples.

  11. Estimation of the global regularity of a multifractional Brownian motion

    DEFF Research Database (Denmark)

    Lebovits, Joachim; Podolskij, Mark

    This paper presents a new estimator of the global regularity index of a multifractional Brownian motion. Our estimation method is based upon a ratio statistic, which compares the realized global quadratic variation of a multifractional Brownian motion at two different frequencies. We show that a ...... that a logarithmic transformation of this statistic converges in probability to the minimum of the Hurst functional parameter, which is, under weak assumptions, identical to the global regularity index of the path....

  12. QUANTUM STOCHASTIC PROCESSES: BOSON AND FERMION BROWNIAN MOTION

    Directory of Open Access Journals (Sweden)

    A.E.Kobryn

    2003-01-01

    Full Text Available Dynamics of quantum systems which are stochastically perturbed by linear coupling to the reservoir can be studied in terms of quantum stochastic differential equations (for example, quantum stochastic Liouville equation and quantum Langevin equation. In order to work it out one needs to define the quantum Brownian motion. As far as only its boson version has been known until recently, in the present paper we present the definition which makes it possible to consider the fermion Brownian motion as well.

  13. Partitioning a call graph

    NARCIS (Netherlands)

    Bisseling, R.H.; Byrka, J.; Cerav-Erbas, S.; Gvozdenovic, N.; Lorenz, M.; Pendavingh, R.A.; Reeves, C.; Röger, M.; Verhoeven, A.; Berg, van den J.B.; Bhulai, S.; Hulshof, J.; Koole, G.; Quant, C.; Williams, J.F.

    2006-01-01

    Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph with vertices representing the programs of the system and arcs representing calls from one program to

  14. Coloring geographical threshold graphs

    Energy Technology Data Exchange (ETDEWEB)

    Bradonjic, Milan [Los Alamos National Laboratory; Percus, Allon [Los Alamos National Laboratory; Muller, Tobias [EINDHOVEN UNIV. OF TECH

    2008-01-01

    We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyze the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.

  15. Supermarket model on graphs

    NARCIS (Netherlands)

    Budhiraja, A.S.; Mukherjee, D.; Wu, R.

    2017-01-01

    We consider a variation of the supermarket model in which the servers can communicate with their neighbors and where the neighborhood relationships are described in terms of a suitable graph. Tasks with unit-exponential service time distributions arrive at each vertex as independent Poisson

  16. Basin Hopping Graph

    DEFF Research Database (Denmark)

    Kucharik, Marcel; Hofacker, Ivo; Stadler, Peter

    2014-01-01

    of the folding free energy landscape, however, can provide the relevant information. Results We introduce the basin hopping graph (BHG) as a novel coarse-grained model of folding landscapes. Each vertex of the BHG is a local minimum, which represents the corresponding basin in the landscape. Its edges connect...

  17. The STAPL Parallel Graph Library

    KAUST Repository

    Harshvardhan,; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence

    2013-01-01

    This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable

  18. A Clustering Graph Generator

    Energy Technology Data Exchange (ETDEWEB)

    Winlaw, Manda [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); De Sterck, Hans [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Sanders, Geoffrey [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2015-10-26

    In very simple terms a network can be de ned as a collection of points joined together by lines. Thus, networks can be used to represent connections between entities in a wide variety of elds including engi- neering, science, medicine, and sociology. Many large real-world networks share a surprising number of properties, leading to a strong interest in model development research and techniques for building synthetic networks have been developed, that capture these similarities and replicate real-world graphs. Modeling these real-world networks serves two purposes. First, building models that mimic the patterns and prop- erties of real networks helps to understand the implications of these patterns and helps determine which patterns are important. If we develop a generative process to synthesize real networks we can also examine which growth processes are plausible and which are not. Secondly, high-quality, large-scale network data is often not available, because of economic, legal, technological, or other obstacles [7]. Thus, there are many instances where the systems of interest cannot be represented by a single exemplar network. As one example, consider the eld of cybersecurity, where systems require testing across diverse threat scenarios and validation across diverse network structures. In these cases, where there is no single exemplar network, the systems must instead be modeled as a collection of networks in which the variation among them may be just as important as their common features. By developing processes to build synthetic models, so-called graph generators, we can build synthetic networks that capture both the essential features of a system and realistic variability. Then we can use such synthetic graphs to perform tasks such as simulations, analysis, and decision making. We can also use synthetic graphs to performance test graph analysis algorithms, including clustering algorithms and anomaly detection algorithms.

  19. Groupies in multitype random graphs

    OpenAIRE

    Shang, Yilun

    2016-01-01

    A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erd?s-R?nyi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.

  20. Groupies in multitype random graphs.

    Science.gov (United States)

    Shang, Yilun

    2016-01-01

    A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.

  1. Temporal Representation in Semantic Graphs

    Energy Technology Data Exchange (ETDEWEB)

    Levandoski, J J; Abdulla, G M

    2007-08-07

    A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.

  2. Quantum walks on quotient graphs

    International Nuclear Information System (INIS)

    Krovi, Hari; Brun, Todd A.

    2007-01-01

    A discrete-time quantum walk on a graph Γ is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states the walk will be confined to a subspace of the original Hilbert space. Symmetries of the original graph, given by its automorphism group, can be inherited by the evolution operator. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup H of the automorphism group and illustrate it with examples. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup H used to construct it. The quotient graph is constructed by removing the symmetries of the subgroup H from the original graph. We then analyze the behavior of hitting times on quotient graphs. Hitting time is the average time it takes a walk to reach a given final vertex from a given initial vertex. It has been shown in earlier work [Phys. Rev. A 74, 042334 (2006)] that the hitting time for certain initial states of a quantum walks can be infinite, in contrast to classical random walks. We give a condition which determines whether the quotient graph has infinite hitting times given that they exist in the original graph. We apply this condition for the examples discussed and determine which quotient graphs have infinite hitting times. All known examples of quantum walks with hitting times which are short compared to classical random walks correspond to systems with quotient graphs much smaller than the original graph; we conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speedup

  3. A generalization of total graphs

    Indian Academy of Sciences (India)

    M Afkhami

    2018-04-12

    Apr 12, 2018 ... product of any lower triangular matrix with the transpose of any element of U belongs to U. The ... total graph of R, which is denoted by T( (R)), is a simple graph with all elements of R as vertices, and ...... [9] Badawi A, On dot-product graph of a commutative ring, Communications in Algebra 43 (2015). 43–50.

  4. Graph transformation tool contest 2008

    NARCIS (Netherlands)

    Rensink, Arend; van Gorp, Pieter

    This special section is the outcome of the graph transformation tool contest organised during the Graph-Based Tools (GraBaTs) 2008 workshop, which took place as a satellite event of the International Conference on Graph Transformation (ICGT) 2008. The contest involved two parts: three “off-line case

  5. On dominator colorings in graphs

    Indian Academy of Sciences (India)

    colors required for a dominator coloring of G is called the dominator .... Theorem 1.3 shows that the complete graph Kn is the only connected graph of order n ... Conversely, if a graph G satisfies condition (i) or (ii), it is easy to see that χd(G) =.

  6. Topic Model for Graph Mining.

    Science.gov (United States)

    Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng

    2015-12-01

    Graph mining has been a popular research area because of its numerous application scenarios. Many unstructured and structured data can be represented as graphs, such as, documents, chemical molecular structures, and images. However, an issue in relation to current research on graphs is that they cannot adequately discover the topics hidden in graph-structured data which can be beneficial for both the unsupervised learning and supervised learning of the graphs. Although topic models have proved to be very successful in discovering latent topics, the standard topic models cannot be directly applied to graph-structured data due to the "bag-of-word" assumption. In this paper, an innovative graph topic model (GTM) is proposed to address this issue, which uses Bernoulli distributions to model the edges between nodes in a graph. It can, therefore, make the edges in a graph contribute to latent topic discovery and further improve the accuracy of the supervised and unsupervised learning of graphs. The experimental results on two different types of graph datasets show that the proposed GTM outperforms the latent Dirichlet allocation on classification by using the unveiled topics of these two models to represent graphs.

  7. Algorithms for Planar Graphs and Graphs in Metric Spaces

    DEFF Research Database (Denmark)

    Wulff-Nilsen, Christian

    structural properties that can be exploited. For instance, a road network or a wire layout on a microchip is typically (near-)planar and distances in the network are often defined w.r.t. the Euclidean or the rectilinear metric. Specialized algorithms that take advantage of such properties are often orders...... of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... for geometric graphs and graphs embedded in metric spaces. Roughly speaking, the stretch factor is a real value expressing how well a (geo-)metric graph approximates the underlying complete graph w.r.t. distances. We give improved algorithms for computing the stretch factor of a given graph and for augmenting...

  8. A seminar on graph theory

    CERN Document Server

    Harary, Frank

    2015-01-01

    Presented in 1962-63 by experts at University College, London, these lectures offer a variety of perspectives on graph theory. Although the opening chapters form a coherent body of graph theoretic concepts, this volume is not a text on the subject but rather an introduction to the extensive literature of graph theory. The seminar's topics are geared toward advanced undergraduate students of mathematics.Lectures by this volume's editor, Frank Harary, include ""Some Theorems and Concepts of Graph Theory,"" ""Topological Concepts in Graph Theory,"" ""Graphical Reconstruction,"" and other introduc

  9. Spectral fluctuations of quantum graphs

    International Nuclear Information System (INIS)

    Pluhař, Z.; Weidenmüller, H. A.

    2014-01-01

    We prove the Bohigas-Giannoni-Schmit conjecture in its most general form for completely connected simple graphs with incommensurate bond lengths. We show that for graphs that are classically mixing (i.e., graphs for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap), the generating functions for all (P,Q) correlation functions for both closed and open graphs coincide (in the limit of infinite graph size) with the corresponding expressions of random-matrix theory, both for orthogonal and for unitary symmetry

  10. Dynamic Representations of Sparse Graphs

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Fagerberg, Rolf

    1999-01-01

    We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....

  11. Domination criticality in product graphs

    Directory of Open Access Journals (Sweden)

    M.R. Chithra

    2015-07-01

    Full Text Available A connected dominating set is an important notion and has many applications in routing and management of networks. Graph products have turned out to be a good model of interconnection networks. This motivated us to study the Cartesian product of graphs G with connected domination number, γc(G=2,3 and characterize such graphs. Also, we characterize the k−γ-vertex (edge critical graphs and k−γc-vertex (edge critical graphs for k=2,3 where γ denotes the domination number of G. We also discuss the vertex criticality in grids.

  12. Graph Creation, Visualisation and Transformation

    Directory of Open Access Journals (Sweden)

    Maribel Fernández

    2010-03-01

    Full Text Available We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph rewriting systems. The editor, called GraphPaper, allows users to create and edit graphs and their transformation rules using an intuitive user interface. The editor uses the functionalities of the TULIP system, which gives us access to a wealth of visualisation algorithms. Interaction nets are not only a formalism for the specification of graphs, but also a rewrite-based computation model. We discuss graph rewriting strategies and a language to express them in order to perform strategic interaction net rewriting.

  13. Brownian dynamics simulations of insulin microspheres formation

    Science.gov (United States)

    Li, Wei; Chakrabarti, Amit; Gunton, James

    2010-03-01

    Recent experiments have indicated a novel, aqueous process of microsphere insulin fabrication based on controlled phase separation of protein from water-soluble polymers. We investigate the insulin microsphere crystal formation from insulin-PEG-water systems via 3D Brownian Dynamics simulations. We use the two component Asakura-Oosawa model to simulate the kinetics of this colloid polymer mixture. We first perform a deep quench below the liquid-crystal boundary that leads to fractal formation. We next heat the system to obtain a break-up of the fractal clusters and subsequently cool the system to obtain a spherical aggregation of droplets with a relatively narrow size distribution. We analyze the structure factor S(q) to identify the cluster dimension. S(q) crosses over from a power law q dependence of 1.8 (in agreement with DLCA) to 4 as q increases, which shows the evolution from fractal to spherical clusters. By studying the bond-order parameters, we find the phase transition from liquid-like droplets to crystals which exhibit local HCP and FCC order. This work is supported by grants from the NSF and Mathers Foundation.

  14. From Brownian motion to power of fluctuations

    Directory of Open Access Journals (Sweden)

    B. Berche

    2012-12-01

    Full Text Available The year 2012 marks the 140th birth anniversary of Marian Smoluchowski (28.05.1872-5.09.1917, a man who "made ground-breaking contribution to the theory of Brownian motion, the theory of sedimentation, the statistical nature of the Second Law, the theory and practice of density fluctuations (critical opalescence. During his final years of scientific creativity his pioneering theory of coagulation and diffusion-limited reaction rate appeared. These outstanding achievements present true gems which dominate the description of soft matter physics and chemical physics as well as the related areas up till now!" This quotation was taken from the lecture by Peter Hanggi given at international conference Statistical Physics: Modern Trends and Applications that took place in Lviv, Ukraine on July 3-6, 2012 (see conference web-page for more details and was dedicated to the commemoration of Smoluchowski's work. This and forthcoming issues of the Condensed Matter Physics contain papers presented at this conference.

  15. Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph

    Science.gov (United States)

    Nagarathinam, R.; Parvathi, N.

    2018-04-01

    Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat

  16. Spherical particle Brownian motion in viscous medium as non-Markovian random process

    International Nuclear Information System (INIS)

    Morozov, Andrey N.; Skripkin, Alexey V.

    2011-01-01

    The Brownian motion of a spherical particle in an infinite medium is described by the conventional methods and integral transforms considering the entrainment of surrounding particles of the medium by the Brownian particle. It is demonstrated that fluctuations of the Brownian particle velocity represent a non-Markovian random process. The features of Brownian motion in short time intervals and in small displacements are considered. -- Highlights: → Description of Brownian motion considering the entrainment of medium is developed. → We find the equations for statistical characteristics of impulse fluctuations. → Brownian motion at small time intervals is considered. → Theoretical results and experimental data are compared.

  17. Graph Sampling for Covariance Estimation

    KAUST Repository

    Chepuri, Sundeep Prabhakar

    2017-04-25

    In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs. Second-order stationary graph signals may be obtained by graph filtering zero-mean white noise and they admit a well-defined power spectrum whose shape is determined by the frequency response of the graph filter. Estimating the graph power spectrum forms an important component of stationary graph signal processing and related inference tasks such as Wiener prediction or inpainting on graphs. The central result of this paper is that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the second-order statistics of the graph signal from the subsampled observations, and more importantly, without any spectral priors. To this end, both a nonparametric approach as well as parametric approaches including moving average and autoregressive models for the graph power spectrum are considered. The results specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non-parametric and the moving average models, whereas a particular subsampling scheme that allows linear estimation for the autoregressive model is proposed. Numerical experiments on synthetic as well as real datasets related to climatology and processing handwritten digits are provided to demonstrate the developed theory.

  18. Practical graph mining with R

    CERN Document Server

    Hendrix, William; Jenkins, John; Padmanabhan, Kanchana; Chakraborty, Arpan

    2014-01-01

    Practical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting patterns from graph data. It covers many basic and advanced techniques for the identification of anomalous or frequently recurring patterns in a graph, the discovery of groups or clusters of nodes that share common patterns of attributes and relationships, the extraction of patterns that distinguish one category of graphs from another, and the use of those patterns to predict the category of new graphs. Hands-On Application of Graph Data Mining Each chapter in the book focuses on a graph mining task, such as link analysis, cluster analysis, and classification. Through applications using real data sets, the book demonstrates how computational techniques can help solve real-world problems. The applications covered include network intrusion detection, tumor cell diagnostics, face recognition, predictive toxicology, mining metabolic and protein-protein interaction networks, and community detection in social networks. De...

  19. Canonical Labelling of Site Graphs

    Directory of Open Access Journals (Sweden)

    Nicolas Oury

    2013-06-01

    Full Text Available We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft's partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with "many" automorphisms, and the partition refinement algorithm runs in sub-quadratic time for graphs with "few" bisimulation equivalences. This suite of algorithms was chosen based on the expectation that graphs fall in one of those two categories. If that is the case, a combined algorithm runs in sub-quadratic worst case time. Whether this expectation is reasonable remains an interesting open problem.

  20. Learning heat diffusion graphs

    OpenAIRE

    Thanou, Dorina; Dong, Xiaowen; Kressner, Daniel; Frossard, Pascal

    2016-01-01

    Effective information analysis generally boils down to properly identifying the structure or geometry of the data, which is often represented by a graph. In some applications, this structure may be partly determined by design constraints or pre-determined sensing arrangements, like in road transportation networks for example. In general though, the data structure is not readily available and becomes pretty difficult to define. In particular, the global smoothness assumptions, that most of the...

  1. An Unusual Exponential Graph

    Science.gov (United States)

    Syed, M. Qasim; Lovatt, Ian

    2014-01-01

    This paper is an addition to the series of papers on the exponential function begun by Albert Bartlett. In particular, we ask how the graph of the exponential function y = e[superscript -t/t] would appear if y were plotted versus ln t rather than the normal practice of plotting ln y versus t. In answering this question, we find a new way to…

  2. Understanding Charts and Graphs.

    Science.gov (United States)

    1987-07-28

    Farenheit degrees, which have no Onaturalo zero ); finally, ratio scales have numbers that are ordered so that the magnitudes of differences are important and...system. They have to do with the very nature of how marks serve as meaningful symbols. In the ideal case, a chart or graph will be absolutely unambiguous...and these laws comprise this principle (see Stevens, 1974). Absolute discriminability: A minimal magnitude of a mark is necessary for it to be detected

  3. Graphs cospectral with a friendship graph or its complement

    Directory of Open Access Journals (Sweden)

    Alireza Abdollahi

    2013-12-01

    Full Text Available Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length $4$ or $5$, then $Gcong F_n$. Moreover if $G$ is connected and planar then $Gcong F_n$.All but one of connected components of $G$ are isomorphic to $K_2$.The complement $overline{F_n}$ of the friendship graph is determined by its adjacency eigenvalues, that is, if $overline{F_n}$ is cospectral with a graph $H$, then $Hcong overline{F_n}$.

  4. Browndye: A software package for Brownian dynamics

    Science.gov (United States)

    Huber, Gary A.; McCammon, J. Andrew

    2010-11-01

    A new software package, Browndye, is presented for simulating the diffusional encounter of two large biological molecules. It can be used to estimate second-order rate constants and encounter probabilities, and to explore reaction trajectories. Browndye builds upon previous knowledge and algorithms from software packages such as UHBD, SDA, and Macrodox, while implementing algorithms that scale to larger systems. Program summaryProgram title: Browndye Catalogue identifier: AEGT_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEGT_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: MIT license, included in distribution No. of lines in distributed program, including test data, etc.: 143 618 No. of bytes in distributed program, including test data, etc.: 1 067 861 Distribution format: tar.gz Programming language: C++, OCaml ( http://caml.inria.fr/) Computer: PC, Workstation, Cluster Operating system: Linux Has the code been vectorised or parallelized?: Yes. Runs on multiple processors with shared memory using pthreads RAM: Depends linearly on size of physical system Classification: 3 External routines: uses the output of APBS [1] ( http://www.poissonboltzmann.org/apbs/) as input. APBS must be obtained and installed separately. Expat 2.0.1, CLAPACK, ocaml-expat, Mersenne Twister. These are included in the Browndye distribution. Nature of problem: Exploration and determination of rate constants of bimolecular interactions involving large biological molecules. Solution method: Brownian dynamics with electrostatic, excluded volume, van der Waals, and desolvation forces. Running time: Depends linearly on size of physical system and quadratically on precision of results. The included example executes in a few minutes.

  5. Engineering Autonomous Chemomechanical Nanomachines Using Brownian Ratchets

    Science.gov (United States)

    Lavella, Gabriel

    Nanoscale machines which directly convert chemical energy into mechanical work are ubiquitous in nature and are employed to perform a diverse set of tasks such as transporting molecules, maintaining molecular gradients, and providing motion to organisms. Their widespread use in nature suggests that large technological rewards can be obtained by designing synthetic machines that use similar mechanisms. This thesis addresses the technological adaptation of a specific mechanism known as the Brownian ratchet for the design of synthetic autonomous nanomachines. My efforts were focused more specifically on synthetic chemomechanical ratchets which I deem will be broadly applicable in the life sciences. In my work I have theoretically explored the biophysical mechanisms and energy landscapes that give rise to the ratcheting phenomena and devised devices that operate off these principles. I demonstrate two generations of devices that produce mechanical force/deformation in response to a user specified ligand. The first generation devices, fabricatied using a combination nanoscale lithographic processes and bioconjugation techniques, were used to provide evidence that the proposed ratcheting phenomena can be exploited in synthetic architectures. Second generation devices fabricated using self-assembled DNA/hapten motifs were constructed to gain a precise understanding of ratcheting dynamics and design constraints. In addition, the self-assembled devices enabled fabrication en masse, which I feel will alleviate future experimental hurdles in analysis and facilitate its adaptation to technologies. The product of these efforts is an architecture that has the potential to enable numerous technologies in biosensing and drug delivery. For example, the coupling of molecule-specific actuation to the release of drugs or signaling molecules from nanocapsules or porous materials could be transformative. Such architectures could provide possible avenues to pressing issues in biology and

  6. Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs

    DEFF Research Database (Denmark)

    Bensmail, Julien; Renault, Gabriel

    2016-01-01

    An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪⋯∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently co...

  7. X-Graphs: Language and Algorithms for Heterogeneous Graph Streams

    Science.gov (United States)

    2017-09-01

    are widely used by academia and industry. 15. SUBJECT TERMS Data Analytics, Graph Analytics, High-Performance Computing 16. SECURITY CLASSIFICATION...form the core of the DeepDive Knowledge Construction System. 2 INTRODUCTION The goal of the X-Graphs project was to develop computational techniques...memory multicore machine. Ringo is based on Snap.py and SNAP, and uses Python . Ringo now allows the integration of Delite DSL Framework Graph

  8. How superdiffusion gets arrested: Ecological encounters explain shift from Lévy to Brownian movement

    NARCIS (Netherlands)

    De Jager, M.; Bartumeus, F.; Kölzsch, A.; Weissing, F.J.; Hengeveld, G.M.; Nolet, B.A.; Herman, P.M.J.; Van de Koppel, J.

    2014-01-01

    Ecological theory uses Brownian motion as a default template for describing ecological movement, despite limited mechanistic underpinning. The generality of Brownian motion has recently been challenged by empirical studies that highlight alternative movement patterns of animals, especially when

  9. How superdiffusion gets arrested: ecological encounters explain shift from Levy to Brownian movement

    NARCIS (Netherlands)

    de Jager, M.; Bartumeus, F.; Kölzsch, A.; Weissing, F.J.; Hengeveld, G.M.; Nolet, B.A.; Herman, P.M.J.; de Koppel, J.

    2014-01-01

    Ecological theory uses Brownian motion as a default template for describing ecological movement, despite limited mechanistic underpinning. The generality of Brownian motion has recently been challenged by empirical studies that highlight alternative movement patterns of animals, especially when

  10. How superdiffusion gets arrested: ecological encounters explain shift from Lévy to Brownian movement

    NARCIS (Netherlands)

    Jager, de M.; Bartumeus, F.; Kölzsch, A.; Weissing, F.J.; Hengeveld, G.M.; Nolet, B.A.; Herman, P.M.J.; Koppel, van de J.

    2014-01-01

    Ecological theory uses Brownian motion as a default template for describing ecological movement, despite limited mechanistic underpinning. The generality of Brownian motion has recently been challenged by empirical studies that highlight alternative movement patterns of animals, especially when

  11. Exponential functionals of Brownian motion, I: Probability laws at fixed time

    OpenAIRE

    Matsumoto, Hiroyuki; Yor, Marc

    2005-01-01

    This paper is the first part of our survey on various results about the distribution of exponential type Brownian functionals defined as an integral over time of geometric Brownian motion. Several related topics are also mentioned.

  12. How superdiffusion gets arrested : ecological encounters explain shift from Levy to Brownian movement

    NARCIS (Netherlands)

    de Jager, Monique; Bartumeus, Frederic; Kolzsch, Andrea; Weissing, Franz J.; Hengeveld, Geerten M.; Nolet, Bart A.; Herman, Peter M. J.; de Koppel, Johan van

    2014-01-01

    Ecological theory uses Brownian motion as a default template for describing ecological movement, despite limited mechanistic underpinning. The generality of Brownian motion has recently been challenged by empirical studies that highlight alternative movement patterns of animals, especially when

  13. How superdiffusion gets arrested : Ecological encounters explain shift from Levy to Brownian movement

    NARCIS (Netherlands)

    de Jager, Monique; Bartumeus, Frederic; Kölzsch, Andrea; Weissing, Franz J.; Hengeveld, Geerten M.; Nolet, Bart A.; Herman, Peter M.J.; van de Koppel, Johan

    2014-01-01

    Ecological theory uses Brownian motion as a default template for describing ecological movement, despite limited mechanistic underpinning. The generality of Brownian motion has recently been challenged by empirical studies that highlight alternative movement patterns of animals, especially when

  14. On modeling animal movements using Brownian motion with measurement error.

    Science.gov (United States)

    Pozdnyakov, Vladimir; Meyer, Thomas; Wang, Yu-Bo; Yan, Jun

    2014-02-01

    Modeling animal movements with Brownian motion (or more generally by a Gaussian process) has a long tradition in ecological studies. The recent Brownian bridge movement model (BBMM), which incorporates measurement errors, has been quickly adopted by ecologists because of its simplicity and tractability. We discuss some nontrivial properties of the discrete-time stochastic process that results from observing a Brownian motion with added normal noise at discrete times. In particular, we demonstrate that the observed sequence of random variables is not Markov. Consequently the expected occupation time between two successively observed locations does not depend on just those two observations; the whole path must be taken into account. Nonetheless, the exact likelihood function of the observed time series remains tractable; it requires only sparse matrix computations. The likelihood-based estimation procedure is described in detail and compared to the BBMM estimation.

  15. Brownian dynamic simulations and experiments of MR fluids

    International Nuclear Information System (INIS)

    Segovia-Gutiérrez, J P; Vicente, J de; Hidalgo, R; Puertas, A M

    2013-01-01

    The use of computational techniques in magnetorheology is not new. I general, these approaches assume dipolar magnetic interactions, hard sphere repulsions, and no-slip conditions. In this contribution we focus on the dynamics of the equilibrium state in the presence of uniaxial DC fields. To achieve this goal we make use of Brownian Dynamic Simulations. We highlight the importance of the Brownian forces versus magnetic dipolar interaction in the range of low magnetic field strengths. We monitor the formation of columnar structures and their dynamics, in competition with the Brownian motion, until a hexatic crystal phase appears at high field strengths for monodisperse systems. The shear viscosity is computed from the Einstein relation and eventually compared with experimental data at very low-shear rates. A reasonably good agreement between both data sets is observed.

  16. Nonparametric Regression with Subfractional Brownian Motion via Malliavin Calculus

    Directory of Open Access Journals (Sweden)

    Yuquan Cang

    2014-01-01

    Full Text Available We study the asymptotic behavior of the sequence Sn=∑i=0n-1K(nαSiH1(Si+1H2-SiH2, as n tends to infinity, where SH1 and SH2 are two independent subfractional Brownian motions with indices H1 and H2, respectively. K is a kernel function and the bandwidth parameter α satisfies some hypotheses in terms of H1 and H2. Its limiting distribution is a mixed normal law involving the local time of the sub-fractional Brownian motion SH1. We mainly use the techniques of Malliavin calculus with respect to sub-fractional Brownian motion.

  17. Cosmophysical Factors in the Fluctuation Amplitude Spectrum of Brownian Motion

    Directory of Open Access Journals (Sweden)

    Kaminsky A. V.

    2010-04-01

    Full Text Available Phenomenon of the regular variability of the fine structure of the fluctuation in the amplitude distributions (shapes of related histograms for the case of Brownian motion was investigated. We took an advantage of the dynamic light scattering method (DLS to get a stochastically fluctuated signal determined by Brownian motion. Shape of the histograms is most likely to vary, synchronous, in two proximally located independent cells containing Brownian particles. The synchronism persists in the cells distant at 2m from each other, and positioned meridionally. With a parallel-wise positioning of the cells, high probability of the synchronous variation in the shape of the histograms by local time has been observed. This result meets the previous conclusion about the dependency of histogram shapes ("fluctuation amplitudes" of the spectra of stochastic processes upon rotation of the Earth.

  18. Cosmophysical Factors in the Fluctuation Amplitude Spectrum of Brownian Motion

    Directory of Open Access Journals (Sweden)

    Kaminsky A. V.

    2010-07-01

    Full Text Available Phenomenon of the regular variability of the fine structure of the fluctuation in the am- plitude distributions (shapes of related histograms for the case of Brownian motion was investigated. We took an advantage of the dynamic light scattering method (DLS to get a stochastically fluctuated signal determined by Brownian motion. Shape of the histograms is most likely to vary, synchronous, in two proximally located independent cells containing Brownian particles. The synchronism persists in the cells distant at 2 m from each other, and positioned meridionally. With a parallel-wise positioning of the cells, high probability of the synchronous variation in the shape of the histograms by local time has been observed. This result meets the previous conclusion about the dependency of histogram shapes (“fluctuation amplitudes” of the spectra of stochastic processes upon rotation of the Earth.

  19. Non-colliding Brownian Motions and the Extended Tacnode Process

    Science.gov (United States)

    Johansson, Kurt

    2013-04-01

    We consider non-colliding Brownian motions with two starting points and two endpoints. The points are chosen so that the two groups of Brownian motions just touch each other, a situation that is referred to as a tacnode. The extended kernel for the determinantal point process at the tacnode point is computed using new methods and given in a different form from that obtained for a single time in previous work by Delvaux, Kuijlaars and Zhang. The form of the extended kernel is also different from that obtained for the extended tacnode kernel in another model by Adler, Ferrari and van Moerbeke. We also obtain the correlation kernel for a finite number of non-colliding Brownian motions starting at two points and ending at arbitrary points.

  20. Stochastic calculus for fractional Brownian motion and related processes

    CERN Document Server

    Mishura, Yuliya S

    2008-01-01

    The theory of fractional Brownian motion and other long-memory processes are addressed in this volume. Interesting topics for PhD students and specialists in probability theory, stochastic analysis and financial mathematics demonstrate the modern level of this field. Among these are results about Levy characterization of fractional Brownian motion, maximal moment inequalities for Wiener integrals including the values 0Brownian SDE. The author develops optimal filtering of mixed models including linear case, and studies financial applications and statistical inference with hypotheses testing and parameter estimation. She proves that the market with stock guided by the mixed model is arbitrage-free without any restriction on the dependence of the components and deduces different forms of the Black-Scholes equation for fractional mark...

  1. Brownian gas models for extreme-value laws

    International Nuclear Information System (INIS)

    Eliazar, Iddo

    2013-01-01

    In this paper we establish one-dimensional Brownian gas models for the extreme-value laws of Gumbel, Weibull, and Fréchet. A gas model is a countable collection of independent particles governed by common diffusion dynamics. The extreme-value laws are the universal probability distributions governing the affine scaling limits of the maxima and minima of ensembles of independent and identically distributed one-dimensional random variables. Using the recently introduced concept of stationary Poissonian intensities, we construct two gas models whose global statistical structures are stationary, and yield the extreme-value laws: a linear Brownian motion gas model for the Gumbel law, and a geometric Brownian motion gas model for the Weibull and Fréchet laws. The stochastic dynamics of these gas models are studied in detail, and closed-form analytical descriptions of their temporal correlation structures, their topological phase transitions, and their intrinsic first-passage-time fluxes are presented. (paper)

  2. Quantum Brownian motion model for the stock market

    Science.gov (United States)

    Meng, Xiangyi; Zhang, Jian-Wei; Guo, Hong

    2016-06-01

    It is believed by the majority today that the efficient market hypothesis is imperfect because of market irrationality. Using the physical concepts and mathematical structures of quantum mechanics, we construct an econophysical framework for the stock market, based on which we analogously map massive numbers of single stocks into a reservoir consisting of many quantum harmonic oscillators and their stock index into a typical quantum open system-a quantum Brownian particle. In particular, the irrationality of stock transactions is quantitatively considered as the Planck constant within Heisenberg's uncertainty relationship of quantum mechanics in an analogous manner. We analyze real stock data of Shanghai Stock Exchange of China and investigate fat-tail phenomena and non-Markovian behaviors of the stock index with the assistance of the quantum Brownian motion model, thereby interpreting and studying the limitations of the classical Brownian motion model for the efficient market hypothesis from a new perspective of quantum open system dynamics.

  3. Deterministic Brownian motion generated from differential delay equations.

    Science.gov (United States)

    Lei, Jinzhi; Mackey, Michael C

    2011-10-01

    This paper addresses the question of how Brownian-like motion can arise from the solution of a deterministic differential delay equation. To study this we analytically study the bifurcation properties of an apparently simple differential delay equation and then numerically investigate the probabilistic properties of chaotic solutions of the same equation. Our results show that solutions of the deterministic equation with randomly selected initial conditions display a Gaussian-like density for long time, but the densities are supported on an interval of finite measure. Using these chaotic solutions as velocities, we are able to produce Brownian-like motions, which show statistical properties akin to those of a classical Brownian motion over both short and long time scales. Several conjectures are formulated for the probabilistic properties of the solution of the differential delay equation. Numerical studies suggest that these conjectures could be "universal" for similar types of "chaotic" dynamics, but we have been unable to prove this.

  4. Algorithm for generating a Brownian motion on a sphere

    International Nuclear Information System (INIS)

    Carlsson, Tobias; Elvingson, Christer; Ekholm, Tobias

    2010-01-01

    We present a new algorithm for generation of a random walk on a two-dimensional sphere. The algorithm is obtained by viewing the 2-sphere as the equator in the 3-sphere surrounded by an infinitesimally thin band with boundary which reflects Brownian particles and then applying known effective methods for generating Brownian motion on the 3-sphere. To test the method, the diffusion coefficient was calculated in computer simulations using the new algorithm and, for comparison, also using a commonly used method in which the particle takes a Brownian step in the tangent plane to the 2-sphere and is then projected back to the spherical surface. The two methods are in good agreement for short time steps, while the method presented in this paper continues to give good results also for larger time steps, when the alternative method becomes unstable.

  5. Endomorphisms of graph algebras

    DEFF Research Database (Denmark)

    Conti, Roberto; Hong, Jeong Hee; Szymanski, Wojciech

    2012-01-01

    We initiate a systematic investigation of endomorphisms of graph C*-algebras C*(E), extending several known results on endomorphisms of the Cuntz algebras O_n. Most but not all of this study is focused on endomorphisms which permute the vertex projections and globally preserve the diagonal MASA D...... that the restriction to the diagonal MASA of an automorphism which globally preserves both D_E and the core AF-subalgebra eventually commutes with the corresponding one-sided shift. Secondly, we exhibit several properties of proper endomorphisms, investigate invertibility of localized endomorphisms both on C...

  6. Total colourings of graphs

    CERN Document Server

    Yap, Hian-Poh

    1996-01-01

    This book provides an up-to-date and rapid introduction to an important and currently active topic in graph theory. The author leads the reader to the forefront of research in this area. Complete and easily readable proofs of all the main theorems, together with numerous examples, exercises and open problems are given. The book is suitable for use as a textbook or as seminar material for advanced undergraduate and graduate students. The references are comprehensive and so it will also be useful for researchers as a handbook.

  7. Graph Algorithm Animation with Grrr

    OpenAIRE

    Rodgers, Peter; Vidal, Natalia

    2000-01-01

    We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and profiling of Grrr code, but recently it has been extended for the purpose of teaching algorithms to undergraduate students. The animation is restricted to graph based algorithms such as graph drawing, list manipulation or more traditional gra...

  8. The Intersection Probability of Brownian Motion and SLEκ

    Directory of Open Access Journals (Sweden)

    Shizhong Zhou

    2015-01-01

    Full Text Available By using excursion measure Poisson kernel method, we obtain a second-order differential equation of the intersection probability of Brownian motion and SLEκ. Moreover, we find a transformation such that the second-order differential equation transforms into a hypergeometric differential equation. Then, by solving the hypergeometric differential equation, we obtain the explicit formula of the intersection probability for the trace of the chordal SLEκ and planar Brownian motion started from distinct points in an upper half-plane H-.

  9. On the Generalized Brownian Motion and its Applications in Finance

    DEFF Research Database (Denmark)

    Høg, Esben; Frederiksen, Per; Schiemert, Daniel

    This paper deals with dynamic term structure models (DTSMs) and proposes a new way to handle the limitation of the classical affine models. In particular, the paper expands the exibility of the DTSMs by applying generalized Brownian motions with dependent increments as the governing force...... of the state variables instead of standard Brownian motions. This is a new direction in pricing non defaultable bonds. By extending the theory developed by Dippon & Schiemert (2006a), the paper developes a bond market with memory, and proves the absence of arbitrage. The framework is readily extendable...

  10. Survival probabilities for branching Brownian motion with absorption

    OpenAIRE

    Harris, John; Harris, Simon

    2007-01-01

    We study a branching Brownian motion (BBM) with absorption, in which particles move as Brownian motions with drift $-\\rho$, undergo dyadic branching at rate $\\beta>0$, and are killed on hitting the origin. In the case $\\rho>\\sqrt{2\\beta}$ the extinction time for this process, $\\zeta$, is known to be finite almost surely. The main result of this article is a large-time asymptotic formula for the survival probability $P^x(\\zeta>t)$ in the case $\\rho>\\sqrt{2\\beta}$, where $P^x$ is...

  11. Finding viscosity of liquids from Brownian motion at students' laboratory

    International Nuclear Information System (INIS)

    Greczylo, Tomasz; Debowska, Ewa

    2005-01-01

    Brownian motion appears to be a good subject for investigation at advanced students' laboratory [1]. The paper presents such an investigation carried out in Physics Laboratory II at the Institute of Experimental Physics of Wroclaw University. The experiment has been designed to find viscosity of liquids from Brownian motion phenomenon. Authors use modern technology that helps to proceed with measurements and makes the procedure less time and effort consuming. Discussion of the process of setting up the experiment and the results obtained for three different solutions of glycerin in water are presented. Advantages and disadvantages of the apparatus are pointed out along with descriptions of possible future uses

  12. Brownian motion of solitons in a Bose-Einstein condensate.

    Science.gov (United States)

    Aycock, Lauren M; Hurst, Hilary M; Efimkin, Dmitry K; Genkina, Dina; Lu, Hsin-I; Galitski, Victor M; Spielman, I B

    2017-03-07

    We observed and controlled the Brownian motion of solitons. We launched solitonic excitations in highly elongated [Formula: see text] Bose-Einstein condensates (BECs) and showed that a dilute background of impurity atoms in a different internal state dramatically affects the soliton. With no impurities and in one dimension (1D), these solitons would have an infinite lifetime, a consequence of integrability. In our experiment, the added impurities scatter off the much larger soliton, contributing to its Brownian motion and decreasing its lifetime. We describe the soliton's diffusive behavior using a quasi-1D scattering theory of impurity atoms interacting with a soliton, giving diffusion coefficients consistent with experiment.

  13. Optimization Problems on Threshold Graphs

    Directory of Open Access Journals (Sweden)

    Elena Nechita

    2010-06-01

    Full Text Available During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known, decompositions where the subgraph induced by every subset of the partition must have predeterminate properties, as well as combinations of such decompositions. In this paper we characterize threshold graphs using the weakly decomposition, determine: density and stability number, Wiener index and Wiener polynomial for threshold graphs.

  14. Eulerian Graphs and Related Topics

    CERN Document Server

    Fleischner, Herbert

    1990-01-01

    The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering walks. They should appeal both to researchers and students, as they contain enough material for an undergraduate or graduate graph theory course which emphasizes Eulerian graphs, and thus can be read by any mathematician not yet familiar with graph theory. But they are also of interest to researchers in graph theory because they contain many recent results, some of which are only partial solutions to more general problems. A number of conjectures have been included as well. Various problems (such a

  15. Quantum Graph Analysis

    Energy Technology Data Exchange (ETDEWEB)

    Maunz, Peter Lukas Wilhelm [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sterk, Jonathan David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lobser, Daniel [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Parekh, Ojas D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Ryan-Anderson, Ciaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2016-01-01

    In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.

  16. Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?

    Directory of Open Access Journals (Sweden)

    Mehmet Fatih Öçal

    2017-01-01

    Full Text Available Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students’ learning during graphing functions. However, the display of graphs of functions that students sketched by hand may be relatively different when compared to the correct forms sketched using graphing software. The possible misleading effects of this situation brought a discussion of a misconception (asymptote misconception on graphing functions. The purpose of this study is two- fold. First of all, this study investigated whether using graphing software (GeoGebra in this case helps students to determine and resolve this misconception in calculus classrooms. Second, the reasons for this misconception are sought. The multiple case study was utilized in this study. University students in two calculus classrooms who received instructions with (35 students or without GeoGebra assisted instructions (32 students were compared according to whether they fell into this misconception on graphing basic functions (1/x, lnx, ex. In addition, students were interviewed to reveal the reasons behind this misconception. Data were analyzed by means of descriptive and content analysis methods. The findings indicated that those who received GeoGebra assisted instruction were better in resolving it. In addition, the reasons behind this misconception were found to be teacher-based, exam-based and some other factors.

  17. ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS

    OpenAIRE

    Said Broumi; Mohamed Talea; Assia Bakali; Florentin Smarandache

    2016-01-01

    In this article, we combine the concept of bipolar neutrosophic set and graph theory. We introduce the notions of bipolar single valued neutrosophic graphs, strong bipolar single valued neutrosophic graphs, complete bipolar single valued neutrosophic graphs, regular bipolar single valued neutrosophic graphs and investigate some of their related properties.

  18. Graph Theory. 2. Vertex Descriptors and Graph Coloring

    Directory of Open Access Journals (Sweden)

    Lorentz JÄNTSCHI

    2002-12-01

    Full Text Available This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.

  19. On an edge partition and root graphs of some classes of line graphs

    Directory of Open Access Journals (Sweden)

    K Pravas

    2017-04-01

    Full Text Available The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets of the Gallai and anti-Gallai graphs of $G$. Based on this, an optimal algorithm to find the root graph of a line graph is obtained. Moreover, root graphs of diameter-maximal, distance-hereditary, Ptolemaic and chordal graphs are also discussed.

  20. The planar cubic Cayley graphs

    CERN Document Server

    Georgakopoulos, Agelos

    2018-01-01

    The author obtains a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. He obtains counterexamples to conjectures of Mohar, Bonnington and Watkins. The author's analysis makes the involved graphs accessible to computation, corroborating a conjecture of Droms.

  1. Groupies in random bipartite graphs

    OpenAIRE

    Yilun Shang

    2010-01-01

    A vertex $v$ of a graph $G$ is called a groupie if its degree is notless than the average of the degrees of its neighbors. In thispaper we study the influence of bipartition $(B_1,B_2)$ on groupiesin random bipartite graphs $G(B_1,B_2,p)$ with both fixed $p$ and$p$ tending to zero.

  2. Nested Dynamic Condition Response Graphs

    DEFF Research Database (Denmark)

    Hildebrandt, Thomas; Mukkamala, Raghava Rao; Slaats, Tijs

    2012-01-01

    We present an extension of the recently introduced declarative process model Dynamic Condition Response Graphs ( DCR Graphs) to allow nested subgraphs and a new milestone relation between events. The extension was developed during a case study carried out jointly with our industrial partner...

  3. Bell inequalities for graph states

    International Nuclear Information System (INIS)

    Toth, G.; Hyllus, P.; Briegel, H.J.; Guehne, O.

    2005-01-01

    Full text: In the last years graph states have attracted an increasing interest in the field of quantum information theory. Graph states form a family of multi-qubit states which comprises many popular states such as the GHZ states and the cluster states. They also play an important role in applications. For instance, measurement based quantum computation uses graph states as resources. From a theoretical point of view, it is remarkable that graph states allow for a simple description in terms of stabilizing operators. In this contribution, we investigate the non-local properties of graph states. We derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, any graph state violates at least one of the inequalities. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positively of the partial transpose or the geometric measure of entanglement. (author)

  4. Graph Sampling for Covariance Estimation

    KAUST Repository

    Chepuri, Sundeep Prabhakar; Leus, Geert

    2017-01-01

    specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non

  5. Network reconstruction via graph blending

    Science.gov (United States)

    Estrada, Rolando

    2016-05-01

    Graphs estimated from empirical data are often noisy and incomplete due to the difficulty of faithfully observing all the components (nodes and edges) of the true graph. This problem is particularly acute for large networks where the number of components may far exceed available surveillance capabilities. Errors in the observed graph can render subsequent analyses invalid, so it is vital to develop robust methods that can minimize these observational errors. Errors in the observed graph may include missing and spurious components, as well fused (multiple nodes are merged into one) and split (a single node is misinterpreted as many) nodes. Traditional graph reconstruction methods are only able to identify missing or spurious components (primarily edges, and to a lesser degree nodes), so we developed a novel graph blending framework that allows us to cast the full estimation problem as a simple edge addition/deletion problem. Armed with this framework, we systematically investigate the viability of various topological graph features, such as the degree distribution or the clustering coefficients, and existing graph reconstruction methods for tackling the full estimation problem. Our experimental results suggest that incorporating any topological feature as a source of information actually hinders reconstruction accuracy. We provide a theoretical analysis of this phenomenon and suggest several avenues for improving this estimation problem.

  6. A cluster algorithm for graphs

    NARCIS (Netherlands)

    S. van Dongen

    2000-01-01

    textabstractA cluster algorithm for graphs called the emph{Markov Cluster algorithm (MCL~algorithm) is introduced. The algorithm provides basically an interface to an algebraic process defined on stochastic matrices, called the MCL~process. The graphs may be both weighted (with nonnegative weight)

  7. Statistical properties of laser light scattering in Brownian medium

    International Nuclear Information System (INIS)

    Suwono; Santoso, Budi; Baiquni, A.

    1983-01-01

    Relationship between statistical properties of laser light scattering in Brownian medium and photon-counting distributions are described in detail. A coherence optical detection has been constructed and by using photon-counting technique the ensemble distribution of the scattered field within space and time coherence has been measured. Good agreement between theory and experiment is shown. (author)

  8. Brownian Movement and Avogadro's Number: A Laboratory Experiment.

    Science.gov (United States)

    Kruglak, Haym

    1988-01-01

    Reports an experimental procedure for studying Einstein's theory of Brownian movement using commercially available latex microspheres and a video camera. Describes how students can monitor sphere motions and determine Avogadro's number. Uses a black and white video camera, microscope, and TV. (ML)

  9. Velocity persistence of Brownian particles generated in a glow discharge

    International Nuclear Information System (INIS)

    Hurd, A.J.; Ho, P.

    1989-01-01

    Quasielastic light scattering from Brownian particles in the rarefied environment of a glow discharge exhibits Gaussianlike intensity correlation functions owing to the long mean free paths of the particles. The shape of the correlation function depends on the particles' average thermal velocity and friction coefficient, which can be related to aggregate mass and structure, and indicates a crossover from kinetic to hydrodynamic behavior

  10. Phase transition for absorbed Brownian motion with drift

    International Nuclear Information System (INIS)

    Ferrari, P.A.; Martinez, S.; San Martin, J.

    1997-01-01

    We study one-dimensional Brownian motion with constant drift toward the origin and initial distribution concentrated in the strictly positive real line. We say that at the first time the process hits the origin, it is absorbed. We study the asymptotic behavior, as t → ∞, of m t , the conditional distribution at time zero of the process conditioned on survival up to time t and on the process having a fixed value at time t. We find that there is a phase transition in the decay rate of the initial condition. For fast decay rate (subcritical case) m t is localized, in the critical case m t is located around √t, and for slow rates (supercritical case) m, is located around t. The critical rate is given by the decay of the minimal quasistationary distribution of this process. We also study in each case the asymptotic distribution of the process, scaled by √t, conditioned as before. We prove that in the subcritical case this distribution is a Brownian excursion. In the critical case it is a Brownian bridge attaining 0 for the first time at time 1, with some initial distribution. In the supercritical case, after centering around the expected value-which is of the order of t we show that this process converges to a Brownian bridge arriving at 0 at time 1 and with a Gaussian initial distribution

  11. Brownian motion, Minkowski space and principle of special relativity

    International Nuclear Information System (INIS)

    Caubet, J.-P.

    1977-01-01

    From the assumption that the brownian diffusion locally behaves like an ideal gas (pressure being inversely proportional to volume according to Boyle's law) one can deduce the signature +++- of the Minkowski space, the Lorentz addition of velocities, and the principle of special relativity [fr

  12. Entropy production of a Brownian ellipsoid in the overdamped limit.

    Science.gov (United States)

    Marino, Raffaele; Eichhorn, Ralf; Aurell, Erik

    2016-01-01

    We analyze the translational and rotational motion of an ellipsoidal Brownian particle from the viewpoint of stochastic thermodynamics. The particle's Brownian motion is driven by external forces and torques and takes place in an heterogeneous thermal environment where friction coefficients and (local) temperature depend on space and time. Our analysis of the particle's stochastic thermodynamics is based on the entropy production associated with single particle trajectories. It is motivated by the recent discovery that the overdamped limit of vanishing inertia effects (as compared to viscous fricion) produces a so-called "anomalous" contribution to the entropy production, which has no counterpart in the overdamped approximation, when inertia effects are simply discarded. Here we show that rotational Brownian motion in the overdamped limit generates an additional contribution to the "anomalous" entropy. We calculate its specific form by performing a systematic singular perturbation analysis for the generating function of the entropy production. As a side result, we also obtain the (well-known) equations of motion in the overdamped limit. We furthermore investigate the effects of particle shape and give explicit expressions of the "anomalous entropy" for prolate and oblate spheroids and for near-spherical Brownian particles.

  13. Asset pricing puzzles explained by incomplete Brownian equilibria

    DEFF Research Database (Denmark)

    Christensen, Peter Ove; Larsen, Kasper

    We examine a class of Brownian based models which produce tractable incomplete equilibria. The models are based on finitely many investors with heterogeneous exponential utilities over intermediate consumption who receive partially unspanned income. The investors can trade continuously on a finit...... markets. Consequently, our model can simultaneously help explaining the risk-free rate and equity premium puzzles....

  14. Non-cooperative Brownian donkeys: A solvable 1D model

    Science.gov (United States)

    Jiménez de Cisneros, B.; Reimann, P.; Parrondo, J. M. R.

    2003-12-01

    A paradigmatic 1D model for Brownian motion in a spatially symmetric, periodic system is tackled analytically. Upon application of an external static force F the system's response is an average current which is positive for F 0 (absolute negative mobility). Under suitable conditions, the system approaches 100% efficiency when working against the external force F.

  15. From Brownian Dynamics to Markov Chain: An Ion Channel Example

    KAUST Repository

    Chen, Wan; Erban, Radek; Chapman, S. Jonathan

    2014-01-01

    is illustrated with a two-ion one-well channel. The stationary probability of states is compared with that from both Brownian dynamics simulation and the hierarchical Fokker-Planck equations. The conductivity of the channel is also studied, and the optimal

  16. The escape of brownian particle over potential barriers

    International Nuclear Information System (INIS)

    Zhong Yunxiao

    1985-01-01

    A convenient method is introduced to calculate the rate of escape of Brownian particle over potential barriers by exact solution of Smoluchowskian equation. This method is applied to calculate the nuclear fission probabilities. The results for four different cases are compared with the results of other theories

  17. Thermodynamic laws and equipartition theorem in relativistic Brownian motion.

    Science.gov (United States)

    Koide, T; Kodama, T

    2011-06-01

    We extend the stochastic energetics to a relativistic system. The thermodynamic laws and equipartition theorem are discussed for a relativistic Brownian particle and the first and the second law of thermodynamics in this formalism are derived. The relation between the relativistic equipartition relation and the rate of heat transfer is discussed in the relativistic case together with the nature of the noise term.

  18. Universal and nonuniversal allometric scaling behaviors in the visibility graphs of world stock market indices

    International Nuclear Information System (INIS)

    Qian Mengcen; Jiang Zhiqiang; Zhou Weixing

    2010-01-01

    The investigations of financial markets from a complex network perspective have unveiled many phenomenological properties, in which the majority of these studies map the financial markets into one complex network. In this work, we investigate 30 world stock market indices through their visibility graphs by adopting the visibility algorithm to convert each single stock index into one visibility graph. A universal allometric scaling law is uncovered in the minimal spanning trees, whose scaling exponent is independent of the stock market and the length of the stock index. In contrast, the maximal spanning trees and the random spanning trees do not exhibit universal allometric scaling behaviors. There are marked discrepancies in the allometric scaling behaviors between the stock indices and the Brownian motions. Using surrogate time series, we find that these discrepancies are caused by the fat-tailedness of the return distribution and the nonlinear long-term correlation.

  19. Planar graphs theory and algorithms

    CERN Document Server

    Nishizeki, T

    1988-01-01

    Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.

  20. Quantum chaos on discrete graphs

    International Nuclear Information System (INIS)

    Smilansky, Uzy

    2007-01-01

    Adapting a method developed for the study of quantum chaos on quantum (metric) graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76), spectral ζ functions and trace formulae for discrete Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph and obtaining functions which belong to the class of ζ functions proposed originally by Ihara (1966 J. Mat. Soc. Japan 18 219) and expanded by subsequent authors (Stark and Terras 1996 Adv. Math. 121 124, Kotani and Sunada 2000 J. Math. Sci. Univ. Tokyo 7 7). Finally, a model of 'classical dynamics' on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76). (fast track communication)

  1. RJSplot: Interactive Graphs with R.

    Science.gov (United States)

    Barrios, David; Prieto, Carlos

    2018-03-01

    Data visualization techniques provide new methods for the generation of interactive graphs. These graphs allow a better exploration and interpretation of data but their creation requires advanced knowledge of graphical libraries. Recent packages have enabled the integration of interactive graphs in R. However, R provides limited graphical packages that allow the generation of interactive graphs for computational biology applications. The present project has joined the analytical power of R with the interactive graphical features of JavaScript in a new R package (RJSplot). It enables the easy generation of interactive graphs in R, provides new visualization capabilities, and contributes to the advance of computational biology analytical methods. At present, 16 interactive graphics are available in RJSplot, such as the genome viewer, Manhattan plots, 3D plots, heatmaps, dendrograms, networks, and so on. The RJSplot package is freely available online at http://rjsplot.net. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

  2. On characterizing terrain visibility graphs

    Directory of Open Access Journals (Sweden)

    William Evans

    2015-06-01

    Full Text Available A terrain is an $x$-monotone polygonal line in the $xy$-plane. Two vertices of a terrain are mutually visible if and only if there is no terrain vertex on or above the open line segment connecting them. A graph whose vertices represent terrain vertices and whose edges represent mutually visible pairs of terrain vertices is called a terrain visibility graph. We would like to find properties that are both necessary and sufficient for a graph to be a terrain visibility graph; that is, we would like to characterize terrain visibility graphs.Abello et al. [Discrete and Computational Geometry, 14(3:331--358, 1995] showed that all terrain visibility graphs are “persistent”. They showed that the visibility information of a terrain point set implies some ordering requirements on the slopes of the lines connecting pairs of points in any realization, and as a step towards showing sufficiency, they proved that for any persistent graph $M$ there is a total order on the slopes of the (pseudo lines in a generalized configuration of points whose visibility graph is $M$.We give a much simpler proof of this result by establishing an orientation to every triple of vertices, reflecting some slope ordering requirements that are consistent with $M$ being the visibility graph, and prove that these requirements form a partial order. We give a faster algorithm to construct a total order on the slopes. Our approach attempts to clarify the implications of the graph theoretic properties on the ordering of the slopes, and may be interpreted as defining properties on an underlying oriented matroid that we show is a restricted type of $3$-signotope.

  3. Graph embedding with rich information through heterogeneous graph

    KAUST Repository

    Sun, Guolei

    2017-11-12

    Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most existing algorithms for graph embedding only rely on the topology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this thesis, we proposed a novel and general framework for graph embedding with rich text information (GERI) through constructing a heterogeneous network, in which we integrate node and edge content information with graph topology. Specially, we designed a novel biased random walk to explore the constructed heterogeneous network with the notion of flexible neighborhood. Our sampling strategy can compromise between BFS and DFS local search on heterogeneous graph. To further improve our algorithm, we proposed semi-supervised GERI (SGERI), which learns graph embedding in an discriminative manner through heterogeneous network with label information. The efficacy of our method is demonstrated by extensive comparison experiments with 9 baselines over multi-label and multi-class classification on various datasets including Citeseer, Cora, DBLP and Wiki. It shows that GERI improves the Micro-F1 and Macro-F1 of node classification up to 10%, and SGERI improves GERI by 5% in Wiki.

  4. CORECLUSTER: A Degeneracy Based Graph Clustering Framework

    OpenAIRE

    Giatsidis , Christos; Malliaros , Fragkiskos; Thilikos , Dimitrios M. ,; Vazirgiannis , Michalis

    2014-01-01

    International audience; Graph clustering or community detection constitutes an important task forinvestigating the internal structure of graphs, with a plethora of applications in several domains. Traditional tools for graph clustering, such asspectral methods, typically suffer from high time and space complexity. In thisarticle, we present \\textsc{CoreCluster}, an efficient graph clusteringframework based on the concept of graph degeneracy, that can be used along withany known graph clusteri...

  5. Hierarchy of modular graph identities

    International Nuclear Information System (INIS)

    D’Hoker, Eric; Kaidi, Justin

    2016-01-01

    The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.

  6. Semantic graphs and associative memories

    Science.gov (United States)

    Pomi, Andrés; Mizraji, Eduardo

    2004-12-01

    Graphs have been increasingly utilized in the characterization of complex networks from diverse origins, including different kinds of semantic networks. Human memories are associative and are known to support complex semantic nets; these nets are represented by graphs. However, it is not known how the brain can sustain these semantic graphs. The vision of cognitive brain activities, shown by modern functional imaging techniques, assigns renewed value to classical distributed associative memory models. Here we show that these neural network models, also known as correlation matrix memories, naturally support a graph representation of the stored semantic structure. We demonstrate that the adjacency matrix of this graph of associations is just the memory coded with the standard basis of the concept vector space, and that the spectrum of the graph is a code invariant of the memory. As long as the assumptions of the model remain valid this result provides a practical method to predict and modify the evolution of the cognitive dynamics. Also, it could provide us with a way to comprehend how individual brains that map the external reality, almost surely with different particular vector representations, are nevertheless able to communicate and share a common knowledge of the world. We finish presenting adaptive association graphs, an extension of the model that makes use of the tensor product, which provides a solution to the known problem of branching in semantic nets.

  7. Hierarchy of modular graph identities

    Energy Technology Data Exchange (ETDEWEB)

    D’Hoker, Eric; Kaidi, Justin [Mani L. Bhaumik Institute for Theoretical Physics, Department of Physics and Astronomy,University of California,Los Angeles, CA 90095 (United States)

    2016-11-09

    The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.

  8. XML Graphs in Program Analysis

    DEFF Research Database (Denmark)

    Møller, Anders; Schwartzbach, Michael I.

    2011-01-01

    of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey the use of XML graphs for program analysis with four very different languages: XACT (XML in Java), Java Servlets (Web application programming), XSugar......XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...

  9. Coloring and The Lonely Graph

    OpenAIRE

    Rabern, Landon

    2007-01-01

    We improve upper bounds on the chromatic number proven independently in \\cite{reedNote} and \\cite{ingo}. Our main lemma gives a sufficient condition for two paths in graph to be completely joined. Using this, we prove that if a graph has an optimal coloring with more than $\\frac{\\omega}{2}$ singleton color classes, then it satisfies $\\chi \\leq \\frac{\\omega + \\Delta + 1}{2}$. It follows that a graph satisfying $n - \\Delta < \\alpha + \\frac{\\omega - 1}{2}$ must also satisfy $\\chi \\leq \\frac{\\ome...

  10. Graphs with Eulerian unit spheres

    OpenAIRE

    Knill, Oliver

    2015-01-01

    d-spheres in graph theory are inductively defined as graphs for which all unit spheres S(x) are (d-1)-spheres and that the removal of one vertex renders the graph contractible. Eulerian d-spheres are geometric d-spheres which are d+1 colorable. We prove here that G is an Eulerian sphere if and only if the degrees of all the (d-2)-dimensional sub-simplices in G are even. This generalizes a Kempe-Heawood result for d=2 and is work related to the conjecture that all d-spheres have chromatic numb...

  11. Evolutionary games on graphs

    Science.gov (United States)

    Szabó, György; Fáth, Gábor

    2007-07-01

    Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first four sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fifth section surveys the topological complications implied by non-mean-field-type social network structures in general. The next three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner's Dilemma, the Rock-Scissors-Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.

  12. How superdiffusion gets arrested: ecological encounters explain shift from Lévy to Brownian movement.

    Science.gov (United States)

    de Jager, Monique; Bartumeus, Frederic; Kölzsch, Andrea; Weissing, Franz J; Hengeveld, Geerten M; Nolet, Bart A; Herman, Peter M J; van de Koppel, Johan

    2014-01-07

    Ecological theory uses Brownian motion as a default template for describing ecological movement, despite limited mechanistic underpinning. The generality of Brownian motion has recently been challenged by empirical studies that highlight alternative movement patterns of animals, especially when foraging in resource-poor environments. Yet, empirical studies reveal animals moving in a Brownian fashion when resources are abundant. We demonstrate that Einstein's original theory of collision-induced Brownian motion in physics provides a parsimonious, mechanistic explanation for these observations. Here, Brownian motion results from frequent encounters between organisms in dense environments. In density-controlled experiments, movement patterns of mussels shifted from Lévy towards Brownian motion with increasing density. When the analysis was restricted to moves not truncated by encounters, this shift did not occur. Using a theoretical argument, we explain that any movement pattern approximates Brownian motion at high-resource densities, provided that movement is interrupted upon encounters. Hence, the observed shift to Brownian motion does not indicate a density-dependent change in movement strategy but rather results from frequent collisions. Our results emphasize the need for a more mechanistic use of Brownian motion in ecology, highlighting that especially in rich environments, Brownian motion emerges from ecological interactions, rather than being a default movement pattern.

  13. How superdiffusion gets arrested: ecological encounters explain shift from Lévy to Brownian movement

    Science.gov (United States)

    de Jager, Monique; Bartumeus, Frederic; Kölzsch, Andrea; Weissing, Franz J.; Hengeveld, Geerten M.; Nolet, Bart A.; Herman, Peter M. J.; van de Koppel, Johan

    2014-01-01

    Ecological theory uses Brownian motion as a default template for describing ecological movement, despite limited mechanistic underpinning. The generality of Brownian motion has recently been challenged by empirical studies that highlight alternative movement patterns of animals, especially when foraging in resource-poor environments. Yet, empirical studies reveal animals moving in a Brownian fashion when resources are abundant. We demonstrate that Einstein's original theory of collision-induced Brownian motion in physics provides a parsimonious, mechanistic explanation for these observations. Here, Brownian motion results from frequent encounters between organisms in dense environments. In density-controlled experiments, movement patterns of mussels shifted from Lévy towards Brownian motion with increasing density. When the analysis was restricted to moves not truncated by encounters, this shift did not occur. Using a theoretical argument, we explain that any movement pattern approximates Brownian motion at high-resource densities, provided that movement is interrupted upon encounters. Hence, the observed shift to Brownian motion does not indicate a density-dependent change in movement strategy but rather results from frequent collisions. Our results emphasize the need for a more mechanistic use of Brownian motion in ecology, highlighting that especially in rich environments, Brownian motion emerges from ecological interactions, rather than being a default movement pattern. PMID:24225464

  14. Properly colored connectivity of graphs

    CERN Document Server

    Li, Xueliang; Qin, Zhongmei

    2018-01-01

    A comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security. Beginning with a brief introduction, comprising relevant definitions and preliminary results, this book moves on to consider a variety of properties of graphs that imply bounds on the proper connection number. Detailed proofs of significant advancements toward open problems and conjectures are presented with complete references. Researchers and graduate students with an interest in graph connectivity and colorings will find this book useful as it builds upon fundamental definitions towards modern innovations, strategies, and techniques. The detailed presentation lends to use as an introduction to proper connection of graphs for new and advanced researchers, a solid book for a graduate level topics course, or as a reference for those interested in expanding and further developing research in the area.

  15. Graph anomalies in cyber communications

    Energy Technology Data Exchange (ETDEWEB)

    Vander Wiel, Scott A [Los Alamos National Laboratory; Storlie, Curtis B [Los Alamos National Laboratory; Sandine, Gary [Los Alamos National Laboratory; Hagberg, Aric A [Los Alamos National Laboratory; Fisk, Michael [Los Alamos National Laboratory

    2011-01-11

    Enterprises monitor cyber traffic for viruses, intruders and stolen information. Detection methods look for known signatures of malicious traffic or search for anomalies with respect to a nominal reference model. Traditional anomaly detection focuses on aggregate traffic at central nodes or on user-level monitoring. More recently, however, traffic is being viewed more holistically as a dynamic communication graph. Attention to the graph nature of the traffic has expanded the types of anomalies that are being sought. We give an overview of several cyber data streams collected at Los Alamos National Laboratory and discuss current work in modeling the graph dynamics of traffic over the network. We consider global properties and local properties within the communication graph. A method for monitoring relative entropy on multiple correlated properties is discussed in detail.

  16. Open Graphs and Computational Reasoning

    Directory of Open Access Journals (Sweden)

    Lucas Dixon

    2010-06-01

    Full Text Available We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of half-edges (edges which are drawn with an unconnected end and enjoy rich compositional principles by connecting graphs along these half-edges. In particular, this allows equations and rewrite rules to be specified between graphs. Particular computational models can then be encoded as an axiomatic set of such rules. Further rules can be derived graphically and rewriting can be used to simulate the dynamics of a computational system, e.g. evaluating a program on an input. Examples of models which can be formalised in this way include traditional electronic circuits as well as recent categorical accounts of quantum information.

  17. The toughness of split graphs

    NARCIS (Netherlands)

    Woeginger, G.J.

    1998-01-01

    In this short note we argue that the toughness of split graphs can be computed in polynomial time. This solves an open problem from a recent paper by Kratsch et al. (Discrete Math. 150 (1996) 231–245).

  18. Generating random networks and graphs

    CERN Document Server

    Coolen, Ton; Roberts, Ekaterina

    2017-01-01

    This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of rand...

  19. Graph theory and its applications

    CERN Document Server

    Gross, Jonathan L

    2006-01-01

    Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.

  20. Multiscale Reaction-Diffusion Algorithms: PDE-Assisted Brownian Dynamics

    KAUST Repository

    Franz, Benjamin

    2013-06-19

    Two algorithms that combine Brownian dynami cs (BD) simulations with mean-field partial differential equations (PDEs) are presented. This PDE-assisted Brownian dynamics (PBD) methodology provides exact particle tracking data in parts of the domain, whilst making use of a mean-field reaction-diffusion PDE description elsewhere. The first PBD algorithm couples BD simulations with PDEs by randomly creating new particles close to the interface, which partitions the domain, and by reincorporating particles into the continuum PDE-description when they cross the interface. The second PBD algorithm introduces an overlap region, where both descriptions exist in parallel. It is shown that the overlap region is required to accurately compute variances using PBD simulations. Advantages of both PBD approaches are discussed and illustrative numerical examples are presented. © 2013 Society for Industrial and Applied Mathematics.

  1. Exact master equation for a noncommutative Brownian particle

    International Nuclear Information System (INIS)

    Costa Dias, Nuno; Nuno Prata, Joao

    2009-01-01

    We derive the Hu-Paz-Zhang master equation for a Brownian particle linearly coupled to a bath of harmonic oscillators on the plane with spatial noncommutativity. The results obtained are exact to all orders in the noncommutative parameter. As a by-product we derive some miscellaneous results such as the equilibrium Wigner distribution for the reservoir of noncommutative oscillators, the weak coupling limit of the master equation and a set of sufficient conditions for strict purity decrease of the Brownian particle. Finally, we consider a high-temperature Ohmic model and obtain an estimate for the time scale of the transition from noncommutative to ordinary quantum mechanics. This scale is considerably smaller than the decoherence scale

  2. CNT based thermal Brownian motor to pump water in nanodevices

    DEFF Research Database (Denmark)

    Oyarzua, Elton; Zambrano, Harvey; Walther, Jens Honore

    2016-01-01

    asymmetry drive the water ow in a preferential direction. We systematically modified the magnitude of the applied thermal gradient and the axial position of the fixed points. The analysis involves measurement of the vibrational modes in the CNTs using a Fast Fourier Transform (FFT) algorithm. We observed......Brownian molecular motors are nanoscale machines that exploit thermal fluctuations for directional motion by employing mechanisms such as the Feynman-Smoluchowski ratchet. In this study, using Non Equilibrium Molecular Dynamics, we propose a novel thermal Brownian motor for pumping water through...... Carbon Nanotubes (CNTs). To achieve this we impose a thermal gradient along the axis of a CNT filled with water and impose, in addition, a spatial asymmetry by flxing specific zones on the CNT in order to modify the vibrational modes of the CNT. We find that the temperature gradient and imposed spatial...

  3. Synchronization and collective motion of globally coupled Brownian particles

    International Nuclear Information System (INIS)

    Sevilla, Francisco J; Heiblum-Robles, Alexandro; Dossetti, Victor

    2014-01-01

    In this work, we study a system of passive Brownian (non-self-propelled) particles in two dimensions, interacting only through a social-like force (velocity alignment in this case) that resembles Kuramoto's coupling among phase oscillators. We show that the kinematical stationary states of the system go from a phase in thermal equilibrium with no net flux of particles, to far-from-equilibrium phases exhibiting collective motion by increasing the coupling among particles. The mechanism that leads to the instability of the equilibrium phase relies on the competition between two time scales, namely, the mean collision time of the Brownian particles in a thermal bath and the time it takes for a particle to orient its direction of motion along the direction of motion of the group. Our results show a clear connection between collective motion and the Kuramoto model for synchronization, in our case, for the direction of motion of the particles. (paper)

  4. Brownian motion model with stochastic parameters for asset prices

    Science.gov (United States)

    Ching, Soo Huei; Hin, Pooi Ah

    2013-09-01

    The Brownian motion model may not be a completely realistic model for asset prices because in real asset prices the drift μ and volatility σ may change over time. Presently we consider a model in which the parameter x = (μ,σ) is such that its value x (t + Δt) at a short time Δt ahead of the present time t depends on the value of the asset price at time t + Δt as well as the present parameter value x(t) and m-1 other parameter values before time t via a conditional distribution. The Malaysian stock prices are used to compare the performance of the Brownian motion model with fixed parameter with that of the model with stochastic parameter.

  5. A faithful functor among algebras and graphs

    OpenAIRE

    Falcón Ganfornina, Óscar Jesús; Falcón Ganfornina, Raúl Manuel; Núñez Valdés, Juan; Pacheco Martínez, Ana María; Villar Liñán, María Trinidad; Vigo Aguiar, Jesús (Coordinador)

    2016-01-01

    The problem of identifying a functor between the categories of algebras and graphs is currently open. Based on a known algorithm that identifies isomorphisms of Latin squares with isomorphism of vertex-colored graphs, we describe here a pair of graphs that enable us to find a faithful functor between finite-dimensional algebras over finite fields and these graphs.

  6. Graphs with branchwidth at most three

    NARCIS (Netherlands)

    Bodlaender, H.L.; Thilikos, D.M.

    1997-01-01

    In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three, if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph

  7. A Modal-Logic Based Graph Abstraction

    NARCIS (Netherlands)

    Bauer, J.; Boneva, I.B.; Kurban, M.E.; Rensink, Arend; Ehrig, H; Heckel, R.; Rozenberg, G.; Taentzer, G.

    2008-01-01

    Infinite or very large state spaces often prohibit the successful verification of graph transformation systems. Abstract graph transformation is an approach that tackles this problem by abstracting graphs to abstract graphs of bounded size and by lifting application of productions to abstract

  8. Graphs whose complement and square are isomorphic

    DEFF Research Database (Denmark)

    Pedersen, Anders Sune

    2014-01-01

    We study square-complementary graphs, that is, graphs whose complement and square are isomorphic. We prove several necessary conditions for a graph to be square-complementary, describe ways of building new square-complementary graphs from existing ones, construct infinite families of square-compl...

  9. Acyclicity in edge-colored graphs

    DEFF Research Database (Denmark)

    Gutin, Gregory; Jones, Mark; Sheng, Bin

    2017-01-01

    A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type...

  10. Building Scalable Knowledge Graphs for Earth Science

    Science.gov (United States)

    Ramachandran, Rahul; Maskey, Manil; Gatlin, Patrick; Zhang, Jia; Duan, Xiaoyi; Miller, J. J.; Bugbee, Kaylin; Christopher, Sundar; Freitag, Brian

    2017-01-01

    Knowledge Graphs link key entities in a specific domain with other entities via relationships. From these relationships, researchers can query knowledge graphs for probabilistic recommendations to infer new knowledge. Scientific papers are an untapped resource which knowledge graphs could leverage to accelerate research discovery. Goal: Develop an end-to-end (semi) automated methodology for constructing Knowledge Graphs for Earth Science.

  11. Port-Hamiltonian Systems on Open Graphs

    NARCIS (Netherlands)

    Schaft, A.J. van der; Maschke, B.M.

    2010-01-01

    In this talk we discuss how to define in an intrinsic manner port-Hamiltonian dynamics on open graphs. Open graphs are graphs where some of the vertices are boundary vertices (terminals), which allow interconnection with other systems. We show that a directed graph carries two natural Dirac

  12. Constructing Dense Graphs with Unique Hamiltonian Cycles

    Science.gov (United States)

    Lynch, Mark A. M.

    2012-01-01

    It is not difficult to construct dense graphs containing Hamiltonian cycles, but it is difficult to generate dense graphs that are guaranteed to contain a unique Hamiltonian cycle. This article presents an algorithm for generating arbitrarily large simple graphs containing "unique" Hamiltonian cycles. These graphs can be turned into dense graphs…

  13. Skew-adjacency matrices of graphs

    NARCIS (Netherlands)

    Cavers, M.; Cioaba, S.M.; Fallat, S.; Gregory, D.A.; Haemers, W.H.; Kirkland, S.J.; McDonald, J.J.; Tsatsomeros, M.

    2012-01-01

    The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguish adjacency cospectral graphs. This leads to the following topics: graphs whose skew-adjacency matrices are all cospectral; relations between the matchings polynomial of a graph and the characteristic

  14. Chromatic polynomials of random graphs

    International Nuclear Information System (INIS)

    Van Bussel, Frank; Fliegner, Denny; Timme, Marc; Ehrlich, Christoph; Stolzenberg, Sebastian

    2010-01-01

    Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.

  15. Commuting graphs of matrix algebras

    International Nuclear Information System (INIS)

    Akbari, S.; Bidkhori, H.; Mohammadian, A.

    2006-08-01

    The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all non- central elements of R and two distinct vertices x and y are adjacent if and only if xy = yx. The commuting graph of a group G, denoted by Γ(G), is similarly defined. In this paper we investigate some graph theoretic properties of Γ(M n (F)), where F is a field and n ≥ 2. Also we study the commuting graphs of some classical groups such as GL n (F) and SL n (F). We show that Γ(M n (F)) is a connected graph if and only if every field extension of F of degree n contains a proper intermediate field. We prove that apart from finitely many fields, a similar result is true for Γ(GL n (F)) and Γ(SL n (F)). Also we show that for two fields E and F and integers m, n ≥> 2, if Γ(M m (E)) ≅ Γ(M n (F)), then m = n and vertical bar E vertical bar = vertical bar F vertical bar. (author)

  16. Fuzzy Itand#244; Integral Driven by a Fuzzy Brownian Motion

    Directory of Open Access Journals (Sweden)

    Didier Kumwimba Seya

    2015-11-01

    Full Text Available In this paper we take into account the fuzzy stochastic integral driven by fuzzy Brownian motion. To define the metric between two fuzzy numbers and to take into account the limit of a sequence of fuzzy numbers, we invoke the Hausdorff metric. First this fuzzy stochastic integral is constructed for fuzzy simple stochastic functions, then the construction is done for fuzzy stochastic integrable functions.

  17. Continuous state branching processes in random environment: The Brownian case

    OpenAIRE

    Palau, Sandra; Pardo, Juan Carlos

    2015-01-01

    We consider continuous state branching processes that are perturbed by a Brownian motion. These processes are constructed as the unique strong solution of a stochastic differential equation. The long-term extinction and explosion behaviours are studied. In the stable case, the extinction and explosion probabilities are given explicitly. We find three regimes for the asymptotic behaviour of the explosion probability and, as in the case of branching processes in random environment, we find five...

  18. New methods for simulation of fractional Brownian motion

    International Nuclear Information System (INIS)

    Yin, Z.M.

    1996-01-01

    We present new algorithms for simulation of fractional Brownian motion (fBm) which comprises a set of important random functions widely used in geophysical and physical modeling, fractal image (landscape) simulating, and signal processing. The new algorithms, which are both accurate and efficient, allow us to generate not only a one-dimensional fBm process, but also two- and three-dimensional fBm fields. 23 refs., 3 figs

  19. Quantum work fluctuation theorem: Nonergodic Brownian motion case

    International Nuclear Information System (INIS)

    Bai, Zhan-Wu

    2014-01-01

    The work fluctuations of a quantum Brownian particle driven by an external force in a general nonergodic heat bath are studied under a general initial state. The exact analytical expression of the work probability distribution function is derived. Results show the existence of a quantum asymptotic fluctuation theorem, which is in general not a direct generalization of its classical counterpart. The form of this theorem is dependent on the structure of the heat bath and the specified initial condition.

  20. Anyonic partition functions and windings of planar Brownian motion

    International Nuclear Information System (INIS)

    Desbois, J.; Heinemann, C.; Ouvry, S.

    1995-01-01

    The computation of the N-cycle Brownian paths contribution F N (α) to the N-anyon partition function is addressed. A detailed numerical analysis based on a random walk on a lattice indicates that F N 0 (α)=product k=1 N-1 [1-(N/k)α]. In the paramount three-anyon case, one can show that F 3 (α) is built by linear states belonging to the bosonic, fermionic, and mixed representations of S 3

  1. Algorithms for Brownian first-passage-time estimation

    Science.gov (United States)

    Adib, Artur B.

    2009-09-01

    A class of algorithms in discrete space and continuous time for Brownian first-passage-time estimation is considered. A simple algorithm is derived that yields exact mean first-passage times (MFPTs) for linear potentials in one dimension, regardless of the lattice spacing. When applied to nonlinear potentials and/or higher spatial dimensions, numerical evidence suggests that this algorithm yields MFPT estimates that either outperform or rival Langevin-based (discrete time and continuous space) estimates.

  2. On the Humble Origins of the Brownian Entropic Force

    OpenAIRE

    Neumann, Richard M.

    2015-01-01

    Recognition that certain forces arising from the averaging of the multiple impacts of a solute particle by the surrounding solvent particles undergoing random thermal motion can be of an entropic nature has led to the incorporation of these forces and their related entropies into theoretical protocols ranging from molecular-dynamics simulations to the modeling of quarkonium suppression in particle physics. Here we present a rigorous derivation of this Brownian entropic force by means of the c...

  3. Graph Quasicontinuous Functions and Densely Continuous Forms

    Directory of Open Access Journals (Sweden)

    Lubica Hola

    2017-07-01

    Full Text Available Let $X, Y$ be topological spaces. A function $f: X \\to Y$ is said to be graph quasicontinuous if there is a quasicontinuous function $g: X \\to Y$ with the graph of $g$ contained in the closure of the graph of $f$. There is a close relation between the notions of graph quasicontinuous functions and minimal usco maps as well as the notions of graph quasicontinuous functions and densely continuous forms. Every function with values in a compact Hausdorff space is graph quasicontinuous; more generally every locally compact function is graph quasicontinuous.

  4. The Diffusion Process in Small Particles and Brownian Motion

    Science.gov (United States)

    Khoshnevisan, M.

    Albert Einstein in 1926 published his book entitled ''INVESTIGATIONS ON THE THEORY OF THE BROWNIAN MOVEMENT''. He investigated the process of diffusion in an undissociated dilute solution. The diffusion process is subject to Brownian motion. Furthermore, he elucidated the fact that the heat content of a substance will change the position of the single molecules in an irregular fashion. In this paper, I have shown that in order for the displacement of the single molecules to be proportional to the square root of the time, and for v/2 - v 1 Δ =dv/dx , (where v1 and v2 are the concentrations in two cross sections that are separated by a very small distance), ∫ - ∞ ∞ Φ (Δ) dΔ = I and I/τ ∫ - ∞ ∞Δ2/2 Φ (Δ) dΔ = D conditions to hold, then equation (7a) D =√{ 2 D }√{ τ} must be changed to Δ =√{ 2 D }√{ τ} . I have concluded that D =√{ 2 D }√{ τ} is an unintended error, and it has not been amended for almost 90 years in INVESTIGATIONS ON THE THEORY OF THE BROWNIAN MOVEMENT, 1926 publication.

  5. Brownian relaxation of an inelastic sphere in air

    Energy Technology Data Exchange (ETDEWEB)

    Bird, G. A., E-mail: gab@gab.com.au [University of Sydney, Sydney, NSW 2006 (Australia)

    2016-06-15

    The procedures that are used to calculate the forces and moments on an aerodynamic body in the rarefied gas of the upper atmosphere are applied to a small sphere of the size of an aerosol particle at sea level. While the gas-surface interaction model that provides accurate results for macroscopic bodies may not be appropriate for bodies that are comprised of only about a thousand atoms, it provides a limiting case that is more realistic than the elastic model. The paper concentrates on the transfer of energy from the air to an initially stationary sphere as it acquires Brownian motion. Individual particle trajectories vary wildly, but a clear relaxation process emerges from an ensemble average over tens of thousands of trajectories. The translational and rotational energies in equilibrium Brownian motion are determined. Empirical relationships are obtained for the mean translational and rotational relaxation times, the mean initial power input to the particle, the mean rates of energy transfer between the particle and air, and the diffusivity. These relationships are functions of the ratio of the particle mass to an average air molecule mass and the Knudsen number, which is the ratio of the mean free path in the air to the particle diameter. The ratio of the molecular radius to the particle radius also enters as a correction factor. The implications of Brownian relaxation for the second law of thermodynamics are discussed.

  6. Reflected Brownian motions in the KPZ universality class

    CERN Document Server

    Weiss, Thomas; Spohn, Herbert

    2017-01-01

    This book presents a detailed study of a system of interacting Brownian motions in one dimension. The interaction is point-like such that the n-th Brownian motion is reflected from the Brownian motion with label n-1. This model belongs to the Kardar-Parisi-Zhang (KPZ) universality class. In fact, because of the singular interaction, many universal properties can be established with rigor. They depend on the choice of initial conditions. Discussion addresses packed and periodic initial conditions (Chapter 5), stationary initial conditions (Chapter 6), and mixtures thereof (Chapter 7). The suitably scaled spatial process will be proven to converge to an Airy process in the long time limit. A chapter on determinantal random fields and another one on Airy processes are added to have the notes self-contained. These notes serve as an introduction to the KPZ universality class, illustrating the main concepts by means of a single model only. The notes will be of interest to readers from interacting diffusion processe...

  7. Adiabatic Processes Realized with a Trapped Brownian Particle

    Science.gov (United States)

    Martínez, Ignacio A.; Roldán, Édgar; Dinis, Luis; Petrov, Dmitri; Rica, Raúl A.

    2015-03-01

    The ability to implement adiabatic processes in the mesoscale is of key importance in the study of artificial or biological micro- and nanoengines. Microadiabatic processes have been elusive to experimental implementation due to the difficulty in isolating Brownian particles from their fluctuating environment. Here we report on the experimental realization of a microscopic quasistatic adiabatic process employing a trapped Brownian particle. We circumvent the complete isolation of the Brownian particle by designing a protocol where both characteristic volume and temperature of the system are changed in such a way that the entropy of the system is conserved along the process. We compare the protocols that follow from either the overdamped or underdamped descriptions, demonstrating that the latter is mandatory in order to obtain a vanishing average heat flux to the particle. We provide analytical expressions for the distributions of the fluctuating heat and entropy and verify them experimentally. Our protocols could serve to implement the first microscopic engine that is able to attain the fundamental limit for the efficiency set by Carnot.

  8. Collective motion of active Brownian particles with polar alignment.

    Science.gov (United States)

    Martín-Gómez, Aitor; Levis, Demian; Díaz-Guilera, Albert; Pagonabarraga, Ignacio

    2018-04-04

    We present a comprehensive computational study of the collective behavior emerging from the competition between self-propulsion, excluded volume interactions and velocity-alignment in a two-dimensional model of active particles. We consider an extension of the active brownian particles model where the self-propulsion direction of the particles aligns with the one of their neighbors. We analyze the onset of collective motion (flocking) in a low-density regime (10% surface area) and show that it is mainly controlled by the strength of velocity-alignment interactions: the competition between self-propulsion and crowding effects plays a minor role in the emergence of flocking. However, above the flocking threshold, the system presents a richer pattern formation scenario than analogous models without alignment interactions (active brownian particles) or excluded volume effects (Vicsek-like models). Depending on the parameter regime, the structure of the system is characterized by either a broad distribution of finite-sized polar clusters or the presence of an amorphous, highly fluctuating, large-scale traveling structure which can take a lane-like or band-like form (and usually a hybrid structure which is halfway in between both). We establish a phase diagram that summarizes collective behavior of polar active brownian particles and propose a generic mechanism to describe the complexity of the large-scale structures observed in systems of repulsive self-propelled particles.

  9. Biased and flow driven Brownian motion in periodic channels

    Science.gov (United States)

    Martens, S.; Straube, A.; Schmid, G.; Schimansky-Geier, L.; Hänggi, P.

    2012-02-01

    In this talk we will present an expansion of the common Fick-Jacobs approximation to hydrodynamically as well as by external forces driven Brownian transport in two-dimensional channels exhibiting smoothly varying periodic cross-section. We employ an asymptotic analysis to the components of the flow field and to stationary probability density for finding the particles within the channel in a geometric parameter. We demonstrate that the problem of biased Brownian dynamics in a confined 2D geometry can be replaced by Brownian motion in an effective periodic one-dimensional potential ψ(x) which takes the external bias, the change of the local channel width, and the flow velocity component in longitudinal direction into account. In addition, we study the influence of the external force magnitude, respectively, the pressure drop of the fluid on the particle transport quantities like the averaged velocity and the effective diffusion coefficient. The critical ratio between the external force and pressure drop where the average velocity equals zero is identified and the dependence of the latter on the channel geometry is derived. Analytic findings are confirmed by numerical simulations of the particle dynamics in a reflection symmetric sinusoidal channel.

  10. Visibility graph analysis on quarterly macroeconomic series of China based on complex network theory

    Science.gov (United States)

    Wang, Na; Li, Dong; Wang, Qiwen

    2012-12-01

    The visibility graph approach and complex network theory provide a new insight into time series analysis. The inheritance of the visibility graph from the original time series was further explored in the paper. We found that degree distributions of visibility graphs extracted from Pseudo Brownian Motion series obtained by the Frequency Domain algorithm exhibit exponential behaviors, in which the exponential exponent is a binomial function of the Hurst index inherited in the time series. Our simulations presented that the quantitative relations between the Hurst indexes and the exponents of degree distribution function are different for different series and the visibility graph inherits some important features of the original time series. Further, we convert some quarterly macroeconomic series including the growth rates of value-added of three industry series and the growth rates of Gross Domestic Product series of China to graphs by the visibility algorithm and explore the topological properties of graphs associated from the four macroeconomic series, namely, the degree distribution and correlations, the clustering coefficient, the average path length, and community structure. Based on complex network analysis we find degree distributions of associated networks from the growth rates of value-added of three industry series are almost exponential and the degree distributions of associated networks from the growth rates of GDP series are scale free. We also discussed the assortativity and disassortativity of the four associated networks as they are related to the evolutionary process of the original macroeconomic series. All the constructed networks have “small-world” features. The community structures of associated networks suggest dynamic changes of the original macroeconomic series. We also detected the relationship among government policy changes, community structures of associated networks and macroeconomic dynamics. We find great influences of government

  11. Interactive Graph Layout of a Million Nodes

    OpenAIRE

    Peng Mi; Maoyuan Sun; Moeti Masiane; Yong Cao; Chris North

    2016-01-01

    Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph to...

  12. Khovanov homology of graph-links

    Energy Technology Data Exchange (ETDEWEB)

    Nikonov, Igor M [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)

    2012-08-31

    Graph-links arise as the intersection graphs of turning chord diagrams of links. Speaking informally, graph-links provide a combinatorial description of links up to mutations. Many link invariants can be reformulated in the language of graph-links. Khovanov homology, a well-known and useful knot invariant, is defined for graph-links in this paper (in the case of the ground field of characteristic two). Bibliography: 14 titles.

  13. PRIVATE GRAPHS – ACCESS RIGHTS ON GRAPHS FOR SEAMLESS NAVIGATION

    Directory of Open Access Journals (Sweden)

    W. Dorner

    2016-06-01

    Full Text Available After the success of GNSS (Global Navigational Satellite Systems and navigation services for public streets, indoor seems to be the next big development in navigational services, relying on RTLS – Real Time Locating Services (e.g. WIFI and allowing seamless navigation. In contrast to navigation and routing services on public streets, seamless navigation will cause an additional challenge: how to make routing data accessible to defined users or restrict access rights for defined areas or only to parts of the graph to a defined user group? The paper will present case studies and data from literature, where seamless and especially indoor navigation solutions are presented (hospitals, industrial complexes, building sites, but the problem of restricted access rights was only touched from a real world, but not a technical perspective. The analysis of case studies will show, that the objective of navigation and the different target groups for navigation solutions will demand well defined access rights and require solutions, how to make only parts of a graph to a user or application available to solve a navigational task. The paper will therefore introduce the concept of private graphs, which is defined as a graph for navigational purposes covering the street, road or floor network of an area behind a public street and suggest different approaches how to make graph data for navigational purposes available considering access rights and data protection, privacy and security issues as well.

  14. On the validity of Brownian assumptions in the spin van der Waals model

    International Nuclear Information System (INIS)

    Oh, Suhk Kun

    1985-01-01

    A simple Brownian motion theory of the spin van der Waals model, which can be stationary, Markoffian or Gaussian, is studied. By comparing the Brownian motion theory with an exact theory called the generalized Langevin equation theory, the validity of the Brownian assumptions is tested. Thereby, it is shown explicitly how the Markoffian and Gaussian properties are modified in the spin van der Waals model under the influence of quantum fluctuations and long range ordering. (Author)

  15. How superdiffusion gets arrested: ecological encounters explain shift from Lévy to Brownian movement

    OpenAIRE

    de Jager, Monique; Bartumeus, Frederic; Kölzsch, Andrea; Weissing, Franz J.; Hengeveld, Geerten M.; Nolet, Bart A.; Herman, Peter M. J.; van de Koppel, Johan

    2014-01-01

    Ecological theory uses Brownian motion as a default template for describing ecological movement, despite limited mechanistic underpinning. The generality of Brownian motion has recently been challenged by empirical studies that highlight alternative movement patterns of animals, especially when foraging in resource-poor environments. Yet, empirical studies reveal animals moving in a Brownian fashion when resources are abundant. We demonstrate that Einstein’s original theory ...

  16. Eigenfunction statistics on quantum graphs

    International Nuclear Information System (INIS)

    Gnutzmann, S.; Keating, J.P.; Piotet, F.

    2010-01-01

    We investigate the spatial statistics of the energy eigenfunctions on large quantum graphs. It has previously been conjectured that these should be described by a Gaussian Random Wave Model, by analogy with quantum chaotic systems, for which such a model was proposed by Berry in 1977. The autocorrelation functions we calculate for an individual quantum graph exhibit a universal component, which completely determines a Gaussian Random Wave Model, and a system-dependent deviation. This deviation depends on the graph only through its underlying classical dynamics. Classical criteria for quantum universality to be met asymptotically in the large graph limit (i.e. for the non-universal deviation to vanish) are then extracted. We use an exact field theoretic expression in terms of a variant of a supersymmetric σ model. A saddle-point analysis of this expression leads to the estimates. In particular, intensity correlations are used to discuss the possible equidistribution of the energy eigenfunctions in the large graph limit. When equidistribution is asymptotically realized, our theory predicts a rate of convergence that is a significant refinement of previous estimates. The universal and system-dependent components of intensity correlation functions are recovered by means of an exact trace formula which we analyse in the diagonal approximation, drawing in this way a parallel between the field theory and semiclassics. Our results provide the first instance where an asymptotic Gaussian Random Wave Model has been established microscopically for eigenfunctions in a system with no disorder.

  17. Box graphs and resolutions I

    Directory of Open Access Journals (Sweden)

    Andreas P. Braun

    2016-04-01

    Full Text Available Box graphs succinctly and comprehensively characterize singular fibers of elliptic fibrations in codimension two and three, as well as flop transitions connecting these, in terms of representation theoretic data. We develop a framework that provides a systematic map between a box graph and a crepant algebraic resolution of the singular elliptic fibration, thus allowing an explicit construction of the fibers from a singular Weierstrass or Tate model. The key tool is what we call a fiber face diagram, which shows the relevant information of a (partial toric triangulation and allows the inclusion of more general algebraic blowups. We shown that each such diagram defines a sequence of weighted algebraic blowups, thus providing a realization of the fiber defined by the box graph in terms of an explicit resolution. We show this correspondence explicitly for the case of SU(5 by providing a map between box graphs and fiber faces, and thereby a sequence of algebraic resolutions of the Tate model, which realizes each of the box graphs.

  18. Degree-based graph construction

    International Nuclear Information System (INIS)

    Kim, Hyunju; Toroczkai, Zoltan; Erdos, Peter L; Miklos, Istvan; Szekely, Laszlo A

    2009-01-01

    Degree-based graph construction is a ubiquitous problem in network modelling (Newman et al 2006 The Structure and Dynamics of Networks (Princeton Studies in Complexity) (Princeton, NJ: Princeton University Press), Boccaletti et al 2006 Phys. Rep. 424 175), ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects that are still open today. Here we give necessary and sufficient conditions for a sequence of nonnegative integers to be realized as a simple graph's degree sequence, such that a given (but otherwise arbitrary) set of connections from an arbitrarily given node is avoided. We then use this result to present a swap-free algorithm that builds all simple graphs realizing a given degree sequence. In a wider context, we show that our result provides a greedy construction method to build all the f-factor subgraphs (Tutte 1952 Can. J. Math. 4 314) embedded within K n setmn S k , where K n is the complete graph and S k is a star graph centred on one of the nodes. (fast track communication)

  19. Hierarchical organisation of causal graphs

    International Nuclear Information System (INIS)

    Dziopa, P.

    1993-01-01

    This paper deals with the design of a supervision system using a hierarchy of models formed by graphs, in which the variables are the nodes and the causal relations between the variables of the arcs. To obtain a representation of the variables evolutions which contains only the relevant features of their real evolutions, the causal relations are completed with qualitative transfer functions (QTFs) which produce roughly the behaviour of the classical transfer functions. Major improvements have been made in the building of the hierarchical organization. First, the basic variables of the uppermost level and the causal relations between them are chosen. The next graph is built by adding intermediary variables to the upper graph. When the undermost graph has been built, the transfer functions parameters corresponding to its causal relations are identified. The second task consists in the upwelling of the information from the undermost graph to the uppermost one. A fusion procedure of the causal relations has been designed to compute the QFTs relevant for each level. This procedure aims to reduce the number of parameters needed to represent an evolution at a high level of abstraction. These techniques have been applied to the hierarchical modelling of nuclear process. (authors). 8 refs., 12 figs

  20. Integer Flows and Circuit Covers of Graphs and Signed Graphs

    Science.gov (United States)

    Cheng, Jian

    The work in Chapter 2 is motivated by Tutte and Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {2, 3}, if (G, sigma) is (k - 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted into an integer-valued ( k + 1)-ow with a larger or the same support. We also prove that if (G, sigma) is odd-(2p+1)-edge-connected, then (G, sigma) admits a modulo circular (2 + 1/ p)-flows if and only if it admits an integer-valued circular (2 + 1/p)-flows, which improves all previous result by Xu and Zhang (DM2005), Schubert and Steffen (EJC2015), and Zhu (JCTB2015). Shortest circuit cover conjecture is one of the major open problems in graph theory. It states that every bridgeless graph G contains a set of circuits F such that each edge is contained in at least one member of F and the length of F is at most 7/5∥E(G)∥. This concept was recently generalized to signed graphs by Macajova et al. (JGT2015). In Chapter 3, we improve their upper bound from 11∥E( G)∥ to 14/3 ∥E(G)∥, and if G is 2-edgeconnected and has even negativeness, then it can be further reduced to 11/3 ∥E(G)∥. Tutte's 3-flow conjecture has been studied by many graph theorists in the last several decades. As a new approach to this conjecture, DeVos and Thomassen considered the vectors as ow values and found that there is a close relation between vector S1-flows and integer 3-NZFs. Motivated by their observation, in Chapter 4, we prove that if a graph G admits a vector S1-flow with rank at most two, then G admits an integer 3-NZF. The concept of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it

  1. Graph modeling systems and methods

    Science.gov (United States)

    Neergaard, Mike

    2015-10-13

    An apparatus and a method for vulnerability and reliability modeling are provided. The method generally includes constructing a graph model of a physical network using a computer, the graph model including a plurality of terminating vertices to represent nodes in the physical network, a plurality of edges to represent transmission paths in the physical network, and a non-terminating vertex to represent a non-nodal vulnerability along a transmission path in the physical network. The method additionally includes evaluating the vulnerability and reliability of the physical network using the constructed graph model, wherein the vulnerability and reliability evaluation includes a determination of whether each terminating and non-terminating vertex represents a critical point of failure. The method can be utilized to evaluate wide variety of networks, including power grid infrastructures, communication network topologies, and fluid distribution systems.

  2. On the graph turnpike problem

    KAUST Repository

    Feder, Tomá s; Motwani, Rajeev

    2009-01-01

    Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.

  3. On the graph turnpike problem

    KAUST Repository

    Feder, Tomás

    2009-06-01

    Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.

  4. Negation switching invariant signed graphs

    Directory of Open Access Journals (Sweden)

    Deepa Sinha

    2014-04-01

    Full Text Available A signed graph (or, $sigraph$ in short is a graph G in which each edge x carries a value $\\sigma(x \\in \\{-, +\\}$ called its sign. Given a sigraph S, the negation $\\eta(S$ of the sigraph S is a sigraph obtained from S by reversing the sign of every edge of S. Two sigraphs $S_{1}$ and $S_{2}$ on the same underlying graph are switching equivalent if it is possible to assign signs `+' (`plus' or `-' (`minus' to vertices of $S_{1}$ such that by reversing the sign of each of its edges that has received opposite signs at its ends, one obtains $S_{2}$. In this paper, we characterize sigraphs which are negation switching invariant and also see for what sigraphs, S and $\\eta (S$ are signed isomorphic.

  5. Quantum snake walk on graphs

    International Nuclear Information System (INIS)

    Rosmanis, Ansis

    2011-01-01

    I introduce a continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First, I analyze the quantum snake walk on the line, and I show that, even though most states stay localized throughout the evolution, there are specific states that most likely move on the line as wave packets with momentum inversely proportional to the length of the snake. Next, I discuss how an algorithm based on the quantum snake walk might potentially be able to solve an extended version of the glued trees problem, which asks to find a path connecting both roots of the glued trees graph. To the best of my knowledge, no efficient quantum algorithm solving this problem is known yet.

  6. On Graph Rewriting, Reduction and Evaluation

    DEFF Research Database (Denmark)

    Zerny, Ian

    2010-01-01

    We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter-derive a t......We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter...

  7. The fascinating world of graph theory

    CERN Document Server

    Benjamin, Arthur; Zhang, Ping

    2015-01-01

    Graph theory goes back several centuries and revolves around the study of graphs-mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematics-and some of its most famous problems. The Fascinating World of Graph Theory explores the questions and puzzles that have been studied, and often solved, through graph theory. This book looks at graph theory's development and the vibrant individuals responsible for the field's growth. Introducin

  8. Graph-based modelling in engineering

    CERN Document Server

    Rysiński, Jacek

    2017-01-01

    This book presents versatile, modern and creative applications of graph theory in mechanical engineering, robotics and computer networks. Topics related to mechanical engineering include e.g. machine and mechanism science, mechatronics, robotics, gearing and transmissions, design theory and production processes. The graphs treated are simple graphs, weighted and mixed graphs, bond graphs, Petri nets, logical trees etc. The authors represent several countries in Europe and America, and their contributions show how different, elegant, useful and fruitful the utilization of graphs in modelling of engineering systems can be. .

  9. XML Graphs in Program Analysis

    DEFF Research Database (Denmark)

    Møller, Anders; Schwartzbach, Michael Ignatieff

    2007-01-01

    XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...... of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey four very different applications: XML in Java, Java Servlets and JSP, transformations between XML and non-XML data, and XSLT....

  10. Graph topologies on closed multifunctions

    Directory of Open Access Journals (Sweden)

    Giuseppe Di Maio

    2003-10-01

    Full Text Available In this paper we study function space topologies on closed multifunctions, i.e. closed relations on X x Y using various hypertopologies. The hypertopologies are in essence, graph topologies i.e topologies on functions considered as graphs which are subsets of X x Y . We also study several topologies, including one that is derived from the Attouch-Wets filter on the range. We state embedding theorems which enable us to generalize and prove some recent results in the literature with the use of known results in the hyperspace of the range space and in the function space topologies of ordinary functions.

  11. Cyclic graphs and Apery's theorem

    International Nuclear Information System (INIS)

    Sorokin, V N

    2002-01-01

    This is a survey of results about the behaviour of Hermite-Pade approximants for graphs of Markov functions, and a survey of interpolation problems leading to Apery's result about the irrationality of the value ζ(3) of the Riemann zeta function. The first example is given of a cyclic graph for which the Hermite-Pade problem leads to Apery's theorem. Explicit formulae for solutions are obtained, namely, Rodrigues' formulae and integral representations. The asymptotic behaviour of the approximants is studied, and recurrence formulae are found

  12. Interacting particle systems on graphs

    Science.gov (United States)

    Sood, Vishal

    In this dissertation, the dynamics of socially or biologically interacting populations are investigated. The individual members of the population are treated as particles that interact via links on a social or biological network represented as a graph. The effect of the structure of the graph on the properties of the interacting particle system is studied using statistical physics techniques. In the first chapter, the central concepts of graph theory and social and biological networks are presented. Next, interacting particle systems that are drawn from physics, mathematics and biology are discussed in the second chapter. In the third chapter, the random walk on a graph is studied. The mean time for a random walk to traverse between two arbitrary sites of a random graph is evaluated. Using an effective medium approximation it is found that the mean first-passage time between pairs of sites, as well as all moments of this first-passage time, are insensitive to the density of links in the graph. The inverse of the mean-first passage time varies non-monotonically with the density of links near the percolation transition of the random graph. Much of the behavior can be understood by simple heuristic arguments. Evolutionary dynamics, by which mutants overspread an otherwise uniform population on heterogeneous graphs, are studied in the fourth chapter. Such a process underlies' epidemic propagation, emergence of fads, social cooperation or invasion of an ecological niche by a new species. The first part of this chapter is devoted to neutral dynamics, in which the mutant genotype does not have a selective advantage over the resident genotype. The time to extinction of one of the two genotypes is derived. In the second part of this chapter, selective advantage or fitness is introduced such that the mutant genotype has a higher birth rate or a lower death rate. This selective advantage leads to a dynamical competition in which selection dominates for large populations

  13. Multiple graph regularized protein domain ranking

    KAUST Repository

    Wang, Jim Jing-Yan

    2012-11-19

    Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.

  14. Multiple graph regularized protein domain ranking

    KAUST Repository

    Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

    2012-01-01

    Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.

  15. Multiple graph regularized protein domain ranking.

    Science.gov (United States)

    Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

    2012-11-19

    Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

  16. Multiple graph regularized protein domain ranking

    Directory of Open Access Journals (Sweden)

    Wang Jim

    2012-11-01

    Full Text Available Abstract Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

  17. Random functions via Dyson Brownian Motion: progress and problems

    International Nuclear Information System (INIS)

    Wang, Gaoyuan; Battefeld, Thorsten

    2016-01-01

    We develope a computationally efficient extension of the Dyson Brownian Motion (DBM) algorithm to generate random function in C"2 locally. We further explain that random functions generated via DBM show an unstable growth as the traversed distance increases. This feature restricts the use of such functions considerably if they are to be used to model globally defined ones. The latter is the case if one uses random functions to model landscapes in string theory. We provide a concrete example, based on a simple axionic potential often used in cosmology, to highlight this problem and also offer an ad hoc modification of DBM that suppresses this growth to some degree.

  18. Random functions via Dyson Brownian Motion: progress and problems

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Gaoyuan; Battefeld, Thorsten [Institute for Astrophysics, University of Goettingen,Friedrich Hund Platz 1, D-37077 Goettingen (Germany)

    2016-09-05

    We develope a computationally efficient extension of the Dyson Brownian Motion (DBM) algorithm to generate random function in C{sup 2} locally. We further explain that random functions generated via DBM show an unstable growth as the traversed distance increases. This feature restricts the use of such functions considerably if they are to be used to model globally defined ones. The latter is the case if one uses random functions to model landscapes in string theory. We provide a concrete example, based on a simple axionic potential often used in cosmology, to highlight this problem and also offer an ad hoc modification of DBM that suppresses this growth to some degree.

  19. Entropic Ratchet transport of interacting active Brownian particles

    International Nuclear Information System (INIS)

    Ai, Bao-Quan; He, Ya-Feng; Zhong, Wei-Rong

    2014-01-01

    Directed transport of interacting active (self-propelled) Brownian particles is numerically investigated in confined geometries (entropic barriers). The self-propelled velocity can break thermodynamical equilibrium and induce the directed transport. It is found that the interaction between active particles can greatly affect the ratchet transport. For attractive particles, on increasing the interaction strength, the average velocity first decreases to its minima, then increases, and finally decreases to zero. For repulsive particles, when the interaction is very weak, there exists a critical interaction at which the average velocity is minimal, nearly tends to zero, however, for the strong interaction, the average velocity is independent of the interaction

  20. Entropic Ratchet transport of interacting active Brownian particles

    Energy Technology Data Exchange (ETDEWEB)

    Ai, Bao-Quan, E-mail: aibq@hotmail.com [Laboratory of Quantum Engineering and Quantum Materials, School of Physics and Telecommunication Engineering, South China Normal University, 510006 Guangzhou (China); He, Ya-Feng [College of Physics Science and Technology, Hebei University, 071002 Baoding (China); Zhong, Wei-Rong, E-mail: wrzhong@jnu.edu.cn [Department of Physics and Siyuan Laboratory, College of Science and Engineering, Jinan University, 510632 Guangzhou (China)

    2014-11-21

    Directed transport of interacting active (self-propelled) Brownian particles is numerically investigated in confined geometries (entropic barriers). The self-propelled velocity can break thermodynamical equilibrium and induce the directed transport. It is found that the interaction between active particles can greatly affect the ratchet transport. For attractive particles, on increasing the interaction strength, the average velocity first decreases to its minima, then increases, and finally decreases to zero. For repulsive particles, when the interaction is very weak, there exists a critical interaction at which the average velocity is minimal, nearly tends to zero, however, for the strong interaction, the average velocity is independent of the interaction.

  1. Analysis of Brownian Dynamics Simulations of Reversible Bimolecular Reactions

    KAUST Repository

    Lipková, Jana

    2011-01-01

    A class of Brownian dynamics algorithms for stochastic reaction-diffusion models which include reversible bimolecular reactions is presented and analyzed. The method is a generalization of the λ-bcȳ model for irreversible bimolecular reactions which was introduced in [R. Erban and S. J. Chapman, Phys. Biol., 6(2009), 046001]. The formulae relating the experimentally measurable quantities (reaction rate constants and diffusion constants) with the algorithm parameters are derived. The probability of geminate recombination is also investigated. © 2011 Society for Industrial and Applied Mathematics.

  2. Whitening filter and innovational representation of fractional Brownian motion

    International Nuclear Information System (INIS)

    Wang Xiaotian; Wu Min

    2009-01-01

    In this paper, by means of fractional differential-integral technique we give a new whitening filter formula for fractional Brownian motion defined by Mandelbrot and van Ness [Mandelbrot BB, van Ness JW. SIAM Rev 1968;10(4):422]. This new formula has potential use in time series analysis and in detecting signals as Barton and Vincent Poor [Barton RJ, Vincent Poor H. IEEE Trans Inform Theory 1988;34(5):943] have shown. Another potential application of it is behavioral finance, where the arbitrage opportunities that come from the reversal effect of stock returns, can be eliminated by such a formula.

  3. Moments of inertia and the shapes of Brownian paths

    International Nuclear Information System (INIS)

    Fougere, F.; Desbois, J.

    1993-01-01

    The joint probability law of the principal moments of inertia of Brownian paths (open or closed) is computed, using constrained path integrals and Random Matrix Theory. The case of two-dimensional paths is discussed in detail. In particular, it is shown that the ratio of the average values of the largest and smallest moments is equal to 4.99 (open paths) and 3.07 (closed paths). Results of numerical simulations are also presented, which include investigation of the relationships between the moments of inertia and the arithmetic area enclosed by a path. (authors) 28 refs., 2 figs

  4. Theory of Brownian motion with the Alder-Wainwright effect

    International Nuclear Information System (INIS)

    Okabe, Y.

    1986-01-01

    The Stokes-Boussinesq-Langevin equation, which describes the time evolution of Brownian motion with the Alder-Wainwright effect, can be treated in the framework of the theory of KMO-Langevin equations which describe the time evolution of a real, stationary Gaussian process with T-positivity (reflection positivity) originating in axiomatic quantum field theory. After proving the fluctuation-dissipation theorems for KMO-Langevin equations, the authors obtain an explicit formula for the deviation from the classical Einstein relation that occurs in the Stokes-Boussinesq-Langevin equation with a white noise as its random force. The authors interested in whether or not it can be measured experimentally

  5. Permutation entropy of fractional Brownian motion and fractional Gaussian noise

    International Nuclear Information System (INIS)

    Zunino, L.; Perez, D.G.; Martin, M.T.; Garavaglia, M.; Plastino, A.; Rosso, O.A.

    2008-01-01

    We have worked out theoretical curves for the permutation entropy of the fractional Brownian motion and fractional Gaussian noise by using the Bandt and Shiha [C. Bandt, F. Shiha, J. Time Ser. Anal. 28 (2007) 646] theoretical predictions for their corresponding relative frequencies. Comparisons with numerical simulations show an excellent agreement. Furthermore, the entropy-gap in the transition between these processes, observed previously via numerical results, has been here theoretically validated. Also, we have analyzed the behaviour of the permutation entropy of the fractional Gaussian noise for different time delays

  6. Nuclear resonant scattering of synchrotron radiation from nuclei in the Brownian motion

    International Nuclear Information System (INIS)

    Razdan, Ashok

    2003-01-01

    The time evolution of the coherent forward scattering of the synchrotron radiation for resonant nuclei in Brownian motion is studied. Apart from target thickness, the appearance of the dynamical beats also depends on 'α' which is the ratio of the harmonic force constant to the damping force constant of harmonic oscillator undergoing Brownian motion

  7. On the biased motion of a brownian particle for the pausing time behavior of the CTRW

    International Nuclear Information System (INIS)

    Kim, K.S.

    1982-01-01

    The purpose of this paper is to discuss the biased Brownian motion with the absorbing barrier for the pausing time behavior of the CTRW (continuous-time random walk method), regarding a Brownian particle as a walker. For two pausing time density functions, the respective values for the transport averaged velocity and the dispersion are calculated as the time t becomes large. (KAERI)

  8. Dynamics of a Brownian particle in a plasma in the long-time limit

    International Nuclear Information System (INIS)

    Dickman, R.; Varley, R.L.

    1981-01-01

    The velocity autocorrelation function (VAF) of a Brownian particle in a plasma is calculated in the long-time limit. The Brownian particle VAF exhibits the same qualitative behavior as the electron VAF in a one-component plasma: oscillations at the plasma frequency and decay approx. t -3 sup(/) 2 . (orig.)

  9. Under which conditions is quantum Brownian motion observable in a microscope?

    International Nuclear Information System (INIS)

    Helseth, L.E.

    2010-01-01

    We investigate under which conditions we can expect to observe quantum Brownian motion in a microscope. Using the fluctuation-dissipation theorem, we investigate quantum Brownian motion in an ohmic bath, and estimate temporal and spatial accuracy required to observe a crossover from classical to quantum behavior.

  10. Statistics of the first passage time of Brownian motion conditioned by maximum value or area

    International Nuclear Information System (INIS)

    Kearney, Michael J; Majumdar, Satya N

    2014-01-01

    We derive the moments of the first passage time for Brownian motion conditioned by either the maximum value or the area swept out by the motion. These quantities are the natural counterparts to the moments of the maximum value and area of Brownian excursions of fixed duration, which we also derive for completeness within the same mathematical framework. Various applications are indicated. (paper)

  11. Hydrodynamically Coupled Brownian Dynamics simulations for flow on non-Newtonian fluids

    NARCIS (Netherlands)

    Ahuja, Vishal Raju

    2018-01-01

    This thesis deals with model development for particle-based flow simulations of non-Newtonian fluids such as polymer solutions. A novel computational technique called Hydrodynamically Coupled Brownian Dynamics (HCBD) is presented in this thesis. This technique essentially couples the Brownian motion

  12. On the definition of an admitted Lie group for stochastic differential equations with multi-Brownian motion

    International Nuclear Information System (INIS)

    Srihirun, B; Meleshko, S V; Schulz, E

    2006-01-01

    The definition of an admitted Lie group of transformations for stochastic differential equations has been already presented for equations with one-dimensional Brownian motion. The transformation of the dependent variables involves time as well, and it has been proven that Brownian motion is transformed to Brownian motion. In this paper, we will discuss this concept for stochastic differential equations involving multi-dimensional Brownian motion and present applications to a variety of stochastic differential equations

  13. Constructing Knowledge Graphs of Depression

    NARCIS (Netherlands)

    Huang, Zhisheng; Yang, Jie; van Harmelen, Frank; Hu, Qing

    2017-01-01

    Knowledge Graphs have been shown to be useful tools for integrating multiple medical knowledge sources, and to support such tasks as medical decision making, literature retrieval, determining healthcare quality indicators, co-morbodity analysis and many others. A large number of medical knowledge

  14. Partitioning graphs into connected parts

    NARCIS (Netherlands)

    Hof, van 't P.; Paulusma, D.; Woeginger, G.J.; Frid, A.; Morozov, A.S.; Rybalchenko, A.; Wagner, K.W.

    2009-01-01

    The 2-DISJOINT CONNECTED SUBGRAPHS problem asks if a given graph has two vertex-disjoint connected subgraphs containing pre-specified sets of vertices. We show that this problem is NP-complete even if one of the sets has cardinality 2. The LONGEST PATH CONTRACTIBILITY problem asks for the largest

  15. Isoperimetric inequalities for minimal graphs

    International Nuclear Information System (INIS)

    Pacelli Bessa, G.; Montenegro, J.F.

    2007-09-01

    Based on Markvorsen and Palmer's work on mean time exit and isoperimetric inequalities we establish slightly better isoperimetric inequalities and mean time exit estimates for minimal graphs in N x R. We also prove isoperimetric inequalities for submanifolds of Hadamard spaces with tamed second fundamental form. (author)

  16. Ancestral Genres of Mathematical Graphs

    Science.gov (United States)

    Gerofsky, Susan

    2011-01-01

    Drawing from sources in gesture studies, cognitive science, the anthropology of religion and art/architecture history, this article explores cultural, bodily and cosmological resonances carried (unintentionally) by mathematical graphs on Cartesian coordinates. Concepts of asymmetric bodily spaces, grids, orthogonality, mapping and sacred spaces…

  17. Humidity Graphs for All Seasons.

    Science.gov (United States)

    Esmael, F.

    1982-01-01

    In a previous article in this journal (Vol. 17, p358, 1979), a wet-bulb depression table was recommended for two simple experiments to determine relative humidity. However, the use of a graph is suggested because it gives the relative humidity directly from the wet and dry bulb readings. (JN)

  18. Contracting a planar graph efficiently

    DEFF Research Database (Denmark)

    Holm, Jacob; Italiano, Giuseppe F.; Karczmarz, Adam

    2017-01-01

    the data structure, we can achieve optimal running times for decremental bridge detection, 2-edge connectivity, maximal 3-edge connected components, and the problem of finding a unique perfect matching for a static planar graph. Furthermore, we improve the running times of algorithms for several planar...

  19. Graph Model Based Indoor Tracking

    DEFF Research Database (Denmark)

    Jensen, Christian Søndergaard; Lu, Hua; Yang, Bin

    2009-01-01

    The tracking of the locations of moving objects in large indoor spaces is important, as it enables a range of applications related to, e.g., security and indoor navigation and guidance. This paper presents a graph model based approach to indoor tracking that offers a uniform data management...

  20. A graph with fractional revival

    Science.gov (United States)

    Bernard, Pierre-Antoine; Chan, Ada; Loranger, Érika; Tamon, Christino; Vinet, Luc

    2018-02-01

    An example of a graph that admits balanced fractional revival between antipodes is presented. It is obtained by establishing the correspondence between the quantum walk on a hypercube where the opposite vertices across the diagonals of each face are connected and, the coherent transport of single excitations in the extension of the Krawtchouk spin chain with next-to-nearest neighbour interactions.

  1. Fixation Time for Evolutionary Graphs

    Science.gov (United States)

    Nie, Pu-Yan; Zhang, Pei-Ai

    Evolutionary graph theory (EGT) is recently proposed by Lieberman et al. in 2005. EGT is successful for explaining biological evolution and some social phenomena. It is extremely important to consider the time of fixation for EGT in many practical problems, including evolutionary theory and the evolution of cooperation. This study characterizes the time to asymptotically reach fixation.

  2. Coloring sums of extensions of certain graphs

    Directory of Open Access Journals (Sweden)

    Johan Kok

    2017-12-01

    Full Text Available We recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the chromatic number of $G$ and denoted $\\chi(G$. Motivated by the introduction of the concept of the $b$-chromatic sum of a graph the concept of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum are introduced in this paper. The extended graph $G^x$ of a graph $G$ was recently introduced for certain regular graphs. This paper furthers the concepts of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum to extended paths and cycles. Bipartite graphs also receive some attention. The paper concludes with patterned structured graphs. These last said graphs are typically found in chemical and biological structures.

  3. Mathematical Minute: Rotating a Function Graph

    Science.gov (United States)

    Bravo, Daniel; Fera, Joseph

    2013-01-01

    Using calculus only, we find the angles you can rotate the graph of a differentiable function about the origin and still obtain a function graph. We then apply the solution to odd and even degree polynomials.

  4. Towards a theory of geometric graphs

    CERN Document Server

    Pach, Janos

    2004-01-01

    The early development of graph theory was heavily motivated and influenced by topological and geometric themes, such as the Konigsberg Bridge Problem, Euler's Polyhedral Formula, or Kuratowski's characterization of planar graphs. In 1936, when Denes Konig published his classical Theory of Finite and Infinite Graphs, the first book ever written on the subject, he stressed this connection by adding the subtitle Combinatorial Topology of Systems of Segments. He wanted to emphasize that the subject of his investigations was very concrete: planar figures consisting of points connected by straight-line segments. However, in the second half of the twentieth century, graph theoretical research took an interesting turn. In the most popular and most rapidly growing areas (the theory of random graphs, Ramsey theory, extremal graph theory, algebraic graph theory, etc.), graphs were considered as abstract binary relations rather than geometric objects. Many of the powerful techniques developed in these fields have been su...

  5. Bounds on Gromov hyperbolicity constant in graphs

    Indian Academy of Sciences (India)

    Infinite graphs; Cartesian product graphs; independence number; domin- ation number; geodesics ... the secure transmission of information through the internet (see [15, 16]). In particular, ..... In particular, δ(G) is an integer multiple of 1/4.

  6. Summary: beyond fault trees to fault graphs

    International Nuclear Information System (INIS)

    Alesso, H.P.; Prassinos, P.; Smith, C.F.

    1984-09-01

    Fault Graphs are the natural evolutionary step over a traditional fault-tree model. A Fault Graph is a failure-oriented directed graph with logic connectives that allows cycles. We intentionally construct the Fault Graph to trace the piping and instrumentation drawing (P and ID) of the system, but with logical AND and OR conditions added. Then we evaluate the Fault Graph with computer codes based on graph-theoretic methods. Fault Graph computer codes are based on graph concepts, such as path set (a set of nodes traveled on a path from one node to another) and reachability (the complete set of all possible paths between any two nodes). These codes are used to find the cut-sets (any minimal set of component failures that will fail the system) and to evaluate the system reliability

  7. Torsional rigidity, isospectrality and quantum graphs

    International Nuclear Information System (INIS)

    Colladay, Don; McDonald, Patrick; Kaganovskiy, Leon

    2017-01-01

    We study torsional rigidity for graph and quantum graph analogs of well-known pairs of isospectral non-isometric planar domains. We prove that such isospectral pairs are distinguished by torsional rigidity. (paper)

  8. The single- and double-particle properties and the current reversal of coupled Brownian motors

    International Nuclear Information System (INIS)

    Li, Chen-Pu; Chen, Hong-Bin; Zheng, Zhi-Gang; Fan, Hong; Shen, Wen-Mei

    2017-01-01

    In this paper, we investigate the directed transport of coupled Brownian motors composed of two identical particles which is individually subject to a time-symmetric rocking force in spatially-symmetric periodic potentials. We find that both the coupling free length and the coupling strength can induce the reversed motion of the coupled Brownian motors, the essence of which is the coupled Brownian motors can exhibit completely different single- or double-particle properties under certain conditions. Namely, the current reversal is the result of the mutual conversion between the single- and double-particle properties of the coupled Brownian motors. Moreover, the directed current of coupled Brownian motors can be optimized and manipulated by adjusting the strength, the period, the phase difference of the rocking forces, and the noise intensity. (paper)

  9. Mathematical interpretation of Brownian motor model: Limit cycles and directed transport phenomena

    Science.gov (United States)

    Yang, Jianqiang; Ma, Hong; Zhong, Suchuang

    2018-03-01

    In this article, we first suggest that the attractor of Brownian motor model is one of the reasons for the directed transport phenomenon of Brownian particle. We take the classical Smoluchowski-Feynman (SF) ratchet model as an example to investigate the relationship between limit cycles and directed transport phenomenon of the Brownian particle. We study the existence and variation rule of limit cycles of SF ratchet model at changing parameters through mathematical methods. The influences of these parameters on the directed transport phenomenon of a Brownian particle are then analyzed through numerical simulations. Reasonable mathematical explanations for the directed transport phenomenon of Brownian particle in SF ratchet model are also formulated on the basis of the existence and variation rule of the limit cycles and numerical simulations. These mathematical explanations provide a theoretical basis for applying these theories in physics, biology, chemistry, and engineering.

  10. Bond graph modeling of centrifugal compression systems

    OpenAIRE

    Uddin, Nur; Gravdahl, Jan Tommy

    2015-01-01

    A novel approach to model unsteady fluid dynamics in a compressor network by using a bond graph is presented. The model is intended in particular for compressor control system development. First, we develop a bond graph model of a single compression system. Bond graph modeling offers a different perspective to previous work by modeling the compression system based on energy flow instead of fluid dynamics. Analyzing the bond graph model explains the energy flow during compressor surge. Two pri...

  11. A Graph Calculus for Predicate Logic

    Directory of Open Access Journals (Sweden)

    Paulo A. S. Veloso

    2013-03-01

    Full Text Available We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents bottom. Our calculus establishes that a graph has empty extension by converting it to a normal form, which is expanded to other graphs until we can recognize conflicting situations (equivalent to a formula and its negation.

  12. Sphere and dot product representations of graphs

    NARCIS (Netherlands)

    R.J. Kang (Ross); T. Müller (Tobias)

    2012-01-01

    textabstractA graph $G$ is a $k$-sphere graph if there are $k$-dimensional real vectors $v_1,\\dots,v_n$ such that $ij\\in E(G)$ if and only if the distance between $v_i$ and $v_j$ is at most $1$. A graph $G$ is a $k$-dot product graph if there are $k$-dimensional real vectors $v_1,\\dots,v_n$ such

  13. Deep Learning with Dynamic Computation Graphs

    OpenAIRE

    Looks, Moshe; Herreshoff, Marcello; Hutchins, DeLesley; Norvig, Peter

    2017-01-01

    Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different shape and size for every input, such networks do not directly support batched training or inference. They are also difficult to implement in popular deep learning libraries, which are based on static data-flow graphs. We introduce a technique called dynami...

  14. Constructs for Programming with Graph Rewrites

    OpenAIRE

    Rodgers, Peter

    2000-01-01

    Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifications to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language. The constructs we present are once only nodes, attractor nodes and single match rewrites. We illustrate the operation of the constructs by example. The advantages of adding these new rewrite modifiers is to reduce t...

  15. On the sizes of expander graphs and minimum distances of graph codes

    DEFF Research Database (Denmark)

    Høholdt, Tom; Justesen, Jørn

    2014-01-01

    We give lower bounds for the minimum distances of graph codes based on expander graphs. The bounds depend only on the second eigenvalue of the graph and the parameters of the component codes. We also give an upper bound on the size of a degree regular graph with given second eigenvalue....

  16. My Bar Graph Tells a Story

    Science.gov (United States)

    McMillen, Sue; McMillen, Beth

    2010-01-01

    Connecting stories to qualitative coordinate graphs has been suggested as an effective instructional strategy. Even students who are able to "create" bar graphs may struggle to correctly "interpret" them. Giving children opportunities to work with qualitative graphs can help them develop the skills to interpret, describe, and compare information…

  17. The groupies of random multipartite graphs

    OpenAIRE

    Portmann, Marius; Wang, Hongyun

    2012-01-01

    If a vertex $v$ in a graph $G$ has degree larger than the average of the degrees of its neighbors, we call it a groupie in $G$. In the current work, we study the behavior of groupie in random multipartite graphs with the link probability between sets of nodes fixed. Our results extend the previous ones on random (bipartite) graphs.

  18. Modeling Software Evolution using Algebraic Graph Rewriting

    NARCIS (Netherlands)

    Ciraci, Selim; van den Broek, Pim

    We show how evolution requests can be formalized using algebraic graph rewriting. In particular, we present a way to convert the UML class diagrams to colored graphs. Since changes in software may effect the relation between the methods of classes, our colored graph representation also employs the

  19. A Type Graph Model for Java Programs

    NARCIS (Netherlands)

    Rensink, Arend; Zambon, Eduardo

    2009-01-01

    In this report we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java

  20. An intersection graph of straight lines

    DEFF Research Database (Denmark)

    Thomassen, Carsten

    2002-01-01

    G. Ehrlich, S. Even, and R.E. Tarjan conjectured that the graph obtained from a complete 3 partite graph K4,4,4 by deleting the edges of four disjoint triangles is not the intersection graph of straight line segments in the plane. We show that it is....

  1. Girth 5 graphs from relative difference sets

    DEFF Research Database (Denmark)

    Jørgensen, Leif Kjær

    2005-01-01

    We consider the problem of construction of graphs with given degree $k$ and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed ...

  2. Cycles in weighted graphs and related topics

    NARCIS (Netherlands)

    Zhang, Shenggui

    2002-01-01

    This thesis contains results on paths andcycles in graphs andon a more or less relatedtopic, the vulnerability of graphs. In the first part of the thesis, Chapters 2 through 5, we concentrate on paths andcycles in weightedgraphs. A number of sufficient conditions are presentedfor graphs to contain

  3. Graph Transformation Semantics for a QVT Language

    NARCIS (Netherlands)

    Rensink, Arend; Nederpel, Ronald; Bruni, Roberto; Varró, Dániel

    It has been claimed by many in the graph transformation community that model transformation, as understood in the context of Model Driven Architecture, can be seen as an application of graph transformation. In this paper we substantiate this claim by giving a graph transformation-based semantics to

  4. Girth 5 graphs from relative difference sets

    DEFF Research Database (Denmark)

    Jørgensen, Leif Kjær

    We consider the problem of construction of graphs with given degree and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed by G...

  5. Improper colouring of (random) unit disk graphs

    NARCIS (Netherlands)

    Kang, R.J.; Müller, T.; Sereni, J.S.

    2008-01-01

    For any graph G, the k-improper chromatic number ¿k(G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree k. We investigate ¿k for unit disk graphs and random unit disk graphs to generalise results of McDiarmid and Reed

  6. Alliances and Bisection Width for Planar Graphs

    DEFF Research Database (Denmark)

    Olsen, Martin; Revsbæk, Morten

    2013-01-01

    An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show that any planar graph with minimum degree at least 4 can be split into two alliances in polyn...

  7. A Type Graph Model for Java Programs

    NARCIS (Netherlands)

    Rensink, Arend; Zambon, Eduardo; Lee, D.; Lopes, A.; Poetzsch-Heffter, A.

    2009-01-01

    In this work we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java syntax

  8. RATGRAPH: Computer Graphing of Rational Functions.

    Science.gov (United States)

    Minch, Bradley A.

    1987-01-01

    Presents an easy-to-use Applesoft BASIC program that graphs rational functions and any asymptotes that the functions might have. Discusses the nature of rational functions, graphing them manually, employing a computer to graph rational functions, and describes how the program works. (TW)

  9. A new cluster algorithm for graphs

    NARCIS (Netherlands)

    S. van Dongen

    1998-01-01

    textabstractA new cluster algorithm for graphs called the emph{Markov Cluster algorithm ($MCL$ algorithm) is introduced. The graphs may be both weighted (with nonnegative weight) and directed. Let~$G$~be such a graph. The $MCL$ algorithm simulates flow in $G$ by first identifying $G$ in a

  10. Well-covered graphs and factors

    DEFF Research Database (Denmark)

    Randerath, Bert; Vestergaard, Preben D.

    2006-01-01

    A maximum independent set of vertices in a graph is a set of pairwise nonadjacent vertices of largest cardinality α. Plummer defined a graph to be well-covered, if every independent set is contained in a maximum independent set of G. Every well-covered graph G without isolated vertices has a perf...

  11. A new characterization of trivially perfect graphs

    Directory of Open Access Journals (Sweden)

    Christian Rubio Montiel

    2015-03-01

    Full Text Available A graph $G$ is \\emph{trivially perfect} if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number $\\alpha(G$ equals the number of (maximal cliques $m(G$. We characterize the trivially perfect graphs in terms of vertex-coloring and we extend some definitions to infinite graphs.

  12. 47 CFR 80.761 - Conversion graphs.

    Science.gov (United States)

    2010-10-01

    ... MARITIME SERVICES Standards for Computing Public Coast Station VHF Coverage § 80.761 Conversion graphs. The following graphs must be employed where conversion from one to the other of the indicated types of units is... 47 Telecommunication 5 2010-10-01 2010-10-01 false Conversion graphs. 80.761 Section 80.761...

  13. Undergraduate Labs for Biological Physics: Brownian Motion and Optical Trapping

    Science.gov (United States)

    Chu, Kelvin; Laughney, A.; Williams, J.

    2006-12-01

    We describe a set of case-study driven labs for an upper-division biological physics course. These labs are motivated by case-studies and consist of inquiry-driven investigations of Brownian motion and optical-trapping experiments. Each lab incorporates two innovative educational techniques to drive the process and application aspects of scientific learning. Case studies are used to encourage students to think independently and apply the scientific method to a novel lab situation. Student input from this case study is then used to decide how to best do the measurement, guide the project and ultimately evaluate the success of the program. Where appropriate, visualization and simulation using VPython is used. Direct visualization of Brownian motion allows students to directly calculate Avogadro's number or the Boltzmann constant. Following case-study driven discussion, students use video microscopy to measure the motion of latex spheres in different viscosity fluids arrive at a good approximation of NA or kB. Optical trapping (laser tweezer) experiments allow students to investigate the consequences of 100-pN forces on small particles. The case study consists of a discussion of the Boltzmann distribution and equipartition theorem followed by a consideration of the shape of the potential. Students can then use video capture to measure the distribution of bead positions to determine the shape and depth of the trap. This work supported by NSF DUE-0536773.

  14. Intermittency and multifractional Brownian character of geomagnetic time series

    Directory of Open Access Journals (Sweden)

    G. Consolini

    2013-07-01

    Full Text Available The Earth's magnetosphere exhibits a complex behavior in response to the solar wind conditions. This behavior, which is described in terms of mutifractional Brownian motions, could be the consequence of the occurrence of dynamical phase transitions. On the other hand, it has been shown that the dynamics of the geomagnetic signals is also characterized by intermittency at the smallest temporal scales. Here, we focus on the existence of a possible relationship in the geomagnetic time series between the multifractional Brownian motion character and the occurrence of intermittency. In detail, we investigate the multifractional nature of two long time series of the horizontal intensity of the Earth's magnetic field as measured at L'Aquila Geomagnetic Observatory during two years (2001 and 2008, which correspond to different conditions of solar activity. We propose a possible double origin of the intermittent character of the small-scale magnetic field fluctuations, which is related to both the multifractional nature of the geomagnetic field and the intermittent character of the disturbance level. Our results suggest a more complex nature of the geomagnetic response to solar wind changes than previously thought.

  15. First passage Brownian functional properties of snowmelt dynamics

    Science.gov (United States)

    Dubey, Ashutosh; Bandyopadhyay, Malay

    2018-04-01

    In this paper, we model snow-melt dynamics in terms of a Brownian motion (BM) with purely time dependent drift and difusion and examine its first passage properties by suggesting and examining several Brownian functionals which characterize the lifetime and reactivity of such stochastic processes. We introduce several probability distribution functions (PDFs) associated with such time dependent BMs. For instance, for a BM with initial starting point x0, we derive analytical expressions for : (i) the PDF P(tf|x0) of the first passage time tf which specify the lifetime of such stochastic process, (ii) the PDF P(A|x0) of the area A till the first passage time and it provides us numerous valuable information about the total fresh water availability during melting, (iii) the PDF P(M) associated with the maximum size M of the BM process before the first passage time, and (iv) the joint PDF P(M; tm) of the maximum size M and its occurrence time tm before the first passage time. These P(M) and P(M; tm) are useful in determining the time of maximum fresh water availability and in calculating the total maximum amount of available fresh water. These PDFs are examined for the power law time dependent drift and diffusion which matches quite well with the available data of snowmelt dynamics.

  16. Active Brownian particles with velocity-alignment and active fluctuations

    International Nuclear Information System (INIS)

    Großmann, R; Schimansky-Geier, L; Romanczuk, P

    2012-01-01

    We consider a model of active Brownian particles (ABPs) with velocity alignment in two spatial dimensions with passive and active fluctuations. Here, active fluctuations refers to purely non-equilibrium stochastic forces correlated with the heading of an individual active particle. In the simplest case studied here, they are assumed to be independent stochastic forces parallel (speed noise) and perpendicular (angular noise) to the velocity of the particle. On the other hand, passive fluctuations are defined by a noise vector independent of the direction of motion of a particle, and may account, for example, for thermal fluctuations. We derive a macroscopic description of the ABP gas with velocity-alignment interaction. Here, we start from the individual-based description in terms of stochastic differential equations (Langevin equations) and derive equations of motion for the coarse-grained kinetic variables (density, velocity and temperature) via a moment expansion of the corresponding probability density function. We focus here on the different impact of active and passive fluctuations on onset of collective motion and show how active fluctuations in the active Brownian dynamics can change the phase-transition behaviour of the system. In particular, we show that active angular fluctuations lead to an earlier breakdown of collective motion and to the emergence of a new bistable regime in the mean-field case. (paper)

  17. Active Brownian motion models and applications to ratchets

    Science.gov (United States)

    Fiasconaro, A.; Ebeling, W.; Gudowska-Nowak, E.

    2008-10-01

    We give an overview over recent studies on the model of Active Brownian Motion (ABM) coupled to reservoirs providing free energy which may be converted into kinetic energy of motion. First, we present an introduction to a general concept of active Brownian particles which are capable to take up energy from the source and transform part of it in order to perform various activities. In the second part of our presentation we consider applications of ABM to ratchet systems with different forms of differentiable potentials. Both analytical and numerical evaluations are discussed for three cases of sinusoidal, staircaselike and Mateos ratchet potentials, also with the additional loads modelled by tilted potential structure. In addition, stochastic character of the kinetics is investigated by considering perturbation by Gaussian white noise which is shown to be responsible for driving the directionality of the asymptotic flux in the ratchet. This stochastically driven directionality effect is visualized as a strong nonmonotonic dependence of the statistics of the right versus left trajectories of motion leading to a net current of particles. Possible applications of the ratchet systems to molecular motors are also briefly discussed.

  18. On a conjecture concerning helly circle graphs

    Directory of Open Access Journals (Sweden)

    Durán Guillermo

    2003-01-01

    Full Text Available We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and inequations which represents the structure of G, in such a way that G is an e-circle graph if and only if S has a solution. In fact, e-circle graphs are exactly the circle graphs (intersection graphs of chords in a circle, and thus this method provides an analytic way for recognizing circle graphs. A graph G is a Helly circle graph if G is a circle graph and there exists a model of G by chords such that every three pairwise intersecting chords intersect at the same point. A conjecture by Durán (2000 states that G is a Helly circle graph if and only if G is a circle graph and contains no induced diamonds (a diamond is a graph formed by four vertices and five edges. Many unsuccessful efforts - mainly based on combinatorial and geometrical approaches - have been done in order to validate this conjecture. In this work, we utilize the ideas behind the definition of e-circle graphs and restate this conjecture in terms of an equivalence between two systems of equations and inequations, providing a new, analytic tool to deal with it.

  19. Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes

    Directory of Open Access Journals (Sweden)

    Katona Gyula Y.

    2014-11-01

    Full Text Available The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.

  20. Subsampling for graph power spectrum estimation

    KAUST Repository

    Chepuri, Sundeep Prabhakar; Leus, Geert

    2016-01-01

    In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.

  1. On 4-critical t-perfect graphs

    OpenAIRE

    Benchetrit, Yohann

    2016-01-01

    It is an open question whether the chromatic number of $t$-perfect graphs is bounded by a constant. The largest known value for this parameter is 4, and the only example of a 4-critical $t$-perfect graph, due to Laurent and Seymour, is the complement of the line graph of the prism $\\Pi$ (a graph is 4-critical if it has chromatic number 4 and all its proper induced subgraphs are 3-colorable). In this paper, we show a new example of a 4-critical $t$-perfect graph: the complement of the line gra...

  2. Subsampling for graph power spectrum estimation

    KAUST Repository

    Chepuri, Sundeep Prabhakar

    2016-10-06

    In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.

  3. Proving relations between modular graph functions

    International Nuclear Information System (INIS)

    Basu, Anirban

    2016-01-01

    We consider modular graph functions that arise in the low energy expansion of the four graviton amplitude in type II string theory. The vertices of these graphs are the positions of insertions of vertex operators on the toroidal worldsheet, while the links are the scalar Green functions connecting the vertices. Graphs with four and five links satisfy several non-trivial relations, which have been proved recently. We prove these relations by using elementary properties of Green functions and the details of the graphs. We also prove a relation between modular graph functions with six links. (paper)

  4. A graph edit dictionary for correcting errors in roof topology graphs reconstructed from point clouds

    Science.gov (United States)

    Xiong, B.; Oude Elberink, S.; Vosselman, G.

    2014-07-01

    In the task of 3D building model reconstruction from point clouds we face the problem of recovering a roof topology graph in the presence of noise, small roof faces and low point densities. Errors in roof topology graphs will seriously affect the final modelling results. The aim of this research is to automatically correct these errors. We define the graph correction as a graph-to-graph problem, similar to the spelling correction problem (also called the string-to-string problem). The graph correction is more complex than string correction, as the graphs are 2D while strings are only 1D. We design a strategy based on a dictionary of graph edit operations to automatically identify and correct the errors in the input graph. For each type of error the graph edit dictionary stores a representative erroneous subgraph as well as the corrected version. As an erroneous roof topology graph may contain several errors, a heuristic search is applied to find the optimum sequence of graph edits to correct the errors one by one. The graph edit dictionary can be expanded to include entries needed to cope with errors that were previously not encountered. Experiments show that the dictionary with only fifteen entries already properly corrects one quarter of erroneous graphs in about 4500 buildings, and even half of the erroneous graphs in one test area, achieving as high as a 95% acceptance rate of the reconstructed models.

  5. Significance evaluation in factor graphs

    DEFF Research Database (Denmark)

    Madsen, Tobias; Hobolth, Asger; Jensen, Jens Ledet

    2017-01-01

    in genomics and the multiple-testing issues accompanying them, accurate significance evaluation is of great importance. We here address the problem of evaluating statistical significance of observations from factor graph models. Results Two novel numerical approximations for evaluation of statistical...... significance are presented. First a method using importance sampling. Second a saddlepoint approximation based method. We develop algorithms to efficiently compute the approximations and compare them to naive sampling and the normal approximation. The individual merits of the methods are analysed both from....... Conclusions The applicability of saddlepoint approximation and importance sampling is demonstrated on known models in the factor graph framework. Using the two methods we can substantially improve computational cost without compromising accuracy. This contribution allows analyses of large datasets...

  6. Groups, graphs and random walks

    CERN Document Server

    Salvatori, Maura; Sava-Huss, Ecaterina

    2017-01-01

    An accessible and panoramic account of the theory of random walks on groups and graphs, stressing the strong connections of the theory with other branches of mathematics, including geometric and combinatorial group theory, potential analysis, and theoretical computer science. This volume brings together original surveys and research-expository papers from renowned and leading experts, many of whom spoke at the workshop 'Groups, Graphs and Random Walks' celebrating the sixtieth birthday of Wolfgang Woess in Cortona, Italy. Topics include: growth and amenability of groups; Schrödinger operators and symbolic dynamics; ergodic theorems; Thompson's group F; Poisson boundaries; probability theory on buildings and groups of Lie type; structure trees for edge cuts in networks; and mathematical crystallography. In what is currently a fast-growing area of mathematics, this book provides an up-to-date and valuable reference for both researchers and graduate students, from which future research activities will undoubted...

  7. Flux networks in metabolic graphs

    International Nuclear Information System (INIS)

    Warren, P B; Queiros, S M Duarte; Jones, J L

    2009-01-01

    A metabolic model can be represented as a bipartite graph comprising linked reaction and metabolite nodes. Here it is shown how a network of conserved fluxes can be assigned to the edges of such a graph by combining the reaction fluxes with a conserved metabolite property such as molecular weight. A similar flux network can be constructed by combining the primal and dual solutions to the linear programming problem that typically arises in constraint-based modelling. Such constructions may help with the visualization of flux distributions in complex metabolic networks. The analysis also explains the strong correlation observed between metabolite shadow prices (the dual linear programming variables) and conserved metabolite properties. The methods were applied to recent metabolic models for Escherichia coli, Saccharomyces cerevisiae and Methanosarcina barkeri. Detailed results are reported for E. coli; similar results were found for other organisms

  8. 3-biplacement of bipartite graphs

    Directory of Open Access Journals (Sweden)

    Lech Adamus

    2008-01-01

    Full Text Available Let \\(G=(L,R;E\\ be a bipartite graph with color classes \\(L\\ and \\(R\\ and edge set \\(E\\. A set of two bijections \\(\\{\\varphi_1 , \\varphi_2\\}\\, \\(\\varphi_1 , \\varphi_2 :L \\cup R \\to L \\cup R\\, is said to be a \\(3\\-biplacement of \\(G\\ if \\(\\varphi_1(L= \\varphi_2(L = L\\ and \\(E \\cap \\varphi_1^*(E=\\emptyset\\, \\(E \\cap \\varphi_2^*(E=\\emptyset\\, \\(\\varphi_1^*(E \\cap \\varphi_2^*(E=\\emptyset\\, where \\(\\varphi_1^*\\, \\(\\varphi_2^*\\ are the maps defined on \\(E\\, induced by \\(\\varphi_1\\, \\(\\varphi_2\\, respectively. We prove that if \\(|L| = p\\, \\(|R| = q\\, \\(3 \\leq p \\leq q\\, then every graph \\(G=(L,R;E\\ of size at most \\(p\\ has a \\(3\\-biplacement.

  9. On the centrality of some graphs

    Directory of Open Access Journals (Sweden)

    Vecdi Aytac

    2017-10-01

    Full Text Available A central issue in the analysis of complex networks is the assessment of their stability and vulnerability. A variety of measures have been proposed in the literature to quantify the stability of networks and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. Different measures for graph vulnerability have been introduced so far to study different aspects of the graph behavior after removal of vertices or links such as connectivity, toughness, scattering number, binding number, residual closeness and integrity. In this paper, we consider betweenness centrality of a graph. Betweenness centrality of a vertex of a graph is portion of the shortest paths all pairs of vertices passing through a given vertex. In this paper, we obtain exact values for betweenness centrality for some wheel related graphs namely gear, helm, sunflower and friendship graphs.

  10. Quantum walk on a chimera graph

    Science.gov (United States)

    Xu, Shu; Sun, Xiangxiang; Wu, Jizhou; Zhang, Wei-Wei; Arshed, Nigum; Sanders, Barry C.

    2018-05-01

    We analyse a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum walk features such as localization that starkly distinguishes classical from quantum behaviour. Motivated by technological thrusts, we study continuous-time quantum walk on enhanced variants of the chimera graph and on diminished chimera graph with a random removal of vertices. We explain the quantum walk by constructing a generating set for a suitable subgroup of graph isomorphisms and corresponding symmetry operators that commute with the quantum walk Hamiltonian; the Hamiltonian and these symmetry operators provide a complete set of labels for the spectrum and the stationary states. Our quantum walk characterization of the chimera graph and its variants yields valuable insights into graphs used for designing quantum-annealers.

  11. Fibonacci number of the tadpole graph

    Directory of Open Access Journals (Sweden)

    Joe DeMaio

    2014-10-01

    Full Text Available In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2 and the Fibonacci number of the cycle graph Cn is the Lucas number Ln. The tadpole graph Tn,k is the graph created by concatenating Cn and Pk with an edge from any vertex of Cn to a pendant of Pk for integers n=3 and k=0. This paper establishes formulae and identities for the Fibonacci number of the tadpole graph via algebraic and combinatorial methods.

  12. Software for Graph Analysis and Visualization

    Directory of Open Access Journals (Sweden)

    M. I. Kolomeychenko

    2014-01-01

    Full Text Available This paper describes the software for graph storage, analysis and visualization. The article presents a comparative analysis of existing software for analysis and visualization of graphs, describes the overall architecture of application and basic principles of construction and operation of the main modules. Furthermore, a description of the developed graph storage oriented to storage and processing of large-scale graphs is presented. The developed algorithm for finding communities and implemented algorithms of autolayouts of graphs are the main functionality of the product. The main advantage of the developed software is high speed processing of large size networks (up to millions of nodes and links. Moreover, the proposed graph storage architecture is unique and has no analogues. The developed approaches and algorithms are optimized for operating with big graphs and have high productivity.

  13. Parallel External Memory Graph Algorithms

    DEFF Research Database (Denmark)

    Arge, Lars Allan; Goodrich, Michael T.; Sitchinava, Nodari

    2010-01-01

    In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one o f the private-cache chip multiprocessor (CMP) models. We study the fundamental problem of list ranking which leads to efficient solutions to problems on trees, such as computing lowest...... an optimal speedup of ¿(P) in parallel I/O complexity and parallel computation time, compared to the single-processor external memory counterparts....

  14. Submanifolds weakly associated with graphs

    Indian Academy of Sciences (India)

    A CARRIAZO, L M FERN ´ANDEZ and A RODRÍGUEZ-HIDALGO. Department of Geometry and Topology, ..... by means of trees (connected graphs without cycles) and forests (disjoint unions of trees, see [6]) given in [3], by extending it to weak ... CR-submanifold. In this case, every tree is a K2. Finally, Theorem 3.8 of [3] can ...

  15. Topological structure of dictionary graphs

    International Nuclear Information System (INIS)

    Fuks, Henryk; Krzeminski, Mark

    2009-01-01

    We investigate the topological structure of the subgraphs of dictionary graphs constructed from WordNet and Moby thesaurus data. In the process of learning a foreign language, the learner knows only a subset of all words of the language, corresponding to a subgraph of a dictionary graph. When this subgraph grows with time, its topological properties change. We introduce the notion of the pseudocore and argue that the growth of the vocabulary roughly follows decreasing pseudocore numbers-that is, one first learns words with a high pseudocore number followed by smaller pseudocores. We also propose an alternative strategy for vocabulary growth, involving decreasing core numbers as opposed to pseudocore numbers. We find that as the core or pseudocore grows in size, the clustering coefficient first decreases, then reaches a minimum and starts increasing again. The minimum occurs when the vocabulary reaches a size between 10 3 and 10 4 . A simple model exhibiting similar behavior is proposed. The model is based on a generalized geometric random graph. Possible implications for language learning are discussed.

  16. Quantum information processing with graph states

    International Nuclear Information System (INIS)

    Schlingemann, Dirk-Michael

    2005-04-01

    Graph states are multiparticle states which are associated with graphs. Each vertex of the graph corresponds to a single system or particle. The links describe quantum correlations (entanglement) between pairs of connected particles. Graph states were initiated independently by two research groups: On the one hand, graph states were introduced by Briegel and Raussendorf as a resource for a new model of one-way quantum computing, where algorithms are implemented by a sequence of measurements at single particles. On the other hand, graph states were developed by the author of this thesis and ReinhardWerner in Braunschweig, as a tool to build quantum error correcting codes, called graph codes. The connection between the two approaches was fully realized in close cooperation of both research groups. This habilitation thesis provides a survey of the theory of graph codes, focussing mainly, but not exclusively on the author's own research work. We present the theoretical and mathematical background for the analysis of graph codes. The concept of one-way quantum computing for general graph states is discussed. We explicitly show how to realize the encoding and decoding device of a graph code on a one-way quantum computer. This kind of implementation is to be seen as a mathematical description of a quantum memory device. In addition to that, we investigate interaction processes, which enable the creation of graph states on very large systems. Particular graph states can be created, for instance, by an Ising type interaction between next neighbor particles which sits at the points of an infinitely extended cubic lattice. Based on the theory of quantum cellular automata, we give a constructive characterization of general interactions which create a translationally invariant graph state. (orig.)

  17. Large scale Brownian dynamics of confined suspensions of rigid particles

    Science.gov (United States)

    Sprinkle, Brennan; Balboa Usabiaga, Florencio; Patankar, Neelesh A.; Donev, Aleksandar

    2017-12-01

    We introduce methods for large-scale Brownian Dynamics (BD) simulation of many rigid particles of arbitrary shape suspended in a fluctuating fluid. Our method adds Brownian motion to the rigid multiblob method [F. Balboa Usabiaga et al., Commun. Appl. Math. Comput. Sci. 11(2), 217-296 (2016)] at a cost comparable to the cost of deterministic simulations. We demonstrate that we can efficiently generate deterministic and random displacements for many particles using preconditioned Krylov iterative methods, if kernel methods to efficiently compute the action of the Rotne-Prager-Yamakawa (RPY) mobility matrix and its "square" root are available for the given boundary conditions. These kernel operations can be computed with near linear scaling for periodic domains using the positively split Ewald method. Here we study particles partially confined by gravity above a no-slip bottom wall using a graphical processing unit implementation of the mobility matrix-vector product, combined with a preconditioned Lanczos iteration for generating Brownian displacements. We address a major challenge in large-scale BD simulations, capturing the stochastic drift term that arises because of the configuration-dependent mobility. Unlike the widely used Fixman midpoint scheme, our methods utilize random finite differences and do not require the solution of resistance problems or the computation of the action of the inverse square root of the RPY mobility matrix. We construct two temporal schemes which are viable for large-scale simulations, an Euler-Maruyama traction scheme and a trapezoidal slip scheme, which minimize the number of mobility problems to be solved per time step while capturing the required stochastic drift terms. We validate and compare these schemes numerically by modeling suspensions of boomerang-shaped particles sedimented near a bottom wall. Using the trapezoidal scheme, we investigate the steady-state active motion in dense suspensions of confined microrollers, whose

  18. Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph

    Directory of Open Access Journals (Sweden)

    P. Anusha Devi

    2015-10-01

    Full Text Available An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G,$ is the minimum number of da-ecards that uniquely determines $G.$  The adversary degree associated edge reconstruction number of a graph $G, adern(G,$ is the minimum number $k$ such that every collection of $k$ da-ecards of $G$ uniquely determines $G.$ The maximal subgraph without end vertices of a graph $G$ which is not a tree is the pruned graph of $G.$ It is shown that $dern$ of complete multipartite graphs and some connected graphs with regular pruned graph is $1$ or $2.$ We also determine $dern$ and $adern$ of corona product of standard graphs.

  19. BROWNIAN HEAT TRANSFER ENHANCEMENT IN THE TURBULENT REGIME

    Directory of Open Access Journals (Sweden)

    Suresh Chandrasekhar

    2016-08-01

    Full Text Available The paper presents convection heat transfer of a turbulent flow Al2O3/water nanofluid in a circular duct. The duct is a under constant and uniform heat flux. The paper computationally investigates the system’s thermal behavior in a wide range of Reynolds number and also volume concentration up to 6%. To obtain the nanofluid thermophysical properties, the Hamilton-Crosser model along with the Brownian motion effect are utilized. Then the thermal performance of the system with the nanofluid is compared to the conventional systems which use water as the working fluid. The results indicate that the use of nanofluid of 6% improves the heat transfer rate up to 36.8% with respect to pure water. Therefore, using the Al2O3/water nanofluid instead of water can be a great choice when better heat transfer is needed.

  20. Change of particle size distribution during Brownian coagulation

    International Nuclear Information System (INIS)

    Lee, K.W.

    1984-01-01

    Change in particle size distribution due to Brownian coagulation in the continuum regime has been stuied analytically. A simple analytic solution for the size distribution of an initially lognormal distribution is obtained based on the assumption that the size distribution during the coagulation process attains or can, at least, be represented by a time dependent lognormal function. The results are found to be in a form that corrects Smoluchowski's solution for both polydispersity and size-dependent kernel. It is further shown that regardless of whether the initial distribution is narrow or broad, the spread of the distribution is characterized by approaching a fixed value of the geometric standard deviation. This result has been compared with the self-preserving distribution obtained by similarity theory. (Author)

  1. Brownian rotational relaxation and power absorption in magnetite nanoparticles

    International Nuclear Information System (INIS)

    Goya, G.F.; Fernandez-Pacheco, R.; Arruebo, M.; Cassinelli, N.; Ibarra, M.R.

    2007-01-01

    We present a study of the power absorption efficiency in several magnetite-based colloids, to asses their potential as magnetic inductive hyperthermia (MIH) agents. Relaxation times τ were measured through the imaginary susceptibility component χ ' '(T), and analyzed within Debye's theory of dipolar fluid. The results indicated Brownian rotational relaxation and allowed to calculate the hydrodynamic radius close to the values obtained from photon correlation. The study of the colloid performances as power absorbers showed no detectable increase of temperature for dextran-coated Fe 3 O 4 nanoparticles, whereas a second Fe 3 O 4 -based dispersion of similar concentration could be heated up to 12K after 30min under similar experimental conditions. The different power absorption efficiencies are discussed in terms of the magnetic structure of the nanoparticles

  2. Brownian rotational relaxation and power absorption in magnetite nanoparticles

    Energy Technology Data Exchange (ETDEWEB)

    Goya, G.F. [Institute of Nanoscience of Aragon (INA), University of Zaragoza, 50009 Zaragoza (Spain)]. E-mail: goya@unizar.es; Fernandez-Pacheco, R. [Institute of Nanoscience of Aragon (INA), University of Zaragoza, 50009 Zaragoza (Spain); Arruebo, M. [Institute of Nanoscience of Aragon (INA), University of Zaragoza, 50009 Zaragoza (Spain); Cassinelli, N. [Electronics Division, Bauer and Associates, Buenos Aires (Argentina); Facultad de Ingenieria, UNLP (Argentina); Ibarra, M.R. [Institute of Nanoscience of Aragon (INA), University of Zaragoza, 50009 Zaragoza (Spain)

    2007-09-15

    We present a study of the power absorption efficiency in several magnetite-based colloids, to asses their potential as magnetic inductive hyperthermia (MIH) agents. Relaxation times {tau} were measured through the imaginary susceptibility component {chi}{sup '}'(T), and analyzed within Debye's theory of dipolar fluid. The results indicated Brownian rotational relaxation and allowed to calculate the hydrodynamic radius close to the values obtained from photon correlation. The study of the colloid performances as power absorbers showed no detectable increase of temperature for dextran-coated Fe{sub 3}O{sub 4} nanoparticles, whereas a second Fe{sub 3}O{sub 4}-based dispersion of similar concentration could be heated up to 12K after 30min under similar experimental conditions. The different power absorption efficiencies are discussed in terms of the magnetic structure of the nanoparticles.

  3. Modeling collective emotions: a stochastic approach based on Brownian agents

    International Nuclear Information System (INIS)

    Schweitzer, F.

    2010-01-01

    We develop a agent-based framework to model the emergence of collective emotions, which is applied to online communities. Agents individual emotions are described by their valence and arousal. Using the concept of Brownian agents, these variables change according to a stochastic dynamics, which also considers the feedback from online communication. Agents generate emotional information, which is stored and distributed in a field modeling the online medium. This field affects the emotional states of agents in a non-linear manner. We derive conditions for the emergence of collective emotions, observable in a bimodal valence distribution. Dependent on a saturated or a super linear feedback between the information field and the agent's arousal, we further identify scenarios where collective emotions only appear once or in a repeated manner. The analytical results are illustrated by agent-based computer simulations. Our framework provides testable hypotheses about the emergence of collective emotions, which can be verified by data from online communities. (author)

  4. Optimal dividends in the Brownian motion risk model with interest

    Science.gov (United States)

    Fang, Ying; Wu, Rong

    2009-07-01

    In this paper, we consider a Brownian motion risk model, and in addition, the surplus earns investment income at a constant force of interest. The objective is to find a dividend policy so as to maximize the expected discounted value of dividend payments. It is well known that optimality is achieved by using a barrier strategy for unrestricted dividend rate. However, ultimate ruin of the company is certain if a barrier strategy is applied. In many circumstances this is not desirable. This consideration leads us to impose a restriction on the dividend stream. We assume that dividends are paid to the shareholders according to admissible strategies whose dividend rate is bounded by a constant. Under this additional constraint, we show that the optimal dividend strategy is formed by a threshold strategy.

  5. Micro rectennas: Brownian ratchets for thermal-energy harvesting

    International Nuclear Information System (INIS)

    Pan, Y.; Powell, C. V.; Balocco, C.; Song, A. M.

    2014-01-01

    We experimentally demonstrated the operation of a rectenna for harvesting thermal (blackbody) radiation and converting it into dc electric power. The device integrates an ultrafast rectifier, the self-switching nanodiode, with a wideband log-periodic spiral microantenna. The radiation from the thermal source drives the rectenna out of thermal equilibrium, permitting the rectification of the excess thermal fluctuations from the antenna. The power conversion efficiency increases with the source temperatures up to 0.02% at 973 K. The low efficiency is attributed mainly to the impedance mismatch between antenna and rectifier, and partially to the large field of view of the antenna. Our device not only opens a potential solution for harvesting thermal energy but also provides a platform for experimenting with Brownian ratchets

  6. Micro rectennas: Brownian ratchets for thermal-energy harvesting

    Science.gov (United States)

    Pan, Y.; Powell, C. V.; Song, A. M.; Balocco, C.

    2014-12-01

    We experimentally demonstrated the operation of a rectenna for harvesting thermal (blackbody) radiation and converting it into dc electric power. The device integrates an ultrafast rectifier, the self-switching nanodiode, with a wideband log-periodic spiral microantenna. The radiation from the thermal source drives the rectenna out of thermal equilibrium, permitting the rectification of the excess thermal fluctuations from the antenna. The power conversion efficiency increases with the source temperatures up to 0.02% at 973 K. The low efficiency is attributed mainly to the impedance mismatch between antenna and rectifier, and partially to the large field of view of the antenna. Our device not only opens a potential solution for harvesting thermal energy but also provides a platform for experimenting with Brownian ratchets.

  7. Exact analytical thermodynamic expressions for a Brownian heat engine

    Science.gov (United States)

    Taye, Mesfin Asfaw

    2015-09-01

    The nonequilibrium thermodynamics feature of a Brownian motor operating between two different heat baths is explored as a function of time t . Using the Gibbs entropy and Schnakenberg microscopic stochastic approach, we find exact closed form expressions for the free energy, the rate of entropy production, and the rate of entropy flow from the system to the outside. We show that when the system is out of equilibrium, it constantly produces entropy and at the same time extracts entropy out of the system. Its entropy production and extraction rates decrease in time and saturate to a constant value. In the long time limit, the rate of entropy production balances the rate of entropy extraction, and at equilibrium both entropy production and extraction rates become zero. Furthermore, via the present model, many thermodynamic theories can be checked.

  8. Directed transport of confined Brownian particles with torque

    Science.gov (United States)

    Radtke, Paul K.; Schimansky-Geier, Lutz

    2012-05-01

    We investigate the influence of an additional torque on the motion of Brownian particles confined in a channel geometry with varying width. The particles are driven by random fluctuations modeled by an Ornstein-Uhlenbeck process with given correlation time τc. The latter causes persistent motion and is implemented as (i) thermal noise in equilibrium and (ii) noisy propulsion in nonequilibrium. In the nonthermal process a directed transport emerges; its properties are studied in detail with respect to the correlation time, the torque, and the channel geometry. Eventually, the transport mechanism is traced back to a persistent sliding of particles along the even boundaries in contrast to scattered motion at uneven or rough ones.

  9. Large Scale Brownian Dynamics of Confined Suspensions of Rigid Particles

    Science.gov (United States)

    Donev, Aleksandar; Sprinkle, Brennan; Balboa, Florencio; Patankar, Neelesh

    2017-11-01

    We introduce new numerical methods for simulating the dynamics of passive and active Brownian colloidal suspensions of particles of arbitrary shape sedimented near a bottom wall. The methods also apply for periodic (bulk) suspensions. Our methods scale linearly in the number of particles, and enable previously unprecedented simulations of tens to hundreds of thousands of particles. We demonstrate the accuracy and efficiency of our methods on a suspension of boomerang-shaped colloids. We also model recent experiments on active dynamics of uniform suspensions of spherical microrollers. This work was supported in part by the National Science Foundation under award DMS-1418706, and by the U.S. Department of Energy under award DE-SC0008271.

  10. Micro rectennas: Brownian ratchets for thermal-energy harvesting

    Energy Technology Data Exchange (ETDEWEB)

    Pan, Y.; Powell, C. V.; Balocco, C., E-mail: claudio.balocco@durham.ac.uk [School of Engineering and Computing Sciences, Durham University, Durham DH1 3LE (United Kingdom); Song, A. M. [School of Electrical and Electronic Engineering, University of Manchester, Manchester M13 9PL (United Kingdom)

    2014-12-22

    We experimentally demonstrated the operation of a rectenna for harvesting thermal (blackbody) radiation and converting it into dc electric power. The device integrates an ultrafast rectifier, the self-switching nanodiode, with a wideband log-periodic spiral microantenna. The radiation from the thermal source drives the rectenna out of thermal equilibrium, permitting the rectification of the excess thermal fluctuations from the antenna. The power conversion efficiency increases with the source temperatures up to 0.02% at 973 K. The low efficiency is attributed mainly to the impedance mismatch between antenna and rectifier, and partially to the large field of view of the antenna. Our device not only opens a potential solution for harvesting thermal energy but also provides a platform for experimenting with Brownian ratchets.

  11. Elastic moduli of a Brownian colloidal glass former

    Science.gov (United States)

    Fritschi, S.; Fuchs, M.

    2018-01-01

    The static, dynamic and flow-dependent shear moduli of a binary mixture of Brownian hard disks are studied by an event-driven molecular dynamics simulation. Thereby, the emergence of rigidity close to the glass transition encoded in the static shear modulus G_∞ is accessed by three methods. Results from shear stress auto-correlation functions, elastic dispersion relations, and the elastic response to strain deformations upon the start-up of shear flow are compared. This enables one to sample the time-dependent shear modulus G(t) consistently over several decades in time. By that a very precise specification of the glass transition point and of G_∞ is feasible. Predictions by mode coupling theory of a finite shear modulus at the glass transition, of α-scaling in fluid states close to the transition, and of shear induced decay in yielding glass states are tested and broadly verified.

  12. Hybrid finite element and Brownian dynamics method for charged particles

    Energy Technology Data Exchange (ETDEWEB)

    Huber, Gary A., E-mail: ghuber@ucsd.edu; Miao, Yinglong [Howard Hughes Medical Institute, University of California San Diego, La Jolla, California 92093-0365 (United States); Zhou, Shenggao [Department of Mathematics and Mathematical Center for Interdiscipline Research, Soochow University, 1 Shizi Street, Suzhou, 215006 Jiangsu (China); Li, Bo [Department of Mathematics and Quantitative Biology Graduate Program, University of California, San Diego, 9500 Gilman Drive, La Jolla, California 92093-0112 (United States); McCammon, J. Andrew [Howard Hughes Medical Institute, University of California San Diego, La Jolla, California 92093 (United States); Department of Chemistry and Biochemistry, University of California San Diego, La Jolla, California 92093-0365 (United States); Department of Pharmacology, University of California San Diego, La Jolla, California 92093-0636 (United States)

    2016-04-28

    Diffusion is often the rate-determining step in many biological processes. Currently, the two main computational methods for studying diffusion are stochastic methods, such as Brownian dynamics, and continuum methods, such as the finite element method. A previous study introduced a new hybrid diffusion method that couples the strengths of each of these two methods, but was limited by the lack of interactions among the particles; the force on each particle had to be from an external field. This study further develops the method to allow charged particles. The method is derived for a general multidimensional system and is presented using a basic test case for a one-dimensional linear system with one charged species and a radially symmetric system with three charged species.

  13. Semicircular canals circumvent Brownian Motion overload of mechanoreceptor hair cells

    DEFF Research Database (Denmark)

    Muller, Mees; Heeck, Kier; Elemans, Coen P H

    2016-01-01

    Vertebrate semicircular canals (SCC) first appeared in the vertebrates (i.e. ancestral fish) over 600 million years ago. In SCC the principal mechanoreceptors are hair cells, which as compared to cochlear hair cells are distinctly longer (70 vs. 7 μm), 10 times more compliant to bending (44 vs. 500...... nN/m), and have a 100-fold higher tip displacement threshold (hair cells where the bundle is approximated as a stiff, cylindrical elastic rod subject to friction and thermal agitation. Our models suggest that the above...... differences aid SCC hair cells in circumventing the masking effects of Brownian motion noise of about 70 nm, and thereby permit transduction of very low frequency (

  14. Replica methods for loopy sparse random graphs

    International Nuclear Information System (INIS)

    Coolen, ACC

    2016-01-01

    I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees (via hard constraints) and the adjacency matrix spectrum (via a soft constraint) are prescribed. The sum over graphs can be done analytically, using a replica formalism with complex replica dimensions. All known results for tree-like graphs are recovered in a suitable limit. For loopy graphs, the emerging theory has an appealing and intuitive structure, suggests how message passing algorithms should be adapted, and what is the structure of theories describing spin systems on loopy architectures. However, the formalism is still largely untested, and may require further adjustment and refinement. (paper)

  15. Chemical Graph Transformation with Stereo-Information

    DEFF Research Database (Denmark)

    Andersen, Jakob Lykke; Flamm, Christoph; Merkle, Daniel

    2017-01-01

    Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms and their neighbo......Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms...... and their neighbours in space. Stereoisomers of chemical compounds thus cannot be distinguished, even though their chemical activity may differ substantially. In this contribution we propose an extended chemical graph transformation system with attributes that encode information about local geometry. The modelling...... of graph transformation, but we here propose a framework that also allows for partially specified stereoinformation. While there are several stereochemical configurations to be considered, we focus here on the tetrahedral molecular shape, and suggest general principles for how to treat all other chemically...

  16. Reconstructing Topological Graphs and Continua

    OpenAIRE

    Gartside, Paul; Pitz, Max F.; Suabedissen, Rolf

    2015-01-01

    The deck of a topological space $X$ is the set $\\mathcal{D}(X)=\\{[X \\setminus \\{x\\}] \\colon x \\in X\\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever $\\mathcal{D}(X)=\\mathcal{D}(Y)$ then $X$ is homeomorphic to $Y$. It is shown that all metrizable compact connected spaces are reconstructible. It follows that all finite graphs, when viewed as a 1-dimensional cell-complex, are reconstructible in the topological sense, and more genera...

  17. Decomposing a graph into bistars

    DEFF Research Database (Denmark)

    Thomassen, Carsten

    2013-01-01

    Bárat and the present author conjectured that, for each tree T, there exists a natural number kT such that the following holds: If G is a kT-edge-connected graph such that |E(T)| divides |E(G)|, then G has a T-decomposition, that is, a decomposition of the edge set into trees each of which...... is isomorphic to T. The conjecture has been verified for infinitely many paths and for each star. In this paper we verify the conjecture for an infinite family of trees that are neither paths nor stars, namely all the bistars S(k,k+1)....

  18. On the motion of a Brownian particle with an asymmetric bias

    International Nuclear Information System (INIS)

    Kim, K.S.

    1981-01-01

    On the infinite three dimensional cubic lattice, the transport process of a Brownian particle biased on the direction (in the case of nearest-neighbor jumping) is discussed. The Brownian particle is considered as a walker of the random process. By introducing the theorem that the probability density P(l,t) becomes Gaussian for large t, P(l,t) is completely specified when the first and second moments of P(l,t) become known. The respective values for the transprot averaged velocity and dispersion of a biased Brownian particle are obtained. Finally as t becomes large we find Gaussian packets of a biased Brownian particle which propagate with a constant velocity and have a dispersion proportional to time t. (KAERI)

  19. Second order limit laws for occupation times of the fractional Brownian motion

    OpenAIRE

    Xu, Fangjun

    2013-01-01

    We prove second order limit laws for (additive) functionals of the $d$-dimensional fractional Brownian motion with Hurst index $H=\\frac{1}{d}$, using the method of moments, extending the Kallianpur-Robbins law.

  20. Self-Intersection Local Times of Generalized Mixed Fractional Brownian Motion as White Noise Distributions

    International Nuclear Information System (INIS)

    Suryawan, Herry P.; Gunarso, Boby

    2017-01-01

    The generalized mixed fractional Brownian motion is defined by taking linear combinations of a finite number of independent fractional Brownian motions with different Hurst parameters. It is a Gaussian process with stationary increments, posseses self-similarity property, and, in general, is neither a Markov process nor a martingale. In this paper we study the generalized mixed fractional Brownian motion within white noise analysis framework. As a main result, we prove that for any spatial dimension and for arbitrary Hurst parameter the self-intersection local times of the generalized mixed fractional Brownian motions, after a suitable renormalization, are well-defined as Hida white noise distributions. The chaos expansions of the self-intersection local times in the terms of Wick powers of white noises are also presented. (paper)

  1. On path hypercompositions in graphs and automata

    Directory of Open Access Journals (Sweden)

    Massouros Christos G.

    2016-01-01

    Full Text Available The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph. Similarly, the strings of letters from their alphabet, define hypercompositions in the automata, which in turn define the associated hypergroups to the automata. The study of the associated hypercompositional structures gives results in both, graphs and automata theory.

  2. Attack Graph Construction for Security Events Analysis

    Directory of Open Access Journals (Sweden)

    Andrey Alexeevich Chechulin

    2014-09-01

    Full Text Available The paper is devoted to investigation of the attack graphs construction and analysis task for a network security evaluation and real-time security event processing. Main object of this research is the attack modeling process. The paper contains the description of attack graphs building, modifying and analysis technique as well as overview of implemented prototype for network security analysis based on attack graph approach.

  3. Steiner Distance in Graphs--A Survey

    OpenAIRE

    Mao, Yaping

    2017-01-01

    For a connected graph $G$ of order at least $2$ and $S\\subseteq V(G)$, the \\emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. In this paper, we summarize the known results on the Steiner distance parameters, including Steiner distance, Steiner diameter, Steiner center, Steiner median, Steiner interval, Steiner distance hereditary graph, Steiner distance stable graph, average Steiner distance, and Steiner ...

  4. Density conditions for triangles in multipartite graphs

    DEFF Research Database (Denmark)

    Bondy, Adrian; Shen, Jin; Thomassé, Stephan

    2006-01-01

    subgraphs in G. We investigate in particular the case where G is a complete multipartite graph. We prove that a finite tripartite graph with all edge densities greater than the golden ratio has a triangle and that this bound is best possible. Also we show that an infinite-partite graph with finite parts has...... a triangle, provided that the edge density between any two parts is greater than 1/2....

  5. Efficient Algorithmic Frameworks via Structural Graph Theory

    Science.gov (United States)

    2016-10-28

    constant. For example, they measured that, on large samples of the entire network, the Amazon graph has average degree 17.7, the Facebook graph has average...department heads’ opinions of departments, and generally lack transparency and well-defined measures . On the other hand, the National Research Council (the...Efficient and practical resource block allocation for LTE -based D2D network via graph coloring. Wireless Networks 20(4): 611-624 (2014) 50. Hossein

  6. Decomposing a planar graph into an independent set and a 3-degenerate graph

    DEFF Research Database (Denmark)

    Thomassen, Carsten

    2001-01-01

    We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar graph can be decomposed into an independent set and a set inducing a 3-degenerate graph. (C) 2001 Academic Press....

  7. Hydrodynamic interactions induce movement against an external load in a ratchet dimer Brownian motor.

    Science.gov (United States)

    Fornés, José A

    2010-01-15

    We use the Brownian dynamics with hydrodynamic interactions simulation in order to describe the movement of a elastically coupled dimer Brownian motor in a ratchet potential. The only external forces considered in our system were the load, the random thermal noise and an unbiased thermal fluctuation. For a given set of parameters we observe direct movement against the load force if hydrodynamic interactions were considered.

  8. Asian Option Pricing with Monotonous Transaction Costs under Fractional Brownian Motion

    Directory of Open Access Journals (Sweden)

    Di Pan

    2013-01-01

    Full Text Available Geometric-average Asian option pricing model with monotonous transaction cost rate under fractional Brownian motion was established. The method of partial differential equations was used to solve this model and the analytical expressions of the Asian option value were obtained. The numerical experiments show that Hurst exponent of the fractional Brownian motion and transaction cost rate have a significant impact on the option value.

  9. On the distribution of estimators of diffusion constants for Brownian motion

    International Nuclear Information System (INIS)

    Boyer, Denis; Dean, David S

    2011-01-01

    We discuss the distribution of various estimators for extracting the diffusion constant of single Brownian trajectories obtained by fitting the squared displacement of the trajectory. The analysis of the problem can be framed in terms of quadratic functionals of Brownian motion that correspond to the Euclidean path integral for simple Harmonic oscillators with time dependent frequencies. Explicit analytical results are given for the distribution of the diffusion constant estimator in a number of cases and our results are confirmed by numerical simulations.

  10. The probability of an encounter of two Brownian particles before escape

    International Nuclear Information System (INIS)

    Holcman, D; Kupka, I

    2009-01-01

    We study the probability of meeting of two Brownian particles before one of them exits a finite interval. We obtain an explicit expression for the probability as a function of the initial distance between the two particles using the Weierstrass elliptic function. We also find the law of the meeting location. Brownian simulations show the accuracy of our analysis. Finally, we discuss some applications to the probability that a double-strand DNA break repairs in confined environments.

  11. On correlations between certain random variables associated with first passage Brownian motion

    International Nuclear Information System (INIS)

    Kearney, Michael J; Pye, Andrew J; Martin, Richard J

    2014-01-01

    We analyse how the area swept out by a Brownian motion up to its first passage time correlates with the first passage time itself, obtaining several exact results in the process. Additionally, we analyse the relationship between the time average of a Brownian motion during a first passage and the maximum value attained. The results, which find various applications, are in excellent agreement with simulations. (paper)

  12. The Pricing of Vulnerable Options in a Fractional Brownian Motion Environment

    Directory of Open Access Journals (Sweden)

    Chao Wang

    2015-01-01

    Full Text Available Under the assumption of the stock price, interest rate, and default intensity obeying the stochastic differential equation driven by fractional Brownian motion, the jump-diffusion model is established for the financial market in fractional Brownian motion setting. With the changes of measures, the traditional pricing method is simplified and the general pricing formula is obtained for the European vulnerable option with stochastic interest rate. At the same time, the explicit expression for it comes into being.

  13. Graph algorithms in the titan toolkit.

    Energy Technology Data Exchange (ETDEWEB)

    McLendon, William Clarence, III; Wylie, Brian Neil

    2009-10-01

    Graph algorithms are a key component in a wide variety of intelligence analysis activities. The Graph-Based Informatics for Non-Proliferation and Counter-Terrorism project addresses the critical need of making these graph algorithms accessible to Sandia analysts in a manner that is both intuitive and effective. Specifically we describe the design and implementation of an open source toolkit for doing graph analysis, informatics, and visualization that provides Sandia with novel analysis capability for non-proliferation and counter-terrorism.

  14. The Harary index of a graph

    CERN Document Server

    Xu, Kexiang; Trinajstić, Nenad

    2015-01-01

    This is the first book to focus on the topological index, the Harary index, of a graph, including its mathematical properties, chemical applications and some related and attractive open problems. This book is dedicated to Professor Frank Harary (1921—2005), the grandmaster of graph theory and its applications. It has be written by experts in the field of graph theory and its applications. For a connected graph G, as an important distance-based topological index, the Harary index H(G) is defined as the sum of the reciprocals of the distance between any two unordered vertices of the graph G. In this book, the authors report on the newest results on the Harary index of a graph. These results mainly concern external graphs with respect to the Harary index; the relations to other topological indices; its properties and applications to pure graph theory and chemical graph theory; and two significant variants, i.e., additively and multiplicatively weighted Harary indices. In the last chapter, we present a number o...

  15. Mechatronic modeling and simulation using bond graphs

    CERN Document Server

    Das, Shuvra

    2009-01-01

    Introduction to Mechatronics and System ModelingWhat Is Mechatronics?What Is a System and Why Model Systems?Mathematical Modeling Techniques Used in PracticeSoftwareBond Graphs: What Are They?Engineering SystemsPortsGeneralized VariablesBond GraphsBasic Components in SystemsA Brief Note about Bond Graph Power DirectionsSummary of Bond Direction RulesDrawing Bond Graphs for Simple Systems: Electrical and MechanicalSimplification Rules for Junction StructureDrawing Bond Graphs for Electrical SystemsDrawing Bond Graphs for Mechanical SystemsCausalityDrawing Bond Graphs for Hydraulic and Electronic Components and SystemsSome Basic Properties and Concepts for FluidsBond Graph Model of Hydraulic SystemsElectronic SystemsDeriving System Equations from Bond GraphsSystem VariablesDeriving System EquationsTackling Differential CausalityAlgebraic LoopsSolution of Model Equations and Their InterpretationZeroth Order SystemsFirst Order SystemsSecond Order SystemTransfer Functions and Frequency ResponsesNumerical Solution ...

  16. An algebraic approach to graph codes

    DEFF Research Database (Denmark)

    Pinero, Fernando

    This thesis consists of six chapters. The first chapter, contains a short introduction to coding theory in which we explain the coding theory concepts we use. In the second chapter, we present the required theory for evaluation codes and also give an example of some fundamental codes in coding...... theory as evaluation codes. Chapter three consists of the introduction to graph based codes, such as Tanner codes and graph codes. In Chapter four, we compute the dimension of some graph based codes with a result combining graph based codes and subfield subcodes. Moreover, some codes in chapter four...

  17. The color space of a graph

    DEFF Research Database (Denmark)

    Jensen, T.R.; Thomassen, Carsten

    2000-01-01

    If k is a prime power, and G is a graph with n vertices, then a k-coloring of G may be considered as a vector in GF(k)(n). We prove that the subspace of GF(3)(n) spanned by all 3-colorings of a planar triangle-free graph with n vertices has dimension n. In particular, any such graph has at least n...... - 1 nonequivalent 3-colorings, and the addition of any edge or any vertex of degree 3 results in a 3-colorable graph. (C) 2000 John Wiley & Sons, Inc....

  18. Interactive Graph Layout of a Million Nodes

    Directory of Open Access Journals (Sweden)

    Peng Mi

    2016-12-01

    Full Text Available Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph topology. This algorithm can interactively layout graphs with millions of nodes, and support real-time interaction to explore alternative graph layouts. Users can directly manipulate the layout of vertices in a force-directed fashion. The complexity of traditional repulsive force computation is reduced by approximating calculations based on the hierarchical structure of multi-level clustered graphs. We evaluate the algorithm performance, and demonstrate human-in-the-loop layout in two sensemaking case studies. Moreover, we summarize lessons learned for designing interactive large graph layout algorithms on the GPU.

  19. Text-Filled Stacked Area Graphs

    DEFF Research Database (Denmark)

    Kraus, Martin

    2011-01-01

    -filled stacked area graphs; i.e., graphs that feature stacked areas that are filled with small-typed text. Since these graphs allow for computing the text layout automatically, it is possible to include large amounts of textual detail with very little effort. We discuss the most important challenges and some...... solutions for the design of text-filled stacked area graphs with the help of an exemplary visualization of the genres, publication years, and titles of a database of several thousand PC games....

  20. Reconstructing Nearly Simple Polytopes from their Graph

    OpenAIRE

    Doolittle, Joseph

    2017-01-01

    We present a partial description of which polytopes are reconstructible from their graphs. This is an extension of work by Blind and Mani (1987) and Kalai (1988), which showed that simple polytopes can be reconstructed from their graphs. In particular, we introduce a notion of $h$-nearly simple and prove that 1-nearly simple and 2-nearly simple polytopes are reconstructible from their graphs. We also give an example of a 3-nearly simple polytope which is not reconstructible from its graph. Fu...

  1. A Reduction of the Graph Reconstruction Conjecture

    Directory of Open Access Journals (Sweden)

    Monikandan S.

    2014-08-01

    Full Text Available A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC asserts that all graphs on at least three vertices are reconstructible. In this paper, we prove that interval-regular graphs and some new classes of graphs are reconstructible and show that RC is true if and only if all non-geodetic and non-interval-regular blocks G with diam(G = 2 or diam(Ḡ = diam(G = 3 are reconstructible

  2. Total dominator chromatic number of a graph

    Directory of Open Access Journals (Sweden)

    Adel P. Kazemi

    2015-06-01

    Full Text Available Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a color class. We seek to minimize the number of color classes. We initiate to study this problem on several classes of graphs, as well as finding general bounds and characterizations. We also compare the total dominator chromatic number of a graph with the chromatic number and the total domination number of it.

  3. Equitable Colorings Of Corona Multiproducts Of Graphs

    Directory of Open Access Journals (Sweden)

    Furmánczyk Hanna

    2017-11-01

    Full Text Available A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the numbers of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by =(G. It is known that the problem of computation of =(G is NP-hard in general and remains so for corona graphs. In this paper we consider the same model of coloring in the case of corona multiproducts of graphs. In particular, we obtain some results regarding the equitable chromatic number for the l-corona product G ◦l H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs are mostly constructive in that they lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G. Moreover, we confirm the Equitable Coloring Conjecture for corona products of such graphs. This paper extends the results from [H. Furmánczyk, K. Kaliraj, M. Kubale and V.J. Vivin, Equitable coloring of corona products of graphs, Adv. Appl. Discrete Math. 11 (2013 103–120].

  4. VT Digital Line Graph Miscellaneous Transmission Lines

    Data.gov (United States)

    Vermont Center for Geographic Information — (Link to Metadata) This datalayer is comprised of Miscellaineous Transmission Lines. Digital line graph (DLG) data are digital representations of cartographic...

  5. On cyclic orthogonal double covers of circulant graphs by special infinite graphs

    Directory of Open Access Journals (Sweden)

    R. El-Shanawany

    2017-12-01

    Full Text Available In this article, a technique to construct cyclic orthogonal double covers (CODCs of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and K1,2n−10 is introduced.

  6. The complexity of the matching-cut problem for planar graphs and other graph classes

    NARCIS (Netherlands)

    Bonsma, P.S.

    2009-01-01

    The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be -complete when restricted to graphs with maximum degree four. In this paper it

  7. Probability on graphs random processes on graphs and lattices

    CERN Document Server

    Grimmett, Geoffrey

    2018-01-01

    This introduction to some of the principal models in the theory of disordered systems leads the reader through the basics, to the very edge of contemporary research, with the minimum of technical fuss. Topics covered include random walk, percolation, self-avoiding walk, interacting particle systems, uniform spanning tree, random graphs, as well as the Ising, Potts, and random-cluster models for ferromagnetism, and the Lorentz model for motion in a random medium. This new edition features accounts of major recent progress, including the exact value of the connective constant of the hexagonal lattice, and the critical point of the random-cluster model on the square lattice. The choice of topics is strongly motivated by modern applications, and focuses on areas that merit further research. Accessible to a wide audience of mathematicians and physicists, this book can be used as a graduate course text. Each chapter ends with a range of exercises.

  8. Enabling Graph Appliance for Genome Assembly

    Energy Technology Data Exchange (ETDEWEB)

    Singh, Rina [ORNL; Graves, Jeffrey A [ORNL; Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Shankar, Mallikarjun [ORNL

    2015-01-01

    In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to store and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.

  9. Isospectral graphs with identical nodal counts

    International Nuclear Information System (INIS)

    Oren, Idan; Band, Ram

    2012-01-01

    According to a recent conjecture, isospectral objects have different nodal count sequences (Gnutzmann et al 2005 J. Phys. A: Math. Gen. 38 8921–33). We study generalized Laplacians on discrete graphs, and use them to construct the first non-trivial counterexamples to this conjecture. In addition, these examples demonstrate a surprising connection between isospectral discrete and quantum graphs. (paper)

  10. Compression-based inference on graph data

    NARCIS (Netherlands)

    Bloem, P.; van den Bosch, A.; Heskes, T.; van Leeuwen, D.

    2013-01-01

    We investigate the use of compression-based learning on graph data. General purpose compressors operate on bitstrings or other sequential representations. A single graph can be represented sequentially in many ways, which may in uence the performance of sequential compressors. Using Normalized

  11. On minimum degree conditions for supereulerian graphs

    NARCIS (Netherlands)

    Broersma, Haitze J.; Xiong, L.

    1999-01-01

    A graph is called supereulerian if it has a spanning closed trail. Let $G$ be a 2-edge-connected graph of order $n$ such that each minimal edge cut $E \\subseteq E (G)$ with $|E| \\le 3$ satisfies the property that each component of $G-E$ has order at least $(n-2)/5$. We prove that either $G$ is

  12. On the exterior structure of graphs

    International Nuclear Information System (INIS)

    Kastler, Daniel

    2004-01-01

    After a detailed ab initio description of the exterior structure of graphs as handled by Connes and Kreimer in their work on renormalization (illustrated by the example of the φ 3 model in six dimensions) we spell out in detail their study of the Lie algebra of infinitesimal characters and of the group of characters of the Hopf algebra of Feynman graphs

  13. The Minimum Distance of Graph Codes

    DEFF Research Database (Denmark)

    Høholdt, Tom; Justesen, Jørn

    2011-01-01

    We study codes constructed from graphs where the code symbols are associated with the edges and the symbols connected to a given vertex are restricted to be codewords in a component code. In particular we treat such codes from bipartite expander graphs coming from Euclidean planes and other...... geometries. We give results on the minimum distances of the codes....

  14. Domination versus disjunctive domination in graphs | Henning ...

    African Journals Online (AJOL)

    Domination versus disjunctive domination in graphs. Michael A Henning, Sinclair A Marcon. Abstract. A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacent to a vertex of S. The domination number of G is the minimum cardinality of a dominating set of G. For a positive integer b, ...

  15. Eigenvalues and expansion of bipartite graphs

    DEFF Research Database (Denmark)

    Høholdt, Tom; Janwa, Heeralal

    2012-01-01

    We prove lower bounds on the largest and second largest eigenvalue of the adjacency matrix of bipartite graphs and give necessary and sufficient conditions for equality. We give several examples of classes that are optimal with respect to the bouns. We prove that BIBD-graphs are characterized by ...

  16. Co-Roman domination in graphs

    Indian Academy of Sciences (India)

    1National Centre for Advanced Research in Discrete Mathematics ... 3Department of Computer Science, Ball State University, Muncie, IN, USA .... The corona of two disjoint graphs G1 and G2 is defined to be the graph G = G1 ◦ G2,.

  17. Trajectories entropy in dynamical graphs with memory

    Directory of Open Access Journals (Sweden)

    Francesco eCaravelli

    2016-04-01

    Full Text Available In this paper we investigate the application of non-local graph entropy to evolving and dynamical graphs. The measure is based upon the notion of Markov diffusion on a graph, and relies on the entropy applied to trajectories originating at a specific node. In particular, we study the model of reinforcement-decay graph dynamics, which leads to scale free graphs. We find that the node entropy characterizes the structure of the network in the two parameter phase-space describing the dynamical evolution of the weighted graph. We then apply an adapted version of the entropy measure to purely memristive circuits. We provide evidence that meanwhile in the case of DC voltage the entropy based on the forward probability is enough to characterize the graph properties, in the case of AC voltage generators one needs to consider both forward and backward based transition probabilities. We provide also evidence that the entropy highlights the self-organizing properties of memristive circuits, which re-organizes itself to satisfy the symmetries of the underlying graph.

  18. Graphs, Ideal Flow, and the Transportation Network

    OpenAIRE

    Teknomo, Kardi

    2016-01-01

    This lecture discusses the mathematical relationship between network structure and network utilization of transportation network. Network structure means the graph itself. Network utilization represent the aggregation of trajectories of agents in using the network graph. I show the similarity and relationship between the structural pattern of the network and network utilization.

  19. Supplantation of Mental Operations on Graphs

    Science.gov (United States)

    Vogel, Markus; Girwidz, Raimund; Engel, Joachim

    2007-01-01

    Research findings show the difficulties younger students have in working with graphs. Higher mental operations are necessary for a skilled interpretation of abstract representations. We suggest connecting a concrete representation of the modeled problem with the related graph. The idea is to illustrate essential mental operations externally. This…

  20. Some remarks on definability of process graphs

    NARCIS (Netherlands)

    Grabmayer, C.A.; Klop, J.W.; Luttik, B.; Baier, C.; Hermanns, H.

    2006-01-01

    We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and BPP. For a process graph G, the density function in a state s maps a natural number n to the number of states of G with distance less or