default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSophie Hautphenne
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Sophie Hautphenne, Brendan Patch:
Birth-and-Death Processes in Python: The BirDePy Package. J. Stat. Softw. 111(5) (2024)- 2020
- [j12]Peter Braunsteins
, Sophie Hautphenne:
The probabilities of extinction in a branching random walk on a strip. J. Appl. Probab. 57(3): 811-831 (2020) - [j11]Sophie Hautphenne, Stefano Massei:
A Low-Rank Technique for Computing the Quasi-Stationary Distribution of Subcritical Galton-Watson Processes. SIAM J. Matrix Anal. Appl. 41(1): 29-57 (2020)
2010 – 2019
- 2016
- [j10]Peter Braunsteins, Sophie Hautphenne, Peter G. Taylor:
The roles of coupling and the deviation matrix in determining the value of capacity in M/M/1/C queues. Queueing Syst. Theory Appl. 83(1-2): 157-179 (2016) - 2015
- [j9]Sophie Hautphenne, Gautier Krings, Jean-Charles Delvenne, Vincent D. Blondel:
Sensitivity analysis of a branching process evolving on a network with application in epidemiology. J. Complex Networks 3(4): 606-641 (2015) - [j8]Sophie Hautphenne, Yoav Kerner, Yoni Nazarathy, Peter G. Taylor:
The intercept term of the asymptotic variance curve for some queueing output processes. Eur. J. Oper. Res. 242(2): 455-464 (2015) - [i2]Sophie Hautphenne, Gautier Krings, Jean-Charles Delvenne, Vincent D. Blondel:
Sensitivity analysis of a branching process evolving on a network with application in epidemiology. CoRR abs/1509.01860 (2015) - 2014
- [j7]Sophie Hautphenne, Mark Fackrell:
An EM algorithm for the model fitting of Markovian binary trees. Comput. Stat. Data Anal. 70: 19-34 (2014) - 2013
- [j6]Sophie Hautphenne, Miklós Telek:
Extension of some MAP results to transient MAPs and Markovian binary trees. Perform. Evaluation 70(9): 607-622 (2013) - 2012
- [j5]Sophie Hautphenne:
Extinction Probabilities of Supercritical Decomposable Branching Processes. J. Appl. Probab. 49(3): 639-651 (2012) - [j4]Sophie Hautphenne:
An EM algorithm for the model fitting of Markovian binary trees (abstract only). SIGMETRICS Perform. Evaluation Rev. 39(4): 26-27 (2012) - [j3]Sophie Hautphenne, Guy Latouche, Giang T. Nguyen:
Markovian trees subject to catastrophes: would they survive forever? (abstract only). SIGMETRICS Perform. Evaluation Rev. 39(4): 27 (2012) - 2011
- [c2]Sophie Hautphenne, Guy Latouche, Giang Nguyen:
Markovian Trees Subject to Catastrophes: Would They Survive Forever? MAM 2011: 87-106 - 2010
- [j2]Sophie Hautphenne, Benny Van Houdt:
On the link between Markovian trees and tree-structured Markov chains. Eur. J. Oper. Res. 201(3): 791-798 (2010)
2000 – 2009
- 2009
- [c1]Sophie Hautphenne, Guy Latouche, Marie-Ange Remiche:
Transient features for Markovian binary trees. VALUETOOLS 2009: 18 - 2007
- [i1]Sophie Hautphenne, Guy Latouche, Marie-Ange Remiche:
Matrix Analytic Methods in Branching processes. Numerical Methods for Structured Markov Chains 2007 - 2006
- [j1]Sophie Hautphenne, Kenji Leibnitz, Marie-Ange Remiche:
Extinction probability in peer-to-peer file diffusion. SIGMETRICS Perform. Evaluation Rev. 34(2): 3-4 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-13 00:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
