Related papers: Trees and forests for nonequilibrium purposes: an …
Random forests are a statistical learning method widely used in many areas of scientific research because of its ability to learn complex relationships between input and output variables and also its capacity to handle high-dimensional…
Generalized gamma distributions arise as limits in many settings involving random graphs, walks, trees, and branching processes. Pek\"oz, R\"ollin, and Ross (2016, arXiv:1309.4183 [math.PR]) exploited characterizing distributional fixed…
By using the well-known mountain pass theorem and Ekeland's variational principle, we prove that there exist at least two fully-non-trivial solutions for a $(p,q)$-Kirchhoff elliptic system with the Dirichlet boundary conditions and…
We present a version of the matrix-tree theorem, which relates the determinant of a matrix to sums of weights of arborescences of its directed graph representation. Our treatment allows for non-zero column sums in the parent matrix by…
Let $G$ be a simple undirected $n$-vertex graph with the characteristic polynomial of its Laplacian matrix $L(G)$, $\det (\lambda I - L (G))=\sum_{k = 0}^n (-1)^k c_k \lambda^{n - k}$. Laplacian--like energy of a graph is newly proposed…
We derive a geometrical expression of the excess entropy production for quasi-static transitions between nonequilibrium steady states of Markovian jump processes, which can be exactly applied to nonlinear and nonequilibrium situations. The…
By using our novel Grassmann formulation we study the phase transition of the spanning-hyperforest model of the k-uniform complete hypergraph for any k>= 2. The case k=2 reduces to the spanning-forest model on the complete graph. Different…
We study the energy minimization problem for an elastic interface in a random potential plus a quadratic well. As the position of the well is varied, the ground state undergoes jumps, called shocks or static avalanches. We introduce an…
We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…
Usually the calculation of work distributions in an arbitrary nonequilibrium process in a quantum system, especially in a quantum many-body system is extremely cumbersome. For all quantum systems described by quadratic Hamiltonians, we…
The purpose of this article is to show how the isotropy subgroup of leaf permutations on binary trees can be used to systematically identify tree-informative invariants relevant to models of phylogenetic evolution. In the quartet case, we…
We propose a principled method for autoencoding with random forests. Our strategy builds on foundational results from nonparametric statistics and spectral graph theory to learn a low-dimensional embedding of the model that optimally…
We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…
We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…
In previous papers of this series, we presented a formalism able to account for both statistical equilibrium of a multilevel atom and coherent and incoherent scatterings (partial redistribution). aims: This paper provides theoretical…
We consider a random model for directed graphs whereby an arc is placed from one vertex to another with a prescribed probability which may vary from arc to arc. Using perturbation bounds as well as Chernoff inequalities, we show that the…
Systems out of equilibrium, in stationary as well as in nonstationary regimes, display a linear response to energy impulses simply expressed as the sum of two specific temporal correlation functions. There is a natural interpretation of…
Starting from any graph on $\{1, \ldots, n\}$, consider the Markov chain where at each time-step a uniformly chosen vertex is disconnected from all of its neighbors and reconnected to another uniformly chosen vertex. This Markov chain has a…
A non-local model describing the growth of a tree-like transportation network with given allocation rules is proposed. In this model we focus on tree like networks, and the network transports the very resource it needs to build itself. Some…
Recent interest in the external validity of prediction models (i.e., the problem of different train and test distributions, known as dataset shift) has produced many methods for finding predictive distributions that are invariant to dataset…