相关论文: On Pauling's residual entropy estimate for regular…

The logarithm of the number of Eulerian orientations, normalised by the number of vertices, is known as the residual entropy in studies of ice-type models on graphs. The spanning tree entropy depends similarly on the number of spanning…

We introduce two simple models with nearest neighbor interactions on 3D hexagonal lattices. Each model allows one to calculate the residual entropy of ice I (ordinary ice) by means of multicanonical simulations. This gives the correction to…

An Eulerian orientation is an orientation of the edges of a graph such that every vertex is balanced: its in-degree equals its out-degree. Counting Eulerian orientations corresponds to the crucial partition function in so-called ``ice-type…

As first shown by H. S. Green in 1952, the entropy of a classical fluid of identical particles can be written as a sum of many-particle contributions, each of them being a distinctive functional of all spatial distribution functions up to a…

Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…

The entropy conservative/stable algorithm of Friedrich~\etal (2018) for hyperbolic conservation laws on nonconforming p-refined/coarsened Cartesian grids, is extended to curvilinear grids for the compressible Euler equations. The primary…

Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…

We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…

In this work we analyze the entropic properties of the Euler equations when the system is closed with the assumption of a polytropic gas. In this case, the pressure solely depends upon the density of the fluid and the energy equation is not…

In 1966, Arnold [1] showed that the Lagrangian flow of ideal incompressible fluids (described by Euler equations) coincide with the geodesic flow on the manifold of volume preserving diffeomorphisms of the fluid domain. Arnold's proof and…

We study evolution equations on metric graphs with reservoirs, that is graphs where a one-dimensional interval is associated to each edge and, in addition, the vertices are able to store and exchange mass with these intervals. Focusing on…

We prove an asymptotic formula for the number of Eulerian circuits for graphs with strong mixing properties and with vertices having even degrees. The exact value is determined up to the multiplicative error $O(n^{-1/2+\varepsilon})$, where…

We present the derivation of the hydrodynamic limit under Eulerian scaling for a general class of one-dimensional interacting particle systems with two or more conservation laws. Following Yau's relative entropy method it turns out that in…

We define the Euler number of a bipartite graph on $n$ vertices to be the number of labelings of the vertices with $1,2,...,n$ such that the vertices alternate in being local maxima and local minima. We reformulate the problem of computing…

We assert that the solutions to the Cauchy problem of the inviscid vorticity equation remain regular and unique for any smooth initial data of finite energy. However, the primitive formulation of the Euler equations is not well-posed, due…

Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into…

We study the hydrodynamic description of collective dynamics driven by velocity {\it alignment}. It is known that such Euler alignment systems must flock towards a limiting ``flocking'' velocity, provided their solutions remain globally…

We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm…

We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory…

In this paper, we derive entropy estimates for a class of schemes for the Euler equations which present the following features: they are based on the internal energy equation (eventually with a positive corrective term at the righ-hand-side…