相关论文: An energy function and its application to the peri…
We take up the issue of deriving the limit as $n\to\infty$ of the GREM-like K process on a tree with $n$ levels. Under specific conditions on the parameters of the process, implying the martingality of a modification of the underlying clock…
Irreversible processes accomplished in a fixed time involve nonlinearly coupled flows of matter, energy, and information. Here, using entropy production as an example, we show how thermodynamic uncertainty relations and speed limits on…
In this numerical study, recurrence quantification analysis of chaotic trajectories is explored to detect atypical dynamical behaviour in non-linear Hamiltonian systems. An ensemble of initial conditions is evolved up to a maximum iteration…
We discuss a problem of optimization of the energetic efficiency of a simple rocked ratchet. We concentrate on a low-temperature case in which the particle's motion in a ratchet potential is deterministic. We show that the energetic…
The focus of this paper is the analysis of real-time systems with recursion, through the development of good theoretical techniques which are implementable. Time is modeled using clock variables, and recursion using stacks. Our technique…
Graphs of the most probable transitions for a transition probability matrix, $e^{\tau K}$, i.e., the time evolution matrix of the transition rate matrix $K$ over a finite time interval $\tau$, are considered. We study how the graph…
The folding pathway and rate coefficients of the folding of a knotted protein are calculated for a potential energy function with minimal energetic frustration. A kinetic transition network is constructed using the discrete path sampling…
We study Green's function and the large time behavior of the one-dimensional Euler-Maxwell System with relaxation. Firstly, we construct the Green's function of linearized system and obtain the optimal time decay rates of its solutions. And…
The Randic (connectivity) index is one of the most successful molecular descriptors in structure-property and structure-activity relationships studies. J. Gao found the sharp upper bound for the Randic index of apex trees. In this paper, we…
Passivity is a fundamental concept in thermodynamics that demands a quantum system's energy cannot be lowered by any reversible, unitary process acting on the system. In the limit of many such systems, passivity leads in turn to the concept…
A possible way to extract information about the reversible dissociation of a molecular adhesion bond from force fluctuations observed in force ramp experiments is discussed. For small loading rates the system undergoes a limited number of…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
The transition law of every exchangeable Feller process on the space of countable graphs is determined by a $\sigma$-finite measure on the space of $\{0,1\}\times\{0,1\}$-valued arrays. In discrete-time, this characterization amounts to a…
We extend the Dirichlet principle to non-reversible Markov processes on countable state spaces. We present two variational formulas for the solution of the Poisson equation or, equivalently, for the capacity between two disjoint sets. As an…
We study nondeterministic and probabilistic versions of a discrete dynamical system (due to T. Antal, P. L. Krapivsky, and S. Redner) inspired by Heider's social balance theory. We investigate the convergence time of this dynamics on…
We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…
A tree with at most k leaves is called k-ended tree, and a tree with exactly k leaves is called k-end tree, where a leaf is a vertex of degree one. Contraction of a graph G along the edge e means deleting the edge e and identifying its end…
An $n$-vertex $m$-edge graph is \emph{$k$-vertex connected} if it cannot be disconnected by deleting less than $k$ vertices. After more than half a century of intensive research, the result by [Li et al. STOC'21] finally gave a…
We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all $k \geq 3$, the $k$-CS-transitive such graphs.
In this manuscript we study how the vertex energy of a tree is affected when joined with a bipartite graph. We find an alternating pattern with respect to the coalescence vertex: the energy decreases for vertices located at odd distances…