Results 81 to 90 of about 1,157,729 (290)
Hybrid Monte Carlo on Hilbert spaces [PDF]
, 2011 The Hybrid Monte Carlo (HMC) algorithm provides a framework for sampling from complex, high-dimensional target distributions. In contrast with standard Markov chain Monte Carlo (MCMC) algorithms, it generates nonlocal, nonsymmetric moves in the state ...
Beskos, A +15 more
core +1 more source
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Christian Löwenstein +2 more
doaj +1 more source
The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves
Theory and Applications of Graphs, 2021 The color number c(G) of a cubic graph G is the minimum cardinality of a color class of a proper 4-edge-coloring of G. It is well-known that every cubic graph G satisfies c(G) = 0 if G has a Hamiltonian cycle, and c(G) ≤ 2 if G has a Hamiltonian path. In
Analen Malnegro +2 more
doaj +1 more source
Superatom Distortion Induces Triferroicity and Spin Splitting in Two‐Dimensional Antiferromagnets
Advanced Science, EarlyView.The incorporation of superatoms into a 2D square lattice induces symmetry breaking, thereby enabling concurrent coupling among magnetism, ferroelectricity, and ferroelasticity. This strategy achieves triferroic behavior—characterized by spin‐split antiferromagnetic ground states—and offers a viable pathway toward energy‐efficient spintronic devices ...
Zhen Gao +6 more
wiley +1 more source
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
Journal of Graph Algorithms and Applications, 2011 Given an embedded planar acyclic digraph G, we define the problem of acyclic hamiltonian path completion with crossing minimization (acyclic-HPCCM) to be the problem of determining a hamiltonian path completion set of edges such that, when these edges ...
Tamara Mchedlidze, Antonios Symvonis
doaj +1 more source
IEEE Access, 2021 In order to solve the NP-hard problem of mobile sink path planning in wireless sensor networks (WSN) where the communication range is modeled as a circular area and overlaps with each other, this paper proposes a sink node path planning method guided by ...
Zhijie Huang +4 more
doaj +1 more source
Advanced Science, EarlyView.Interlayer sliding in the RuO2Zn2F2 bilayer induces ferroelectricity and enables reversible valley polarization switching. The electric dipole and valley‐resolved band edges are intimately coupled, revealing sliding ferroelectricity as a powerful mechanism for electrical control of valley degrees of freedom in 2D materials.
Djamel Bezzerga +3 more
wiley +1 more source
Bayesian Adaptive Hamiltonian Monte Carlo with an Application to High-Dimensional BEKK GARCH Models [PDF]
Hamiltonian Monte Carlo (HMC) is a recent statistical procedure to sample from complex distributions. Distant proposal draws are taken in a equence of steps following the Hamiltonian dynamics of the underlying parameter space, often yielding superior ...
John Maheu, Martin Burda
core +2 more sources
Journal of Graph Algorithms and ApplicationsThe 2-blowup of a graph is obtained by replacing each vertex with two non-adjacent copies; a graph is biplanar if it is the union of two planar graphs. We disprove a conjecture of Gethner that 2-blowups of planar graphs are biplanar: iterated Kleetopes ...
David Eppstein
doaj +1 more source
On coefficients of path polynomials
International Journal of Mathematics and Mathematical Sciences, 1984 Explicit formulae, in terms of sugraphs of the graph, are given for the first six coefficients of the simple path polynomial of a graph. From these, explicit formulae are deduced for the number of hamiltonian paths in graphs with up to six nodes.
E. J. Farrell
doaj +1 more source