Search

Along recent decades, an intensive worldwide research activity is focusing both black holes and cosmos (e.g. the dark-energy phenomenon) on the basis of entropic approaches. The Boltzmann-Gibbs-based Bekenstein-Hawking entropy $S_{BH}\propto A/l_P^2$ ($A \equiv$ area; $l_P \equiv$ Planck length) systematically plays a crucial theoretical role although it has a serious drawback, namely that it violates the thermodynamic extensivity of spatially-three-dimensional systems. Still, its intriguing area dependence points out the relevance of considering the form $W(N)\sim \mu^{N^\gamma}\;\;(\mu >1;\gamma >0)$, $W$ and $N$ respectively being the total number of microscopic possibilities and the number of components; $\gamma=1$ corresponds to standard Boltzmann-Gibbs (BG) statistical mechanics. For this $W(N)$ asymptotic behavior, we introduce here, on a group-theory basis, the entropic functional $S_{\alpha,\gamma}=k \Bigl[ \frac{\ln \Sigma_{i=1}^W p_i^\alpha}{1-\alpha} \Bigr]^{\frac{1}{\gamma}} \;(\alpha \in \mathbb{R};\,S_{1,1}=S_{BG}\equiv-k\sum_{i=1}^W p_i \ln p_i)$. This functional simultaneously is {\it extensive} (as required by thermodynamics) and {\it composable} (as required for logic consistency), $\forall (\alpha,\gamma)$. We further show that $(\alpha,\gamma)=(1,2/3)$ satisfactorily agrees with cosmological data measuring neutrinos, Big Bang nucleosynthesis and the relic abundance of cold dark matter particles, as well as dynamical and geometrical cosmological data sets., Comment: 5 pages, 2 figures

Monte Carlo rendering of translucent objects with heterogeneous scattering properties is often expensive both in terms of memory and computation. If we do path tracing and use a high dynamic range lighting environment, the rendering becomes computationally heavy. We propose a compact and efficient neural method for representing and rendering the appearance of heterogeneous translucent objects. The neural representation function resembles a bidirectional scattering-surface reflectance distribution function (BSSRDF). However, conventional BSSRDF models assume a planar half-space medium and only surface variation of the material, which is often not a good representation of the appearance of real-world objects. Our method represents the BSSRDF of a full object taking its geometry and heterogeneities into account. This is similar to a neural radiance field, but our representation works for an arbitrary distant lighting environment. In a sense, we present a version of neural precomputed radiance transfer that captures all-frequency relighting of heterogeneous translucent objects. We use a multi-layer perceptron (MLP) with skip connections to represent the appearance of an object as a function of spatial position, direction of observation, and direction of incidence. The latter is considered a directional light incident across the entire non-self-shadowed part of the object. We demonstrate the ability of our method to store highly complex materials while having high accuracy when comparing to reference images of the represented object in unseen lighting environments. As compared with path tracing of a heterogeneous light scattering volume behind a refractive interface, our method more easily enables importance sampling of the directions of incidence and can be integrated into existing rendering frameworks while achieving interactive frame rates.

At what level does selective pressure effectively act? When considering the reproductive dynamics of interacting and mutating agents, it has long been debated whether selection is better understood by focusing on the individual or if hierarchical selection emerges as a consequence of joint adaptation. Despite longstanding efforts in theoretical ecology there is still no consensus on this fundamental issue, most likely due to the difficulty in obtaining adequate data spanning sufficient number of generations and the lack of adequate tools to quantify the effect of hierarchical selection. Here we capitalise on recent advances in information-theoretic data analysis to advance this state of affairs by investigating the emergence of high-order structures -- such as groups of species -- in the collective dynamics of the Tangled Nature model of evolutionary ecology. Our results show that evolutionary dynamics can lead to clusters of species that act as a selective group, that acquire information-theoretic agency. Overall, our findings provide quantitative evidence supporting the relevance of high-order structures in evolutionary ecology, which can emerge even from relatively simple processes of adaptation and selection.

Neural reflectance models are capable of reproducing the spatially-varying appearance of many real-world materials at different scales. Unfortunately, existing techniques such as NeuMIP have difficulties handling materials with strong shadowing effects or detailed specular highlights. In this paper, we introduce a neural appearance model that offers a new level of accuracy. Central to our model is an inception-based core network structure that captures material appearances at multiple scales using parallel-operating kernels and ensures multi-stage features through specialized convolution layers. Furthermore, we encode the inputs into frequency space, introduce a gradient-based loss, and employ it adaptive to the progress of the learning phase. We demonstrate the effectiveness of our method using a variety of synthetic and real examples.

