Related papers: A Phase Transition and Stochastic Domination in Pi…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
We introduce an evolving network model in which a new node attaches to a randomly selected target node and also to each of its neighbors with probability $p$. The resulting network is sparse for $p<\frac{1}{2}$ and dense (average degree…
The power domination problem seeks to determine the minimum number of phasor measurement units (PMUs) needed to monitor an electric power network. We introduce random sensor failure before the power domination process occurs and call this…
In this report, we present a formal approach that addresses the problem of emergence of phase transitions in stochastic and attractive nonlinear threshold Boolean automata networks. Nonlinear networks considered are informally defined on…
Transitions between multiple stable states of nonlinear systems are ubiquitous in physics, chemistry, and beyond. Two types of behaviors are usually seen as mutually exclusive: unpredictable noise-induced transitions and predictable…
We study the statistical behaviour of reasoning probes in a stylized model of looped reasoning, given by Boolean circuits whose computational graph is a perfect $\nu$-ary tree ($\nu\ge 2$) and whose output is appended to the input and fed…
We consider Mobile Ad-hoc Network (MANET) with transmitters located according to a Poisson point in the Euclidean plane, slotted Aloha Medium Access (MAC) protocol and the so-called outage scenario, where a successful transmission requires…
Across many fields, a problem of interest is to predict the transition rates between nodes of a network, given limited stationary state and dynamical information. We give a solution using the principle of Maximum Caliber. We find the…
In this work, we study the topological transition on the associated networks in a model proposed by Saeedian et al. (Scientific Reports 2019 9:9726), which considers a coupled dynamics of node and link states. Our goal was to better…
The Voter model is a well-studied stochastic process that models the invasion of a novel trait $A$ (e.g., a new opinion, social meme, genetic mutation, magnetic spin) in a network of individuals (agents, people, genes, particles) carrying…
We present a study of exclusion process on a peculiar topology of network with two intersected lanes, competing for the particles in a reservoir with finite capacity. To provide a theoretical ground for our findings, we exploit mean-field…
We study emergent dynamics of the discrete Cucker-Smale (in short, DCS) model with randomly switching network topologies. For this, we provide a sufficient framework leading to the stochastic flocking with probability one. Our sufficient…
Weak multiplex percolation generalizes percolation to multi-layer networks, represented as networks with a common set of nodes linked by multiple types (colors) of edges. We report a novel discontinuous phase transition in this problem.…
It is an increasingly important problem to study conditions on the structure of a network that guarantee a given behavior for its underlying dynamical system. In this paper we report that a Boolean network may fall within the chaotic…
We study the behavior of epidemic routing in a delay tolerant network as a function of node density. Focusing on the probability of successful delivery to a destination within a deadline (PS), we show that PS experiences a phase transition…
We study the following game on a finite graph $G = (V, E)$. At the start, each edge is assigned an integer $n_e \ge 0$, $n = \sum_{e \in E} n_e$. In round $t$, $1 \le t \le n$, a uniformly random vertex $v \in V$ is chosen and one of the…
We show how the theory of the critical behaviour of $d$-dimensional polymer networks of arbitrary topology can be generalized to the case of networks confined by hyperplanes. This in particular encompasses the case of a single polymer chain…
We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts…
In this paper we study the existence phase transition of scale invariant random fractal models. We determine the exact value of the critical point of this phase transition for all models satisfying some weak assumptions. In addition, we…
In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power…