Related papers: Transition time asymptotics of queue-based activat…
The theory of the asymptotic manipulation of pure bipartite quantum systems can be considered completely understood: The rates at which bipartite entangled states can be asymptotically transformed into each other are fully determined by a…
We introduce a non-equilibrium discrete-time random walk model on multiplex networks, in which at each time step the walker first undergoes a random jump between neighboring nodes in the same layer, and then tries to hop from one node to…
We study the mean time for a random walk to traverse between two arbitrary sites of the Erdos-Renyi random graph. We develop an effective medium approximation that predicts that the mean first-passage time between pairs of nodes, as well as…
In this thesis, we propose and analyze a multi-server model that captures a performance trade-off between centralized and distributed processing. In our model, a fraction $p$ of an available resource is deployed in a centralized manner…
We consider a Generalised Jackson Network with finitely many servers, a renewal input and $i.i.d.$ service times at each queue. We assume the network to be stable and, in addition, the distribution of the inter-arrival times to have…
We propose experimentally feasible ways to probe universal features of absorbing phase transitions from two different approaches, both based on numerical validations. On one hand, we numerically study a probability distribution of…
In this work and the supporting Parts II [2] and III [3], we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over networks. We…
We study a mean field model of a complex network, focusing on edge and triangle densities. Our first result is the derivation of a variational characterization of the entropy density, compatible with the infinite node limit. We then…
We analyze opportunistic schemes for transmission scheduling from one of $n$ homogeneous queues whose channel states fluctuate independently. Considered schemes consist of the LCQ policy, which transmits from a longest connected queue in…
Motivated by an optimal visiting problem, we study a switching mean-field game on a network, where both a decisional and a switching time-variable is at disposal of the agents for what concerns, respectively, the instant to decide and the…
The optimal tradeoff between average service cost rate, average utility rate, and average delay is addressed for a state dependent M/M/1 queueing model, with controllable queue length dependent service rates and arrival rates. For a model…
The Majority Rule is applied to a topology that consists of two coupled random networks, thereby mimicking the modular structure observed in social networks. We calculate analytically the asymptotic behaviour of the model and derive a phase…
Transition State Theory is a central cornerstone in reaction dynamics. Its key step is the identification of a dividing surface that is crossed only once by all reactive trajectories. This assumption is often badly violated, especially when…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks are characterized by the fact that the one-step transition probabilities are functions of the…
We suggest a model for data losses in a single node of a packet-switched network (like the Internet) which reduces to one-dimensional discrete random walks with unusual boundary conditions. The model shows critical behavior with an abrupt…
The dynamical organization in the presence of noise of a Boolean neural network with random connections is analyzed. For low levels of noise, the system reaches a stationary state in which the majority of its elements acquire the same…
The time evolution of the thermally activated decay rates is considered. This evolution is of particular importance for the recent nanoscale experiments discussed in the literature, where the potential barrier is relatively low (or the…
To provide a phenomenological theory for the various interesting transitions in restructuring networks we employ a statistical mechanical approach with detailed balance satisfied for the transitions between topological states. This enables…
Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we…
In Markov networks, measurement blackouts with unknown frequency compromise observations such that thermodynamic quantities can no longer be inferred reliably. In particular, the observed currents neither discern equilibrium from…