Cloud K-SVD is a dictionary learning algorithm that can train at multiple nodes and hereby produce a mutual dictionary to represent low-dimensional geometric structures in image data. We present a novel application of the algorithm as we use it to recover both noiseless and noisy images from overlapping patches. We implement a node network in Kubernetes using Docker containers to facilitate Cloud K-SVD. Results show that Cloud K-SVD can recover images approximately and remove quantifiable amounts of noise from benchmark gray-scaled images without sacrificing accuracy in recovery; we achieve an SSIM index of 0.88, 0.91 and 0.95 between clean and recovered images for noise levels ($\mu$ = 0, $\sigma^{2}$ = 0.01, 0.005, 0.001), respectively, which is similar to SOTA in the field. Cloud K-SVD is evidently able to learn a mutual dictionary across multiple nodes and remove AWGN from images. The mutual dictionary can be used to recover a specific image at any of the nodes in the network.

The frequency and magnitude of weather extreme events have increased significantly during the past few years in response to anthropogenic climate change. However, global statistical characteristics and underlying physical mechanisms are still not fully understood. Here, we adopt a statistical physics and probability theory based method to investigate the nature of extreme weather events, particularly the statistics of the day-to-day air temperature differences. These statistical measurements reveal that the distributions of the magnitudes of the extreme events satisfy a universal \textit{Gumbel} distribution, while the waiting time of those extreme events is governed by a universal \textit{Gamma} function. Further finite-size effects analysis indicates robust scaling behaviours. We additionally unveil that the cumulative distribution of logarithmic waiting times between the record events follows an \textit{Exponential} distribution and that the evolution of this climate system is directional where the underlying dynamics are related to a decelerating release of tension. The universal scaling laws are remarkably stable and unaffected by global warming. Counterintuitively, unlike as expected for record dynamics, we find that the number of quakes of the extreme temperature variability does not decay as one over time but with deviations relevant to large-scale climate extreme events. Our theoretical framework provides a fresh perspective on the linkage of universality, scaling, and climate systems. The findings throw light on the nature of the weather variabilities and could guide us to better forecast extreme events.

This report presents a comprehensive view of our vision on the development path of the human-machine symbiotic art creation. We propose a classification of the creative system with a hierarchy of 5 classes, showing the pathway of creativity evolving from a mimic-human artist (Turing Artists) to a Machine artist in its own right. We begin with an overview of the limitations of the Turing Artists then focus on the top two-level systems, Machine Artists, emphasizing machine-human communication in art creation. In art creation, it is necessary for machines to understand humans' mental states, including desires, appreciation, and emotions, humans also need to understand machines' creative capabilities and limitations. The rapid development of immersive environment and further evolution into the new concept of metaverse enable symbiotic art creation through unprecedented flexibility of bi-directional communication between artists and art manifestation environments. By examining the latest sensor and XR technologies, we illustrate the novel way for art data collection to constitute the base of a new form of human-machine bidirectional communication and understanding in art creation. Based on such communication and understanding mechanisms, we propose a novel framework for building future Machine artists, which comes with the philosophy that a human-compatible AI system should be based on the "human-in-the-loop" principle rather than the traditional "end-to-end" dogma. By proposing a new form of inverse reinforcement learning model, we outline the platform design of machine artists, demonstrate its functions and showcase some examples of technologies we have developed. We also provide a systematic exposition of the ecosystem for AI-based symbiotic art form and community with an economic model built on NFT technology. Ethical issues for the development of machine artists are also discussed.

Neuronal network computation and computation by avalanche supporting networks are of interest to the fields of physics, computer science (computation theory as well as statistical or machine learning) and neuroscience. Here we show that computation of complex Boolean functions arises spontaneously in threshold networks as a function of connectivity and antagonism (inhibition), computed by logic automata (motifs) in the form of computational cascades. We explain the emergent inverse relationship between the computational complexity of the motifs and their rank-ordering by function probabilities due to motifs, and its relationship to symmetry in function space. We also show that the optimal fraction of inhibition observed here supports results in computational neuroscience, relating to optimal information processing., Comment: 11 pages, 7 figures, 1 table, includes supplementary information

Battiston et al. (arXiv:2110.06023) provide a comprehensive overview of how investigations of complex systems should take into account interactions between more than two elements, which can be modelled by hypergraphs and studied via topological data analysis. Following a separate line of enquiry, a broad literature has developed information-theoretic tools to characterize high-order interdependencies from observed data. While these could seem to be competing approaches aiming to address the same question, in this correspondence we clarify that this is not the case, and that a complete account of higher-order phenomena needs to embrace both.

