262 research outputs found
Anomalous behavior of trapping on a fractal scale-free network
It is known that the heterogeneity of scale-free networks helps enhancing the
efficiency of trapping processes performed on them. In this paper, we show that
transport efficiency is much lower in a fractal scale-free network than in
non-fractal networks. To this end, we examine a simple random walk with a fixed
trap at a given position on a fractal scale-free network. We calculate
analytically the mean first-passage time (MFPT) as a measure of the efficiency
for the trapping process, and obtain a closed-form expression for MFPT, which
agrees with direct numerical calculations. We find that, in the limit of a
large network order , the MFPT behaves superlinearly as with an exponent 3/2 much larger than 1, which is in sharp contrast
to the scaling with , previously obtained
for non-fractal scale-free networks. Our results indicate that the degree
distribution of scale-free networks is not sufficient to characterize trapping
processes taking place on them. Since various real-world networks are
simultaneously scale-free and fractal, our results may shed light on the
understanding of trapping processes running on real-life systems.Comment: 6 pages, 5 figures; Definitive version accepted for publication in
EPL (Europhysics Letters
Maximal-entropy random walk unifies centrality measures
In this paper analogies between different (dis)similarity matrices are
derived. These matrices, which are connected to path enumeration and random
walks, are used in community detection methods or in computation of centrality
measures for complex networks. The focus is on a number of known centrality
measures, which inherit the connections established for similarity matrices.
These measures are based on the principal eigenvector of the adjacency matrix,
path enumeration, as well as on the stationary state, stochastic matrix or mean
first-passage times of a random walk. Particular attention is paid to the
maximal-entropy random walk, which serves as a very distinct alternative to the
ordinary random walk used in network analysis.
The various importance measures, defined both with the use of ordinary random
walk and the maximal-entropy random walk, are compared numerically on a set of
benchmark graphs. It is shown that groups of centrality measures defined with
the two random walks cluster into two separate families. In particular, the
group of centralities for the maximal-entropy random walk, connected to the
eigenvector centrality and path enumeration, is strongly distinct from all the
other measures and produces largely equivalent results.Comment: 7 pages, 2 figure
Random walks on the Apollonian network with a single trap
Explicit determination of the mean first-passage time (MFPT) for trapping
problem on complex media is a theoretical challenge. In this paper, we study
random walks on the Apollonian network with a trap fixed at a given hub node
(i.e. node with the highest degree), which are simultaneously scale-free and
small-world. We obtain the precise analytic expression for the MFPT that is
confirmed by direct numerical calculations. In the large system size limit, the
MFPT approximately grows as a power-law function of the number of nodes, with
the exponent much less than 1, which is significantly different from the
scaling for some regular networks or fractals, such as regular lattices,
Sierpinski fractals, T-graph, and complete graphs. The Apollonian network is
the most efficient configuration for transport by diffusion among all
previously studied structure.Comment: Definitive version accepted for publication in EPL (Europhysics
Letters
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs
In this paper, we consider termination of probabilistic programs with
real-valued variables. The questions concerned are:
1. qualitative ones that ask (i) whether the program terminates with
probability 1 (almost-sure termination) and (ii) whether the expected
termination time is finite (finite termination); 2. quantitative ones that ask
(i) to approximate the expected termination time (expectation problem) and (ii)
to compute a bound B such that the probability to terminate after B steps
decreases exponentially (concentration problem).
To solve these questions, we utilize the notion of ranking supermartingales
which is a powerful approach for proving termination of probabilistic programs.
In detail, we focus on algorithmic synthesis of linear ranking-supermartingales
over affine probabilistic programs (APP's) with both angelic and demonic
non-determinism. An important subclass of APP's is LRAPP which is defined as
the class of all APP's over which a linear ranking-supermartingale exists.
Our main contributions are as follows. Firstly, we show that the membership
problem of LRAPP (i) can be decided in polynomial time for APP's with at most
demonic non-determinism, and (ii) is NP-hard and in PSPACE for APP's with
angelic non-determinism; moreover, the NP-hardness result holds already for
APP's without probability and demonic non-determinism. Secondly, we show that
the concentration problem over LRAPP can be solved in the same complexity as
for the membership problem of LRAPP. Finally, we show that the expectation
problem over LRAPP can be solved in 2EXPTIME and is PSPACE-hard even for APP's
without probability and non-determinism (i.e., deterministic programs). Our
experimental results demonstrate the effectiveness of our approach to answer
the qualitative and quantitative questions over APP's with at most demonic
non-determinism.Comment: 24 pages, full version to the conference paper on POPL 201
Trapping in scale-free networks with hierarchical organization of modularity
A wide variety of real-life networks share two remarkable generic topological
properties: scale-free behavior and modular organization, and it is natural and
important to study how these two features affect the dynamical processes taking
place on such networks. In this paper, we investigate a simple stochastic
process--trapping problem, a random walk with a perfect trap fixed at a given
location, performed on a family of hierarchical networks that exhibit
simultaneously striking scale-free and modular structure. We focus on a
particular case with the immobile trap positioned at the hub node having the
largest degree. Using a method based on generating functions, we determine
explicitly the mean first-passage time (MFPT) for the trapping problem, which
is the mean of the node-to-trap first-passage time over the entire network. The
exact expression for the MFPT is calculated through the recurrence relations
derived from the special construction of the hierarchical networks. The
obtained rigorous formula corroborated by extensive direct numerical
calculations exhibits that the MFPT grows algebraically with the network order.
Concretely, the MFPT increases as a power-law function of the number of nodes
with the exponent much less than 1. We demonstrate that the hierarchical
networks under consideration have more efficient structure for transport by
diffusion in contrast with other analytically soluble media including some
previously studied scale-free networks. We argue that the scale-free and
modular topologies are responsible for the high efficiency of the trapping
process on the hierarchical networks.Comment: Definitive version accepted for publication in Physical Review
Stochastic Invariants for Probabilistic Termination
Termination is one of the basic liveness properties, and we study the
termination problem for probabilistic programs with real-valued variables.
Previous works focused on the qualitative problem that asks whether an input
program terminates with probability~1 (almost-sure termination). A powerful
approach for this qualitative problem is the notion of ranking supermartingales
with respect to a given set of invariants. The quantitative problem
(probabilistic termination) asks for bounds on the termination probability. A
fundamental and conceptual drawback of the existing approaches to address
probabilistic termination is that even though the supermartingales consider the
probabilistic behavior of the programs, the invariants are obtained completely
ignoring the probabilistic aspect.
In this work we address the probabilistic termination problem for
linear-arithmetic probabilistic programs with nondeterminism. We define the
notion of {\em stochastic invariants}, which are constraints along with a
probability bound that the constraints hold. We introduce a concept of {\em
repulsing supermartingales}. First, we show that repulsing supermartingales can
be used to obtain bounds on the probability of the stochastic invariants.
Second, we show the effectiveness of repulsing supermartingales in the
following three ways: (1)~With a combination of ranking and repulsing
supermartingales we can compute lower bounds on the probability of termination;
(2)~repulsing supermartingales provide witnesses for refutation of almost-sure
termination; and (3)~with a combination of ranking and repulsing
supermartingales we can establish persistence properties of probabilistic
programs.
We also present results on related computational problems and an experimental
evaluation of our approach on academic examples.Comment: Full version of a paper published at POPL 2017. 20 page
Euclidean Distances, soft and spectral Clustering on Weighted Graphs
We define a class of Euclidean distances on weighted graphs, enabling to
perform thermodynamic soft graph clustering. The class can be constructed form
the "raw coordinates" encountered in spectral clustering, and can be extended
by means of higher-dimensional embeddings (Schoenberg transformations).
Geographical flow data, properly conditioned, illustrate the procedure as well
as visualization aspects.Comment: accepted for presentation (and further publication) at the ECML PKDD
2010 conferenc
Rupture by damage accumulation in rocks
The deformation of rocks is associated with microcracks nucleation and
propagation, i.e. damage. The accumulation of damage and its spatial
localization lead to the creation of a macroscale discontinuity, so-called
"fault" in geological terms, and to the failure of the material, i.e. a
dramatic decrease of the mechanical properties as strength and modulus. The
damage process can be studied both statically by direct observation of thin
sections and dynamically by recording acoustic waves emitted by crack
propagation (acoustic emission). Here we first review such observations
concerning geological objects over scales ranging from the laboratory sample
scale (dm) to seismically active faults (km), including cliffs and rock masses
(Dm, hm). These observations reveal complex patterns in both space (fractal
properties of damage structures as roughness and gouge), time (clustering,
particular trends when the failure approaches) and energy domains (power-law
distributions of energy release bursts). We use a numerical model based on
progressive damage within an elastic interaction framework which allows us to
simulate these observations. This study shows that the failure in rocks can be
the result of damage accumulation
A simple genetic algorithm for calibration of stochastic rock discontinuity networks
Este artículo propone un método para llevar a cabo la calibración de las familias de discontinuidades en macizos rocosos. We present a novel approach for calibration of stochastic discontinuity network parameters based on genetic algorithms (GAs). To validate the approach, examples of application of the method to cases with known parameters of the original Poisson discontinuity network are presented. Parameters of the model are encoded as chromosomes using a binary representation, and such chromosomes evolve as successive generations of a randomly generated initial population, subjected to GA operations of selection, crossover and mutation. Such back-calculated parameters are employed to make assessments about the inference capabilities of the model using different objective functions with different probabilities of crossover and mutation. Results show that the predictive capabilities of GAs significantly depend on the type of objective function considered; and they also show that the calibration capabilities of the genetic algorithm can be acceptable for practical engineering applications, since in most cases they can be expected to provide parameter estimates with relatively small errors for those parameters of the network (such as intensity and mean size of discontinuities) that have the strongest influence on many engineering applications
- …