Results 21 to 30 of about 1,795,811 (300)
Fokker–Planck equation on metric graphs [PDF]
We consider the Fokker-Planck equation on metric graphs. Vertex boundary conditions are imposed in the form of weight continuity and the probability current conservation. Exact solution of the is obtained for star, tree and loop graphs. Applications of the model to Brownian motion in networks and other problems are briefly discussed.
J. Matrasulov, K. Sabirov
openaire +2 more sources
Analysis, Modeling and Simulation of Mechatronic Systems using the Bond Graph Method [PDF]
The Bond Graph is the proper choice of physical system used for: (i) Modeling which can be applied to systems combining multidisciplinary energy domains, (ii) Analysis to provide a great value proposition for finding the algebraic loops within the system
A. Alabakhshizadeh +3 more
doaj +1 more source
Poisson equations for elliptic modular graph functions
We obtain Poisson equations satisfied by elliptic modular graph functions with four links. Analysis of these equations leads to a non–trivial algebraic relation between the various graphs.
Anirban Basu
doaj +1 more source
On the existence of solutions for fractional boundary value problems on the ethane graph
A few researchers have studied fractional differential equations on star graphs. They use star graphs because their method needs a common point which has edges with other nodes while other nodes have no edges between themselves.
Sina Etemad, Shahram Rezapour
doaj +1 more source
Graph equations for line graphs and total graphs
AbstractAll pairs (G,H) of graphs G,H satisfying L(G) = T(H) are determined. The “graph equation“ L(G)= T(H) is also solved.
Dragos M. Cvetkovic, Slobodan K. Simic
openaire +2 more sources
Optimising orbit counting of arbitrary order by equation selection
Background Graphlets are useful for bioinformatics network analysis. Based on the structure of Hočevar and Demšar’s ORCA algorithm, we have created an orbit counting algorithm, named Jesse.
Ine Melckenbeeck +5 more
doaj +1 more source
Power evaluation of advanced energy-harvester using graphical analysis
In this paper, we present the benefits of bond-graph analysis for mechanical-electrical systems, which are energy-harvesters based on structural vibrations and electric loads.
Kanjuro MAKIHARA +3 more
doaj +1 more source
Different Dynamic Formulations for a Mechanism using Bond Graph
For modeling dynamics of mechanisms, various classical formulations are available in the literature. The equations of dynamics given by various classical formulations can also be derived from the bond graph.
Aman Kumar Maini, Anand Vaz
doaj +1 more source
Governing equation discovery based on causal graph for nonlinear dynamic systems
The governing equations of nonlinear dynamic systems is of great significance for understanding the internal physical characteristics. In order to learn the governing equations of nonlinear systems from noisy observed data, we propose a novel method ...
Dongni Jia +4 more
doaj +1 more source
Kazdan–Warner equation on graph [PDF]
Let $G=(V,E)$ be a finite graph and $Δ$ be the usual graph Laplacian. Using the calculus of variations and a method of upper and lower solutions, we give various conditions such that the Kazdan-Warner equation $Δu=c-he^u$ has a solution on $V$, where $c$ is a constant, and $h:V\rightarrow\mathbb{R}$ is a function.
Grigor'yan, Alexander +2 more
openaire +2 more sources

