Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userGeneralization of Effective Conductance Centrality for Egonetworks
65
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study the popular centrality measure known as effective conductance or in some circles as information centrality. This is an important notion of centrality for undirected networks, with many applications, e.g., for random walks, electrical resistor networks, epidemic spreading, etc. In this paper, we first reinterpret this measure in terms of modulus (energy) of families of walks on the network. This modulus centrality measure coincides with the effective conductance measure on simple undirected networks, and extends it to much more general situations, e.g., directed networks as well. Secondly, we study a variation of this modulus approach in the egocentric network paradigm. Egonetworks are networks formed around a focal node (ego) with a specific order of neighborhoods. We propose efficient analytical and approximate methods for computing these measures on both undirected and directed networks. Finally, we describe a simple method inspired by the modulus point-of-view, called shell degree, which proved to be a useful tool for network science.
rate research
Read More
We provide a method to correct the observed azimuthal anisotropy in heavy-ion collisions for the event plane resolution in a wide centrality bin. This new procedure is especially useful for rare particles, such as Omega baryons and J/psi mesons, which are difficult to measure in small intervals of centrality. Based on a Monte Carlo calculation with simulated v_2 and multiplicity, we show that some of the commonly used methods have a bias of up to 15%.
The ideal gas law of physics and chemistry says that PV = nRT. This law is a statement of the relationship between four variables (P, V, n, and T) that reflect properties of a quantity of gas in a container. The law enables us to make accurate predictions of the value of any one of the four variables from the values of the other three. The symbol R (called the molar gas constant) is the sole parameter or constant of the law. R stands for a fixed number that has been shown through experiments to equal approximately 8.314472. Eight methods are available to analyze the data from a relevant experiment to determine the value of R. These methods are specific instances of eight general methods that scientists use to determine the value(s) of the parameter(s) of a model equation of a relationship between variables. Parameter estimation is one step in the study of a relationship between variables.
We introduce a generalization of Higuchis estimator of the fractal dimension as a new way to characterize the multifractal spectrum of univariate time series. The resulting multifractal Higuchi dimension analysis (MF-HDA) method considers the order-$q$ moments of the partition function provided by the length of the time series graph at different levels of subsampling. The results obtained for different types of stochastic processes as well as real-world examples of word length series from fictional texts demonstrate that MF-HDA provides a reliable estimate of the multifractal spectrum already for moderate time series lengths. Practical advantages as well as disadvantages of the new approach as compared to other state-of-the-art methods of multifractal analysis are discussed, highlighting the particular potentials of MF-HDA to distinguish mono- from multi-fractal dynamics based on relatively short time series.
Uncovering factors underlying the network formation is a long-standing challenge for data mining and network analysis. In particular, the microscopic organizing principles of directed networks are less understood than those of undirected networks. This article proposes a hypothesis named potential theory, which assumes that every directed link corresponds to a decrease of a unit potential and subgraphs with definable potential values for all nodes are preferred. Combining the potential theory with the clustering and homophily mechanisms, it is deduced that the Bi-fan structure consisting of 4 nodes and 4 directed links is the most favored local structure in directed networks. Our hypothesis receives strongly positive supports from extensive experiments on 15 directed networks drawn from disparate fields, as indicated by the most accurate and robust performance of Bi-fan predictor within the link prediction framework. In summary, our main contribution is twofold: (i) We propose a new mechanism for the local organization of directed networks; (ii) We design the corresponding link prediction algorithm, which can not only testify our hypothesis, but also find out direct applications in missing link prediction and friendship recommendation.
Deep neural networks, when optimized with sufficient data, provide accurate representations of high-dimensional functions; in contrast, function approximation techniques that have predominated in scientific computing do not scale well with dimensionality. As a result, many high-dimensional sampling and approximation problems once thought intractable are being revisited through the lens of machine learning. While the promise of unparalleled accuracy may suggest a renaissance for applications that require parameterizing representations of complex systems, in many applications gathering sufficient data to develop such a representation remains a significant challenge. Here we introduce an approach that combines rare events sampling techniques with neural network optimization to optimize objective functions that are dominated by rare events. We show that importance sampling reduces the asymptotic variance of the solution to a learning problem, suggesting benefits for generalization. We study our algorithm in the context of learning dynamical transition pathways between two states of a system, a problem with applications in statistical physics and implications in machine learning theory. Our numerical experiments demonstrate that we can successfully learn even with the compounding difficulties of high-dimension and rare data.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
