Related papers: Bounds on mean cycle time in acyclic fork-join que…
Fork-join network is a class of queueing networks with applications in manufactory, healthcare and computation systems. In this paper, we develop a simulation algorithm that (1) generates i.i.d. samples of the job sojourn time, jointly with…
Small nonequilibrium systems in contact with a heat bath can be analyzed with the framework of stochastic thermodynamics. In such systems, fluctuations, which are not negligible, follow universal relations such as the fluctuation theorem.…
We study a general set of models of social network evolution and dynamics. The models consist of both a dynamics on the network and evolution of the network. Links are formed preferentially between 'similar' nodes, where the similarity is…
This work is devoted to study the existence of periodic solutions for a family of discontinuous differential systems $Z(x,y;\epsilon)$ with many zones. We show that for $\epsilon$ sufficiently small the averaged functions at any order…
We present analytical treatment of quantum walks on multidimensional hyper-cycle graphs. We derive the analytical expression of the probability distribution for strong and weak decoherence regimes. Upper bound to mixing time is obtained.
We investigate the transient and stationary queue-length distributions of a class of service systems with correlated service times. The classical $M^X/G/1$ queue with semi-Markov service times is the most prominent example in this class and…
In this paper, the question of expected time to convergence is addressed for unbiased quantized consensus on undirected connected graphs, and some strong results are obtained. The paper first provides a tight expression for the expected…
Time estimation is a fundamental task that underpins precision measurement, global navigation systems, financial markets, and the organisation of everyday life. Many biological processes also depend on time estimation by nanoscale clocks,…
We investigate systems of interacting stochastic differential equations with two kinds of heterogeneity: one originating from different weights of the linkages, and one concerning their asymptotic relevance when the system becomes large. To…
This work addresses the output consensus problem of constrained heterogeneous multi-agent systems under a switching network with potential communication delays, where outputs are periodic and characterized by an exosystem. Since periodic…
We establish uniform moment bounds for steady-state queue lengths of generalized Jackson networks (GJNs) in multi-scale heavy traffic as recently proposed by Dai et al. [2023]. Uniform moment bounds lay the foundation for further analysis…
The switch chain is a well-known Markov chain for sampling directed graphs with a given degree sequence. While not ergodic in general, we show that it is ergodic for regular degree sequences. We then prove that the switch chain is rapidly…
Several differential equation models have been proposed to explain the formation of patterns characteristic of the grid cell network. Understanding the robustness of these patterns with respect to noise is one of the key open questions in…
Several researchers have explored the temporal aspect of association rules mining. In this paper, we focus on the cyclic association rules, in order to discover correlations among items characterized by regular cyclic variation overtime.…
Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds.…
Scheduling control problems for a family of unitary networks under heavy traffic with general interarrival and service times, probabilistic routing and an infinite horizon discounted linear holding cost are studied. Diffusion control…
We obtain upper bounds (in most cases, sharp) for the hitting times of random walks on finite undirected graphs expressed as functions of the graph's number of edges. In particular, we show that the maximum hitting time for a simple random…
We introduce a new functional element (synchronizer for marked pairs) meant to join results of parallel processing in two-branch fork-join queueing network. Approximations for distribution of sojourn time at the synchronizer are derived…
We prove an upper bound for the number of cyclic transitive subgroups in a finite permutation group and clarify the structure of the groups for which this bound becomes sharp. We also give an application in the theory of number fields.
The traditional way of studying temporal networks is to aggregate the dynamics of the edges to create a static weighted network. This implicitly assumes that the edges are governed by Poisson processes, which is not typically the case in…