We say that a graph is connected if there is a path edges between any pair of vertices. Random graph Erd os-R enyi with n vertices is obtained by connecting each pair of vertex with probability pn 2 (0; 1) independently ...

We propose a new methodology to estimate the probability of successful transmissions for random access scheduling in wireless networks, in particular those using Carrier Sense Multiple Access (CSMA). Instead of focusing ...

One of the main consequences of habitat loss and fragmentation is the increase in patch isolation and the consequent decrease in landscape connectivity. In this context, species persistence depends on their responses to ...

We study the firing rate properties of a cellular automaton model for a neuronal network with chemical synapses. We propose a simple mechanism in which the nonlocal connections are included, through electrical and chemical ...

In this paper, we examined the connection between quantum systems’ indistinguishability and signed (or negative) probabilities. We do so by first introducing a measure-theoretic definition of signed probabilities inspired ...

Connectivity among marine populations plays a fundamental role in the dynamic of metapopulations and communities. Moreover, genetic connectivity is important for the evolutionary history and adaptive capability of species ...

This paper analyzes concepts of independence and assumptions of convexity in the theory of sets of probability distributions. The starting point is Kyburg and Pittarelli's discussion of "convex Bayesianism" (in particular ...

Kuznetsov independence of variables X and Y means that, for any pair of bounded functions f(X)f(X) and g(Y)g(Y), E[f(X)g(Y)]=E[f(X)]⊠E[g(Y)]E[f(X)g(Y)]=E[f(X)]⊠E[g(Y)], where E[⋅]E[⋅] denotes interval-valued expectation ...