Raphael M. Jungers

Raphael M. Jungers

Auto-generated profile, based on publicly available information

Raphael M. Jungers

ICTEAM, UCLouvain, Louvain-la-Neuve, Belgium

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 December 2007 in Physical Review E
Verified
Journal Article
Closed access
PDF file
VBVincent D. Blondel
Vincent D. Blondel
Jean-Loup GuillaumeJean-Loup Guillaume
Jean-Loup Guillaume
JHJulien M. Hendrickx
Julien M. Hendrickx
RJRaphaël M. Jungers
Raphaël M. Jungers
We consider the problem of determining the proportion of edges that are discovered in an Erdős-Rényi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of determining the proportion of edges connecting nodes that are at identical distance from the source node. The evolution of this quantity with the probability of existence of the edges exhibits intriguing oscillatory behavior. In order to perform our analysis, we introduce a different way of computing the distribution of distances between nodes. Our method outperforms previous similar analyses and leads to estimates that coincide remarkably well with numerical simulations. It allows us to characterize the phase transitions appearing when the connectivity probability varies.

1 May 2014 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
BCBalázs Csanád Csáji
Balázs Csanád Csáji
RJRaphaël M. Jungers
Raphaël M. Jungers
VBVincent D. Blondel
Vincent D. Blondel

13 April 2020 in Sensors
Verified
Journal Article
Open access
PDF file
Dimitrios DechouniotisDimitrios Dechouniotis
Dimitrios Dechouniotis
NANikolaos Athanasopoulos
Nikolaos Athanasopoulos
Aris LeivadeasAris Leivadeas
Aris Leivadeas
Nathalie MittonNathalie Mitton
Nathalie Mitton
RJRaphael Jungers
Raphael Jungers
Symeon PapavassiliouSymeon Papavassiliou
Symeon Papavassiliou
The potential offered by the abundance of sensors, actuators, and communications in the Internet of Things (IoT) era is hindered by the limited computational capacity of local nodes. Several key challenges should be addressed to optimally and jointly exploit the network, computing, and storage resources, guaranteeing at the same time feasibility for time-critical and mission-critical tasks. We propose the DRUID-NET framework to take upon these challenges by dynamically distributing resources when the demand is rapidly varying. It includes analytic dynamical modeling of the resources, offered workload, and networking environment, incorporating phenomena typically met in wireless communications and mobile edge computing, together with new estimators of time-varying profiles. Building on this framework, we aim to develop novel resource allocation mechanisms that explicitly include service differentiation and context-awareness, being capable of guaranteeing well-defined Quality of Service (QoS) metrics. DRUID-NET goes beyond the state of the art in the design of control algorithms by incorporating resource allocation mechanisms to the decision strategy itself. To achieve these breakthroughs, we combine tools from Automata and Graph theory, Machine Learning, Modern Control Theory, and Network Theory. DRUID-NET constitutes the first truly holistic, multidisciplinary approach that extends recent, albeit fragmented results from all aforementioned fields, thus bridging the gap between efforts of different communities.

8 December 2017 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
RJRaphael M. Jungers
Raphael M. Jungers
AKAtreyee Kundu
Atreyee Kundu
WHW. P. M. H. Heemels
W. P. M. H. Heemels
We provide algorithmically verifiable necessary and sufficient conditions for fundamental system theoretic properties of discrete-time linear systems subject to data losses. More precisely, the systems in our modeling framework are subject to disruptions (data losses) in the feedback loop, where the set of possible data loss sequences is captured by an automaton. As such, the results are applicable in the context of shared (wireless) communication networks and/or embedded architectures where some information on the data loss behaviour is available a priori. We propose an algorithm for deciding observability (or the absence of it) for such systems, and show how this algorithm can be used also to decide other properties including constructibility, controllability, reachability, null-controllability, detectability and stabilizability by means of relations that we establish among these properties. The main apparatus for our analysis is the celebrated Skolem's Theorem from Linear Algebra. Moreover, we study the relation between the model adopted in this paper and a previously introduced model where, instead of allowing dropouts in the feedback loop, one allows for ti

12 June 2017 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
NANikolaos Athanasopoulos
Nikolaos Athanasopoulos
KSKonstantinos Smpoukis
Konstantinos Smpoukis
RJR. M. Jungers
R. M. Jungers
We study discrete time linear constrained switching systems with additive disturbances, in the general setting where the switching acts on the system matrices, the disturbance sets, and the state constraint sets. Our primary goal is to extend the existing invariant set constructions when the switching signal is constrained by a given automation. We achieve it by working with a relaxation of invariance, namely the multi-set invariance. By exploiting recent results on computing the stability metrics for these systems, we establish explicit bounds on the number of iterations required for each construction. Last, as an application, we develop new maximal invariant set constructions for the case of linear systems in far fewer iterations compared to the state-of-the-art.

6 August 2018 in IEEE Transactions on Automatic Control
Verified
Journal Article
Open access
MPMatthew Philippe
Matthew Philippe
NANikolaos Athanasopoulos
Nikolaos Athanasopoulos
DADavid Angeli
David Angeli
RJRaphael M. Jungers
Raphael M. Jungers
We study optimization-based criteria for the stability of switching systems, known as Path-Complete Lyapunov Functions, and ask the question “can we decide algorithmically when a criterion is less conservative than another'”. Our contribution is twofold. First, we show that a Path-Complete Lyapunov Function, which is a multiple Lyapunov function by nature, can always be expressed as a common Lyapunov function taking the form of a combination of minima and maxima of the elementary functions that compose it. Geometrically, our results provide for each Path-Complete criterion an implied invariant set. Second, we provide a linear programming criterion allowing to compare the conservativeness of two arbitrary given Path-Complete Lyapunov functions.