Agnes Radl

Research Scientist

Alumni

Empirical Inference

Publications

7 results (View BibTeX file of all listed publications)

2010

The semigroup approach to transport processes in networks

Dorn, B., Fijavz, M., Nagel, R., Radl, A.

Physica D: Nonlinear Phenomena, 239(15):1416-1421, January 2010 (article)

Abstract

We explain how operator semigroups can be used to study transport processes in networks. This method is applied to a linear Boltzmann equation on a finite as well as on an infinite network and yields well-posedness and information on the long term behavior of the solutions to the presented problems.

Web DOI [BibTex]

2010

ei Dorn, B., Fijavz, M., Nagel, R., Radl, A. The semigroup approach to transport processes in networks Physica D: Nonlinear Phenomena, 239(15):1416-1421, January 2010 (article)

Web DOI [BibTex]

Getting lost in space: Large sample analysis of the resistance distance

von Luxburg, U., Radl, A., Hein, M.

In Advances in Neural Information Processing Systems 23, pages: 2622-2630, (Editors: Lafferty, J. , C. K.I. Williams, J. Shawe-Taylor, R. S. Zemel, A. Culotta), Curran, Red Hook, NY, USA, Twenty-Fourth Annual Conference on Neural Information Processing Systems (NIPS), 2010 (inproceedings)

Abstract

The commute distance between two vertices in a graph is the expected time it takes a random walk to travel from the first to the second vertex and back. We study the behavior of the commute distance as the size of the underlying graph increases. We prove that the commute distance converges to an expression that does not take into account the structure of the graph at all and that is completely meaningless as a distance function on the graph. Consequently, the use of the raw commute distance for machine learning purposes is strongly discouraged for large graphs and in high dimensions. As an alternative we introduce the amplified commute distance that corrects for the undesired large sample effects.

PDF Web [BibTex]

ei von Luxburg, U., Radl, A., Hein, M. Getting lost in space: Large sample analysis of the resistance distance In Advances in Neural Information Processing Systems 23, pages: 2622-2630, (Editors: Lafferty, J. , C. K.I. Williams, J. Shawe-Taylor, R. S. Zemel, A. Culotta), Curran, Red Hook, NY, USA, Twenty-Fourth Annual Conference on Neural Information Processing Systems (NIPS), 2010 (inproceedings)

PDF Web [BibTex]

2008

Transport processes in networks with scattering ramification nodes

Radl, A.

Journal of Applied Functional Analysis, 3, pages: 461-483, 2008 (article)

Web [BibTex]

2008

ei Radl, A. Transport processes in networks with scattering ramification nodes Journal of Applied Functional Analysis, 3, pages: 461-483, 2008 (article)

Web [BibTex]

2007

A semigroup approach to queueing systems

Haji, A., Radl, A.

Semigroup Forum, 75(3):610-624, December 2007 (article)

Abstract

We prove asymptotic stability of the solutions of equations describing a simple queueing system consisting of two machines separated by a finite storage buffer. Following an approach by G. Gupur, we apply the theory of C0-semigroups and spectral theory of positive operators.

PDF DOI [BibTex]

2007

ei Haji, A., Radl, A. A semigroup approach to queueing systems Semigroup Forum, 75(3):610-624, December 2007 (article)

PDF DOI [BibTex]

Asymptotic stability of the solution of the M/MB/1 queueing model

Haji, A., Radl, A.

Computers and Mathematics with Applications, 53(9):1411-1420, May 2007 (article)

PDF DOI [BibTex]

ei Haji, A., Radl, A. Asymptotic stability of the solution of the M/MB/1 queueing model Computers and Mathematics with Applications, 53(9):1411-1420, May 2007 (article)

PDF DOI [BibTex]

2006

Semigroups applied to transport and queueing processes

Radl, A.

Biologische Kybernetik, Eberhard Karls Universität, Tübingen, 2006 (phdthesis)

PDF [BibTex]

2006

ei Radl, A. Semigroups applied to transport and queueing processes Biologische Kybernetik, Eberhard Karls Universität, Tübingen, 2006 (phdthesis)

PDF [BibTex]

2002

Algorithms for Learning Function Distinguishable Regular Languages

Fernau, H., Radl, A.

In Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition, pages: 64-73, (Editors: Caelli, T. , A. Amin, R. P.W. Duin, M. Kamel, D. de Ridder), Springer, Berlin, Germany, Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition, August 2002 (inproceedings)

Abstract

Function distinguishable languages were introduced as a new methodology of defining characterizable subclasses of the regular languages which are learnable from text. Here, we give details on the implementation and the analysis of the corresponding learning algorithms. We also discuss problems which might occur in practical applications.

PDF DOI [BibTex]

2002

ei Fernau, H., Radl, A. Algorithms for Learning Function Distinguishable Regular Languages In Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition, pages: 64-73, (Editors: Caelli, T. , A. Amin, R. P.W. Duin, M. Kamel, D. de Ridder), Springer, Berlin, Germany, Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition, August 2002 (inproceedings)

PDF DOI [BibTex]

Agnes Radl

2010

The semigroup approach to transport processes in networks

2010

Getting lost in space: Large sample analysis of the resistance distance

2008

Transport processes in networks with scattering ramification nodes

2008

2007

A semigroup approach to queueing systems

2007

Asymptotic stability of the solution of the M/MB/1 queueing model

2006

Semigroups applied to transport and queueing processes

2006

2002

Algorithms for Learning Function Distinguishable Regular Languages

2002

Latest News

Links

Contact Us