Related papers: Comment on `Monte Carlo simulation study of the tw…
Using the theory of Properly Embedded Graphs developed in an earlier work we define an involutory duality on the set labeled non-crossing trees that lifts the obvious duality in the set of unlabeled non-crossing trees. The set of…
Rewrite systems [6, 10, 12] have been widely employing equality saturation [9], which is an optimisation methodology that uses a saturated e-graph to represent all possible sequences of rewrite simultaneously, and then extracts the optimal…
Tree models for rigidity percolation are introduced and solved. A probability vector describes the propagation of rigidity outward from a rigid border. All components of this ``vector order parameter'' are singular at the same rigidity…
A novel variational method is proposed for calculating the percolation threshold, the real-space structure, and the thermodynamical compressibility of a disordered two-dimensional electron liquid. Its high accuracy is verified against prior…
We present a numerical study of topological descriptors of initially Gaussian and scale-free density perturbations evolving via gravitational instability in an expanding universe. We carefully evaluate and avoid numerical contamination in…
The site and bond percolation problems are conventionally studied on (hyper)cubic lattices, which afford straightforward numerical treatments. The recent implementation of efficient simulation algorithms for high-dimensional systems now…
We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…
Gradient boosted decision trees are a popular machine learning technique, in part because of their ability to give good accuracy with small models. We describe two extensions to the standard tree boosting algorithm designed to increase this…
A Monte Carlo study of the late time growth of $L1_2$ ordered domains on a fcc $A_3B$ binary alloy is presented. The energy of the alloy has been modeled by a nearest neighbor interaction Ising hamiltonian. The system exhibits a fourfold…
In many systems consisting of interacting subsystems, the complex interactions between elements can be represented using multilayer networks. However percolation, key to understanding connectivity and robustness, is not trivially…
We investigate the behavior of the moments of the partially transposed reduced density matrix \rho^{T_2}_A in critical quantum spin chains. Given subsystem A as union of two blocks, this is the (matrix) transposed of \rho_A with respect to…
We study phase transition and percolation at criticality for three random graph models on the plane, viz., the homogeneous and inhomogeneous enhanced random connection models (RCM) and the Poisson stick model. These models are built on a…
The Escalator Boxcar Train method (EBT) is a numerical method for structured population models of McKendrick-von Foerster type. Those models consist of a certain class of hyperbolic partial differential equations and describe time evolution…
Cascading failures in complex systems have been studied extensively using two different models: $k$-core percolation and interdependent networks. We combine the two models into a general model, solve it analytically and validate our…
We investigate the applicability of the Condon approximation (i.e. the notion that the diabatic coupling is invariant to geometry) in the context of both electron transfer (ET) and triplet energy transfer (TET) and compare the two cases.…
We prove tight bounds on the site percolation threshold for $k$-uniform hypergraphs of maximum degree $\Delta$ and for $k$-uniform hypergraphs of maximum degree $\Delta$ in which any pair of edges overlaps in at most $r$ vertices. The…
Epoch-wise double descent is the phenomenon where generalisation performance improves beyond the point of overfitting, resulting in a generalisation curve exhibiting two descents under the course of learning. Understanding the mechanisms…
Typed entailment graphs try to learn the entailment relations between predicates from text and model them as edges between predicate nodes. The construction of entailment graphs usually suffers from severe sparsity and unreliability of…
We study a system composed from two interdependent networks A and B, where a fraction of the nodes in network A depends on the nodes of network B and a fraction of the nodes in network B depends on the nodes of network A. Due to the…
This paper introduces Type 2 Tobit Bayesian Additive Regression Trees (TOBART-2). BART can produce accurate individual-specific treatment effect estimates. However, in practice estimates are often biased by sample selection. We extend the…