{'fraction_non_alphanumeric': 0.015681544028950542, 'fraction_numerical': 0.0048250904704463205, 'mean_word_length': 5.1940298507462686, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
PROCEEDINGS OF ISCAS, GENEVA, 2000 MONTE CARLO ANALYSIS OF RESISTIVE NETWORKS WITHOUT APRIORI PROBABILITY DISTRIBUTIONS

In this paper, we formulate and solve a new type of Monte Carlo problem for a resistive network. Given lower and upper bounds on the value of each resistor but no probability distribution, we consider the problem of finding the expected value for a designated gain. In view of the fact that no apriori probability distributions for the uncertain resistors are assumed, a certain type “distributional robustness” is sought. To this end, a new paradigm from the robustness literature is particularized to circuits and results are provided in this context. Some of the performance bounds obtained via this new approach differ considerably from those which result from a more conventional Monte Carlo simulation.