Emergence is a profound subject that straddles many scientific disciplines, including the formation of galaxies and how consciousness arises from the collective activity of neurons. Despite the broad interest that exists on this concept, the study of emergence has suffered from a lack of formalisms that could be used to guide discussions and advance theories. Here we summarise, elaborate on, and extend a recent formal theory of causal emergence based on information decomposition, which is quantifiable and amenable to empirical testing. This theory relates emergence with information about a system's temporal evolution that cannot be obtained from the parts of the system separately. This article provides an accessible but rigorous introduction to the framework, discussing the merits of the approach in various scenarios of interest. We also discuss several interpretation issues and potential misunderstandings, while highlighting the distinctive benefits of this formalism., Comment: 8 pages, 2 figures

We present a brief review of power laws and correlation functions as measures of criticality and the relation between them. By comparing phenomenology from rain, brain and the forest fire model we discuss the relevant features of self-organisation to the vicinity about a critical state. We conclude that organisation to a region of extended correlations and approximate power laws may be behaviour of interest shared between the three considered systems., Comment: 11 pages, 2 figures

Modeling the geometry and the appearance of knitted fabrics has been challenging due to their complex geometries and interactions with light. Previous surface-based models have difficulties capturing fine-grained knit geometries; Micro-appearance models, on the other hands, typically store individual cloth fibers explicitly and are expensive to be generated and rendered. Further, neither of the models have been matched the photographs to capture both the reflection and the transmission of light simultaneously. In this paper, we introduce an efficient technique to generate knit models with user-specified knitting patterns. Our model stores individual knit plies with fiber-level detailed depicted using normal and tangent mapping. We evaluate our generated models using a wide array of knitting patterns. Further, we compare qualitatively renderings to our models to photos of real samples.

We revisit the pairing model of state spaces with new emergent states introduced in J. Phys. A: Math. Theor. 51 375002, 2018. We facilitate our analysis by introducing a simplified pairing model consisting of balls able to form pairs but without any internal structure. For both the simplified and the original model we compute exactly the probability distribution for observing a state with $n_p$ pairs. We show this distribution satisfies a large deviation principle with speed $n \ln(n)$. We present closed form expressions for a variety of statistical quantities including moments and marginal distributions.

We study the spread of Covid-19 across neighbourhoods of cities in the developing world and find that small numbers of neighbourhoods account for a majority of cases (k-index~0.7). We also find that the countrywide distribution of cases across states/provinces in these nations also displays similar inequality, indicating self-similarity across scales. Neighbourhoods with slums are found to contain the highest density of cases across all cities under consideration, revealing that slums constitute the most at-risk urban locations in this epidemic. We present a stochastic network model to study the spread of a respiratory epidemic through physically proximate and accidental daily human contacts in a city, and simulate outcomes for a city with two kinds of neighbourhoods - slum and non-slum. The model reproduces observed empirical outcomes for a broad set of parameter values - reflecting the potential validity of these findings for epidemic spread in general, especially across cities of the developing world. We also find that distribution of cases becomes less unequal as the epidemic runs its course, and that both peak and cumulative caseloads are worse for slum neighbourhoods than non-slums at the end of an epidemic. Large slums in the developing world therefore contain the most vulnerable populations in an outbreak, and the continuing growth of metropolises in Asia and Africa presents significant challenges for future respiratory outbreaks from perspectives of public health and socioeconomic equity., Comment: 15 pages, 4 figures

We study the distribution of neighborhoods across a set of 12 global cities and find that the distribution of neighborhood sizes follows exponential decay across all cities under consideration. We are able to analytically show that this exponential distribution of neighbourhood sizes is consistent with the observed Zipf's Law for city sizes. We attempt to explain the emergence of exponential decay in neighbourhood size using a model of neighborhood dynamics where migration into and movement within the city are mediated by wealth. We find that, as observed empirically, the model generates exponential decay in neighborhood size distributions for a range of parameter specifications. The use of a comparative wealth-based metric to assess the relative attractiveness of a neighborhood combined with a stringent affordability threshold in mediating movement within the city are found to be necessary conditions for the the emergence of the exponential distribution. While an analytical treatment is difficult due to the globally coupled dynamics, we use a simple two-neighbourhood system to illustrate the precise dynamics yielding equilibrium non-equal neighborhood size distributions., Comment: 13 pages, 4 figures, 2 tables

Although Monte Carlo path tracing is a simple and effective algorithm to synthesize photo-realistic images, it is often very slow to converge to noise-free results when involving complex global illumination. One of the most successful variance-reduction techniques is path guiding, which can learn better distributions for importance sampling to reduce pixel noise. However, previous methods require a large number of path samples to achieve reliable path guiding. We present a novel neural path guiding approach that can reconstruct high-quality sampling distributions for path guiding from a sparse set of samples, using an offline trained neural network. We leverage photons traced from light sources as the input for sampling density reconstruction, which is highly effective for challenging scenes with strong global illumination. To fully make use of our deep neural network, we partition the scene space into an adaptive hierarchical grid, in which we apply our network to reconstruct high-quality sampling distributions for any local region in the scene. This allows for highly efficient path guiding for any path bounce at any location in path tracing. We demonstrate that our photon-driven neural path guiding method can generalize well on diverse challenging testing scenes that are not seen in training. Our approach achieves significantly better rendering results of testing scenes than previous state-of-the-art path guiding methods., Comment: Keywords: computer graphics, rendering, path tracing, path guiding, machine learning, neural networks, denoising, reconstruction

