Related papers: Random Sequential Renormalization of Networks I: A…
We study the statistical behavior under random sequential renormalization(RSR) of several network models including Erd"os R'enyi (ER) graphs, scale-free networks and an annealed model (AM) related to ER graphs. In RSR the network is locally…
We study random two-dimensional spanning forests in the plane that can be viewed both in the discrete case and in their appropriately taken scaling limits as a uniformly chosen spanning tree with some Poissonian deletion of edges or points.…
The renormalization group (RG) is a powerful theoretical framework developed to consistently transform the description of configurations of systems with many degrees of freedom, along with the associated model parameters and coupling…
Layer normalization (LayerNorm) has been successfully applied to various deep neural networks to help stabilize training and boost model convergence because of its capability in handling re-centering and re-scaling of both inputs and weight…
This thesis presents Regenerative Rejection Sampling (RRS), a novel approximate sampling algorithm inspired by classical Rejection Sampling and Markov Chain Monte Carlo methods. The method constructs a continuous-time regenerative process…
Network growth models that embody principles such as preferential attachment and local attachment rules have received much attention over the last decade. Among various approaches, random walks have been leveraged to capture such…
Distribution shift severely degrades the performance of deep forecasting models. While this issue is well-studied for individual time series, it remains a significant challenge in the spatio-temporal domain. Effective solutions like…
On the lattice, a renormalization group (RG) flow for two-dimensional partition functions expressed as a tensor network can be obtained using the tensor network renormalization (TNR) algorithm [G. Evenbly, G. Vidal, Phys. Rev. Lett. 115…
Networks are widely used in many fields for their powerful ability to provide vivid representations of relationships between variables. However, many of them may be corrupted by experimental noise or inappropriate network inference methods…
The regularized random forest (RRF) was recently proposed for feature selection by building only one ensemble. In RRF the features are evaluated on a part of the training data at each tree node. We derive an upper bound for the number of…
Given an ensemble of randomized regression trees, it is possible to restructure them as a collection of multilayered neural networks with particular connection weights. Following this principle, we reformulate the random forest method of…
A generalization of the Renormalization Group, which describes order-parameter fluctuations in finite systems, is developed in the specific context of percolation. This ``Stochastic Renormalization Group'' (SRG) expresses statistical…
Cycles, which can be found in many different kinds of networks, make the problems more intractable, especially when dealing with dynamical processes on networks. On the contrary, tree networks in which no cycle exists, are simplifications…
We explore how minimal neural networks can invert the renormalization group (RG) coarse-graining procedure in the two-dimensional Ising model, effectively ``dreaming up'' microscopic configurations from coarse-grained states. This task -…
Complex networks can model a range of different systems, from the human brain to social connections. Some of those networks have a large number of nodes and links, making it impractical to analyze them directly. One strategy to simplify…
D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a…
Random forest (RF) is one of the most popular methods for estimating regression functions. The local nature of the RF algorithm, based on intra-node means and variances, is ideal when errors are i.i.d. For dependent error processes like…
For arbitrary networks of random masses connected by random springs, we define a general strong disorder real-space renormalization (RG) approach that generalizes the procedures introduced previously by Hastings [Phys. Rev. Lett. 90, 148702…
Strong Disorder Renormalization is an energy-based renormalization that leads to a complicated renormalized topology for the surviving clusters as soon as $d>1$. In this paper, we propose to include Strong Disorder Renormalization ideas…
Trees have long been used as a graphical representation of species relationships. However complex evolutionary events, such as genetic reassortments or hybrid speciations which occur commonly in viruses, bacteria and plants, do not fit into…