1 citations · 1 across the 10 of their papers we have counts for
10 papers
de Finetti Style Theorems With Applications to Network Analysis
Andras Farago
A classic and fundamental result about the decomposition of random sequences into a mixture of simpler ones is de Finetti's Theorem. In its original form it applies to infinite 0-1…
Routing Packet Traffic via Enhanced Access Control List for Network Congestion Avoidance
Zohre Ranjbar Mojaveri, Andras Farago
Filtering packet traffic and rules of permit/denial of data packets into network nodes are granted by facilitating Access Control Lists (ACL). This paper proposes a procedure of ad…
On Non-Markovian Performance Models
Andras Farago
We present an approach that can be useful when the network or system performance is described by a model that is not Markovian. Although most performance models are based on Markov…
A General Dependency Structure for Random Graphs and Its Effect on Monotone Properties
Zohre Ranjbar-Mojaveri, Andras Farago
We consider random graphs in which the edges are allowed to be dependent. In our model the edge dependence is quite general, we call it -robust random graph. It means that every…
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem
Rupei Xu, András Faragó
Minimum Label Cut (or Hedge Connectivity) problem is defined as follows: given an undirected graph with vertices and edges, in which, each edge is labeled (with…
Job Edge-Fog Interconnection Network Creation Game in Internet of Things
Rupei Xu, András Faragó, Jason P. Jue
This is the first paper to address the topology structure of Job Edge-Fog interconnection network in the perspective of network creation game. A two level network creation game mod…
Connectivity and Structure in Large Networks
András Faragó, Rupei Xu
Large real-life complex networks are often modeled by various random graph constructions and hundreds of further references therein. In many cases it is not at all clear how the mo…
Utilizing Network Structure to Bound the Convergence Rate in Markov Chain Monte Carlo Algorithms
Ahmad Askarian, Rupei Xu, András Faragó
We consider the problem of estimating the measure of subsets in very large networks. A prime tool for this purpose is the Markov Chain Monte Carlo (MCMC) algorithm. This algorithm,…
A Simple Approximation for a Hard Routing Problem
Rupei Xu, András Faragó
We consider a routing problem which plays an important role in several applications, primarily in communication network planning and VLSI layout design. The original underlying gra…
Roughly Polynomial Time: A Concept of Tractability Covering All Known Natural NP-complete Problems
Andras Farago
We introduce a concept of efficiency for which we can prove that it applies to all paddable languages, but still does not conflict with potential worst case intractability. Note th…