Record Dynamics (RD) deals with complex systems evolving through a sequence of metastable stages. These are macroscopically distinguishable and appear stationary, except for the sudden and rapid changes, called quakes, which induce the transitions from one stage to the next. This phenomenology is well known in physics as "physical aging", but from the vantage point of RD the evolution of a class of systems of physical, biological and cultural origin is rooted in a hierarchically structured configuration space and can therefore be analyzed by similar statistical tools. This colloquium paper strives to present in a coherent fashion methods and ideas that have gradually evolved over time. To this end, it first describes the differences and similarities between RD and two widespread paradigms of complex dynamics, Self Organized Criticality and Continuous Time Random Walks. It then outlines the Poissonian nature of records events in white noise time series, and connects it to the statistics of quakes in metastable hierarchical systems, arguing that the relaxation effects of quakes can generally be described by power laws unrelated to criticality. Several different applications of RD have been developed over the years. Some of these are described, showinghe basic RD hypothesis, the log time homogeneity of quake dynamics, can be empirically verified in a given context. The discussion summarizes the paper and briefly mentions applications not discussed in detail. Finally, the outlook points to possible improvements and to new areas of research where RG could be of use.

Amongst the numerous models introduced with SOC, the Forest Fire Model (FFM) is particularly attractive for its close relationship to stochastic spreading, which is central to the study of systems as diverse as epidemics, rumours, or indeed, fires. However, since its introduction, the nature of the model's scale invariance has been controversial, and the lack of scaling observed in many studies diminished its theoretical attractiveness. In this study, we analyse the behaviour of the tree density, the average cluster size and the largest cluster and show that the model could be of high practical relevance for the activation dynamics seen in brain and rain studies. From this perspective, its peculiar scaling properties should be regarded as an asset rather than a limitation., Comment: 18 pages, 10 figures

Recently, deep learning-based denoising approaches have led to dramatic improvements in low sample-count Monte Carlo rendering. These approaches are aimed at path tracing, which is not ideal for simulating challenging light transport effects like caustics, where photon mapping is the method of choice. However, photon mapping requires very large numbers of traced photons to achieve high-quality reconstructions. In this paper, we develop the first deep learning-based method for particle-based rendering, and specifically focus on photon density estimation, the core of all particle-based methods. We train a novel deep neural network to predict a kernel function to aggregate photon contributions at shading points. Our network encodes individual photons into per-photon features, aggregates them in the neighborhood of a shading point to construct a photon local context vector, and infers a kernel function from the per-photon and photon local context features. This network is easy to incorporate in many previous photon mapping methods (by simply swapping the kernel density estimator) and can produce high-quality reconstructions of complex global illumination effects like caustics with an order of magnitude fewer photons compared to previous photon mapping methods.

We create a network model to study the spread of an epidemic through physically proximate and accidental daily human contacts in a city, and simulate outcomes for two kinds of agents - poor and non-poor. Under non-intervention, peak caseload is maximised, but no differences are observed in infection rates across poor and non-poor. Introducing interventions to control spread, peak caseloads are reduced, but both cumulative infection rates and current infection rates are systematically higher for the poor than for non-poor, across all scenarios. Larger populations, higher fractions of poor, and longer durations of intervention are found to progressively worsen outcomes for the poor; and these are of particular concern for economically vulnerable populations in cities of the developing world. Addressing these challenges requires a deeper, more rigorous understanding of the relationships between structural poverty and epidemy, as well as effective utilization of extant community level infrastructure for primary care in developing cities. Finally, improving iniquitous outcomes for the poor creates better outcomes for the whole population, including the non-poor., Comment: 22 pages, 6 figures, 2 tables

The broad concept of emergence is instrumental in various of the most challenging open scientific questions -- yet, few quantitative theories of what constitutes emergent phenomena have been proposed. This article introduces a formal theory of causal emergence in multivariate systems, which studies the relationship between the dynamics of parts of a system and macroscopic features of interest. Our theory provides a quantitative definition of downward causation, and introduces a complementary modality of emergent behaviour -- which we refer to as causal decoupling. Moreover, the theory allows practical criteria that can be efficiently calculated in large systems, making our framework applicable in a range of scenarios of practical interest. We illustrate our findings in a number of case studies, including Conway's Game of Life, Reynolds' flocking model, and neural activity as measured by electrocorticography., Comment: 18 pages, 7 figures